Seminar Topics & Project Ideas On Computer Science Electronics Electrical Mechanical Engineering Civil MBA Medicine Nursing Science Physics Mathematics Chemistry ppt pdf doc presentation downloads and Abstract

Full Version: An Energy Efficient MAC Layer Random Routing in Wireless Sensor Networks ppt
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
An Energy Efficient MAC Layer for Random Routing in Wireless Sensor Networks


[attachment=32230]

INTRODUCTION

To make wireless sensor networks as an energy efficient
MAC layer for Random routing.

EXISTING SYSTEM

Idle-listening is the biggest challenge for energy- efficiency and longevity of multihop wireless sensor network (WSN) deployments.
In multihop WSN deployments, the Sensor is often the critical component that drains most of the energy.
The sensor wastes the same amount of energy during idle state as it uses in transmitting packet.

PROPOSED SYSTEM

We present a sleep/wakeup protocol POWERNAP , which avoids the overhead of distributing complex, large sleep/wakeup scheduling information to the nodes.
An energy-efficient and low-latency MAC protocol for random routing in wireless sensor networks is used.

ADVANTAGES

Eliminates idle-listening efficiently.
Provides significant improvements in energy efficiency, reliability and latency.
It Trades off doing extra computation to derive the pseudo – random scheduling information.
Instead of sending the very lengthy scheduling information we just include the pseudo-random seed in the packet .

ALGORITHMS

Algorithm 1 NEXTSTATE(S) : We present the state prediction algorithm. This algorithm computes the next relay/packet generation event and is essential for computing the required sleep duration. It uses the random number generator state and packet location to compute next location and the updated random number generator state.
Algorithm 2 SLEEPDURATION(S): Through successive applications of state update we predict next packet arrival time, which is in turn used for determining the sleep duration. The algorithm approximates the time through simulating the relays of packets .

CONCLUSION

POWERNAP handles randomly-distributed arrival of packets without the overhead of distributing large sleep/wakeup scheduling information to the nodes.
A key concept in the design of POWERNAP was to trade off doing extra computation in order to avoid expensive control message transmissions.
POWERNAP piggybacks onto the relayed data packets the seed of the pseudo-random generator.
Sleep or wake up schedule is computed from the seed.
Our coordinated sleep/wakeup protocol is readily applicable to related problems such as maintaining a sentry monitoring service, in an energy-efficient manner.
POWERNAP eliminates the idle-listening problem efficiently and achieves self-stabilizing, low-latency, and low-cost relaying of data packets for random routing protocols.