By Topic

Performance of Wireless Mesh Networks with Centralized Multihop Scheduling for Intelligent Transportation Systems

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
$33 $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

4 Author(s)
Yingjie Wang ; Wireless Signal Processing and Network Lab, Beijing University of Posts and Telecommunications, Beijing, 100876, P.R. China., ; Zhenhua Wu ; Mugen Peng ; Wenbo Wang

We consider the problem of centralized multihop scheduling in wireless mesh networks for solutions to realize intelligent transportation systems. A scheduling tree construction strategy is investigated, which could use any predetermined selection metrics, while avoiding primary and secondary interferences to a great extent. Two centralized multihop scheduling algorithms are presented to schedule nodes on the constructed scheduling tree. In contrast with FIFO algorithm, the fair algorithm has the property that it guarantees fairness among downlink relay queues of each relay node, while making an efficient utilization of free mini-slots. The feasibility of scheduling tree construction strategy with both minimal hop count and maximal signal strength metrics for a mesh cell is studied through experiment. Simulation results of network throughput and average active link number show that the Fair algorithm utilizes network resources more efficiently than the FIFO algorithm

Published in:

2006 6th International Conference on ITS Telecommunications

Date of Conference:

June 2006