A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
An on-demand secure routing protocol resilient to byzantine failures
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
On the accuracy of MANET simulators
Proceedings of the second ACM international workshop on Principles of mobile computing
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Secure Multipath Communication in Mobile Ad hoc Networks
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
A distributed architecture for scalable private RFID tag identification
Computer Networks: The International Journal of Computer and Telecommunications Networking
A biology-inspired model for the automatic dissemination of information in P2P networks
Multiagent and Grid Systems - Special Issue on Nature inspired systems for parallel, asynchronous and decentralised environments
A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving QoS in multicasting through adaptive redundancy
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Autonomous gossiping of information in a p2p network with artificial ants
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Towards provable security for ubiquitous applications
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
An adaptive epidemic information dissemination model for wireless sensor networks
Pervasive and Mobile Computing
Hi-index | 0.00 |
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algorithms may lead to broadcast storms where the number of collisions is so large that it causes system failure. To prevent broadcast storms, many mechanisms that reduce redundant transmissions have been proposed that reduce retransmission overhead either deterministically or probabilistically. Gossip is a probabilistic algorithm in which packet retransmission is based on the outcome of coin tosses. The retransmission probability can be fixed, dynamic or adaptive. With dynamic gossip, local information is used to determine the retransmission probability. With adaptive gossip, the decision to relay is adjusted adaptively based on the outcome of coin tosses, the local network structure, and the local response to the flooding call. The goal of gossip is to minimize the number of retransmissions, while retaining the main benefits of flooding, e.g., universal coverage, minimal state retention, and path length preservation. In this paper we consider ways to reduce the number of redundant transmissions in flooding while guaranteeing security. We present several new gossip protocols that exploit local connectivity to adaptively correct propagation failures and protect against Byzantine attacks. A main contribution of this work is that we introduce a cell-grid approach that allows us to analytically prove performance and security protocol properties. The last two gossip protocols that we give are fully adaptive, i.e., they automatically correct all faults and guarantee delivery, the first such protocols to the best of our knowledge.