Placement of multiple mobile data collectors in underwater acoustic sensor networks

被引:6
作者
Alsalih, Waleed [1 ]
Akl, Selim [1 ]
Hassanein, Hossam [1 ]
机构
[1] Queens Univ, Sch Comp, Kingston, ON K7L 3N6, Canada
来源
2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13 | 2008年
关键词
D O I
10.1109/ICC.2008.405
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
For the sake of maximizing the network lifetime, we propose a novel placement scheme for mobile data collectors in Underwater Acoustic Sensor Networks (UASNs). Our scheme is based on a 3D architecture, in which on-the-surface data collectors gather data from underwater sensors and relay them to an on-shore sink. We divide the lifetime of the network into fixed length rounds and move the data collectors to new locations at the beginning of each round. We formulate the problem as an Integer Linear Program (ILP) and use an ILP solver to find the optimal placement of data collectors together with the multi-hop routing paths to deliver data from underwater sensors to data collectors. Our work is a pioneering effort in the placement of mobile data collectors in three-dimensional UASNs. Comprehensive experiments show that our scheme prolongs the lifetime of the network significantly as compared to other data collector placement schemes.
引用
收藏
页码:2113 / 2118
页数:6
相关论文
共 10 条
[1]  
Akyildiz I. F., 2005, Ad Hoc Networks, V3, P257, DOI 10.1016/j.adhoc.2005.01.004
[2]  
Alsalih W., 2007, P IEEE S SIGN PROC I
[3]  
[Anonymous], 2007, P INT C WIR ALG SYST
[4]  
AZAD A, 2006, P IEEE WIR COMM NETW
[5]  
GANDHAM S, 2003, P IEEE GLOB TEL C GL
[6]  
HARRIS A, 2007, P IEEE C SENS MESH A
[7]   Exploiting mobility for energy efficient data collection in wireless sensor networks [J].
Jain, S ;
Shah, RC ;
Brunette, W ;
Borriello, G ;
Roy, S .
MOBILE NETWORKS & APPLICATIONS, 2006, 11 (03) :327-339
[8]  
RODOPLU V, 2005, P MTS IEEE OCEANS SE
[9]   Underwater acoustic networks [J].
Sozer, EM ;
Stojanovic, M ;
Proakis, JG .
IEEE JOURNAL OF OCEANIC ENGINEERING, 2000, 25 (01) :72-83
[10]  
Vasilescu I., 2005, P INT C EMB NETW SEN