Minimum Power Multicasting with Delay Bound Constraints in Ad Hoc Wireless Networks

Kundakçıoğlu, E. and Bülbül, Kerem and Ünlüyurt, Tonguç and Kılıç, Kemal and Erçetin, Özgür (2005) Minimum Power Multicasting with Delay Bound Constraints in Ad Hoc Wireless Networks. In: ISCIS 2005, (Accepted/In Press)

Warning
There is a more recent version of this item available.
Full text not available from this repository. (Request a copy)

Abstract

In this paper, we design a new heuristic for an important extension of the minimum power multicasting problem in ad hoc wireless networks20,21. Assuming that each transmission takes a fixed amount of time, we impose constraints on the number of hops allowed to reach the destination nodes in the multicasting application. This setting would be applicable in time critical or real time applications, and the relative importance of the nodes may be indicated by these delay bounds. We design a filtered beam search procedure for solving this problem. The performance of our algorithm is demonstrated on numerous test cases by benchmarking it against an optimal algorithm in small problem instances, and against a modified version of the well-known Broadcast Incremental Power (BIP) algorithm 20 for relatively large problems.
Item Type: Papers in Conference Proceedings
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Özgür Erçetin
Date Deposited: 20 Dec 2006 02:00
Last Modified: 26 Apr 2022 08:37
URI: https://research.sabanciuniv.edu/id/eprint/1476

Available Versions of this Item

Actions (login required)

View Item
View Item