Abstract
Network lifetime maximization is a critical problem for long-term data collection in wireless sensor networks. For large-scale networks, distributed and self-adaptive solutions are highly desired. In this paper, we investigate how to optimize the network lifetime by a localized method. Specifically, the network lifetime maximization problem is converted to a localized cost-balancing problem with an appropriately designed local cost function. A distributed algorithm, LocalWiser, which adopts the idea of adaptive probabilistic routing, is proposed to construct a localized and self-adaptive optimal solution to maximize the network lifetime. We analyze LocalWiser in both static and dynamic networks. In static networks, it is formally proved that 1) LocalWiser can reach a stable status; 2) the stable status is optimal for maximizing the network lifetime. In dynamic networks, our extensive simulations illustrate that LocalWiser can converge to the optimal status rapidly for the network topology and flow dynamics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barrett, C.L., Eidenbenz, S.J., Kroc, L., Marathe, M., Smith, J.P.: Parametric probabilistic sensor network routing. In: WSNA 2003, pp. 122–131. ACM, New York (2003)
Buragohain, C., Agrawal, D., Suri, S.: Power aware routing for sensor databases. In: INFOCOM 2005, pp. 1747–1757, 2881 (2005)
Dai, H., Han, R.: A node-centric load balancing algorithm for wireless sensor networks. In: Globecom 2003, pp. 548–552, 4209 (2003)
Franceschelli, M., Giua, A., Seatzu, C.: Load balancing over heterogeneous networks with gossip-based algorithms. In: ACC 2009, pp. 1987–1993, 5802 (2009)
Jarry, A., Leone, P., Nikoletseas, S., Rolim, J.: Optimal data gathering paths and energy balance mechanisms in wireless networks. In: Rajaraman, R., Moscibroda, T., Dunkels, A., Scaglione, A. (eds.) DCOSS 2010. LNCS, vol. 6131, pp. 288–305. Springer, Heidelberg (2010)
Krishnamachari, B., Estrin, D., Wicker, S.B.: The impact of data aggregation in wireless sensor networks. In: ICDCSW 2002, pp. 575–578. IEEE Computer Society, Washington, DC, USA (2002)
Lee, H., Keshavarzian, A., Aghajan, H.: Near-lifetime-optimal data collection in wireless sensor networks via spatio-temporal load balancing. ACM Trans. Sen. Netw. 6, 26:1–26:32 (2010)
Liang, W.F., Liu, Y.Z.: Online data gathering for maximizing network lifetime in sensor networks. Ieee Transactions on Mobile Computing 6(1), 2–11 (2007)
Luo, W.L.: Prolonging network lifetime for data gathering in wireless sensor networks. Submitted to IEEE Trans. Computers (2010)
Maróti, M., Kusy, B., Simon, G., Lédeczi, A.: The flooding time synchronization protocol. In: SenSys 2004, pp. 39–49 (2004)
Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proceedings of the Ieee 95(1), 215–233 (2007)
Tsai, Y.-P., Liu, R.-S., Luo, J.-T.: Load balance based on path energy and self-maintenance routing protocol in wireless sensor networks. In: Hong, C.S., Tonouchi, T., Ma, Y., Chao, C.-S. (eds.) APNOMS 2009. LNCS, vol. 5787, pp. 431–434. Springer, Heidelberg (2009)
Wang, L., Xiao, Y.: A survey of energy-efficient scheduling mechanisms in sensor networks. Mob. Netw. Appl. 11, 723–740 (2006)
Wang, Y.C., Wang, Y.X., Lin, H.: Level-based load-balancing by tuning transmission probabilities locally in wireless sensor networks. Submitted to Computer Communications
Wang, Y.C., Wang, Y.X., Qi, X.: Guided-evolution:convergence to global optimal by distributed computing using local information. In: Demo in MobiCom 2010 (2010), http://www.project.itcs.tsinghua.edu.cn/balance
Wu, K., Liu, A.: Rearrangement inequality. Mathematics Competitions 8, 53–60 (1995)
Yan, T., Bi, Y., Sun, L., Zhu, H.: Probability based dynamic load-balancing tree algorithm for wireless sensor networks. In: Lu, X., Zhao, W. (eds.) ICCNMC 2005. LNCS, vol. 3619, pp. 682–691. Springer, Heidelberg (2005)
Zheng, M., Zhang, D., Luo, J.: Minimum hop routing wireless sensor networks based on ensuring of data link reliability. In: MSN 2009, pp. 212–217 (2009)
Zhu, X.Q., Girod, B.: A distributed algorithm for congestion-minimized multi-path routing over ad hoc networks. In: ICME 2005, pp. 1485–1488, 1598 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Wang, Y., Tan, H., Lau, F.C.M. (2011). Maximizing Network Lifetime Online by Localized Probabilistic Load Balancing. In: Frey, H., Li, X., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2011. Lecture Notes in Computer Science, vol 6811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22450-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-22450-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22449-2
Online ISBN: 978-3-642-22450-8
eBook Packages: Computer ScienceComputer Science (R0)