Energy Consumption Routing Protocols Computer Science Essay

Published Date: 02 Nov 2017

Mr.Tanaji A. Dhaigude Department of Computer Networking GHRCEM,Pune

Prof. Vidya Dhamdhere GHRCEM ,pune

Abstract

The Major problem in wireless sensor network to achieve

an energy-efficient routing protocol. Energy consumption is

a critical problem in wireless sensor network for nodes and

network life. Thus, energy-saving routing protocol in wireless

sensor networks is important for increasing the network lifetime.

Less energy consumption can be achieved by reducing

the node transmission radius. In this paper,I will present a

transmission radius self-adjust energy-saving routing protocol

(RSES) for wireless sensor networks. Node reduces its maximum

transmission radius to reach the farthest neighbor before

it sends the first packet using, RSES. The on-demand route

discovery process is used for routing table information. When

remnant energy reaches a certain threshold, node reduces its

transmission radius and again readjustment is done in order

to achieve less energy consumption under the premise of the

some certain coverage ratio. Hence by using this algorithm

Energy consumption can be minimized. Using RSES, network

lifetime and has a balanced network load,energy saving

and routing traffic.

Using shortest path algorithms we might get the energy efficient

path but if the same path is used frequently then nodes

on the same path gets discharged accordingly. Energy efficient

routing algorithms can suggest path containing higher

energized nodes, but it might be resulted in longer distance

and then throughput.

Key terms

Wireless Sensor Network, Radius self-adjust energysaving

routing protocol, Coverage Ratio, Power saving,

Wireless Communication.

1. Introduction

Today in wireless communications have enabled the

development of low cost, low-power signal, multifunctional

sensor nodes that have small in size and communicate

untethered in short distances for sensor node. These

wireless sensor nodes, which consist of sensing, data processing,

and communicating components[1], leverage the

idea of sensor networks. Sensor wireless networks represent

a effective improvement over traditional sensors. A

sensor network is collection of a large number of sensor

wireless nodes that are densely deployed either inside the

phenomenon or very close to each other. The position of

sensor nodes need not be engineered or predetermined.

This allows for node to random deployment in inaccessible

terrains or disaster reliefed operations. On the other

hand, this also means that sensor network protocols and

algorithms must possess self-organizing capabilities and

effective. Another unique feature of sensor networks is

the cooperative effort of sensor nodes and multihop communication.

Sensor nodes are fitted with an onboard

processor. Some of the application areas are were sensor

are use health, military, and home.

Figure 1: Typical architecture of WSN

Less energy consumption can be achieved by reducing

the node transmission radius[3, 4]. Power control

to reduce interference and improve throughtput is

addressed[5, 6, 7]. we present a transmission radius selfadjust

energy-saving routing protocol (RSES). In this

Protocol node reduces its maximum transmission radius

only to reach the farthest neighbor before it sends the

first packet[8, 9]. When remaining energy reaches a certain

threshold, node reduces its transmission radius again

in order to achieve less energy consumption[10] under

the premise of a certain coverage ratio[2]. Results are

network lifetime and has a balanced network load and

routing traffic.

1

2. Related Work

2.1. Maximizing the Lifetime of Wireless Sensor Networks

through Optimal

To get optimal network lifetime by power control

on a much larger timescale with the so-called singlesession

flow routing solutions, under which the packetlevel

power control and strict requirement on synchronization

are not necessary. The synchronization requirement

is very low and its overhead is less when difference

to packet-level multisession ow routing solution.

Lifetime-centric flow routing for energy-constrained wireless

sensor networks.

2.2. Increasing the Throughput of Multihop Packet Radio

Networks with Power Adjustment

The power control problem has been not consider by

most works, but may have impact on performance. By

power control, transmission ranges of stations are tunable

Packet Radio Network. How to reduce a multi-code

assignment problem to a single-code assignment problem

and then use the proposed power adjustment schemes to

improve the network performance.

2.3. Optimal Transmission Radius for Flooding in

Large Scale Sensor Networks

The transmission radius on the average settling time

the time at which all nodes in the network finish transmitting

the flooded packet. Proposed for large wireless

networks there exists a transmission range which

minimizes the settling time corresponding to an optimal

tradeoff between reception and contention times. Finding

an optimal transmission range for flooding in sensor

networks. By choosing a transmission radius without

previous analysis can lead to an unnecessarily large settling

time in the network which will decrease the overall

network throughput. If the transmission radius of the

nodes is not carefully chosen, the flooded packet may

take too long to be transmitted by all the nodes in the

