Bandwidth-Efficient Geographic Multicast Routing Protocol for Wireless Sensor Networks

We present geographic multicast routing (GMR), a new multicast routing protocol for wireless sensor networks. It is a fully localized algorithm that efficiently delivers multicast data messages to multiple destinations. It does not require any type of flooding throughout the network. Each node propa...

Full description

Saved in:
Bibliographic Details
Published in:IEEE sensors journal 2007-05, Vol.7 (5), p.627-636
Main Authors: Sanchez, J.A., Ruiz, P.M., Jennifer Liu, Stojmenovic, I.
Format: Article
Language:English
Subjects:
Algorithms
Bandwidth
Computational modeling
Computer networks
Cost engineering
Cost function
Geographic routing
Merging
Multicast
Multicast algorithms
Multicast protocols
Networks
Protective relaying
Relays
Routing (telecommunications)
Routing protocols
Sensors
Studies
Trees
Wireless sensor networks
wireless sensor networks (WSNs)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present geographic multicast routing (GMR), a new multicast routing protocol for wireless sensor networks. It is a fully localized algorithm that efficiently delivers multicast data messages to multiple destinations. It does not require any type of flooding throughout the network. Each node propagating a multicast data message needs to select a subset of its neighbors as relay nodes towards destinations. GMR optimizes the cost over progress ratio where the cost is equal to the number of neighbors selected for relaying and the progress is the overall reduction of the remaining distances to destinations. Such neighbor selection achieves a good tradeoff between the bandwidth of the multicast tree and the effectiveness of the data distribution. Our cost-aware neighbor selection is based on a greedy set merging scheme achieving a O(Dnmin(D,n) 3 ) computation time, where n is the number of neighbors of current node and D is the number of destinations. As in traditional geographic routing algorithms, delivery to all destinations is guaranteed by applying face routing when necessary. Our simulation results show that GMR outperforms position based multicast in terms of cost of the trees and computation time over a variety of networking scenarios
ISSN:1530-437X
1558-1748
DOI:10.1109/JSEN.2007.894149