A Mobile Service Algorithm Based on Separabitity in Wireless Sensor Networks
In this paper, we propose a novel mobile service algorithm based on separability in dynamic wireless sensor networks, for achieving the collection of the sensed information in an energy-efficient way and with real-time guarantees. Our algorithm is intrinsically parallel. The main idea is to dissect a service procedure into subproblems, solve the subproblems and then patch the subtours together to form a global tour. Simulation results show that our algorithm is more effective and suitable for dynamic wireless sensor networks. It can reduce the time and energy cost needed for data collection efficiently, although the loss ratio of sensor data increased slightly.
mobile service separability mobile agent wireless sensor networks
Zhang Yingbin Shi Haoshan Lu Xuanmin
NorthWestern Ploytechnical University,Xian 710072 China
国际会议
西安
英文
2007-08-16（万方平台首次上网日期，不代表论文的发表时间）