Title
On Computing Multi-Agent Itinerary Planning In Distributed Wireless Sensor Networks
Abstract
The agent technology has been widely used in wireless sensor networks to perform data fusion and energy balancing. Existing multi-agent itinerary algorithms are either time-consuming, or too complicated to realize in reality. In this paper, we design a routing itinerary planning scheme for the multi-agent itinerary problem by constructing the spanning tree of WSN nodes. First, we build a multi-agent based distributed WSN (DWSN) model. Second, we present a novel routing itinerary algorithm named DMAIP, which can group all the sensor nodes into multiple itineraries for agents. We also extend DMAIP and design DMAIP-E, which can avoid long distance transmission in DMAIP. Our evaluation results demonstrate that our algorithms are better in the aspect of life cycle and energy consumption than the existing DWSN data collecting schemes.
Year
DOI
Venue
2015
10.1007/978-3-319-21837-3_36
WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS
Keywords
Field
DocType
Distributed wireless sensor network, Mobile agent, Itinerary planning, Energy efficiency
Key distribution in wireless sensor networks,Computer science,Efficient energy use,Mobile agent,Computer network,Sensor fusion,Spanning tree,Energy consumption,Wireless sensor network,Itinerary planning,Distributed computing
Conference
Volume
ISSN
Citations 
9204
0302-9743
0
PageRank 
References 
Authors
0.34
13
6
Name
Order
Citations
PageRank
Bo Liu165.82
Jiuxin Cao214725.13
Jie Yin3134087.67
Wei Yu41338118.61
Benyuan Liu51534101.09
Xinwen Fu6105486.64