Data Gathering in Wireless Sensor Networks with Multiple Mobile Collectors and SDMA Technique Sensor Networks

被引:0
作者
Zhao, Miao [1 ]
Yang, Yuanyuan [1 ]
机构
[1] SUNY Stony Brook, Dept Elect & Comp Engn, Stony Brook, NY 11794 USA
来源
2010 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC 2010) | 2010年
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we consider data gathering in wireless sensor networks (WSNs) by utilizing multiple mobile collectors and spatial-division multiple access (SDMA) technique. In particular, multiple mobile collectors, for convenience, called SenCars in this paper, are deployed in a WSN and work independently and simultaneously to collect data. The sensing field is divided into several non-overlapping regions, each having a SenCar. Each SenCar gathers data from sensors in the region while traversing their transmission ranges. Sensors directly send data to their associated SenCars without relay in order to achieve uniform energy consumption. We also consider exploiting SDMA technique by equipping each SenCar with two antennas. With the support of SDMA, two distinct compatible sensors in the same region can successfully make concurrent data uploading to their associated SenCar. Intuitively, if each SenCar can always simultaneously communicate with two compatible sensors, the data uploading time in each region can be cut into half in the ideal case. We focus on the problem of minimizing maximum data gathering time among different regions, which consists of two parts: the data uploading time of the sensors in this region and the moving time of the associated SenCar on a tour. We refer to this problem as data gathering with multiple mobile collectors and SDMA, or DG-MS for short, and formalize it into an integer linear program. We then propose a region-division and tour-planning algorithm to provide a practically good solution to the problem. Simulation results demonstrate that the proposed scheme significantly outperforms other non-SDMA or single mobile collector schemes by efficiently shortening and balancing the data gathering time among different regions.
引用
收藏
页数:6
相关论文
共 12 条
[1]  
Ahuja R., 1993, NETWORK FLOWS THEORY
[2]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[3]  
[Anonymous], 2001, Introduction to Graph Theory
[4]  
Cormen T., 2001, Introduction to Algorithms
[5]  
Edmonds J., 1965, CANAD J MATH
[6]   FORMULATIONS AND ALGORITHMS FOR THE CAPACITATED MINIMAL DIRECTED TREE PROBLEM [J].
GAVISH, B .
JOURNAL OF THE ACM, 1983, 30 (01) :118-132
[7]  
Jea D., 2005, IEEE ACM DCOSS JUN
[8]  
Luo J, 2005, IEEE INFOCOM SER, P1735
[9]  
Shah R., 2003, AD HOC NETW, V1, P215, DOI DOI 10.1016/S1570-8705(03)00003-9
[10]  
Tse D., 2005, Fundamentals of Wireless Communication