Minimum power multicasting with delay bound constraints in Ad Hoc wireless networks

Warning The system is temporarily closed to updates for reporting purpose.

Kundakcıoğlu, Erhun Ömer 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: The 20th International Symposium on Computer and Information Sciences, Istanbul

This is the latest version of this item.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1142/9781860947308_0025


In this paper, we design a new heuristic for an important extension of the minimum power multicasting problem in ad hoc wireless networks. 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
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering
ID Code:5394
Deposited By:Kerem Bülbül
Deposited On:13 Nov 2007 21:16
Last Modified:22 May 2019 12:04

Available Versions of this Item

Repository Staff Only: item control page