Abstract In this paper, we study the problem of maximizing lifetime data aggregation in multi-sink wireless sensor networks with unreliable vehicle communication environment. Firstly, we analyze the communication between adjacent nodes, and present the optimal emission radius that can guarantee the minimum expected energy consumption. Secondly, we discuss the problem that how sensor nodes choose the sink node to send message. Thirdly, we propose the Tree-based topology Data Aggregation algorithm (TDA) based on the energy consumption balancing and the Directed Acyclic Graph based Data Aggregation algorithm (DAGDA) to improve the data acceptance probability. The simulation results show that our algorithms can extend network lifetime effectively.
Maximizing Lifetime Data Aggregation in Multi-sink Wireless Sensor Networks with Unreliable Vehicle Communications
Internet of Vehicles – Technologies and Services ; 2 ; 180-189
Lecture Notes in Computer Science ; 8662 , 2
2014-01-01
10 pages
Article/Chapter (Book)
Electronic Resource
English
Wireless Sensor Network , Data Aggregation , Unreliable Vehicle Communication Environment , Maximizing Lifetime Management of Computing and Information Systems , Algorithm Analysis and Problem Complexity , Computer Science , Information Systems Applications (incl. Internet) , Database Management , Computer Communication Networks , Information Storage and Retrieval
British Library Conference Proceedings | 2014
|Distributed Cooperative Guidance of Multi-missile with Unreliable Communications
British Library Conference Proceedings | 2022
|Distributed Cooperative Guidance of Multi-missile with Unreliable Communications
Springer Verlag | 2022
|Minimum Data Aggregation Schedule in Wireless Sensor Networks
British Library Online Contents | 2011
|