A route-based scheduling in wireless multi-hop mesh networks for collision avoidance

Authors:
Zhao Jindong;Wang Qin;Yu Feng
Affiliations:
School of Information Engineering, University of Science and Technology Beijing, Beijing, China and School of Computer, Yantai University, Yantai, China;School of Information Engineering, University of Science and Technology Beijing, Beijing, China;School of Information Engineering, University of Science and Technology Beijing, Beijing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 5
Cited 1

A constructive proof of Vizing's Theorem

Information Processing Letters
Nearly optimal distributed edge colouring in O(log log n) rounds

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of a simple, distributed edge coloring algorithm

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

According to WIA-PA specification, TDMA and FDMA mechanism are used to transmit data and multi-hop mesh topology is supported, but the scheduling issue is still open. In this paper, the two types of conflict in wireless mesh network are analyzed and a link scheduling solution is proposed. The algorithm exploits the route characteristics of data transmitting in wireless multi-hop mesh networks and uses vertex-coloring method but not edge-coloring to schedule the timelots of superframe. The channel that a link will use in transmitting is assigned according to its depth in route when it is colored. By scheduling the links using the presented algorithm, the nodes of the network can transmit data respectively without conflicting with the others. Finally, the validity of algorithm is proved and the simulation result is provided.