EFFICIENT PERFORMANCE OF ROUTING ALGORITHMS IN SENSOR NETWORKS
Vanitha Komira, T.Soma Shekar, Teppala Venkata Ramana · IJCER · 2013
The developing of small and low cost sensors became precisely and efficiently due to recent technological advances. The sensing electronics determine environmental conditions related to the atmosphere surrounding sensor transform them into an electric signal. Performing such a signal reveals some properties about objects located and/or events happening in the vicinity of the sensor. A large number of these not reusable sensors can be networked in many applications that require unattended operations. A wireless sensor network (WSN) consists of spatially dispersed autonomous sensors to supervise physical or environmental circumstances to considerately pass their data through the network to a main location. If congestion occurs in the Wireless Network some or more important data’s may be dropped. A class of algorithms is proposed in our paper which is based on the congested areas of a network and data priority to enforce differentiated routing. Using simple forwarding rules a basic protocol, called Congestion-Aware Routing (CAR) discovers the congested zone of the network that exists between high-priority data sources and the data sink and dedicates this part of the network to forwarding mainly high-priority traffic. For establishing the high-priority routing zone the CAR requires some overhead as it is inappropriate for highly mobile data sources. We define Mac-Enhanced Congestion Aware Routing (MCAR) for forming high priority paths on the fly for each burst of data, which includes medium-access control (MAC) -layer enhancements and a protocol.