Detection of selfish behavior in wireless ad hoc networks based on CUSUM algorithm

2010 ◽  
Vol 16 (2) ◽  
pp. 104-108 ◽  
Author(s):  
Chunfeng Liu ◽  
Yantai Shu ◽  
Oliver Yang ◽  
Mingyuan Li
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Muhammad Altaf Khan ◽  
Moustafa M. Nasralla ◽  
Muhammad Muneer Umar ◽  
Zeeshan Iqbal ◽  
Ghani Ur Rehman ◽  
...  

In ad hoc networks, the communication is usually made through multiple hops by establishing an environment of cooperation and coordination among self-operated nodes. Such nodes typically operate with a set of finite and scarce energy, processing, bandwidth, and storage resources. Due to the cooperative environment in such networks, nodes may consume additional resources by giving relaying services to other nodes. This aspect in such networks coined the situation of noncooperative behavior by some or all the nodes. Moreover, nodes sometimes do not cooperate with others due to their social likeness or their mobility. Noncooperative or selfish nodes can last for a longer time by preserving their resources for their own operations. However, such nodes can degrade the network's overall performance in terms of lower data gathering and information exchange rates, unbalanced work distribution, and higher end-to-end delays. This work surveys the main roots for motivating nodes to adapt selfish behavior and the solutions for handling such nodes. Different schemes are introduced to handle selfish nodes in wireless ad hoc networks. Various types of routing techniques have been introduced to target different types of ad hoc networks having support for keeping misbehaving or selfish nodes. The major solutions for such scenarios can be trust-, punishment-, and stimulation-based mechanisms. Some key protocols are simulated and analyzed for getting their performance metrics to compare their effectiveness.


2012 ◽  
Vol E95.B (9) ◽  
pp. 3047-3051 ◽  
Author(s):  
Xin AO ◽  
F. Richard YU ◽  
Shengming JIANG ◽  
Quansheng GUAN ◽  
Gang WEI

Author(s):  
N. Lavanya ◽  
M. Balakrishna

Network coding is a data transmission technique which allows intermediate nodes in a network to re-code data in transit. In contrast to traditional network communication where a node repeats incoming data to its outgoing channel without modifying the payload, a node implementing network coding not only repeats but also alters data. Network coding has been demonstrated to increase network throughput compared to the traditional forwarding transmission. It has potentially broad applications in many areas, including traditional computer networks, wireless ad-hoc networks, and peer to peer systems. This paper process a new technique for file sharing in P2P.


2009 ◽  
Vol 19 (12) ◽  
pp. 3218-3227
Author(s):  
Kai WEN ◽  
Wei GUO ◽  
Guang-Jie HUANG

Sign in / Sign up

Export Citation Format

Share Document