Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Power-Aware On-Demand Routing Protocol for MANET
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Takeover time curves in random and small-world structured populations
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
The random trip model: stability, stationary regime, and perfect simulation
IEEE/ACM Transactions on Networking (TON)
A robust and scalable peer-to-peer gossiping protocol
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
In this paper, we present a novel gossiping protocol for disseminating information in static and mobile multi-hop ad hoc networks. Our protocol exhibits two interesting properties. First, it tends to decrease the power required to disseminate information, by reducing the transmission range each network node uses for gossiping. This property results in a longer life expectancy for the ad hoc network, when running on power-constrained devices. Second, mobility has no negative impact on the performance of our protocol, meaning that it is equally useful in a static context and in a mobile context. Both these properties are shown empirically, via a thorough performance evaluation. It is also noteworthy that our protocol retains the decentralized and stateless nature of traditional gossiping protocols.