Year-end Sale % OFF 
Abstract
Data collection is one of the key technologies in wireless sensor networks. Due to the limited battery resources of sensors, mobile collectors are introduced to collect data instead of multi-hop data relay. However, how to decrease the data delay based on the cooperation of mobile collectors is a main problem. To solve this problem, a matching game-based data collection algorithm is proposed. First, some high-level cluster heads are elected. Second, by introducing a matching game model, the data collection problem is modeled as a one to one matching problem. Then, according to the preferences of mobile collectors and cluster heads, the benefit matrices are established. Based on the proposed matching algorithm, each mobile collector selects a cluster head to collect the data packets. Performance analysis proves that the matching result is stable, optimal, and unique. Simulation results show that the proposed algorithm is superior to other existing approach in terms of the reduction in data delay.
Highlights
The wireless sensor network consists of a large number of sensor nodes
Data collection is a key technology of a wireless sensor network
The problem to be solved in this paper is, how multiple mobile collectors collaborate to collect event data packets generated by sensor nodes with the minimum data delay
Summary
The wireless sensor network consists of a large number of sensor nodes. The sensor nodes monitor the environment, process the data packets and send the data packets to other sensor nodes or the sink. The mobile sink can move to the vicinity of the nodes to collect data within the monitored range. Mobile collectors move to these locations to collect data packets, and an algorithm is proposed to calculate the paths for them. Reference [18] proposes a fault tolerant algorithm for data aggregation to plan the itinerary for a mobile agent and another alternative itinerary in case of sensor nodes failure. The problem to be solved in this paper is, how multiple mobile collectors collaborate to collect event data packets generated by sensor nodes with the minimum data delay. The problem of cooperative data collection by multiple mobile collectors is modeled as the matching problem between mobile collectors and high-level cluster heads. Theoretical analysis proves that the matching result between mobile collectors and high-level cluster heads is stable, optimal and unique
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
