Social-Stratification Probabilistic Routing Algorithm in Delay-Tolerant Network

Authors:
Fuad Alnajjar;Tarek Saadawi
Affiliations:
Electrical Engineering Department, The City College of The City University of New York, NY NY - 10031;Electrical Engineering Department, The City College of The City University of New York, NY NY - 10031
Venue:
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Year:
2009

Citing 5
Cited 0

Communication in disconnected ad hoc networks using message relay

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
DTN routing in a mobility pattern space

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Integrating DTN and MANET routing

Proceedings of the 2006 SIGCOMM workshop on Challenged networks
DTN routing as a resource allocation problem

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Analyzing online social networks

Communications of the ACM - Remembering Jim Gray

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing in mobile ad hoc networks (MANET) is complicated due to the fact that the network graph is episodically connected. In MANET, topology is changing rapidly because of weather, terrain and jamming. A key challenge is to create a mechanism that can provide good delivery performance and low end-to-end delay in an intermittent network graph where nodes may move freely. Delay-Tolerant Networking (DTN) architecture is designed to provide communication in intermittently connected networks, by moving messages towards destination via "store, carry and forward" technique that supports multi-routing algorithms to acquire best path towards destination. In this paper, we propose the use of probabilistic routing in DTN architecture using the concept of social-stratification network. We use the Opportunistic Network Environment (ONE) simulator as a simulation tool to compare the proposed Social- stratification Probabilistic Routing Algorithm (SPRA) with the common DTN-based protocols. Our results show that SPRA outperforms the other protocols.