Analysis of a greedy heuristic for finding small dominating sets in graphs
Information Processing Letters
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Constant-time distributed dominating set approximation
Distributed Computing
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
This paper proposes a cross-layer service discovery architecture for wireless mesh networks where wireless mesh routers dynamically establish a virtual backbone. The mesh nodes use an automatic reorganization mechanism to be adaptive to the current network structure and stability. If the network is unstable, the mesh nodes operate in ad-hoc mode and use service discovery messages which are encapsulated in OLSR broadcast packets. If the mesh network becomes more stable, some nodes are elected as supernodes and establish a virtual backbone with associated clients. This architecture is based on a (k, r)-distance multiple dominating set algorithm, which means that each node is either a supernode or is dominated by r supernodes with a hop distance of k hops at the most. The measurements which are performed in the department's wireless mesh testbed are discussed with results and conclusions.