New Dynamic Routing Protocol for Wireless Adhoc Network

Main Article Content

Pankaj Sharma
Nikhil Patearia, Anil Rai

Abstract

An ad hoc network is a spontaneous network that can be established with no fixed infrastructure. This means that all its nodes behave
as routers and take part in its discovery and maintenance of routes to other nodes in the network. Realizing such a network presents very
significant challenges, especially at the protocol and software level. Major steps forward are required in the field of communications protocol,
data processing, and application support. Although sensor nodes will be equipped with a power supply (battery) and embedded processor that
makes them autonomous and self-aware, their functionality and capabilities will be very limited. The resource limitations of Wireless Sensor
Networks (WSN), especially in terms of energy, require novel and collaborative approach for the wireless communication. Therefore,
collaboration between nodes is essential to deliver smart services in a ubiquitous setting. Current research in this area generally assumes a rather
static network, leading to strong performance degradation in a dynamic environment. In this thesis we investigate new algorithms for routing in
dynamic wireless environment and evaluate their feasibility through experimentation. The algorithms will be key for building self-organizing
and collaborative networks that show emergent behavior and can operate in a challenging environment where nodes move, fail and energy is a
scarce resource. This thesis has major contributions to the routing in dynamic wireless networks. Firstly, a combination between a new multipath
on-Demand Routing protocol and a data-splitting scheme which results in an efficient solution for high reliability and low traffic. Also a datacentric
approach based on cost estimation is designed to disseminate aggregated data from data source to destination with high efficiency.

 

Keywords: Wireless Network, AODV, Dynamic Routing Protocol.

Downloads

Download data is not yet available.

Article Details

Section
Articles