The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - Oct. (2012 vol.11)
pp: 1464-1477
Miao Zhao , University of New York at Stony Brook, Stony Brook
Yuanyuan Yang , University of New York at Stony Brook, Stony Brook
ABSTRACT
Recent advances have shown a great potential of mobile data gathering in wireless sensor networks, where one or more mobile collectors are employed to collect data from sensors via short-range communications. Among a variety of data gathering approaches, one typical scheme is called anchor-based mobile data gathering. In such a scheme, during each periodic data gathering tour, the mobile collector stays at each anchor point for a period of sojourn time, and in the meanwhile the nearby sensors transmit data to the collector in a multihop fashion. In this paper, we focus on such a data gathering scheme and provide distributed algorithms to achieve its optimal performance. We consider two different cases depending on whether the mobile collector has fixed or variable sojourn time at each anchor point. We adopt network utility, which is a properly defined function, to characterize the data gathering performance, and formalize the problems as network utility maximization problems under the constraints of guaranteed network lifetime and data gathering latency. To efficiently solve these problems, we decompose each of them into several subproblems and solve them in a distributed manner, which facilitates the scalable implementation of the optimization algorithms. Finally, we provide extensive numerical results to demonstrate the usage and efficiency of the proposed algorithms and complement our theoretical analysis.
INDEX TERMS
Sensors, Mobile communication, Routing, Mobile computing, Optimization, Distributed algorithms, Algorithm design and analysis, convex optimization., Wireless sensor networks, mobile data gathering, distributed algorithms, network utility
CITATION
Miao Zhao, Yuanyuan Yang, "Optimization-Based Distributed Algorithms for Mobile Data Gathering in Wireless Sensor Networks", IEEE Transactions on Mobile Computing, vol.11, no. 10, pp. 1464-1477, Oct. 2012, doi:10.1109/TMC.2011.178
REFERENCES
[1] R. Madan and S. Lall, "Distributed Algorithms for Maximum Lifetime Routing in Wireless Sensor Networks," IEEE Trans. Wireless Comm., vol. 5, no. 8, pp. 2185-2193, Aug. 2006.
[2] R. Madan, S. Cui, S. Lall, and A. Goldsmith, "Modeling and Optimization of Transmission Schemes in Energy-Constrained Wireless Sensor Networks," IEEE/ACM Trans. Networking, vol. 15, no. 6, pp. 1359-1372, Dec. 2007.
[3] Y. Hou, Y. Shi, and H. Sherali, "Rate Allocation and Network Lifetime Problems for Wireless Sensor Networks," IEEE/ACM Trans. Networking, vol. 16, no. 2, pp. 321-334, Apr. 2008.
[4] Z. Zhang, M. Ma, and Y. Yang, "Energy Efficient Multi-Hop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks," IEEE Trans. Computers, vol. 53, no. 2, pp. 231-245, Feb. 2008.
[5] C. Hua and T. Yum, "Optimal Routing and Data Aggregation for Maximizing Lifetime of Wireless Sensor Networks," IEEE/ACM Trans. Networking, vol. 16, no. 4, pp. 892-903, Aug. 2008.
[6] C. Zhang, J. Kurose, Y. Liu, D. Towsley, and M. Zink, "A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas," Proc. IEEE 14th Int'l Conf. Network Protocols (ICNP), Nov. 2006.
[7] Y. Wu, S. Fahmy, and N.B. Shroff, "On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm," Proc. IEEE INFOCOM, 2008.
[8] N. Sadagopan and B. Krishnamachari, "Maximizing Data Extraction in Energy-Limited Sensor Networks," Proc. IEEE INFOCOM, 2004.
[9] S. Chen, Y. Fang, and Y. Xia, "Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 6, no. 7, pp. 762-776, July 2007.
[10] H. Liu, X. Jia, P. Wan, C. Yi, S. Makki, and N. Pissinou, "Maximizing Lifetime of Sensor Surveillance Systems," IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 334-345, Apr. 2007.
[11] R. Shah, S. Roy, S. Jain, and W. Brunette, "Data Mules: Modeling a Three-Tier Architecture for Sparse Sensor Networks," Proc. IEEE Int'l Workshop Sensor Network Protocols and Applications, 2003.
[12] 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.
[13] M. Zhao and Y. Yang, "An Optimization Based Distributed Algorithm for Mobile Data Gathering in Wireless Sensor Networks," Proc. IEEE INFOCOM, Mar. 2010.
[14] M. Zhao, M. Ma, and Y. Yang, "Mobile Data Gathering with Space-Division Multiple Access in Wireless Sensor Networks," IEEE Trans. Computers, vol. 60, no. 3, pp. 400-417, Mar. 2011.
[15] M. Zhao and Y. Yang, "Bounded Relay Hop Mobile Data Gathering in Wireless Sensor Networks," IEEE Trans. Computers, vol. 61, no. 2, pp. 265-277, Feb. 2011.
[16] D. Jea, A.A. Somasundara, and M.B. Srivastava, "Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks," Proc. First IEEE Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), 2005.
[17] J. Luo and J.P. Hubaux, "Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2005.
[18] W. Wang, V. Srinivasan, and K. Chua, "Extending the Lifetime of Wireless Sensor Networks through Mobile Relays," IEEE/ACM Trans. Networking, vol. 16, no. 5, pp. 1108-1120, Oct. 2008.
[19] G. Xing, T. Wang, W. Jia, and M. Li, "Rendezvous Design Algorithm for Wireless Sensor Networks with a Mobile Base Station," Proc. ACM MobiHoc, 2008.
[20] M. Gatzianas and L. Georgiadis, "A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink," IEEE Trans. Wireless Comm., vol. 7, no. 3, pp. 984-994, Mar. 2008.
[21] F.P. Kelly, A.K. Maulloo, and D.K.H. Tan, "Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability," J. Operational Research Soc., vol. 49, pp. 237-252, 1998.
[22] I.H. Hou and P.R. Kumar, "Utility Maximization for Delay Constrained QOS in Wireless," Proc. IEEE INFOCOM, 2010.
[23] D. Bertsekas, A. Nedic, and A. Ozdaglar, Convex Analysis and Optimization. Athena Scientific, 2003.
[24] D. Bertsekas and J. Tsitsikli, Parallel and Distributed Computation: Numerical Methods. Athena Scientific, 1997.
[25] S. Boyd and L. Vandenbergh, Convex Optimization. Cambridge Univ., http://www.stanford.edu/boydcvxbook, 2004.
[26] X. Lin and B. Shroff, "Utility Maximization for Communication Networks with Multipath Routing," IEEE Trans. Automatic Control, vol. 51, no. 5, pp. 766-781, May 2006.
[27] L. Xiao, M. Johansson, and S. Boyd, "Simultaneous Routing and Resources Allocation via Dual Decomposition," IEEE Trans. Comm., vol. 52, no. 7, pp. 1136-1144, July 2004.
[28] H. Sherali and G. Choi, "Recovery of Primal Solutions When Using Subgradient Optimization Methods to Solve Lagrangian Duals of Linear Programs," Operations Research Letters, vol. 19, no. 3, pp. 105-113, 1996.
[29] J.G. Wardrop, "Some Theoretical Aspects of Road Traffic Research," Proc. Inst. of Civil Engineers, vol. 1, pp. 352-362, 1952.
[30] M. Chiang, S. Low, A. Calderbank, and J. Doyle, "Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures," Proc. IEEE, vol. 95, no. 1, pp. 255-312, Jan. 2007.
[31] L. Chen, T. Ho, S. Low, M. Chiang, and J. Doyle, "Optimization Based Rate Control for Multicast With Network Coding," Proc. IEEE INFOCOM, 2007.
[32] C. Ma and Y. Yang, "A Battery-Aware Scheme for Routing in Wireless Ad Hoc Networks," IEEE Trans. Vehicular Technology, vol. 60, no. 8, pp. 3919-3932, Oct. 2011.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool