Proposed Energy Conservation Technique in Wireless Sensor Network

Abstract

Wireless Ad hoc network has a lack of infrastructure and decentralized network. It is a collection of mobile nodes which has energy, some restricted bandwidth and computational functionality also. Due to its mobility behavior rigorous kinds of vulnerabilities may get compromised from the nodes which consumes the energy mostly and exploits the bandwidth of the transmitting node. The energy consumption is momentous issue as mobile nodes have battery power. To extend the lifetime of ad hoc network, it is serious issues to minimize the energy consumption of mobile nodes. In this work, proposes an efficient energy conserving scheme which use election algorithm and key management techniques. This approach is much more efficient in preserving the energy of mobile nodes and also prevents it from the exploitation of bandwidth. The experimental analysis of proposed approach is done in network simulator NS2.34. For measuring the performance of the proposed approach different performance measuring parameter such as Packet Delivery Ratio (PDR), Routing Load and Energy Consumption and Delay is used. Keywords: Bandwidth, Computational Capacity, Energy, Network Simulator, Overhead, PDR, Throughput I. INTRODUCTIONWireless ad hoc network is a self-organized and infrastructure less network which does not have any central coordination. In such network each nodes are free to move and share their link among nodes. Each nodes act as host or routers which has the capability to transmit packets from one end to another end. Wireless network uses the dynamic topology to form the connection and because of this structure of the network changes haphazardly which consumes energy while each node has limited battery power. This network is used in many areas of application such as military application, scientific purpose, research application, Rescue Operations etc. wireless ad hoc network uses routing concepts to transmit the packets which are classified into three categories specifically: proactive routing protocol, reactive routing protocol and hybrid routing protocol. In proactive routing protocol [2] is analogous to the connectionless approach of forwarding packets, with no regard to when and how recurrently such routes are preferred. The routing information is continuously propagated and maintained in table-driven routing protocols; a path to every other node in the ad hoc network is forever available, regardless of whether or not it is needed. Examples of this protocol are DSDV (Destination Sequence Distance Vector), CSGR, GSR (Global State Routing) and FSR (Fisheye State Routing) etc. In reactive protocols [2] are also called on demand routing protocols because they don't uphold routing information or routing movement at the group nodes if there is no announcement. If nodes wish to send a packet to a different node then this protocol investigates for the route in an on-demand method and founds the association in order to broadcast and acknowledge the packet. The examples of this protocol are AODV and DSR etc. Hybrid routing pro...