A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Coverage Issue in Sensor Networks with Adjustable Ranges
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Journal of Parallel and Distributed Computing
ENCAST: Energy-Critical Node Aware Spanning Tree for Sensor Networks
CNSR '05 Proceedings of the 3rd Annual Communication Networks and Services Research Conference
Using predictable observer mobility for power efficient design of sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Quasi-Bottleneck nodes: a potential threat to the lifetime of wireless sensor networks
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Communication paradigms for sensor networks
IEEE Communications Magazine
BoSS: a moving strategy for mobile sinks in wireless sensor networks
International Journal of Sensor Networks
Journal of Parallel and Distributed Computing
An energy-balancing clustering approach for gradient-based routing in wireless sensor networks
Computer Communications
Avoiding Energy Holes to Maximize Network Lifetime in Gradient Sinking Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.24 |
A wireless sensor network faces special challenges due to its inherent features, such as the limited energy. The energy constraint drives research on how to utilize energy efficiently to prolong the lifetime of the network. Because a sink node takes the responsibility of collecting data from other nodes, a usual conception is to transfer data towards the sink node by multihop. However, conventional data-gathering schemes based on the conception give rise to the hotspot problem because of the nodes that run out of their energy sooner than other nodes, which results in accelerating the end of the whole network. The closer sensor nodes are to the sink, the more quickly they exhaust their energy, which leaves an upper bound to the lifetime of the whole network. Because of the bottleneck nodes, the network loses its service ability regardless of a large amount of residual energy of the other nodes. In this paper, we propose a novel data-gathering scheme, DAR, to handle the hotspot problem, in which all the nodes participate in the workload of gathering data from the whole network and transferring the data directly to the sink. In our scheme, the forwarding behavior of all the nodes is scheduled to balance their burden of aggregating and transmitting the network data and the nodes may send their data back against the sink, which differs from the conventional schemes. We performed simulation experiments to evaluate the performance of the DAR scheme, and the results show that our data-gathering scheme can balance the energy consumption among all the nodes and extend the network lifetime notably.