In-network processing for wireless sensor networks with multiple sinks and sources
Mobility '06 Proceedings of the 3rd international conference on Mobile technology, applications & systems
Opportunistic Aggregation over Duty Cycled Communications in Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
A Decentralized Hierarchical Aggregation Scheme Using Fermat Points in Wireless Sensor Networks
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Sensor network calculus – a framework for worst case analysis
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
A detection scheme of aggregation point for directed diffusion in wireless sensor networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
| Hi-index | 0.00 |
A primary goal in the design of wireless sensor networks is lifetime maximization, constrained by the energy capacity of batteries. One well known method to reduce energy consumption in such networks is message aggregation. This method reduces the number of messages transmitted in the network, thus extending its lifetime. In order to be effective, aggregation requires messages to be delayed in their path throughout the network. This technique, therefore, must define where and for how long a message should be delayed. This paper shows how aggregation points and corresponding aggregation delays can be determined so that the overall energy efficiency of the system is improved. An algorithm is presented which allows the efficient computation of aggregation points and delays. The benefits of the algorithm is verified through simulation experiments.