Efficient and reliable dissemination in wireless opportunistic networks by location extrapolation

Authors:
Adnan Agbaria;Roy Friedman
Affiliations:
The Academic Arab College, Haifa, Israel;Technion - Israel Institute of Technology, Haifa, Israel
Venue:
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Year:
2010

Citing 8
Cited 0

On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Multicast tree construction and flooding in wireless ad hoc networks

Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
The broadcast storm problem in a mobile ad hoc network

Wireless Networks - Selected Papers from Mobicom'99
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Gossip-based ad hoc routing

IEEE/ACM Transactions on Networking (TON)
RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks

SRDS '07 Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems
Multi-hop broadcast from theory to reality: practical design for ad hoc networks

Proceedings of the 1st international conference on Autonomic computing and communication systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data dissemination is an important service in ad-hoc networks. This work presents a novel approach that utilizes the positioning information and the velocity vector of the immediate neighbors at every node to extrapolate the geographic location of the surrounding nodes at any time in order to obtain efficient dissemination trees with low control overhead. The paper includes an extensive simulation study that compares our approach to other representative overlay and probabilistic forwarding approaches. It is shown that our approach behaves similar or better than the other approaches, and is especially useful in the following challenging environments: the message sizes are large, the network is dense, and nodes are highly mobile. Therefore, we believe that this protocol is appropriate for opportunistic networks.