ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Networks
Volume 51, Issue 14, 10 October 2007, Pages 4112-4130
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (590 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2007.04.020    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Impact of mobility on the performance of relaying in ad hoc networks – Extended versionstar, open

A. Al Hanbalia, b, Corresponding Author Contact Information, E-mail The Corresponding Author, A.A. Kheranic, R. Groeneveltd, P. Nainb and E. Altmanb

aUniversité de Nice-Sophia Antipolis, Department of Computer Science, Nice, France bINRIA, 2004 Route des Lucioles, B.P.-93, Sophia-Antipolis Cedex 06902, France cDepartment of Computer Science and Engineering, IIT Delhi, New Delhi, India dAccenture Technology Park, 449, Route des Cretes, Sophia Antipolis Cedex 06902, France

Received 16 June 2006; 
revised 27 March 2007; 
accepted 26 April 2007. 
Responsible Editor: I.F. Akyildiz. 
Available online 13 May 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly different mobility patterns. We introduce and study the notion of relay throughput, i.e. the maximum rate at which a node can relay data from the source to the destination. Our findings include the results that (a) the relay throughput depends on the node mobility pattern only via its (stationary) node position distribution, and (b) that a node mobility pattern that results in a uniform steady-state distribution for all nodes achieves the lowest relay throughput. Random waypoint and random direction mobility models in both one and in two dimensions are studied and approximate simple expressions for the relay throughput are provided. Finally, the behavior of the relay buffer occupancy is examined for the random walk and random direction mobility models. For both models, the explicit form of the mean buffer is provided in the heavy-traffic case.

Keywords: Mobile Ad hoc Networks; Random Mobility Models; Two-Hop relay; Throughput; Delay; Buffer behavior; Performance Evaluation

Article Outline

1. Introduction
2. The system model
3. A queueing model for the relay buffer
3.1. Single source, destination, and relay nodes
3.2. Multiple source, destination, and relay nodes
4. Comparison of mobility models
5. Throughput in random waypoint and random direction models
5.1. One dimension
5.1.1. Only relay node is mobile
5.1.2. All nodes are mobile
5.2. Two dimensions
5.2.1. Three nodes moving
5.2.2. Probability of a two-hop route
6. Relay buffer behavior
6.1. One-dimensional random walk
6.2. Random direction mobility on a plane
7. Numerical results
7.1. Validation of Theorem 1
7.2. Validation of Theorem 2 and Section 5
7.3. Validation of Section 3.2
7.4. Validation of Section 3.2
7.5. Validation of two-hop route probability
7.6. Validation of Section 6.1
7.7. Validation of Section 6.2
7.8. Comparison between View the MathML source and E[B]
8. Conclusions
References
Vitae
















Computer Networks
Volume 51, Issue 14, 10 October 2007, Pages 4112-4130
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.