Self-Aware Dynamic Routing in Wireless Sensor Networks

Abstract: - In wireless sensor network, the forwarding node takes the load status about its neighbors into account in order to scatter the excessive packets, an appropriate detour path consisting of idle or under loaded nodes can be found purposely, but not blindly. But the detour path takes large end-to-end delay. The existing method used the centralized approach and it consumes more energy. In the proposed method, the node is selfaware about the network. Hence the forwarding node checks status of the nearest node capability with the help of AODV algorithm before forwarding packets. This results in reduction of delay of overall traversing and congestion at each node. Moreover, throughput of the overall network also increased. NS2 is used for the simulation of the overall network. Index Terms: Wireless sensor network, self-aware, AODV, NS2
I. INTRODUCTION

passing through the network in a unit of time. Notice that when the load is below the capacity of the network, the throughput increases proportionally with the load. We expect the throughput to remain constant after the load reaches the capacity, but instead the throughput declines sharply. The reason is the discarding of packets does not reduce the number of packets by the routers. When the load exceeds the capacity, the queues become full and the routers have to discard some packets. Discarding packets does not reduce the number of packets in the network because the sources retransmit the packets, using time-out mechanisms, when the packets do not reach the destinations
II. RELATED WORK

Wireless sensor networks are becoming very popular in both industrial and home automation applications. A typical wireless sensor network consists of a large number of smallsized, battery-powered sensor nodes that are limited in battery energy, CPU power, and communication capability. Congestion control involves two factors that measure the performance of a network: delay and throughput
A. DELAY VERSUS LOAD

Note that when the load is much less than the capacity of the network, the delay is at a minimum. This minimum delay is composed of propagation delay and processing delay, both of which are negligible. However, when the load reaches the network capacity, the delay increases sharply because we now need to add the waiting time in the queues (for routers in the path) to the total delay. Note that the delay becomes infinite when the load is greater than the capacity. If this is not obvious, consider the size of the queues when almost no packet reaches the destination, or reaches the destination, or reaches the destination with infinite delay; the queues become longer and longer. Delay has a negative effect on the load and consequently the congestion. When a packet is delayed, the source, not receiving the acknowledgment, retransmits the packets, which makes the delay, and the congestion, worse.
B. THROUGHPUT VERSUS LOAD

Several researchers have done the qualitative and quantitative analysis of Ad Hoc Routing Protocols by means of different performance metrics. They have used different simulators for this purpose. J Broch et al. [1] performed experiments for performance comparison of both proactive and reactive routing protocols. In their simulation, a network size of 50 nodes with varying pause times and various movement patterns were chosen. The simulation was done with ns-2 simulator. A related innovative network layer approach to robust routing that takes unique advantage of the broadcast wireless channel for diversity is the extremely opportunistic routing technique. Unlike traditional routing techniques, in ExOR the identity of the node, which is to forward a packet, is not predetermined before the packet is transmitted. Instead, it ensures that the node closest to the destination that receives a given packet will forward the packet further. While this technique does not explicitly use metric-based routing, the protocol is designed to minimize the number of transmissions as well as the end-to-end delay. ExOR also requires a larger set of receivers to be active, which may have an energy penalty.
III. BASIC ROUTING ALGORITHM

Description of Proposed AODV Scheme Ad hoc On Demand Distance Vector (AODV) initiates a route discovery process only when it has data packets to send and it does not know any route to the destination node, that is, route discovery in AODV is on-demand. AODV uses sequence numbers maintained at each destination to determine freshness of routing information and to prevent routing loops. All routing packets carry these sequence numbers. A. Route Establishment

We defined throughput and as the number of bits passing through a point in a second. We can extend that definition from bits to packets and from a point to a network. We can define throughput in a network as the number of packets

In an on-demand routing protocol, the source node floods the route request packet in the network when a route is not available for the desired destination. It may obtain multiple routes to different destinations from a single route request.

information only if the destination sequence number of the current packet received is greater than the last destination sequence number stored at the node. A route request carries the source identifier(SrcID), the destination identifier(DestID),the source sequence number(SrcSeqNum),thedestinationsequencenumber(DestSeq Num),the broadcast identifier (BcastID),and the time to live(TTL) field. Destination sequence number indicates the freshness of the route that is accepted by the source. When an intermediate node receives a route request, it either forwards it or prepares a route reply if it has a valid route to the destination. The validity of a route at the intermediate node is determined by comparing the sequence number at the intermediate node with the destination sequence number in the route request packet. If a route request is received multiple times, which is indicated by the BcastID-SrcID pair, the duplicate copies are discarded. All intermediate nodes having valid routes to the destination, or the destination node itself, are allowed to send route reply packets to the source. Every intermediate node, while forwarding a route request, enters the previous node address and its BcastID. A timer is used to delete this entry in case a route reply is not received before the timer expires. This helps in storing an active path at the intermediate node as AODV does not employ source routing of data packets. When a node receives a route reply packet, information about the previous node from which the packet was received is also stored in order to forward the data packet to this next node as the next hop toward the destination. V .SIMULATON SETUP Here we give the emphasis for the evaluation of performance of Ad Hoc routing protocol AODV with varying the number of sensor nodes. The simulations have been performed using network simulator NS-2 version 2.34 running on Fedora 7 is an open source discrete event simulation tool, which means it simulates events such as sending, receiving, forwarding and dropping packets.

Fig: Update path information A node updates its path information only if the destination sequence number of the current packet received is greater than the last destination sequence number stored at the node. Nodes calculation in the network Let n be the number of nodes in the network, N (n) = n.Pn N (n) = n (/) n {1-(/) ----------- (1) Nodes in the network except source node N (n-1) = {1-(/)} (n-1) (/) n--- (2) Arrival rate Path established rate C. Route Maintenance

If a path break is detected at an intermediate node, the node informs the end nodes by sending an unsolicited Route reply with the hop count set as .
IV. WORKING STEPS

In the first step, pre-network analysis taken place. After that number of nodes available is calculated with the help of the formula (2).Hence, the source node floods the route request packets through the various routes for communication establishment. After that the routing node checks the nearest node capability, whether the node is free or not. If free, forward the packets to the destination through intermediate nodes. If no means the pre-network analysis is repeated. In an on-demand routing protocol, the source node floods the route request packet in the network when a route is not available for the desired destination. A node updates its path

[4]

[5]

[6]

[7]

[8]

[9].

[10]

[11] REFERENCES [1] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva, A Performance Comparison of MultiHop Wireless Network Routing Protocols, Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom98), October 25-30, 1998,Dallas,Texas,USA,pp.25-30. S. Chen and N. Yang, Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks, IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 9, pp. 934-946, Sept. 2006. B. Hull, K. Jamieson, and H. Balakrishnan, Mitigating Congestion in Wireless Sensor [12].

Networks, Proc. Intl Conf. Embedded Networked Sensor Systems (SenSys 04), pp. 134-147, 2004. S. Chen and N. Yang, Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks, IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 9, pp. 934-946, Sept. 2006 M.H. Yaghmaee and D.A. Adjeroh, Priority-Based Rate Control for Service Differentiation and Congestion Control in Wireless Multimedia Sensor Networks, Computer Networks, vol. 53, no. 11, pp. 1798-1811, 2009 L. Popa, C. Raiciu, I. Stoica, and D.S. Rosenblum, Reducing Congestion Effects in Wireless Networks by Multipath Routing, Proc. IEEE Intl Conf. Network Protocols (ICNP 06), 2006 C.Y. Wan, S.B. Eisenman, andA.T.Campbell,CODA:CongestionDetection and Avoidance in Sensor Networks, Proc. ACM Intl Conf. Embedded Networked Sensor Systems (SenSys 03), pp. 266-279,2003. J. Kang, Y. Zhang, and B. Nathg, End-to-End Channel Capacity Measurement for Congestion Control in Sensor Networks, Proc. ACM/IEEE SANPA, 2004. M. Zawodniok and S. Jagannathan, Predictive CongestionControl Protocol for Wireless Sensor Networks, IEEE Trans. Wireless Comm., vol. 6, no. 11, pp. 3955-3963, Nov. 2007 C. Wang, B. Li, K. Sohraby, M. Daneshmand, and Y. Hu, Upstream Congestion Control in Wireless Sensor Networks through Cross-Layer Optimization, IEEE J. Selected Areas in Comm., vol. 25, no. 4, pp. 786-795, May 2007 NS -2, the ns Manual (formally known as NS Documentation) Available at http: //www. isi.edu/nsnam/ns/doc. S. R. Das, C. E. Perkins, and E. M. Royer, Performance Comparison of Two On-Demand Routing Protocols for AdHoc Networks , IEEE Personal Communications Magazine,Special Issue on Mobile Ad Hoc Networks, Vol. 8, No. 1,February 2001,pp.16-29. C. E. Perkins, E. M. Royer, and S. R. Das, Ad Hoc On-Demand Distance Vector (AODV) Routing, Internet Draft, draft-ietf- manet-aodv-10.txt, work in progress, 2002

[2]

[13]

[3]