Connectivity-Based k-Hop Clustering in Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 11th annual international conference on Mobile computing and networking
A general model of wireless interference
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Flow admission control for multi-channel multi-radio wireless networks
Wireless Networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The IEEE 802.11 DCF and EDCA mechanisms based on CSMA/CA are the most widely used random channel access mechanisms in wireless mesh networks (WMNs), but unfortunately these cannot effectively eliminate hidden terminal and exposed terminal problems in multi-hop scenarios. In this paper, we propose a set of efficient multi-radio multi-channel (MRMC) assignment, scheduling and routing protocols based on Latin squares for WMNs with MRMC communication capabilities, called "M4", i.e., the Multiple access scheduling in Multi-radio Multi-channel Mesh networking. M4 uses nodal interference information to form cliques for inter-cluster and intra-cluster inWMNs, and then applies Latin squares to map the clique-based clustering structure to radios and channels for communication purposes. Then, M4 again applies Latin squares to schedule the channel access among nodes within each cluster in a collision-free manner. From a systematic view, we also design the corresponding MRMC routing to support M4 communication. Extensive simulation results show that M4 achieves much better performance than IEEE 802.11 standards and other channel access control protocols.