Abstract
In this paper, we study the minimum energy symmetric connectivity problem in wireless sensor networks. This problem is to assign transmission power to each sensor node in a wireless sensor network such that all the sensor nodes are connected by bidirectional links and the overall power consumption is minimized. The determined transmission powers must support the communication session between each pair of nodes along a single-hop path or a multi-hop path. We view this feature as strong symmetric connectivity defined on a digraph. We present two mixed integer programming formulations involving an exponential number of constraints. By introducing some logical constraints, we give the first formulation. Based on this formulation, we further produce some strong cuts which result in the second stronger formulation. Using these formulations, we then devise a branch-and-cut algorithm. Computational results demonstrate that our algorithm is an efficient algorithm for the instances with up to 100 nodes.
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
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Inc., Upper Saddle (1993)
Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: a Survey. Comput. Networks 38, 393–422 (2002)
Althaus, E., Cǎlinescu, G., Mǎndoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power Efficient Range Assignment in Ad-Hoc Wireless Networks. In: IEEE Wireless Communications and Networking Conference (WCNC), pp. 1889–1894. IEEE Press, New York (2003)
Blough, D., Leoncini, M., Resta, G., Sant, P.: On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. In: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), pp. 71–82. Kluwer Academic Publishers, Dordrecht (2002)
Cǎlinescu, G., Mǎndoiu, I., Zelikovsky, A.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), pp. 119–130. Kluwer Academic Publishers, Dordrecht (2002)
Cheng, C., Hu, T.: Ancestor Tree for Arbitrary Multi-Terminal Cut Functions. Ann. of Oper. Res. 33, 199–213 (1991)
Clementi, A., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Technical Report TR00-054, Electronic Colloquium on Computational Complexity (ECCC) (2000)
Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoret. Comput. Sci. 243, 289–305 (2000)
Montemanni, R., Gambardella, L.: Exact Algorithms for the Minimum Power Symmetric Connectivity Problem in Wireless Networks. Comput. & Oper. Res. 32, 2891–2904 (2005)
Rappaport, T.: Wireless Communications: Principles and Practices. Prentice Hall, Inc., Upper Saddle (1996)
Stoer, M., Wangner, F.: A Simple Min-Cut Algorithm. J. of ACM 44, 585–591 (1997)
Yick, J., Mukherjee, B., Ghosal, D.: Wireless sensor network survey. Comput. Networks 52, 2292–2330 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Aneja, Y.P. (2009). A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-02026-1_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02025-4
Online ISBN: 978-3-642-02026-1
eBook Packages: Computer ScienceComputer Science (R0)