Please use this identifier to cite or link to this item:
Title: Power-efficient multicasting algorithms for wireless ad hoc networks
Keywords: wireless ad hoc networks, multicasting, power control, minimum spanning tree (MST), wireless nodal propagation (WNP), power-efficient algorithm
Issue Date: 23-Oct-2004
Citation: YE JIANYANG (2004-10-23). Power-efficient multicasting algorithms for wireless ad hoc networks. ScholarBank@NUS Repository.
Abstract: In this thesis, we first propose a class of minimum-power multicasting algorithms for wireless ad hoc networks using transmission power as cost function. Simulation results yield improvement in terms of power efficiency and interference control, compared with a baseline algorithm without power control, at the cost of increased tree size and average hop count. Then we design a new cost function to jointly optimize power conservation and path efficiency. Performance of algorithms using this new cost function demonstrates great improvement of path efficiency while still maintaining similar or even better power efficiency in comparison with algorithms using pure power as cost function. Finally, we extend our discussion to a full mobile environment with a distributed two-phase multicast tree maintenance algorithm. Simulation results show that it is able to effectively reduce the number of tree link breaks under mobility, and repair the broken tree link in a locally power-efficient manner.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Ye Jianyang - Power-efficient multicasting algorithms for wireless ad hoc networks (2003).pdf1.22 MBAdobe PDF



Page view(s)

checked on Jan 13, 2019


checked on Jan 13, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.