Title :
A New Priority Concerned Distributed Channel Assignment Algorithm for Multi-hop Radio Networks
Author_Institution :
Beijing Univ. of Posts & Telecommun., Key Lab. of Universal Wireless Commun., Beijing, China
Abstract :
For multi-hop radio networks, traditional flat TDMA access method has the drawback of low wireless resource utility efficiency. To improve the slot reusability, spatial TDMA method can be adopted. In this paper, a new STDMA channel assignment algorithm is proposed which takes the service priority, node position and data status into concerned. In addition to limiting the information stored in and transferred among the nodes, it can balance the network throughput and improve the network performance. The algorithm is described in detail and its performance is investigated by simulations.
Keywords :
channel allocation; distributed algorithms; radio networks; time division multiple access; STDMA channel assignment algorithm; flat TDMA access method; multihop radio networks; node position; priority-concerned distributed channel assignment algorithm; service priority; slot reusability; spatial TDMA method; time division multiple access; wireless resource utility efficiency; Delay; Heuristic algorithms; Processor scheduling; Radio network; Scheduling; Spread spectrum communication; Time division multiple access; STDMA; multi-hop; reusability; service priority; slot assignment;
Conference_Titel :
Services Computing Conference (APSCC), 2010 IEEE Asia-Pacific
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4244-9396-8
DOI :
10.1109/APSCC.2010.100
