Impact of mobility on the performance of relaying in ad hoc networks – Extended version

Abstract

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 are provided in the heavy-traffic case.

DTN support for news dissemination in an urban area

“…From Lemma 3 and Lemma 4, we obtain a solution for the inequalities. Substituting u = kµ λ into the solution, we find an upper bound and a lower bound of the number of data kiosks L < k < U , where U is represented by (1) and L is described by (2), which demonstrates Proposition 2.…”

“…Starting from [6], Hanbali et al [3] extended the work with lifetime constraints and Zhang et al [21] studied variations of the epidemic protocol and recovery schemes. Different measures were considered: throughput [2], delay [6,3,21], content age [8].…”

A modified Manhattan distance with application for localization algorithms in ad-hoc WSNs

“…Therefore, Manhattan gives a wrong comparison result in this scenario. However, our formula of MM(18) gives the right result becausẽ1 Let us presume a second scenario where 1 and 2 are (5,7) and(1,10). Here, the estimate point 1 is closer than 2 to the anchor node because theEuclidean distances are 2 √ 74 and 2 √ 101 respectively.…”

“…Although the literature on localization methods for WSNs is abundant, proposing novel simple methods that can improve the localization accuracy with low cost is still a research challenge and an important issue for several applications in many domains such as commercial, environmental, health, face recognition, image processing and military domains [8,9,10,11,12,13,14,15].…”

DTN Support for News Dissemination in an Urban Area

“…Starting from [6], Hanbali et al [3] extended the work with lifetime constraints and Zhang et al [21] studied variations of the epidemic protocol and recovery schemes. Different measures were considered: throughput [2], delay [6,3,21], content age [8].…”