Abstract
We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor network with stationary nodes and static power assignments. Our algorithm determines the transmission power level inducing the maximum-lifetime spanning subgraph of a network by means of a distributed breadth-first search for minmax-power communication paths, i.e. paths that connect a given reference node to each of the other nodes so that the maximum transmission power required on any link of the path is minimised. The performance of the resulting Maximum Lifetime Spanner (MLS) protocol is validated in a number of simulated networking scenarios. In particular, we study the performance of the protocol in terms of the number of required control messages, and compare it to the performance of a recently proposed Distributed Min-Max Tree (DMMT) algorithm. For all network scenarios we consider, MLS outperforms DMMT significantly. We also discuss bringing down the message complexity of our algorithm by initialising it with the Relative Neighbourhood Graph (RNG) of a transmission graph rather than the full graph, and present an efficient distributed method for reducing a given transmission graph to its RNG.
Partially supported by the Academy of Finland under grant 209300 (ACSENT).
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
Ephremides, A.: Energy concerns in wireless networks. IEEE Wireless Comm. 9(4), 48–59 (2002)
Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.: Algorithmic aspects of topology control problems for ad hoc networks. Mobile Networks and Appl. 10(1-2), 19–34 (2005)
Ramanathan, R., Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: Proc. 19th Annual Joint Conf. IEEE Comp. and Comm. Societies, pp. 404–413 (2000)
Kang, I., Poovendran, R.: Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks. Mobile Networks and Appl. 10(6), 879–896 (2005)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Programming Languages and Systems 5(1), 66–77 (1983)
Rodoplu, V., Meng, T.H.: Minimum energy mobile wireless networks. IEEE J. on Selected Areas in Comm. 17(8), 1333–1344 (1999)
Wattenhofer, R., Li, L., Bahl, P., Wang, Y.M.: Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In: Proc. 20th Annual Joint Conf. IEEE Comp. and Comm. Societies, pp. 1388–1397 (2001)
Gupta, S.K.S., Srimani, P.K.: Self-stabilizing multicast protocols for ad hoc networks. J. of Parallel and Distributed Computing 63(1), 87–96 (2003)
Guo, S., Yang, O.W.W., Leung, V.C.M.: Tree-based distributed multicast algorithms for directional communications and lifetime optimization in wireless ad hoc networks. EURASIP J. on Wireless Comm. and Networking 2007, 10 (2007) Article ID 98938
McCanne, S., Floyd, S., Fall, K., Varadhan, K.: The network simulator ns2 (1995) The VINT project, available for download at http://www.isi.edu/nsnam/ns/
Chang, J.H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. In: Proc. 19th Annual Joint Conf. IEEE Comp. and Comm. Societies, pp. 22–31 (2000)
Floréen, P., Kaski, P., Kohonen, J., Orponen, P.: Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE J. on Selected Areas in Comm. 23(1), 117–126 (2005)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, USA (1996)
Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognition 12, 261–268 (1980)
Borbash, S., Jennings, E.: Distributed topology control algorithm for multihop wireless networks. In: Proc. 2002 Intl. Joint Conf. on Neural Networks (2002)
Bhardwaj, M., Misra, S., Xue, G.: Distributed topology control in wireless ad hoc networks using β-skeletons. In: Workshop on High Performance Switching and Routing, pp. 371–375 (2005)
Escalante, O., Pérez, T., Solano, J., Stojmenovic, I.: RNG-based searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems. In: The 3rd ACS/IEEE Intl. Conf. on Computer Systems and Appl., pp. 47–54 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haanpää, H., Schumacher, A., Thaler, T., Orponen, P. (2007). Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks. In: Zhang, H., Olariu, S., Cao, J., Johnson, D.B. (eds) Mobile Ad-Hoc and Sensor Networks. MSN 2007. Lecture Notes in Computer Science, vol 4864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77024-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-77024-4_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77023-7
Online ISBN: 978-3-540-77024-4
eBook Packages: Computer ScienceComputer Science (R0)