Computer Science – Cryptography and Security
Scientific paper
2010-11-08
Computer Science
Cryptography and Security
6 pages, 6 figures, 3 tables. Conference: International Symposium on Intelligent Information Systems and Applications (IISA'09
Scientific paper
Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to wireless users. In a WMN, high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. However, the throughput of a WMN may be severely degraded due to presence of some selfish routers that avoid forwarding packets for other nodes even as they send their own traffic through the network. This paper presents an algorithm for detection of selfish nodes in a WMN. It uses statistical theory of inference for reliable clustering of the nodes and is based on local observations by the nodes. Simulation results show that the algorithm has a high detection rate while having a low rate of false positives.
Goswami Kaustav
Sen Jaydip
No associations
LandOfFree
An Algorithm for Detection of Selfish Nodes in Wireless Mesh Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Algorithm for Detection of Selfish Nodes in Wireless Mesh Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm for Detection of Selfish Nodes in Wireless Mesh Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-131286