A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralized administration. A collection of autonomous nodes or terminals that communicate with each other by forming a multi hop radio network and maintaining connectivity in a decentralized manner is called an ad hoc network. There is no static infrastructure for the network, such as a server or a base station. The idea of such networking is to support robust and efficient operation in mobile wireless networks by incorporating routing functionality into mobile nodes. Fig shows an example of an ad hoc network, where there are numerous combinations of transmission areas for different nodes. From the source node to the destination node, there can be different paths of connection at a given point of time. But each node usually has a limited area of transmission as

shown in Fig by the oval circle around each node. A source can only transmit data to node B but B can transmit data either to C or D. It is a challenging task to choose a really good route to establish the connection between a source and a destination so that they can roam around and transmit robust communication. There are three major ad hoc routing protocols DSDV, DSR, and AODV, all these protocols are constantly being improved by IETF [8]. As a result, a comprehensive performance evaluation is of ad hoc routing protocols essential. We evaluated all available metrics and then performed a comparative performance evaluation. Since these protocols have different characteristics, the comparison of all performance differentials is not always possible. The comparative studies of the simulation results for these parameters for different protocols have been reported. (i) Traffic received and sent, (ii) Total route requests sent, (iii) Control traffic received and sent, (iv) Data traffic received and sent,

Recent advances in micro-electro-mechanical systems (MEMS) and low power and highly integrated digital electronics have led to the development of micro sensors [1][2][3][4][5][5][7]. Such sensors are generally equipped with data

2

transform them into an electric signal. Processing such a signal reveals some properties about objects located and/or events happening in the vicinity of the sensor. The sensor sends such sensed data, usually via radio transmitter, to a command center either directly or through a data concentration center (a gateway). The gateway can perform fusion of the sensed data in order to filter out erroneous data and anomalies and to draw conclusions from the reported data over a period of time

• Traffic shaping

• Traffic policing

These methods are often necessary on the edge separating a customer’s network from a provider’s network. Providers often force the customer to adhere to a specific policy service (or committed rate).This policy is referred to as the Service Level Agreement (SLA) between the customer and provider. Shaping and policing mechanisms differ in how each handles violations of the SLA. Shaping is usually implemented on the customer side, and will buffer traffic that exceeds the provider’s committed rate. Thus, shaping can slow the traffic rate and siphon out traffic in compliance with the provider’s SLA. Buffering traffic will often create delay and jitter, which can negatively impact sensitive traffic types. Shaping also requires sufficient memory to queue buffered traffic. Shaping provides no mechanism to re-mark traffic that exceeds the committed rate. Policing is usually implemented on the provider side, and will either drop or re-mark traffic that exceeds the provider’s committed rate

• Generic Traffic Shaping (GTS): It implements shaping on a per-interface basis using the traffic-shape command. • Class-Based Shaping: It implements shaping on a per-class basis using the shape command within a MQC policy-map. • Distributed Traffic Shaping (DTS) : It offloads traffic shaping from the router processor to Versatile Interface

Routing algorithms can be differentiated based on several key characteristics. First, the particular goals of the algorithm designer affect the operation of the resulting routing protocol. Second, various types of routing algorithms exist, and each algorithm has a different impact on network and router resources. Finally, routing algorithms use a variety of metrics that affect calculation of optimal routes. The following sections analyze these routing algorithm attributes.

Routing algorithms often have one or more of the following design goals:

• Optimality

• Robustness and stability

• Simplicity and low overhead

• Rapid convergence

In this paper, we presented a new energy-aware QoS routing protocol for sensor networks. The protocol finds QoS paths for real-time data with certain endto- end delay requirements. The performance analysis is done on the basis of few parameters all together called Quality of service.

[1] I. F. Akyildiz et al., “Wireless sensor networks: a survey”, Computer Networks, Vol. 38, pp. 393-422, March 2002. [2] D. Estrin et al., “Next Century Challenges: Scalable Coordination in Sensor Networks,” in the Proc. of MobiCom’99, Seattle, Washington, August 1999. [3] G. J. Pottie and W. J. Kaiser, “Wireless integrated network sensors,” Communications of the ACM, Vol. 43, No 5, pp. 51 – 58, May 2000. [4] K. Sohrabi et al., "Protocols for self-organization of a wireless sensor network,”

[5] R. Min et al., "Low Power Wireless Sensor Networks", in the Proc. of Int. Conference on VLSI Design, Bangalore, India , January 2001. [6] J.M. Rabaey et al., "PicoRadio supports ad hoc ultra-low power wireless networking," IEEE Computer, Vol. 33, pp. 42-48, July 2000. [7] R. H. Katz et al., “Mobile Networking for Smart Dust,” in the Proc. of MobiCom’99, Seattle, WA, August 1999.

[9] Amanjeet Kaur, Anuj Gupta “An Analytical Study of the QOS Parameters of Routing of Protocols in a Wireless Sensor Network” International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-3, Issue-6, November 2013 [10] Kumar Manoj, Parmanand, S. C. Sharma & S.P. Singh Performance of QoS Parameter in Wireless Ad hoc Network Proceedings of the World Congress on Engineering and Computer Science 2009 Vol I WCECS 2009, October 20-22, 2009