network, impacting overall network throughput.

2.4. Topology Control for Multihop Packet Radio Networks

Distributed topology-control algorithm has been developed

for each node in a packet radio network (PRN)

to control its transmitting power and logical neighbors

in order to construct a reliable high-throughput topology.

The local computation can be programmed in a

very efficient way. Topology-control algorithm has higher

throughput more than regular-structure networks with

the same. A under the disk-threshold interference model

and ALOHA random-access protocol. Distributed topology

control algorithm is very well suited for real-time

applications.

2.5. Topology Control of Multihop Wireless Networks

using Transmit Power

Centralized algorithms for use in static networks and

prove their optimality. For mobile networks two distributed

heuristics that adaptively for adjusting node

transmits powers in response to topological changes and

that attempt to maintain a connected topology using

minimum power and analyze the throughput delay and

less power required efficient of algorithms using a prototype

software implementation an emulation of a power

controllable radio and a detailed information channel

model. It will connected of multihop wireless networks

in practice can be substantially increased with topology

control.

2.6. Distributed Topology Control for Power Efficient

Operation in Multihop Wireless Ad Hoc Networks

Network topology increases network lifetime by reducing

transmission power and reduces traffic interference

if node degrees is very low. Moreover,that the routes

2

in the multihop network are efficient in power save. Network

lifetime can be increased by efficiently managing

the power-consumption in each individual node belonging

to the network.

2.7. An Energy Efficient Routing Mechanism for Wireless

Sensor Networks

MECH(Maximum Energy Cluster Head) routing protocol

has self-configuration and hierarchical tree routing

properties. MECH constructs clusters based on radio

range for configuration and the number of cluster members.

Hence it required in the network is Distributed

more equally through our cluster constructing.

2.8. An Energy Efficient Routing Protocol for Cluster-

Based Wireless Sensor Networks Using Ant Colony

Optimization

An efficient routing algorithm for large scale clusterbased

wireless sensor networks. The technique uses two

level, In first cluster members send data directly to their

cluster head. Second,the cluster heads use ant colony

optimization algorithm, To increase WSN sensor is any

device that maps a physical quantity from the environment

to a quantitative measurement.

2.9. Power-Saving Protocols for Multi-Hop Ad Hoc

Power saving management protocols,maintaining domain

awake-interval, periodically-fully-awake-interval,

and quorum-based protocols,based MANETs. Network

is fully connected or there is a clock synchronization

mechanism.Power-saving protocols can save lots of power

with reasonable neighbor discovery time.

3. Programmer’s design

3.1. Mathematical Model (Font 12 italic)

• Defining System:

Let S be RSES routing protocol S= {}

• Identifying input:

Identify input S1={ N,Pr,Ps,T,R,SI}

S={S1,.,...}

{Ni|i=1,2,3,...}

where,

N = Wireless nodes

Pr = Packets Received

Ps = Packet Sent

R = Rate of data transfer from node to sink

SI = Sink Node

• Identify Input:

Ni = { Ns , T, Tr, R, E }

R0=max(dist(u,v )|8__ N(u))

where,

Ns = Network size

T = Traffic

Tr=Transmission Speed

R=Radius

E=energy

• Identify Broadcast Message Packets

RREQ

<source addr,RREQ ID, dest addr,hop cnt,route

record>

• Identifying Process

Sink node broadcasts RREQ msg to all its neighbors

3

Figure 2: RREQ

• Identifying Process

RREQ

<source addr,RREQ ID, dest addr,hop cnt,route

record >

source addr,RREQ ID=uniquely identifies

• Identifying Process

Figure 3: ACK/RERR

all nodes return ACK/RERR to Source

3.2. Dynamic Programming and Serialization

• Selection of Transmission Radius

When a sensor node comes into the network,

that time it will use maximum transmission power

and transmission radius to send packets.As a result

of node distribution, max transmission radius is

usually longer than the distance between node and

its farthest neighbor, which causes the waste of

energy. The shadow area of Figure 4 represents

the energy waste when a node sends packets with

the max transmission radius. In this Protocol node

reduces its maximum transmission radius only to

reach the farthest neighbor before it sends the first

packet

Figure 4: Initial transmission radius selection

• Algorithm ITRS//Initiate Transmission Radius

Selection

1. The collection of N(u)’s information Sensor

node u broadcasts HELLO packet containing

its IP and geographical position information

with the max transmission radius. All neighbors

are chosen into N(u). Node u collects

every neighbor’s information after a round of

communication and computes the distance to

all other neighbors.

2. The computation of R0 Initial transmission

