Skip to main content

Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5482))

Abstract

The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new iterated local search to solve this problem by combining filtering techniques with local search. The algorithm is benchmarked using instances with up to 1000 nodes, and results are compared to optimal or best known results as well as other heuristics. For these instances, the proposed algorithm is able to find optimal and near-optimal solutions and outperforms previous heuristics.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. John Wiley & Sons, Chichester (2005)

    Book  Google Scholar 

  2. Călinescu, G., Măndoiu, I.I., Zelikovsky, A.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: Baeza-Yates, R.A., Montanari, U., Santoro, N. (eds.) Proc. 2nd IFIP International Conference on Theoretical Computer Science. IFIP Conference Proceedings, vol. 223, pp. 119–130. Kluwer, Dordrecht (2002)

    Google Scholar 

  3. Althaus, E., Călinescu, G., Măndoiu, I.I., Prasad, S.K., Tchervenski, N., Zelikovsky, A.: Power Efficient Range Assignment in Ad-Hoc Wireless Networks. In: Proc. of the IEEE Wireless Communications and Networking Conference (WCNC 2003), pp. 1889–1894. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  4. Althaus, E., Călinescu, G., Măndoiu, I.I., Prasad, S.K., Tchervenski, N., Zelikovsky, A.: Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks. Wireless Networks 12(3), 287–299 (2006)

    Article  Google Scholar 

  5. Montemanni, R., Gambardella, L.M.: Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Computers & Operations Research 32(11), 2891–2904 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cheng, X., Narahari, B., Simha, R., Cheng, M.X., Liu, D.: Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics. IEEE Transactions on Mobile Computing 2(3), 248–256 (2003)

    Article  Google Scholar 

  7. 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)

    Google Scholar 

  8. Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science 243(1-2), 289–305 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Park, J., Sahni, S.: Power Assignment For Symmetric Communication In Wireless Networks. In: Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC), Washington, pp. 591–596. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  10. Nutov, Z.: Approximating Minimum-Power k-Connectivity. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds.) ADHOC-NOW 2008. LNCS, vol. 5198, pp. 86–93. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Wolf, S., Merz, P.: Evolutionary Local Search for the Minimum Energy Broadcast Problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 61–72. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Lourenço, H.R., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 321–353. Springer, Heidelberg (2002)

    Google Scholar 

  13. Merz, P., Wolf, S.: Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies based on Minimum Routing Cost Spanning Trees. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 272–281. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. ILOG S.A.: ILOG CPLEX User’s Manual, Gentilly, France, and Mountain View, USA (July 2006), http://www.cplex.com/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolf, S., Merz, P. (2009). Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks. In: Cotta, C., Cowling, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2009. Lecture Notes in Computer Science, vol 5482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01009-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01009-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01008-8

  • Online ISBN: 978-3-642-01009-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics