By Topic

A multicast Wireless Mesh Network (WMN) network routing algorithm with ant colony optimization

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

3 Author(s)
Da-Ru Pan ; Sch. of Phys. & Telecommun., South China Normal Univ., Guangzhou ; Yun Xue ; Lu-Jun Zhan

Wireless mesh networks (WMN) are believed to be a highly promising technology and will play an increasingly important role in future generation wireless mobile networks. Routing in WMN is a challenging problem as a result of highly dynamic topology as well as bandwidth and energy constraints. The swarm intelligence paradigm, such as ant colony optimization (ACO), has recently been demonstrated as an active approach for routing in both wired and wireless networks. We designed a novel ACO-based multicasting routing algorithm. In the proposed algorithm, a source-based approach is adapted to build a multicast tree among all the multicast members, and an evolutional scheme for the original multicast tree is designed to find a more optimal multicast tree. In addition the evolutional scheme also acts as a local recovery technique when some intermediate nodes move away. Compared with ODMRP and MAODV, the proposed algorithm performs better in terms of average delay, success ratio and efficiency.

Published in:

Wavelet Analysis and Pattern Recognition, 2008. ICWAPR '08. International Conference on  (Volume:2 )

Date of Conference:

30-31 Aug. 2008