Impact of Mobility on the Performance of Relaying in Ad Hoc Networks

Ahmad Al Hanbali; A.A. Kherani; R. Groenevelt; P. Nain; E Altman

doi:10.1109/INFOCOM.2006.170

Impact of Mobility on the Performance of Relaying in Ad Hoc Networks

Ahmad Al Hanbali, A.A. Kherani, R. Groenevelt, P. Nain, E Altman

Faculty of Behavioural, Management and Social Sciences

Research output: Contribution to conference › Paper

21 Citations (Scopus)

10 Downloads (Pure)

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 the relay throughput depends on the node mobility pattern only via its (stationary) node position distribution and 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 one-dimensional Random Walk, and an explicit form of its mean value is provided in the heavy-traffic case.

Original language	Undefined
Number of pages	12
DOIs	https://doi.org/10.1109/INFOCOM.2006.170
Publication status	Published - 2006
Event	25th IEEE Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2006 - Barcelona, Spain Duration: 23 Apr 2006 → 29 Apr 2006 Conference number: 25

Conference

Conference	25th IEEE Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2006
Abbreviated title	INFOCOM
Country/Territory	Spain
City	Barcelona
Period	23/04/06 → 29/04/06

Keywords

IR-77033

Access to Document

10.1109/INFOCOM.2006.170

Cite this

@conference{f3432ae6c52f4f3c8f77bfd6fa46ee7e,

title = "Impact of Mobility on the Performance of Relaying in Ad Hoc Networks",

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 the relay throughput depends on the node mobility pattern only via its (stationary) node position distribution and 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 one-dimensional Random Walk, and an explicit form of its mean value is provided in the heavy-traffic case.",

keywords = "IR-77033",

author = "{Al Hanbali}, Ahmad and A.A. Kherani and R. Groenevelt and P. Nain and E Altman",

year = "2006",

doi = "10.1109/INFOCOM.2006.170",

language = "Undefined",

note = "25th IEEE Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2006 ; Conference date: 23-04-2006 Through 29-04-2006",

}

TY - CONF

T1 - Impact of Mobility on the Performance of Relaying in Ad Hoc Networks

AU - Al Hanbali, Ahmad

AU - Kherani, A.A.

AU - Groenevelt, R.

AU - Nain, P.

AU - Altman, E

N1 - Conference code: 25

PY - 2006

Y1 - 2006

N2 - 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 the relay throughput depends on the node mobility pattern only via its (stationary) node position distribution and 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 one-dimensional Random Walk, and an explicit form of its mean value is provided in the heavy-traffic case.

AB - 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 the relay throughput depends on the node mobility pattern only via its (stationary) node position distribution and 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 one-dimensional Random Walk, and an explicit form of its mean value is provided in the heavy-traffic case.

KW - IR-77033

U2 - 10.1109/INFOCOM.2006.170

DO - 10.1109/INFOCOM.2006.170

M3 - Paper

T2 - 25th IEEE Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2006

Y2 - 23 April 2006 through 29 April 2006

ER -