CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
Implementation of Feature Selection Using Correlation Matrix in Python

Ahmad Farhan AlShammari
Random Articles
Reseach Article

Congestion Avoidance Routing in Wireless Sensor Networks

by N. Thrimoorthy, T. Anuradha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 141 - Number 5
Year of Publication: 2016
Authors: N. Thrimoorthy, T. Anuradha
10.5120/ijca2016909621

N. Thrimoorthy, T. Anuradha . Congestion Avoidance Routing in Wireless Sensor Networks. International Journal of Computer Applications. 141, 5 ( May 2016), 15-19. DOI=10.5120/ijca2016909621

@article{ 10.5120/ijca2016909621,
author = { N. Thrimoorthy, T. Anuradha },
title = { Congestion Avoidance Routing in Wireless Sensor Networks },
journal = { International Journal of Computer Applications },
issue_date = { May 2016 },
volume = { 141 },
number = { 5 },
month = { May },
year = { 2016 },
issn = { 0975-8887 },
pages = { 15-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume141/number5/24780-2016909621/ },
doi = { 10.5120/ijca2016909621 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:42:39.923915+05:30
%A N. Thrimoorthy
%A T. Anuradha
%T Congestion Avoidance Routing in Wireless Sensor Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 141
%N 5
%P 15-19
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wireless sensor nodes consist of group of self organized sensor nodes with limited resources in terms of processing power and battery energy. Wireless sensors are used increasingly in many industrial and consumer applications. Sensors detect events and send via multi hop routing to the sink node for processing the event. The routing path is established through proactive or reactive routing protocols. Congestion happens due to flow of packets exceeding the capacity of link & exceeding the capacity of nodes in terms of Queue Size. Due of congestion packet loss occurs and it affects the quality of application services built on top of sensor network. In this work, we address the congestion from point of reducing the probability of congestion rather than make it to occur and solve it. We propose a NOCO routing protocol which is built on top of AODV and follows reservation based mechanism to avoid congestion and also alleviate the congestion if it happens.

References
  1. Chien- Yin Wan, Shane B. Eiseaman, Andrew T. Champbell, “ CODA: Congestion Detection and Avoidance”.
  2. Ozgur B. Akan, Ian F. Akyildiz, “Event-to-Sink Reliable Transport in wireless Sensor Networks”.IEEE/ACM transactions on Networking. Vol. 13, No.5, October 2005
  3. KyriakosKarenos, VanaKalogeraki, Srikanth V. Krishnamurthy. “Cluster-based Congestion control for sensor networks”.
  4. RamujaVedantham, RaghupathySivakumar, Sueng – Jong park, “Sink-to-Sensors Congestion Control Strategy”.
  5. Mohammad HosseinYaghmaee, Donald Adjeroh. “ A New priority Based Congestion Control Protocol for Wireless Multimedia Sensor Networks”. IEEE 2008.
  6. Swastil Brahma, MainakChatterjee, Kevin Kwiat,” Congestion Control and Fairness in Wireless Sensor Networks”.
  7. C. Wang, K.Shoraby, B.Li, “SenTCP: A hop-byhop Congestion Control protocol for Wireless Sensor Networks” in IEEE INFOCOM 2005, USA, March 2005.
  8. C. Y. Wan, A.T. Campbell, “PSFQ: A reliable transport protocol for Wireless Sensor Networks” in proceedings of ACM WSNA’02, September 28, 2002, USA.
  9. K.ChenandK.Nahrstedt. EXACT:AnExplicitRate-basedFlowControlFrameworkinMANET(extendedversion). Technical Report UIUCDCS-R-2002-2286/UILU-ENG-2002-1730, Department of Computer Science, University of Illinois at Urbana-Champaign, July 2002.
  10. K. Chen and K. Nahrstedt. Limitations of Equation-Based Congestion Control in Mobile Ad Hoc Networks. In ICDCSW ’04: Proceedings of the 24th International Conference on Distributed Computing Systems Workshops W7: EC, pages 756–761, 2004. DOI: 10.1109/ICDCSW.2004.1284118.
  11. K. Chen, K. Nahrstedt, and N. Vaidya. The Utility of Explicit Rate-based Flow Control in Mobile Ad Hoc Networks. In WCNC ’04: Proceedings of the IEEE Wireless Communications and Networking Conference, volume 3, pages 1921–1926, Mar. 2004.
  12. K. Chen, Y. Xue, and K. Nahrstedt. On Setting TCP’s Congestion Window Limit in Mobile Ad Hoc Networks. In ICC ’03: Proceedings of the IEEE International Conference on Communications, Anchorage, Alaska, May 2003. DOI: 10.1109/ICC.2003.1204525.
  13. C. de M. Cordeiro, S. R. Das, and D. P. Agrawal. COPAS: Dynamic Contention-Balancing to Enhance the Performance of TCP over Multi-hop Wireless Networks. In Proceedings of the 10th International Conference on Computer Communication and Networks (IC3N), pages 382–387, Miami, FL, USA, Oct. 2002.
  14. R. de Oliveira and T. Braun. A Delay-based Approach Using Fuzzy Logic to Improve TCP Error Detection in Ad Hoc Networks. In WCNC ’04: Proceedings of the IEEE Wireless Communications and Networking Conference, volume 3, pages 1666–1671, Mar. 2004.
  15. R. de Oliveira and T. Braun. A Dynamic Adaptive Acknowledgment Strategy for TCP over Multihop Wireless Networks. In INFOCOM ’05: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies, volume 3, pages 1863–1874, Mar. 2005. DOI: 10.1109/INFCOM.2005.1498465.
Index Terms

Computer Science
Information Sciences

Keywords

Sensor Networks Multi hop routing Congestion AODV NOCO.

Powered by PhDFocusTM