Distributed Self-Pruning(DSP) Algorithm for Bridges in Clustered Ad Hoc Networks

Authors:
Seok Yeol Yun;Hoon Oh
Affiliations:
Kangwon National University, Chuncheon, Kangwon-do, Korea;University of Ulsan, Ulsan, Korea
Venue:
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Year:
2007

Citing 3
Cited 0

Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Efficient flooding with Passive Clustering (PC) in ad hoc networks

ACM SIGCOMM Computer Communication Review
On the reduction of broadcast redundancy in mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In clustered ad hoc networks, it is often required that a clusterhead, a leader of cluster, send a message to all its neighbor clusterheads. One simple approach is to use a flooding scheme in which every bridge node receiving a message simply relays it only if it receives the message for the first time. However, the flooding tends to degrade network efficiency severely because many bridges relay the message unnecessarily, causing neighbor clusterheads to receive multiple copies of the same message along different paths. A distributed self-pruning algorithm proposed in this paper attacks this problem.