The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2012 vol.61)
pp: 265-277
Miao Zhao , Stony Brook University, Stony Brook
Yuanyuan Yang , SUNY at Stony Brook, Stony Brook
ABSTRACT
Recent study reveals that great benefit can be achieved for data gathering in wireless sensor networks by employing mobile collectors that gather data via short-range communications. To pursue maximum energy saving at sensor nodes, intuitively, a mobile collector should traverse the transmission range of each sensor in the field such that each data packet can be directly transmitted to the mobile collector without any relay. However, this approach may lead to significantly increased data gathering latency due to the low moving velocity of the mobile collector. Fortunately, it is observed that data gathering latency can be effectively shortened by performing proper local aggregation via multihop transmissions and then uploading the aggregated data to the mobile collector. In such a scheme, the number of local transmission hops should not be arbitrarily large as it may increase the energy consumption on packet relays, which would adversely affect the overall efficiency of mobile data gathering. Based on these observations, in this paper, we study the tradeoff between energy saving and data gathering latency in mobile data gathering by exploring a balance between the relay hop count of local data aggregation and the moving tour length of the mobile collector. We first propose a polling-based mobile gathering approach and formulate it into an optimization problem, named bounded relay hop mobile data gathering (BRH-MDG). Specifically, a subset of sensors will be selected as polling points that buffer locally aggregated data and upload the data to the mobile collector when it arrives. In the meanwhile, when sensors are affiliated with these polling points, it is guaranteed that any packet relay is bounded within a given number of hops. We then give two efficient algorithms for selecting polling points among sensors. The effectiveness of our approach is validated through extensive simulations.
INDEX TERMS
Wireless sensor networks, mobile data gathering, relay hop count, polling points, moving tour.
CITATION
Miao Zhao, Yuanyuan Yang, "Bounded Relay Hop Mobile Data Gathering in Wireless Sensor Networks", IEEE Transactions on Computers, vol.61, no. 2, pp. 265-277, February 2012, doi:10.1109/TC.2010.219
REFERENCES
[1] W.C. Cheng, C. Chou, L. Golubchik, S. Khuller, and Y.C. Wan, "A Coordinated Data Collection Approach: Design, Evaluation, and Comparison," IEEE J. Selected Areas in Comm., vol. 22, no. 10, pp. 2004-2018, Dec. 2004.
[2] 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., Apr. 2001.
[3] A. Scaglione and S.D. Servetto, "On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks," Proc. ACM MobiCom, 2002.
[4] X. Tang and J. Xu, "Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 6, pp. 721-734, June 2008.
[5] B. Gedik, L. Liu, and P.S. Yu, "ASAP: An Adaptive Sampling Approach to Data Collection in Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 12, pp. 1766-1783, Dec. 2007.
[6] C. Liu, K. Wu, and J. Pei, "An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 7, pp. 1010-1023, July 2007.
[7] 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.
[8] S. Jain, R. Shah, W. Brunette, G. Borriello, and S. Roy, "Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks," Mobile Networks and Applications, vol. 11, no. 3, pp. 327-339, 2006.
[9] D. Jea, A.A. Somasundara, and M.B. Srivastava, "Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks," Proc. IEEE/ACM Distributed Computing in Sensor Systems (DCOSS), June 2005.
[10] P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Peh, and D. Rubenstein, "Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with Zebranet," Proc. Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2002.
[11] T. Small and Z. Haas, "The Shared Wireless Infostation Model—A New Ad Hoc Networking Paradigm (or Where There is a Whale, There is a Way)," Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2003.
[12] M.A. Batalin, M. Rahimi, Y. Yu, D. Liu, A. Kansal, G.S. Sukhatme, W.J. Kaiser, M. Hansen, G.J. Pottie, M. Srivastava, and D. Estrin, "Call and Response: Experiments in Sampling the Environment," Proc. ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '04), 2004.
[13] R. Pon, M.A. Batalin, J. Gordon, A. Kansal, D. Liu, M. Rahimi, L. Shirachi, Y. Yu, M. Hansen, W.J. Kaiser, M. Srivastava, G. Sukhatme, and D. Estrin, "Networked Infomechanical Systems: A Mobile Embedded Networked Sensor Platform," Proc. ACM/IEEE Int'l Symp. Information Processing in Sensor Networks (IPSN), 2005.
[14] A.A. Somasundara, A. Ramamoorthy, and M.B. Srivastava, "Mobile Element Scheduling with Dynamic Deadlines," IEEE Trans. Mobile Computing, vol. 6, no. 4, pp. 395-410, Apr. 2007.
[15] M. Ma and Y. Yang, "Data Gathering in Wireless Sensor Networks with Mobile Collectors," Proc. IEEE Int'l Symp. Parallel and Distributed Processing (IPDPS), 2008.
[16] 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.
[17] B. Kusy, H. Lee, M. Wicke, N. Milosavljevic, and L. Guibas, "Predictive QoS Routing to Mobile Sinks in Wireless Sensor Networks," Proc. Int'l Conf. Information Processing in Sensor Networks (IPSN), 2009.
[18] J. Luo and J.P. Hubaux, "Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2005.
[19] K. Karenos and V. Kalogeraki, "Traffic Management in Sensor Networks with a Mobile Sink," IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 10, pp. 1515-1530, Oct. 2010.
[20] X. Xu, J. Luo, and Q. Zhang, "Delay Tolerant Event Collection in Sensor Networks with Mobile Sink," Proc. IEEE INFOCOM, 2010.
[21] M. Gatzianas and L. Georgiadis, "A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink," IEEE/ACM Trans. Wireless Comm., vol. 7, no. 3, pp. 984-994, Mar. 2008.
[22] Y. Yun and Y. Xia, "Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications," IEEE Trans. Mobile Computing, vol. 9, no. 9, pp. 1308-1318, Sept. 2010.
[23] D. Bote, K. Sivalingam, and P. Agrawal, "Data Gathering in Ultra Wide Band Based Wireless Sensor Networks Using a Mobile Node," Proc. Fourth Int'l Conf. Broadband Comm., Networks, and Systems (BroadNets), Sept. 2007.
[24] M. Zhao, M. Ma, and Y. Yang, "Efficient Data Gathering with Mobile Collectors and Space-Division Multiple Access Technique in Wireless Sensor Networks," IEEE Trans. Computers, vol. 60, no. 3, pp. 400-417, http://doi.ieeecomputersociety.org/10.1109 TC.2010.140, Mar. 2011.
[25] G. Xing, T. Wang, W. Jia, and M. Li, "Rendezvous Design Algorithm for Wireless Sensor Networks with a Mobile Base Station," Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (Mobihoc), 2008.
[26] O. Chipara, Z. He, G. Xing, Q. Chen, X. Wang, C. Lu, J. Stankovic, and T. Abdelzaher, "Real-Time Power-Aware Routing in Sensor Networks," Proc. IEEE Int'l Workshop Quality of Service (IWQoS), 2006.
[27] CPLEX package, http://www.ilog.com/productscplex/, 2011.
[28] AMPL package, http:/www.ampl.com/, 2011.
[29] B. Sheng, Q. Li, and W. Mao, "Data Storage Placement in Sensor Networks," Proc. ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (Mobihoc), May 2006.
[30] B. Gavish, "Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem," J. ACM, vol. 30, pp. 118-132, 1983.
[31] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. The MIT Press, 2001.
47 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool