Datacollection in Event-Driven Wireless Sensor Networks with Mobile Sinks

Harshavardhan Sabbineni and Krishnendu Chakrabarty

International Journal of Distributed Sensor Networks, 2010, vol. 6, issue 1, 402680

Abstract: 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.

Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2010/402680 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:6:y:2010:i:1:p:402680

DOI: 10.1155/2010/402680

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().