By Topic

A New Priority Concerned Distributed Channel Assignment Algorithm for Multi-hop Radio Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Li Li ; Beijing Univ. of Posts & Telecommun., Key Lab. of Universal Wireless Commun., Beijing, China

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.

Published in:

Services Computing Conference (APSCC), 2010 IEEE Asia-Pacific

Date of Conference:

6-10 Dec. 2010