A Route-Based Scheduling in Wireless Multi-Hop Mesh Networks for Collision Avoidance

Author

Zhao Jindong ; Wang Qin ; Yu Feng

Author_Institution

Sch. of Inf. Eng., Univ. of Sci. & Technol. Beijing, Beijing, China

fYear

2009

fDate

24-26 Sept. 2009

Firstpage

1

Lastpage

4

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 time-lots 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.

Keywords

frequency division multiple access; graph colouring; packet radio networks; telecommunication network routing; time division multiple access; FDMA mechanism; TDMA mechanism; WIA-PA specification; collision avoidance; link scheduling; route-based scheduling; vertex-coloring method; wireless multihop mesh network; Collision avoidance; Data engineering; Job shop scheduling; Mesh networks; Network topology; Proposals; Scheduling algorithm; Spread spectrum communication; Time division multiple access; Wireless mesh networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-3692-7

Electronic_ISBN

978-1-4244-3693-4

Type

conf

DOI

10.1109/WICOM.2009.5302788

Filename

5302788