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.
|Number of pages||12|
|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||25th IEEE Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2006|
|Period||23/04/06 → 29/04/06|