New Trends In Computer Networks
Spanning a wide spectrum of topics in computer networks, this book presents a selective collection of papers from the 20th International Symposium on Computer and Information Sciences, held in Istanbul, Turkey.
TABLE OF CONTENTS New Trends In Computer Networks
Minimum Power Multicasting with Delay Bound Constraints in AD HOC Wireless Networks
O. E. KUNDAKCIOGLU, K. BULBUL, T. NL YURT, K. KILIC AND O. ERCETIN
Sabanci University, Orhanh, Tuzla, 34956, Istanbul, Turkey Email: { erhunk@su., bulbul@, tonguc@, kkilic@, oercetin@} sabanciuniv.edu
In this paper, we design a new heuristic for an important extension of the minimum power multicasting problem in ad hoc wireless networks 20 ,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.
1. Introduction
In this study, we consider the minimum power multicasting (MPM) problem with delay bounds in ad hoc wireless networks. In this setting, a designated source node sends the same information to a subset of the nodes of the network (destination nodes) by possibly using the rest of the nodes as relay nodes. In addition, for each destination node, we impose a delay bound indicating the maximum number of nodes that the information goes through before reaching that node.
Many new multimedia applications, e.g., video streaming and multimedia...
Copyright Imperial College Press 2005 under license agreement with Books24x7
