By Topic

Collision-Free and Low-Latency Scheduling Algorithm for Broadcast Operation in Wireless Ad Hoc 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

2 Author(s)
Wei Wang ; Nanyang Technol. Univ., Singapore ; Boon-Hee Soong

It is desirable for broadcast operation in wireless ad hoc network to prevent collision and achieve low latency at the same time. In this letter, we propose a greedy broadcast scheduling algorithm based on the graph theory of Maximum Weight Independent Set (MWIS) problem. During each broadcast wave cycle, MWIS is able to find the optimal selection of forwarders so that maximum number of untouched nodes is covered without incurring collision. Numerical results show that this algorithm could produce better performance results than recent 2-step approach.

Published in:

Communications Letters, IEEE  (Volume:11 ,  Issue: 10 )