Abstract
We consider the minimum energy problem for a mobile ad hoc network, where any node in the network may communicate with any other via intermediate nodes. To provide quality of service, the network must be connected, even if one or more nodes drop out. This motivates the notion of k-connectivity. The minimum energy problem aims to optimise the total energy that all nodes spend for transmission. Previous work in the literature includes exact mixed-integer programming formulations for a 1-connected network. We extend these models for when the network is k-connected, and compare the models for various network sizes. As expected, the combinatorial nature of the problem limits the size of the networks that we can solve to optimality in a timely manner. However, these exact models may be used for the future design of mobile ad hoc networks and provide useful benchmarks for heuristics in larger networks.
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
Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Networks 12, 287–299 (2006)
Berend, D., Segal, M., Shpungin, H.: Power efficient resilience and lifetime in wireless ad-hoc networks. In: Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing, pp. 17–24. ACM, New York (2008)
Cagalj, M., Hubaux, J.-P., Enz, C.: Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proceedings of the 8th annual international conference on Mobile computing and networking, pp. 172–182. ACM, New York (2002)
Calinescu, G., Wan, P.-J.: Range assignment for high connectivity in wireless ad hoc networks. In: Proc. International Conference on Ad hoc and Wireless Networks, pp. 235–246 (2003)
Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proc. of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE). Proceedings in Informatics, vol. 15, pp. 23–38. Carleton Scientific (2002)
Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 197–208. Springer, Heidelberg (1999)
Clementi, A., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Networks and Applications 9, 125–140 (2004)
Das, A., Marks, R., El-Sharkaw, M., Arabshahi, P., Gray, A.: Minimum power broadcast trees for wireless networks: Integer programming formulations. In: INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 1001–1010. IEEE, Los Alamitos (2003)
Hsu, T.: Simpler and faster biconnectivity augmentation. Journal of Algorithms 45, 55–71 (2002)
Jia, X., Kim, D., Makki, S., Wan, P.-J., Yi, C.-W.: Power assignment for kconnectivity in wireless ad hoc networks. Journal of Combinatorial Optimization 9(2), 213–222 (2005)
Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)
Montemanni, R., Gambardella, L.: Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Computers and Operations Research 32, 2891–2904 (2005)
Orman, A., Williams, H.: Survey of different integer programming formulations of the travelling salesman problem. In: Optimisation, Econometric and Financial Analysis, Part 1. Springer, Berlin (2007)
Segal, M., Shpungin, H.: On construction of minimum energy k-fault resistant topologies. Ad Hoc Networks 7, 363–373 (2009)
Shpungin, H., Segal, M.: k-fault resistance in wireless ad-hoc networks. In: Proceedings of the 2005 joint workshop on Foundations of mobile computing, pp. 89–96. ACM, New York (2005)
Yuan, D., Bauer, J., Haugland, D.: Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms. Ad Hoc Networks 6, 696–717 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Burt, C., Chan, Yb., Sonenberg, N. (2010). Exact Models for the k-Connected Minimum Energy Problem. In: Zheng, J., Mao, S., Midkiff, S.F., Zhu, H. (eds) Ad Hoc Networks. ADHOCNETS 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11723-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-11723-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11722-0
Online ISBN: 978-3-642-11723-7
eBook Packages: Computer ScienceComputer Science (R0)