1,113 research outputs found
Energy Efficient Location Aided Routing Protocol for Wireless MANETs
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes
forming a temporary network without using any centralized access point,
infrastructure, or centralized administration. In this paper we introduce an
Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is
based on the Location Aided Routing (LAR). EELAR makes significant reduction in
the energy consumption of the mobile nodes batteries by limiting the area of
discovering a new route to a smaller zone. Thus, control packets overhead is
significantly reduced. In EELAR a reference wireless base station is used and
the network's circular area centered at the base station is divided into six
equal sub-areas. At route discovery instead of flooding control packets to the
whole network area, they are flooded to only the sub-area of the destination
mobile node. The base station stores locations of the mobile nodes in a
position table. To show the efficiency of the proposed protocol we present
simulations using NS-2. Simulation results show that EELAR protocol makes an
improvement in control packet overhead and delivery ratio compared to AODV,
LAR, and DSR protocols.Comment: 9 Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423,
http://sites.google.com/site/ijcsis
Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks
We consider massively dense ad hoc networks and study their continuum limits
as the node density increases and as the graph providing the available routes
becomes a continuous area with location and congestion dependent costs. We
study both the global optimal solution as well as the non-cooperative routing
problem among a large population of users where each user seeks a path from its
origin to its destination so as to minimize its individual cost. Finally, we
seek for a (continuum version of the) Wardrop equilibrium. We first show how to
derive meaningful cost models as a function of the scaling properties of the
capacity of the network and of the density of nodes. We present various
solution methodologies for the problem: (1) the viscosity solution of the
Hamilton-Jacobi-Bellman equation, for the global optimization problem, (2) a
method based on Green's Theorem for the least cost problem of an individual,
and (3) a solution of the Wardrop equilibrium problem using a transformation
into an equivalent global optimization problem
Minimizing Detection Probability Routing in Ad Hoc Networks Using Directional Antennas
In a hostile environment, it is important for a transmitter to make its wireless transmission invisible to adversaries because an adversary can detect the transmitter if the received power at its antennas is strong enough. This paper defines a detection probability model to compute the level of a transmitter being detected by a detection system at arbitrary location around the transmitter. Our study proves that the probability of detecting a directional antenna is much lower than that of detecting an omnidirectional antenna if both the directional and omnidirectional antennas provide the same Effective Isotropic Radiated Power (EIRP) in the direction of the receiver. We propose a Minimizing Detection Probability (MinDP) routing algorithm to find a secure routing path in ad hoc networks where nodes employ directional antennas to transmit data to decrease the probability of being detected by adversaries. Our study shows that the MinDP routing algorithm can reduce the total detection probability of deliveries from the source to the destination by over 74%.RIGHTS : This article is licensed under the BioMed Central licence at http://www.biomedcentral.com/about/license which is similar to the 'Creative Commons Attribution Licence'. In brief you may : copy, distribute, and display the work; make derivative works; or make commercial use of the work - under the following conditions: the original author must be given credit; for any reuse or distribution, it must be made clear to others what the license terms of this work are
Airborne Directional Networking: Topology Control Protocol Design
This research identifies and evaluates the impact of several architectural design choices in relation to airborne networking in contested environments related to autonomous topology control. Using simulation, we evaluate topology reconfiguration effectiveness using classical performance metrics for different point-to-point communication architectures. Our attention is focused on the design choices which have the greatest impact on reliability, scalability, and performance. In this work, we discuss the impact of several practical considerations of airborne networking in contested environments related to autonomous topology control modeling. Using simulation, we derive multiple classical performance metrics to evaluate topology reconfiguration effectiveness for different point-to-point communication architecture attributes for the purpose of qualifying protocol design elements
- …