DocumentCode :
3508153
Title :
Optimized sink mobility for energy and delay efficient data collection in FWSNs
Author :
Alnabelsi, Sharhabeel H. ; Almasaeid, Hisham M. ; Kamal, Ahmed E.
Author_Institution :
Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA
fYear :
2010
fDate :
22-25 June 2010
Firstpage :
550
Lastpage :
555
Abstract :
Network fragmentation is a potential problem in wireless sensor networks (WSNs) due to many reasons like, node failures or environmental conditions (obstacles) that prevent connected deployments. One approach to cope with this problem is to have a mobile sink node (MS) patrol the network field and collect the data from all the fragments across the network. In this paper, we use a dynamic programming (DP) approach to determine the mobility trajectory of the MS within each fragment such that the energy consumption at the sensor nodes within the fragment is minimized. Moreover, we study the problem of finding the shortest route (cycle) that the MS should take in its journey between fragments in order to reduce a fragment´s inter-visit time. For this purpose, we propose an Integer Linear Programming (ILP) formulation to find the optimal route. As finding the optimal route is NP-hard, we also propose a heuristic approach to find a near optimal solution.
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computers and Communications (ISCC), 2010 IEEE Symposium on
Conference_Location :
Riccione, Italy
ISSN :
1530-1346
Print_ISBN :
978-1-4244-7754-8
Type :
conf
DOI :
10.1109/ISCC.2010.5546505
Filename :
5546505
Link To Document :
بازگشت