Principles of cost minimisation in wireless networks

Journal of Heuristics

Volumn 11, Issue 2, 2005, Pages 115-133

  Grout, Vic ^a  

^a UNIVERSITY OF WALES   (United Kingdom)

Author keywords

Add algorithm; Drop algorithm; Edge constraints; Load constraints; Minimum connected vertex cover problem; Node constraints; Path constraints; Wireless networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; COSTS; MATRIX ALGEBRA; PROBLEM SOLVING;

ADD ALGORITHMS; DROP ALGORITHMS; EDGE CONSTRAINTS; LOAD CONSTRAINTS; MAXIMUM CONNECTED VERTEX COVER PROBLEMS; NODE CONSTRAINTS; PATH CONSTRAINTS; WIRELESS NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 22044458008     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10732-005-0433-y     Document Type: Article

References (13)

1. 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.
2. Dijkstra, E.W. (1959). "A Note on Two Problems in Connexion with Graphs." Numerische Mathematik. 1, 269-271.
3. Du, D-Z. and P.M. Pardalos. (1993). Network Optimization Problems: Algorithms, Applications and Complexity. World Scientific.
4. Fowler, T. (2004). "Mesh Networks for Broadband Access." IEE Review January. 17-22.
5. Garcy, M.R. and D.S. Johnson. (1979). Computers and Intractibility: A Guide to the Theory of NP-Completeness. Freeman.
6. Grout, V.M. (1988). "Optimisation Techniques for Telecommunication Networks." Ph.D. Thesis, Plymouth Polytechnic UK.
7. Harary, F. and E.F. Palmer. (1973). Graphical Enumeration. Academic Press.
8. Kershenbaum, A. (1993) Telecommunication Network Design Algorithms. McGraw-Hill.
9. Kershenbaum, A. and W. Chou. (1974). "A Unified Algorithm for Designing Multidrop Teleprocessing Networks." IEEE Transactions on Communications. COM-22(11), 1762-1772.
10. 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.
11. Moon, J.W. (1970). Counting labelled Trees. Canadian Mathematics Congress, Montreal.
12. Papadimitriou, C.H. and K. Steiglitz. (1998). Combinatorial Optimzation: Algorithms and Complexity. Dover.
13. Prim, R.C. (1957). "Shortest Connection Networks and Some Generalizations." Bell Systems Technical Journal. 36, 1389-1401.