Longer Distance Hop Count BasedPriority Congestion Control Technique for Wireless Sensor Networks
Keywords:
wireless sensor network, congestion control, priority congestion control protocol
Abstract
Wireless Sensor Network consists of large number of tiny sensor nodes (Tsodes) distributed in an area, having insufficient processing power, communicating over a network. These Tsodes are circulated in given network environment so that they gather data, process that data and send it to the destination. Rising large applications need to transport massive data packets to the sink node from different sensor nodes without having much loss of data packets in the network. Network must be escaped from the congestion, occurs usually at the Tsodes nearer to base station / sink node. Congestion not only causes packet loss, but also leads to unnecessary energy consumption as well as delay. Therefore, in order to extend network lifetime and improve fairness and provide better quality of service, developing a novel solution for congestion estimation and control is important to be considered. This paper proposes a approach of packet level priority for controlling the congestion in WSN. It uses the hop count value and the distance vector among sink and Tsodes. The technique avoids the congestion faster and improves the overall network throughput and delay too for WSN.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2014-03-15
Issue
Section
License
Copyright (c) 2014 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.