Close category search window
 

Mobile Data Gathering with Space-Division Multiple Access in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Miao Zhao ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Stony Brook, NY ; Ming Ma ; Yuanyuan Yang

Recent years have witnessed a surge of interest in efficient data gathering schemes in wireless sensor networks (WSNs). In this paper, we address this important issue in WSNs by adopting mobility and space-division multiple access (SDMA) technique to optimize system performance. Specifically, a mobile data collector, for convenience, called SenCar in this paper, is deployed in a WSN. It works like a mobile base station and polls each sensor while traversing its transmission range. Each sensor directly sends data to the SenCar without any relay so that the lifetime of sensors can be prolonged. We also consider applying SDMA technique to data gathering by equipping the SenCar with two antennas. With SDMA, two distinct compatible sensors may successfully make concurrent data uploading to the SenCar. Intuitively, if the SenCar can always simultaneously communicate with two compatible sensors, data uploading time can be cut into half in the ideal case. We focus on the problem of minimizing the total time of a data gathering tour which consists of two parts: data uploading time and moving time. To better enjoy the benefit of SDMA, the SenCar may have to visit some specific locations where more sensors are compatible, which may adversely prolong the moving path. Hence, an optimum solution should be a tradeoff between the shortest moving path and full utilization of SDMA. We refer to this optimization problem as mobile data gathering problem with SDMA, or MDG-SDMA for short. We formalize the MDG-SDMA problem into an integer program (IP) and then propose three heuristic algorithms that provide practically good solutions to the problem. Our simulation results demonstrate that the proposed algorithms can greatly reduce the total data gathering time compared to the non-SDMA algorithm with only minimum overhead.

Published in:
INFOCOM 2008. The 27th Conference on Computer Communications. IEEE

Date of Conference: 13-18 April 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.