Skip to main content
SpringerLink
Log in

Principles of Cost Minimisation in Wireless Networks

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper considers variations of the minimum connected vertex cover problem to be found in the study of wireless network design. A simple, theoretic formulation is followed by a discussion of practical constraints. Two algorithms are given and results compared.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baldi, P., L. De Nardis, and M-G. De Benedetto. (2002). “Modeling and Optimisation of UWB Communication Networks through a Flexible Cost Function. IEEE Journal on Selected Areas in Communications.” 20(9), 1733–1744.

    Google Scholar 

  • Dijkstra, E.W. (1959). “A Note on Two Problems in Connexion with Graphs.” Numerische Mathematik. 1, 269–271.

    Google Scholar 

  • Du, D-Z. and P.M. Pardalos. (1993). Network Optimization Problems: Algorithms, Applications and Complexity. World Scientific.

  • Fowler, T. (2001). “Mesh Networks for Broadband Access,” IEE Review January, 17–22.

  • Garey, M.R. and D.S. Johnson. (1979). Computers and Intractibility: A Guide to the Theory of NP-Completeness. Freeman.

  • Grout, V.M. (1988). “Optimisation Techniques for Telecommunication Networks.” Ph.D. Thesis, Plymouth Polytechnic UK.

  • Harary, F. and E.F. Palmer. (1973). Graphical Enumeration. Academic Press.

  • Kershenbaum, A. (1993) Telecommunication Network Design Algorithms. McGraw-Hill.

  • Kershenbaum, A. and W. Chou. (1974). “A Unified Algorithm for Designing Multidrop Teleprocessing Networks.” IEEE Transactions on Communications. COM-22(11), 1762–1772.

    Google Scholar 

  • Luo X., P. Yan, C. Guo, and Y. Tang. (2002). “Optimal Placement and Deployment Strategies in Mobile Agent-Based Network Management.” In IEEE International Conference on Communications, Circuits and Systems and West Sino Expositions, Vol. 1, pp. 753–757.

  • Moon, J.W. (1970). Counting Labelled Trees. Canadian Mathematics Congress, Montreal.

  • Papadimitriou, C.H. and K. Steiglitz. (1998). Combinatorial Optimzation: Algorithms and Complexity. Dover.

  • Prim, R.C. (1957). “Shortest Connection Networks and Some Generalizations.” Bell Systems Technical Journal. 36, 1389–1401.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Applied Internet Research (CAIR), University of Wales, NEWI Plas Coch Campus, Mold Road, Wrexham, LL11 2AW, UK

    Vic Grout

Authors
  1. Vic Grout
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vic Grout.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grout, V. Principles of Cost Minimisation in Wireless Networks. J Heuristics 11, 115–133 (2005). https://doi.org/10.1007/s10732-005-0433-y

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-005-0433-y

Keywords

Search

Navigation