The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2011 vol.60)
pp: 400-417
Miao Zhao , Stony Brook University, Stony Brook
Ming Ma , Stony Brook University, Stony Brook
Yuanyuan Yang , Stony Brook University, Stony Brook
Recent years have witnessed a surge of interest in efficient data gathering schemes in wireless sensor networks (WSNs). In this paper, we address this issue by adopting mobility and space-division multiple access (SDMA) technique. Specifically, mobile collectors, called SenCars in this paper, work like mobile base stations and collect data from associated sensors via single-hop transmissions so as to achieve uniform energy consumption. We also apply SDMA technique to data gathering by equipping each SenCar with multiple antennas such that distinct compatible sensors may successfully make concurrent data uploading to a SenCar. To investigate the utility of the joint design of controlled mobility and SDMA technique, we consider two cases, where a single SenCar and multiple SenCars are deployed in a WSN, respectively. For the single SenCar case, we aim to minimize the total data gathering time, which consists of the moving time of the SenCar and the data uploading time of sensors, by exploring the trade-off between the shortest moving tour and the full utilization of SDMA. We refer to this problem as mobile data gathering with SDMA, or MDG-SDMA for short. We formalize it into an integer linear program (ILP) and propose three heuristic algorithms for it. In the multi-SenCar case, the sensing field is divided into several regions, each having a SenCar. We focus on minimizing the maximum data gathering time among different regions and refer to it as mobile data gathering with multiple SenCars and SDMA (MDG-MS) problem. Accordingly, we propose a region-division and tour-planning (RDTP) algorithm in which data gathering time is balanced among different regions. We carry out extensive simulations and the results demonstrate that our proposed algorithms significantly outperform single SenCar and non-SDMA schemes.
Wireless sensor networks, mobile data gathering, space-division multiple access (SDMA), maximum matching.
Miao Zhao, Ming Ma, Yuanyuan Yang, "Efficient Data Gathering with Mobile Collectors and Space-Division Multiple Access Technique in Wireless Sensor Networks", IEEE Transactions on Computers, vol.60, no. 3, pp. 400-417, March 2011, doi:10.1109/TC.2010.140
[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A Survey on Sensor Networks," IEEE Comm. Magazine, pp. 102-114, Aug. 2002.
[2] A. Scaglione and S.D. Servetto, "On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks," Proc. MobiCom, 2002.
[3] D. Marco, E.J. Duarte-Melo, M. Liu, and D. Neuhoff, "On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of its Data," Proc. Int'l Conf. Information Processing in Sensor Networks (IPSN), Apr. 2003.
[4] D. England, B. Veeravalli, and J. Weissman, "A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 5, pp. 608-620, May 2007.
[5] K. Jain, J. Padhye, V.N. Padmanabhan, and L. Qiu, "Impact of Interference on Multi-Hop Wireless Network Performance," Proc. MobiCom, 2003.
[6] E.J. Duarte-Melo and M. Liu, "Data-Gathering Wireless Sensor Networks: Organization and Capacity," Elsevier Computer Networks, vol. 43, pp. 519-537, 2003.
[7] H.E. Gamal, "On the Scaling Laws of Dense Wireless Sensor Networks: The Data Gathering Channel," IEEE Trans. Information Theory, vol. 51, no. 3, pp. 1229-1234, Mar. 2005.
[8] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-Efficient Communication Protocol for Wireless Microsensor Networks," Proc. Hawaii Int'l Conf. System Sciences (HICCS), Jan. 2000.
[9] O. Younis and S. Fahmy, "Distributed Clustering in Ad-Hoc Sensor Networks: A Hybrid, Energy-Efficient Approach," Proc. IEEE INFOCOM, 2004.
[10] A. Manjeshwar and D.P. Agrawal, "Teen: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks," Proc. IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), Apr. 2001.
[11] Z. Zhang, M. Ma, and Y. Yang, "Energy Efficient Multi-Hop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks," IEEE Trans. Computers, vol. 57, no. 2, pp. 231-245, Feb. 2008.
[12] R. Shah, S. Roy, S. Jain, and W. Brunette, "Data MULEs: Modeling a Three-Tier Architecture for Sparse Sensor Networks," Elsevier Ad Hoc Networks J., vol. 1, pp. 215-233, Sept. 2003.
[13] W. Zhao, M. Ammar, and E. Zegura, "A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks," Proc. ACM MobiHoc, 2004.
[14] A. Pentland, R. Fletcher, and A. Hasson, "Daknet: Rethinking Connectivity in Developing Nations," Computer, vol. 37, no. 1, pp. 78-83, Jan. 2004.
[15] A. Chakrabarty, A. Sabharwal, and B. Aazhang, "Using Predictable Observer Mobility for Power Efficient Design of a Sensor Network," Proc. Second Int'l Workshop Information Processing in Sensor Networks (IPSN), Apr. 2003.
[16] D. Jea, A.A. Somasundara, and M.B. Srivastava, "Multiple Controlled Mobile Elements (Data mules) for Data Collection in Sensor Networks," Proc. IEEE/ACM Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), June 2005.
[17] M. Ma and Y. Yang, "SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 10, pp. 1476-1488, Oct. 2007.
[18] M. Ma and Y. Yang, "Data Gathering in Wireless Sensor Networks with Mobile Collectors," Proc. IEEE Int'l Symp. Parallel and Distributed Processing (IPDPS), Apr. 2008.
[19] W. Zhao, M. Ammar, and E. Zegura, "Controlling the Mobility of Multiple Data Transport Ferries in a Delay-Tolerant Network," Proc. IEEE INFOCOM '05, 2005.
[20] A.A. Somasundara, A. Ramamoorthy, and M.B. Srivastava, "Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines," Proc. IEEE Realtime Systems Symp., Dec. 2004.
[21] E. Ekici, Y. Gu, and D. Bozdag, "Mobility-Based Communication in Wireless Sensor Networks," IEEE Comm. Magazine, vol. 44, no. 7, pp. 56-62, July 2006.
[22] J. Luo and J.P. Hubaux, "Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks," Proc. IEEE INFOCOM '05, 2005.
[23] H. Nakayama, N. Ansari, A. Jamalipour, and N. Kato, "Fault-Resilient Sensing in Wireless Sensor Networks," Computer Comm., vol. 30, pp. 2375-2384, Sept. 2007.
[24] S. Nesamony, M.K. Vairamuthu, and M.E. Orlowska, "On Optimal Route of a Calibrating Mobile Sink in a Wireless Sensor Network," Proc. Fourth Int'l Conf. Networked Sensing Systems, June 2007.
[25] S. Basagni, A. Carosi, E. Melachrinoudis, C. Petrioli, and Z.M. Wang, "Controlled Sink Mobility for Prolonging Wireless Sensor Networks Lifetime," ACM Wireless Networks, vol. 14, pp. 831-858, 2008.
[26] G. Xing, T. Wang, W. Jia, and M. Li, "Rendezvous Design Algorithm for Wireless Sensor Networks with a Mobile Base Station," Proc. ACM Mobihoc, May 2008.
[27] K. Dantu, M. Rahimi, H. Shah, S. Babel, A. Dhariwal, and G.S. Sukhatme, "Robomote: Enabling Mobility in Sensor Networks," Fourth Int'l Workshop Information Processing in Sensor Networks (IPSN), Apr. 2005.
[28] D.N.C. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge Univ. Press, May 2005.
[29] S. Thoen, L.V.D. Perre, M. Engels, and H.D. Man, "Adaptive Loading for OFDM/SDMA-Based Wireless Networks," IEEE Trans. Comm., vol. 50, no. 11, pp. 1798-1810, Nov. 2002.
[30] B. Suard, G. Xu, H. Liu, and T. Kailath, "Uplink Channel Capacity of Space-Division-Multiple-Access Schemes," IEEE Trans. Information Theory, vol. 44, no. 4, pp. 1468-1476, July 1998.
[31] M. Zhao, M. Ma, and Y. Yang, "Mobile Data Gathering with Space-Division Multiple Access in Wireless Sensor Networks," Proc. IEEE INFOCOM '08, Apr. 2008.
[32] B. Gavish, "Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem," J. ACM, vol. 30, pp. 118-132, 1983.
[33] D.B. West, Introduction to Graph Theory. Prentice-Hall, 1996.
[34] J. Edmonds, "Paths, Trees, and Flowers," Canadian J. Math., vol. 17, pp. 449-467, 1965.
[35] H.N. Gabow, "An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs," J. ACM, vol. 23, no. 2, pp. 221-234 , 1976.
[36] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.
[37] CPLEX Package,, 2010.
[38] AMPL Package, http:/, 2007.
[39] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT Press, 2001.
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool