Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Power-efficient data dissemination in wireless sensor networks
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Localized techniques for broadcasting in wireless sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Scale-Free Topology for Pervasive Networks
BT Technology Journal
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Reorganization and discovery of grid information with epidemic tuning
Future Generation Computer Systems
BeeSensor: A Bee-Inspired Power Aware Routing Protocol for Wireless Sensor Networks
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
New research in nature inspired algorithms for mobility management in GSM networks
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
BeeHiveGuard: a step towards secure nature inspired routing algorithms
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
A robust and scalable peer-to-peer gossiping protocol
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Injecting power-awareness into epidemic information dissemination in sensor networks
Future Generation Computer Systems
| Hi-index | 0.00 |
In this paper, we present a novel approach for epidemic information dissemination, also known as gossiping, in sensor networks. By construction, our protocol exhibits three interesting properties. First, the routing of messages follows a topology with characteristics similar to that of scale-free graphs, which have been shown to be particularly efficient in terms of power consumption, when gossiping in wireless networks. Then, our protocol is fully decentralized, meaning that each sensor works independently, i.e., no coordination is necessary among sensors. Finally, it is stateless, meaning that no history information is necessary. In particular, no neighborhood knowledge is necessary to execute the protocol. Intuitively, our decentralized and stateless protocol dynamically modulates its transmission power according to a power-law distribution. That is, our approach allows sensors to save power with no negative impact, neither on the time needed for reaching all the sensors, nor on the number of messages sent.