Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Topology management for public safety networks (PSNs) presents some particularities which make it a challenging problem. First, the main concerns for PSNs is rapid deployment and survivability. Second, the network requirements for different disaster scenarios may differ completely. This work describes a flexible distributed algorithm to perform network admission control and topology management for public safety wireless networks using as target architecture the network proposed by the CHORIST project [5]. The proposed algorithm is able, not only to dynamically adapt to different network requirements, but also to create homogeneous clusters, where the number of mobile routers attached to each cluster is roughly the same. The technique successfully creates and maintains the desired topology relying only on a simple and customized cost function.