Event-driven Wireless Sensor Networks using energy-saving data collection

Author(s):  
Sakiko Kawai ◽  
Takuya Asaka
2010 ◽  
Vol 6 (1) ◽  
pp. 402680 ◽  
Author(s):  
Harshavardhan Sabbineni ◽  
Krishnendu Chakrabarty

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.


2016 ◽  
Vol 12 (10) ◽  
pp. 45
Author(s):  
Cunjiang Yu

<p><span style="font-family: Times New Roman; font-size: small;">This paper carries out research on two types of event-driven data collection protocols of wireless sensor networks: EDDGP and ACBP protocols. In the EDDGP protocol, an adaptive evaluation model is put forward to select the cluster head, including the node classification, the fuzzy grade classification, the evaluation function and the parent grid resolution. Once an event of interest occurs, the member nodes will send the collected information to the cluster heads which will then integrate the data and send a </span><span style="font-family: Times New Roman; font-size: small;">request packet for data collection</span><span style="font-family: Times New Roman; font-size: small;"> to the sink. After receiving the request packet, the sink will quickly move to the cluster head for collecting information. If the sink receives the request packet for data collection from other cluster heads of information source in the moving process, it will save their grid ID. </span><span style="font-size: small;"><span style="font-family: Times New Roman;">The data from the other cluster heads of information source are collected in turn from the nearest ones to the farthest ones. The theoretical research and simulation results show that EDDGP can reduce the energy consumption of location updates of the sink so as to balance the energy consumption of nodes and prolong the lifetime of the network.</span></span></p>


Sign in / Sign up

Export Citation Format

Share Document