Abstract— Wireless sensor networks (WSNs) have a tremendous potential to improve the efficiency of many systems, for instance, in building automation and process control.WSN is a promising technology for enabling a variety of applications like environmental monitoring, security and applications that save our lives and assets. In WSN, large numbers of sensor nodes are deployed to sensing and gathering information and forward them to the base station with the help of routing protocol. Routing protocols plays a major role by identifying and maintaining the routes in the network.
Competence of sensor networks relay on the strong and effective routing protocol used. In this paper, we present performance analysis for various protocol for wireless sensor network application. The performance has been evaluated using simulations for MANET reactive protocols like AODV, DSR and DSDV. Performance evaluations has been done on metrics like total energy consumption, throughput and packet delivery ratio.
Index Terms— Packet Delivery Ratio, total energy Consumption, Throughput and Wireless Sensor Networks
I. INTRODUCTION
Wireless sensor networks (WSNs) compared to wired networks, such as, simple deployment, low installation cost, lack of cabling, and high mobility, WSNs present an appealing technology as a smart infrastructure for building and factory automation, and process control applications [1].
Emerson Process Management estimates that WSNs enable cost savings of up to 90% compared to the deployment cost of wired field devices. Several market forecasts have recently predicted exponential growths in the sensor network market over the next few years, resulting in a multi- billion dollar market in the near future.Development of Micro Electro Mechanical System favoured a tremendous growth in wireless sensor networks. Wireless Sensor Networks(WSN) have gained world-wide attention in recent years due to the advances made in wireless communication, information technologies and electronics field. The concept of wireless sensor networks is based on a simple equation:
Sensing + CPU + Radio = Thousands of potential applications. It is a sensing technology where tiny, autonomous and compact devices called sensor nodes or motes deployed in a remote area to detect phenomena, collect and process data and transmit sensed information to users. The development of low-cost, low-power, a multifunctional sensor has received increasing attention
from various industries [2],[3]. Due to fast emergence of the wireless sensing, a lot of work has been done on the various categories of routing protocols of WSN like location-based, data-centric, hierarchal routing protocols etc. to measure the network performance. But recent studies are provided with the evidence that Quality-of-Service.(QoS) routing can enhance the network performance by increasing the network utilization, compared to routing that is not sensitive to QoS requirements of traffic.
Quality of Service: In some applications, data should be delivered within a certain period of time from the moment it is sensed; otherwise the data will be useless. Therefore bounded latency for data delivery is another condition for time-constrained applications. However, in many applications, conservation of energy, which is directly related to network lifetime, is considered relatively more important than the quality of data sent. As the energy gets depleted, the network may be required to reduce the quality of the results in order to reduce the energy dissipation in the nodes and hence lengthen the total network lifetime.
II. VARIOUS QUALITY OF SERVICE AWARE ROUTING PROTOCOLS
QoS aware routing is one of the most essential parts of the Quality of Service framework for wireless networks.
Under QoS routing schemes, the data delivery routes are computed with the knowledge of various resources availability in the network along with the QoS requirements of the corresponding flows. There are several issues to be considered during the design of the QoS based routing algorithms for multi-hop wireless sensor networks. Those are: 1) metric selection (e.g., bandwidth, delay etc) and route computation 2) QoS state propagation and maintenance 3) scalability and 4) domain of QoS such as reliability or timeliness (or both). In a system like wireless sensor network the QoS aware routing protocols need to deal with imprecise state information due to the frequent topology changes.
Moreover a QoS aware routing scheme for multi-hop WSNs should also balance efficiency and adaptability while maintaining low control overhead in the system.
Application – 1) Entertainment industry 2) structural monitoring 3) Data logging
4) Machine health monitoring 5) Natural disaster monitoring and prevention
Analysis of Performance Evaluation of Quality of Service for Routing Protocols for Wireless Sensor
Network Applications
Neha dixit1, Nidhi bajpeyee2
1Department of computer science, GITS Gwalior (mp), India
2Assistant prof. in Gwalior institute of science and Technology (mp), India Contact- +91 8305622061,Email- [email protected]
6) Water quality monitoring 7) forest fire and land slide detection 8) air pollution monitoring 9) health care monitoring 10) Environment/ Earth sensing
A. Ad hoc On Demand Distance Vector ( AODV) Routing Protocol
Ad hoc On Demand Distance Vector (AODV) is a reactive routing protocol that uses some features of proactive routing protocol ,routes are established on demanded and as they are needed to send information. AODV starts a route discovery process only when it has data packets to transmit and it does not have any route path towards the destination node, that is, route discovery in AODV is called as on-demand. However, in AODV, the source node and the intermediate nodes store the next-hop information corresponding to each flow for data packet transmission. 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. The major difference between AODV and other on-demand routing protocols is that it uses a destination sequence number (DestSeqNum) to determine an up-to- date path to the destination. A node updates its path information only if the DestSeqNum of the current packet received is greater than or equal to the last DestSeqNum stored at the node with smaller Hop count. During a route discovery process, the source node broadcasts a route query packet to its neighbors. If any of the neighbors has a route to the destination, it replies to the query with a route reply packet; otherwise, the neighbors rebroadcast the route query packet. Finally, some query packets reach to the destination.
B. Dynamic Source Routing (DSR) Protocol
The Dynamic Source Routing (DSR) protocol is a reactive routing protocol for wireless mesh Network this protocol is truly based on source routing whereby all the routing information maintained at mobile motes that is located in remote area. In the source routing, a source regulate the perfect sequence of nodes with which it propagate a packet towards the target. The list of intermediate nodes for routing is explicitly stored in the packet's header. In DSR, every mobile node needs to maintain a path cache where it caches source routes. When a source node wants to send a packet to some other intermediate node, it firstly checks its path cache for a source route to the target node for successful delivery of data packets. In this case if a path between sources to target is found, the source node uses this path to propagate the data packet otherwise it starts the path discovery process throughout the network. path discovery and path maintenance are the two main aspects of the DSR protocol For path discovery mechanism, the source node initiate by broadcasting a route request packet that can be received by all the neighbor nodes within its wireless transmission range. The route request contains the address of the target host, referred to as the target of the route discovery, the source's address, a route record field and a unique identification number. At the end, the source node should receive a route reply packet with a list of network nodes
through which it should transmit the data packets that is supposed the route discovery process was successful.
During the route discovery process, the route record field is used to contain the sequence of hops which already taken.
At start, all senders initiate the route record as a list with a single node containing itself. The next intermediate node attaches itself to the list and so on. Each route request packet also contains a unique identification number called as request _id which is a simple counter increased whenever a new route request packet is being sent by the source node.
So each route request packet can be uniquely identified through its initiator's address and request_id. When a node receives a route request packet, it is important to process the request in the following given order. This way we can make sure that no loops will occur during the broadcasting of the packets.
C. Destination-Sequence Distance Vector (DSDV) Routing Protocol
The C. Perkins and P. Bhagwat developed this routing protocol in 1994. It is table driven routing mechanism for ad-hoc mobile network based on classical Bellman Ford routing algorithm with some advancements. Solving routing looping problem, increases convergence speed and reducing control overhanging message was the main contribution of this algorithm. In DSDV nodes transmit update periodically to its neighbor node with the information of its routing table.
DSDV routing protocol maintain a routing table that store cost metric for routing path, address of next hop up to the destination and the destination sequence number assigned by the destination node. Whenever the topology of the network changes, a new sequence number is necessary before the network reassembles and the node changed routing table information into event triggered style and send updates to its neighbor nodes. The “full dump” and “incremental update”
is two ways in DSDV for sending information of routing table updates. As like name “full dump” the complete routing table is send in update message while incremental update contains only the entries with metric that have been changed since last update was sent. This algorithm is suitable for small ad-hoc networks but the regularly updating routing table, less bandwidth and essentially requirement of new sequence number at the time of network topology change shows the shortcoming of this protocol and make it unsuitable for long and highly dynamic network environment.
III. PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS
Simulation set up
Here we give the significance for the evaluation of performance of Wireless sensor nodes Ad Hoc routing protocol AODV, DSR and DSDV with varying the number of mobile nodes. The network simulations have been done using network simulator NS-2. The network simulator NS-2 is discrete event simulation software for network simulations which means it simulates events such as sending, receiving, forwarding and dropping packets. In our
work, we consider a network of nodes placing within a 1000m X 1000m area. The performance of AODV, DSR and DSDV is evaluated by keeping the network speed and pause time constant and varying the network size (number of mobile nodes). Table I shows the simulation parameters used in this evaluation.
Simulation Parameters
Simulator NS-2.34
Routing Protocols AODV, DSR and DSDV
Simulation Duration 300 seconds
Simulation Area 1000m X 1000m
Number of Nodes 5,10,15,20,25,30
Transmission Range 250m
Maximum Speed 20m/sec
Pause Time 100sec
MAC Layer Protocol IEEE 802.15.4
Packet Rates 4 packets/sec
TABLE I: Parameter Values for AODV, DSR and DSDV Simulation
3.1 Analysis of Performance Metrics
While analyzed the AODV, DSR and DSDV routing protocol,we targeted on three performance metrics for evaluation which are packet delivery ratio (PDR), Average End-to-end delay and energy consumption.
Packet delivery ratio (PDR): It is the ratio of number of data packets successfully received by the PAN Coordinator to the total number of data packets sent by RFD.
Average End-to-End delay: It indicates the length of time taken for a packet to travel from the CBR (Constant Bit Rate) source to the destination. It represents the average data delay an application experiences when transmitting data.
Energy Consumption: This is amount of energy consumed by MICAZ Mote devices during the periods of transmitting, receiving, idle and sleep. The unit of energy consumption used in the simulations is mJoule.
Network Lifetime: This is defined as the minimum time at which maximum numbers of sensor nodes are dead or shut down during a long run of simulations.
3.2 Simulation results discussion
Packet delivery ratio: The performance analysis of packet delivery ratio is shown in table 4.1 and also illustrated in figure 4.2. From Figure is has been observed that routing protocol DSDV routing protocol performs better than AODV and DSR routing Protocol. For all types of traffic load, DSDV performs better than DSR and AODV. The packet delivery ratio drops at high traffic due to well known hidden terminal problem in multi hop environment.
The packet delivery ratio of DSDV protocol increases from 25.6% to 36% when the load changes from 0.1 packets per seconds to 1 packet per second and then decreases. While the packet delivery ratio of AODV protocol increases from 20% to 31% whereas DSR routing protocol shows nearly 25% packet delivery ratio.
Protocols Loads in Packets/Second
0.1 0.2 1 5 10
AODV 29.5 35.7 41.9 45.6 50.7
DSR 100.5 101.6 110.5 130.2 190.3
DSDV 42.8 50.2 55.6 60.6 90.9
Table 4.1 Simulation Results of Packet Delivery Ratio of Various Routing Protocols
Figure 4.2 Packet Delivery Ratio Vs Loads (packets/ second)
Average end to end delay: The plot for average end-to- end delay for varying traffic loads is shown in Figure 4.3. The results can also be studied from table 4.3. The average end- to- end delay of a packet depends on route discovery latency, besides delays at each hop (comprising of queuing, channel access and transmission delays) and the number of hops. At low loads, queuing and channel access delays do not contribute much to the overall delay. The overall average end to end delay of AODV is less as on compared to DSR and DSDV.
Protocols Loads in Packets/Second
0.1 0.2 1 5 10
AODV 2.6 2.8 2.7 3.0 4.6
DSR 3.2 3.9 4.0 3.4 5.6
DSDV 3.0 3.6 3.9 3.9 5.2
Table 4.2 Simulation Result of Average End to End Delay of Various Routing Protocols
Figure 4.3: Average end to end delay vs. loads (packets/second) . Total energy consumption: The simulation results of total energy consumption Vs load is shown in table 4.3. The plot for total energy consumption vs. load of three routing protocols is shown in Figure 4.4. The total energy consumption includes energy consumption in transmission, reception, idle and sleep modes of operation. It is noticed that the maximum energy dissipation occurred during idle mode while reception consumes greater energy than transmission for transferring data packets while calculating total energy consumption in our simulation. During sleep time, there is no energy consumption. The total energy consumption of three routing protocols decreases exponentially when it transferred packets from lowtraffic loads to high traffic loads. Routing protocols have an indirect effect on battery andenergy models.
Table 4.2 Simulation Results of Energy Consumption vs Load of Routing Protocols
Table 4.2 Simulation Result of Energy Consumption vs Load for various routing Protocols
Protocols Loads in Packets/Second
0.1 0.2 1 5 10
AODV 42.5 39.6 32.4 23.2 20.9
DSR 43.2 40.2 38.6 35.4 23.2
DSDV 42.4 41.9 37.1 34.3 22.2
Figure4 Energy Consumption vs Load of Routing Protocols
iv. Conclusion
To evaluate performance of routing protocol we simulate the various routing protocols for packet delivery ratio, average end to end delay and energy consumption. From the results we analyzed that DSDV is the most efficient protocol for wireless sensor networks and also shows highest performance as compared to AODV and DSR routing protocols. So we can use these routing protocols for low energy consumption applications.
REFERENCES
[1] Dr. Praveen Chaturvedi, “Introduction to Wireless Sensor Networks,” International Journal of Advanced Research in Computer Science and Software Engineering, vol. 2, iss.10, Oct. 2012.
[2] Harsh Sundani, Haoyue Li, Vijay K. Devabhaktuni, Mansoor Alam, and Prabir Bhattacharya, “Wireless Sensor Network Simulators a Survey and Comparisons,”
International Journal of Computer Networks (IJCN), vol.2, iss.5, pp. 249- 265, Feb. 2011.
[3] Shio Kumar Singh, M P Singh, and D K Singh,
“Routing Protocols in Wireless Sensor Networks –A Survey,” International Journal of Computer Science &
Engineering Survey (IJCSES), vol.1, no.2, November 2010.
[4] S.C. Chabalala, T.N. Muddenahalli, and F. Takawira,
“Energy-Efficient Dynamic Source Routing Protocol for Wireless Sensor Networks,” IJCSNS International Journal of Computer Science and Network Security, vol.12, no.10, pp. 98-109, October 2012.
[5] (Aug.07, 2013) Bit Error Rate [Online]. Available:
Website https://en.wikipedia.org/wiki/Bit_error_rate.
[6] Jahangir Khan et. al., . “Simulation Analysis of Static and Dynamic Intermediate Nodes and Performance Comparison of MANETS Routing Protocols”, Int.
JointConf. CISIS'12-ICEUTE'12-SOCO'12, AISC 189, pp.
127–140. springerlink.com © Springer-Verlag Berlin Heidelberg 2013.
[7] Gaurika Talwar, Hemika Narang, Kavita Pandey and Pakhi Singhal. “Analysis of Different Mobility Models for Ad Hoc On-Demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol”, Computer Networks &
Communications (NetCom), 579 Lecture Notes in Electrical Engineering 131, DOI: 10.1007/978-1-4614-6154-8_57, © Springer Science+Business Media New York 2013.