radius R0 equals to the distance to the farthest

neighbor.

R0=max(dist(u,v )|8__ N(u))

After the selection of initial transmission

radius, node can still communicate with the

farthest neighbor. By network topology and

4

routing information don’t change, and no

maintenance is needed.

• Route Discovery

Route discovery process of RSES is on demand.

The source node by broadcasting a route request

(RREQ) packet to its neighbors. The RREQ contains

information the following fields:

<source addr,RREQ ID, dest addr,hop cnt,route

record >. The pair source addr, RREQ ID uniquely

identifies a RREQ.

Figure 5: Route Discovery

• Algorithm TRR// Readjustment of Transmission

Radius

Node energy is low, energy will be exhausted

rapidly if the node still use the initial transmission

radius. So, decrease the speed of energy consumption

and prolong the lifetime of node and network,

node must reduce its transmission radius and the

amount of neighbors and communication. In RSES,

node readjusts it transmission radius based on coverage

ratio CR when nodeÅ s remaining energy reaches

the threshold E_ Definition Coverage Ratio The ratio

of the amount of neighbors after readjust transmission

radius to the amount of neighbors before

readjustment.

1. The collection of N(u)’s information Node(u)

broadcasts Radius Readjustment Notification

packet RRNT when remnant energy reaches

E_ , and every neighbor replies a Radius Readjustment

ACK packet RRACK piggybacking

its geographical position information. Node

u collects every neighbor’s information after a

round of communication and computes N0.

2. Deciding which node in N(u) belongs to

NCR(u)

Node(u) computes the distance to every node

in N(u) and sorts the nodes by the distance.

The CR • N0 nodes with the minimum distance

will be put into NCR(u).

3. The computation of RCR

The transmission radius RCR based on the CR

equals to the distance to the farthest neighbor

in NCR(u).

RCR = max(dist(u,v)|8__NCR(u))

4. The confirmation of RCR Node u broadcasts

Radius Readjustment Confirmation packet

RRCN, informing the neighbors in NCR(u)

that radius readjustment has finished and it

will send packets with RCR.

• Route Maintenance

The packet is responsible for confirming that the

packet has been received by the next hop and make

record; the packet is retransmitted until this confirmation

of receipt (ACK) is received.If error occurs

RERR identifying link and removes this broken link

from table.

3.3. Data independence and Data Flow architecture

The RSES is a plane on-demand energy-saving routing

protocol. RSES is composed of initial transmission

radius selection, route discovery, transmission radius

readjustment and route maintenance figure 6 show

the flow of Algorithm.

5

Figure 6: Architecture for Radius Self-Adjust Energy-

Saving Routing Protocol

3.4. Turing Machine

The Radius Self-adjust Energy-Saving Routing Protocol

is a plane on-demand energy-saving routing protocol.

RSES is composed of initial transmission radius

selection where transmission radius only to reach farthest

neighbor before it sends the packet. Then route discovery

process of RSES is on-demand so sensor node need to

communicate with another node to get information from

route table. Transmission radius readjustment when low

energy that node readjust its transmission radius. Route

maintenance is used ACK for confirmation its show Data

Fow Architecture figure 7.

4. Results and Discussion

Expected Research Outcome

The outcome of the project is that it deals with network

connectivity, lifetime at the same time. Following

outcomes will be achived using this algorithm.

• Energy Saving:By using this algorithm if remnant

energy reaches a certain threshold, node reduces its

transmission radius to achieve less energy consump-

Figure 7: Data Flow Architecture

tion under the premise of a coverage ratio which will

save energy.

• Increasing Network lifetime:As we are using RESE

Algorithm which saves energy hence we can increase

network lifetime.

• Adjusting radius:When ever energy of some node fall

unders certin threshold then it adjusts radius so that

energy of that node will be saved.

5. Conclusion

In this work, presenting a transmission radius selfadjust

energy-saving routing protocol RSES. By using

RSES, source node minimis its initial transmission radius

to the most away neighbor before it sends the first

packet.The on-demand route discovery process is initiated

whenever a source sensor node needs to communicate

with another node for which it has no routing infor-

6

mation in its route table. Energy Saving by using, this

algorithm if remnant energy reaches a certain threshold,

node reduces its transmission radius again in order to

achieve less energy consumption under the premise of

a coverage ratio which will save energy. Increasing Network

lifetime using RESE, Algorithm which saves energy

hence we can increase network lifetime. Adjusting radius

When ever energy of some node fall unders certin threshold

then it adjusts radius so that energy of that node will

be saved.