On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Identifying sets of key players in a social network
Computational & Mathematical Organization Theory
Energy efficient distributed connected dominating sets construction in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Networks: An Introduction
Social network analysis concepts in the design of wireless ad hoc network protocols
IEEE Network: The Magazine of Global Internetworking
Journal of Network and Computer Applications
Design and analysis of an MST-based topology control algorithm
IEEE Transactions on Wireless Communications
Topology Enhancements in Wireless Multihop Networks: A Top-Down Approach
IEEE Transactions on Parallel and Distributed Systems
Achieving Small-World Properties using Bio-Inspired Techniques in Wireless Networks
The Computer Journal
| Hi-index | 0.00 |
In this paper, a new mechanism for topology control in wireless mesh networks is proposed. We evaluate the application to this problem of the centrality metrics developed by social network analysts. Our target network is a wireless mesh network created by user hand-held devices. For this kind of networks, we aim to construct a connected dominating set that includes the most central nodes. Many advantages result from selecting just a subset of stations for routing tasks: reduction of collisions, protocol overhead, interference and energy consumption, better network organization and scalability. The resulting performance using the three most common centrality measures (degree, closeness and betweenness) is evaluated. As we are working with dynamic and decentralized networks, a distributed implementation is also proposed and evaluated.