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
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
Wireless integrated network sensors
Communications of the ACM
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)
Fault-tolerant peer-to-peer search on small-world networks
Future Generation Computer Systems
Reorganization and discovery of grid information with epidemic tuning
Future Generation Computer Systems
An ant algorithm for balanced job scheduling in grids
Future Generation Computer Systems
Power-efficient epidemic information dissemination in sensor networks
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
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
Future Generation Computer Systems
Layered Green Performance Indicators
Future Generation Computer Systems
PCRLB-based sensor selection for maneuvering target tracking in range-based sensor networks
Future Generation Computer Systems
Hi-index | 0.00 |
This paper presents and evaluates a novel approach to decrease the power consumption of epidemic information dissemination in sensor networks. In essence, our strategy consists in modulating the transmission range of sensors before they send messages. Since the range modulation follows a power-law probability distribution, we qualify our approach to information dissemination as being a power-law. An obvious consequence of this strategy is that many nodes can reach few neighbors, while few nodes can reach many neighbors. To evaluate the effects of our approach, we inject the power-law range modulation into four existing epidemic algorithms and we compare their performances with their original versions, based on a fixed transmission range or on a uniform distribution of transmission ranges. This evaluation shows that our power-law approach improves the efficiency of the original algorithms in terms of power consumption, with no negative impact of their effectiveness, measured in terms of how many nodes have been reached after the dissemination.