EDFS a novel flooding protocol for multi-hop wireless networks

Authors:
Raphael Frank;Thomas Scherer;Mario Gerla
Affiliations:
Dept. of Computer Science, University of Luxembourg, Luxembourg;Telindus Luxembourg, Luxembourg;Dept. of Computer Science, UCLA, CA
Venue:
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Year:
2010

Citing 10
Cited 1

The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Leader election algorithms for mobile ad hoc networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Efficient flooding with Passive Clustering (PC) in ad hoc networks

ACM SIGCOMM Computer Communication Review
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scalable AODV with efficient flooding based on on-demand clustering

ACM SIGMOBILE Mobile Computing and Communications Review
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Gossip-based ad hoc routing

IEEE/ACM Transactions on Networking (TON)
Evaluation of distributed cover set algorithms in mobile ad hoc network for simplified multicast forwarding

ACM SIGMOBILE Mobile Computing and Communications Review
Tree Based Flooding Protocol for Multi-hop Wireless Networks

BROADCOM '08 Proceedings of the 2008 Third International Conference on Broadband Communications, Information Technology & Biomedical Applications

Efficient broadcasting in multi-hop wireless networks with a realistic physical layer

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a novel tree propagation mechanism called "Extended Depth First Search" (EDFS) to efficiently do the flooding of broadcast messages in multi-hop wireless networks. Replying on a tree structure is a simple and efficient way to elect relay nodes and thus reduce the number of redundant re-transmissions. We discuss the principle and functioning of EDGS and propose both, a centralized and distributed algorithm to elect relay nodes in wireless environments. We also analyze the preformance of the proposed technique and show that the distrubuted algorithm performs as well as the centralized. Finally, we present some simulation results to show the performance of EDFS compared to other flooding techniques.