Академический Документы
Профессиональный Документы
Культура Документы
Project
Title:
Opportunistic Routing Algorithm for Relay Node Selection in Wireless Sensor Networks
Motivation:
There are two very important considerations that need to be made to ensure optimum
transmission of information from WSN source nodes to the sink – distance covered or
time elapsed for an information to reach from source node to sink node, and the residual
energy of each other. So, we have to find a way to minimize energy consumption, and
maximize network lifetime for data relay in one-dimensional queue network. This leads
us to find out a routing algorithm to ensure we are properly able to balance both energy
of the sensors, while also ensuring that transmission delays are reduced.
Methodology:
Our objective is to design an energy-efficient routing strategy that ensures minimum
power is cost and protects the nodes with relatively low residual energy, while
optimizing network lifetime for delay. Therefore, we have a trade-off between the
energy expenditure of the relay nodes and the time taken to transmit the info from a node
to the sink
Numerous simulation results and real testbed results show that a proposed solution,
namely ENS_OR makes significant improvements in energy saving and network
partition as compared with other existing routing algorithms.
We therefore propose the implementation and simulation of an energy efficient routing
algorithm for 1-D network, namely Energy Saving via Opportunistic Routing
(ENS_OR). It adopts a new concept called Energy Equivalent Node (EEN) which
selects nodes on the basis of Opportunistic Routing Theory, to virtually derive the
Optimal Transmission Distance for energy saving and maximizing the lifetime of
whole network.
ENS_OR selects a forwarder set and prioritises nodes in it, according to their virtual
optical transmission distance and residual energy levels. Nodes in this forwarder set
that are closer to the EENs and have more residual energy than the sender can be selected
as forwarder candidates.
Algorithm and Workflow: