Datacollection in event-driven wireless sensor networks with mobile sinks
Repository Usage Stats
We present a two-tier distributed hash table-based scheme for data-collection in event-driven wireless sensor networks. The proposed method leverages mobile sinks to significantly extend the lifetime of the sensor network. We propose localized algorithms using a distributed geographic hash-table mechanism that adds load balancing capabilities to the data-collection process. We address the hotspot problem by rehashing the locations of the mobile sinks periodically. The proposed mobility model moves the sink node only upon the occurrence of an event according to the evolution of current events, so as to minimize the energy consumption incurred by the multihop transmission of the event-data. Data is collected via single-hop routing between the sensor node and the mobile sink. Simulation results demonstrate significant gains in energy savings, while keeping the latency and the communication overhead at low levels for a variety of parameter values. © 2010 Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Published Version (Please cite this version)
Sabbineni, H, and K Chakrabarty (2010). Datacollection in event-driven wireless sensor networks with mobile sinks. International Journal of Distributed Sensor Networks, 2010. p. 402680. 10.1155/2010/402680 Retrieved from https://hdl.handle.net/10161/4317.
This is constructed from limited available data and may be imprecise. To cite this article, please review & use the official citation provided by the journal.
Unless otherwise indicated, scholarly articles published by Duke faculty members are made available here with a CC-BY-NC (Creative Commons Attribution Non-Commercial) license, as enabled by the Duke Open Access Policy. If you wish to use the materials in ways not already permitted under CC-BY-NC, please consult the copyright owner. Other materials are made available here through the author’s grant of a non-exclusive license to make their work openly accessible.