Academic Journals Database
Disseminating quality controlled scientific knowledge

Multicast Routing with Minimum Energy Cost in Ad Hoc Wireless Networks

ADD TO MY LIST
 
Author(s): Abhishek Pandey | Lok Ranjan Das

Journal: International Journal of Computer Applications
ISSN 0975-8887

Volume: ncipet;
Issue: 12;
Date: 2012;
Original page

Keywords: Minimum energy cost | Multicast tree | Total energy cost | Transmission range | Greedy algorithm

ABSTRACT
In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network and a multicast request, to find a multicast tree such that the total energy cost of the multicast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove the problem is NP-hard, and then propose three heuristic algorithms, namely Steiner tree based heuristic, Node-Join-Tree and Tree-Join-Tree greedy algorithms. Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms.
Affiliate Program     

Tango Jona
Tangokurs Rapperswil-Jona