15,796 research outputs found
Effective link operation duration: a new routing metric for mobile ad hoc networks
The dynamic topology of mobile ad hoc networks (MANETs) is caused by node mobility and fading of the wireless link. Link reliability is often measured by the estimated lifetime and the stability of a link. In this paper we propose that the stability of a link can be represented by the time duration in which the two nodes at each end of a link are within each other’s transmission range and the fading is above an acceptable threshold. A novel routing metric, called effective link operation duration (ELOD), is proposed and implemented into AODV (AODV-ELOD). Simulation results show that proposed AODVELOD outperforms both AODV and the Flow Oriented Routing Protocol (FORP)
An Optimal Game Theoretical Framework for Mobility Aware Routing in Mobile Ad hoc Networks
Selfish behaviors are common in self-organized Mobile Ad hoc Networks
(MANETs) where nodes belong to different authorities. Since cooperation of
nodes is essential for routing protocols, various methods have been proposed to
stimulate cooperation among selfish nodes. In order to provide sufficient
incentives, most of these methods pay nodes a premium over their actual costs
of participation. However, they lead to considerably large overpayments.
Moreover, existing methods ignore mobility of nodes, for simplicity. However,
owing to the mobile nature of MANETs, this assumption seems unrealistic. In
this paper, we propose an optimal game theoretical framework to ensure the
proper cooperation in mobility aware routing for MANETs. The proposed method is
based on the multi-dimensional optimal auctions which allows us to consider
path durations, in addition to the route costs. Path duration is a metric that
best reflects changes in topology caused by mobility of nodes and, it is widely
used in mobility aware routing protocols. Furthermore, the proposed mechanism
is optimal in that it minimizes the total expected payments. We provide
theoretical analysis to support our claims. In addition, simulation results
show significant improvements in terms of payments compared to the most popular
existing methods
Location-Quality-aware Policy Optimisation for Relay Selection in Mobile Networks
Relaying can improve the coverage and performance of wireless access
networks. In presence of a localisation system at the mobile nodes, the use of
such location estimates for relay node selection can be advantageous as such
information can be collected by access points in linear effort with respect to
number of mobile nodes (while the number of links grows quadratically).
However, the localisation error and the chosen update rate of location
information in conjunction with the mobility model affect the performance of
such location-based relay schemes; these parameters also need to be taken into
account in the design of optimal policies. This paper develops a Markov model
that can capture the joint impact of localisation errors and inaccuracies of
location information due to forwarding delays and mobility; the Markov model is
used to develop algorithms to determine optimal location-based relay policies
that take the aforementioned factors into account. The model is subsequently
used to analyse the impact of deployment parameter choices on the performance
of location-based relaying in WLAN scenarios with free-space propagation
conditions and in an measurement-based indoor office scenario.Comment: Accepted for publication in ACM/Springer Wireless Network
- …