Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Optimized design of dynamic networks with heuristic algorithms

Samko, Valentin, Hurley, Stephen, Allen, Stuart Michael ORCID: and Whitaker, Roger Marcus ORCID: 2006. Optimized design of dynamic networks with heuristic algorithms. Pinter, Janos D., ed. Global Optimization: Scientific and Engineering Case Studies., Nonconvex Optimization and its Applications, vol. 85. Springer US, pp. 45-72. (10.1007/0-387-30927-6_3)

Full text not available from this repository.


This research investigates the design of reliable wireless communication networks in which all communication is carried over the wireless medium, every node exhibits mobility and is able to establish only a limited number of point-to-point links with other nodes in its neighbourhood. The design process aims to select a feasible subset of the potential links in such a way that both network reliability and network performance are maximised. We describe a graph-theoretic model for the type of network under consideration, define some graph-theoretic measures of network reliability in terms of this model, present methods for the optimisation of these reliability measures, and indicate their performance under simulation.

Item Type: Book Section
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Systems Immunity Research Institute (SIURI)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: Springer US
ISBN: 0387304088
Related URLs:
Last Modified: 01 Dec 2022 10:25

Citation Data

Actions (repository staff only)

Edit Item Edit Item