145,217 research outputs found
Dynamic Queue Utilization Based MAC for multi-hop Ad Hoc networks
The end-to-end throughput in single flow multi-hop Ad Hoc networks decays rapidly with path length. Along the path, the success rate of delivering packets towards the destination decreases due to higher contention, interference, limited buffer size and limited shared bandwidth constraints. In such environments the queues fill up faster in nodes closer to the source than in the nodes nearer the destination. In order to reduce buffer overflow and improve throughput for a saturated network, this paper introduces a new MAC protocol named Dynamic Queue Utilization Based Medium Access Control (DQUB-MAC). The protocol aims to prioritise access to the channel for queues with higher utilization and helps in achieving higher throughput by rapidly draining packets towards the destination. The proposed MAC enhances the performance of an end-to-end data flow by up to 30% for a six hop transmission in a chain topology and is demonstrated to remain competitive for other network topologies and for a variety of packet sizes
A probabilistic approach to reduce the route establishment overhead in AODV algorithm for manet
Mobile Ad-hoc Networks (MANETS) is a collection of wireless nodes without any
infrastructure support. The nodes in MANET can act as either router or source
and the control of the network is distributed among nodes. The nodes in MANETS
are highly mobile and it maintains dynamic interconnection between those mobile
nodes. MANTEs have been considered as isolated stand-alone network. This can
turn the dream of networking "at any time and at any where" into reality. The
main purpose of this paper is to study the issues in route discovery process in
AODV protocol for MANET. Flooding of route request message imposes major
concern in route establishment. This paper suggests a new approach to reduce
the routing overhead during the route discovery phase. By considering the
previous behaviour of the network, the new protocol reduces the unwanted
searches during route establishment processComment: International Journal of Distributed and Parallel Systems (IJDPS)
Vol.3, No.2, March 201
Extremal Properties of Three Dimensional Sensor Networks with Applications
In this paper, we analyze various critical transmitting/sensing ranges for
connectivity and coverage in three-dimensional sensor networks. As in other
large-scale complex systems, many global parameters of sensor networks undergo
phase transitions: For a given property of the network, there is a critical
threshold, corresponding to the minimum amount of the communication effort or
power expenditure by individual nodes, above (resp. below) which the property
exists with high (resp. a low) probability. For sensor networks, properties of
interest include simple and multiple degrees of connectivity/coverage. First,
we investigate the network topology according to the region of deployment, the
number of deployed sensors and their transmitting/sensing ranges. More
specifically, we consider the following problems: Assume that nodes, each
capable of sensing events within a radius of , are randomly and uniformly
distributed in a 3-dimensional region of volume , how large
must the sensing range be to ensure a given degree of coverage of the region to
monitor? For a given transmission range, what is the minimum (resp. maximum)
degree of the network? What is then the typical hop-diameter of the underlying
network? Next, we show how these results affect algorithmic aspects of the
network by designing specific distributed protocols for sensor networks
- …