21 research outputs found
On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks
In this paper, a reliability analysis is carried out to state a performance
comparison between two recently proposed proactive routing algorithms. These
protocols are able to scale in ad hoc and sensor networks by resorting to
dynamic addressing, to face with the topology variability, which is typical of
ad hoc, and sensor networks. Numerical simulations are also carried out to
corroborate the results of the analysis.Comment: Proc. of WRECOM '07: Wireless Rural and Emergency Communications
Conference, Roma (Italy), October 200
A Reliability-based Framework for Multi-path Routing Analysis in Mobile Ad-Hoc Networks
Unlike traditional routing procedures that, at the best, single out a unique
route, multi-path routing protocols discover proactively several alternative
routes. It has been recognized that multi-path routing can be more efficient
than traditional one mainly for mobile ad hoc networks, where route failure
events are frequent. Most studies in the area of multi-path routing focus on
heuristic methods, and the performances of these strategies are commonly
evaluated by numerical simulations. The need of a theoretical analysis
motivates such a paper, which proposes to resort to the terminal-pair routing
reliability as performance metric. This metric allows one to assess the
performance gain due to the availability of route diversity. By resorting to
graph theory, we propose an analytical framework to evaluate the tolerance of
multi-path route discovery processes against route failures for mobile ad hoc
networks. Moreover, we derive a useful bound to easily estimate the performance
improvements achieved by multi-path routing with respect to any traditional
routing protocol. Finally, numerical simulation results show the effectiveness
of this performance analysis.Comment: To appear on IJCNDS: International Journal of Communication Networks
and Distributed System
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
Simulation study on the impact of the transmission power on the performance of routing protocols under different mobility models
© 2014 IEEE. the dynamic topology of a mobile ad hoc network poses a real challenge in designing the routing protocol. This paper examine through simulation the fundamental factors, mobility models and transmission power which have a major impacts on the performance of position based routing protocols. We analyse the effect of the transmission power of on the performance of protocols under two different mobility models. Using OPNET simulation tool, results show the evaluation and performance of the proposed protocol under a unified simulation environment for different scenarios
Shallow Water Acoustic Networking [Algorithms
Acoustic networks of autonomous underwater vehicles (AUVs) cannot typically rely on protocols intended for terrestrial radio networks. This work describes a new location-aware source routing (LASR) protocol shown to provide superior network performance over two commonly used network protocols2014;flooding and dynamic source routing (DSR)2014;in simulation studies of underwater acoustic networks of AUVs. LASR shares some features with DSR but also includes an improved link/route metric and a node tracking system. LASR also replaces DSR's shortest-path routing with the expected transmission count (ETX) metric. This allows LASR to make more informed routing decisions, which greatly increases performance compared to DSR. Provision for a node tracking system is another novel addition: using the time-division multiple access (TDMA) feature of the simulated acoustic modem, LASR includes a tracking system that predicts node locations, so that LASR can proactively respond to topology changes. LASR delivers 2-3 times as many messages as flooding in 72% of the simulated missions and delivers 22013;4 times as many messages as DSR in 100% of the missions. In 67% of the simulated missions, LASR delivers messages requiring multiple hops to cross the network with 22013;5 times greater reliability than flooding or DSR
Route Stability in MANETs under the Random Direction Mobility Model
Abstract: A fundamental issue arising in mobile ad hoc networks (MANETs) is the selection of the optimal path between any two nodes. A method that has been advocated to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due to route reconstruction. In this work, we study both the availability and the duration probability of a routing path that is subject to link failures caused by node mobility. In particular, we focus on the case where the network nodes move according to the Random Direction model, and we derive both exact and approximate (but simple) expressions of these probabilities. Through our results, we study the problem of selecting an optimal route in terms of path availability. Finally, we propose an approach to improve the efficiency of reactive routing protocols