Minimum hop multicasting in broadcast wireless networks with omni-directional antennas

We consider the problem of minimum-hop multicasting in wireless networks. We first present a mixed integer linear programming model of the problem, followed by a discussion of a (sub-optimal) sequential shortest path heuristic algorithm with "node unwrapping". This sequential algorithm is...

Full description

Saved in:
Bibliographic Details
Main Authors: Das, A.K., El-Sharkawi, M.
Format: Conference Proceeding
Language:English
Subjects:
Antennas
Applied sciences
Batteries
Broadcasting
Delay
Exact sciences and technology
Heuristic algorithms
Intelligent networks
Multicast algorithms
Network topology
Radiocommunications
Relays
Symmetric matrices
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Wireless networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of minimum-hop multicasting in wireless networks. We first present a mixed integer linear programming model of the problem, followed by a discussion of a (sub-optimal) sequential shortest path heuristic algorithm with "node unwrapping". This sequential algorithm is amenable to distributed implementation. The node unwrapping part of the algorithm is used to modify the weight matrix of the underlying graph after each iteration and exploits the inherently broadcast nature of wireless transmissions. Simulation results are presented which indicate that reasonably good solutions can be obtained using the proposed heuristic algorithm.
DOI:10.1109/MILCOM.2004.1494807