International Journal of Computer Network and Information Security(IJCNIS)

ISSN: 2074-9090 (Print), ISSN: 2074-9104 (Online)

Published By: MECS Press

IJCNIS Vol.6, No.9, Aug. 2014

Congestion Control in WMSNs by Reducing Congestion and Free Resources to Set Accurate Rates and Priority

Full Text (PDF, 376KB), PP.37-42

Views:152   Downloads:3


Akbar Majidi, Hamid Mirvaziri

Index Terms

Wireless multimedia sensor networks;Congestion control;Energy;Collision


The main intention of this paper is focus on mechanism for reducing congestion in the network by free resources to set accurate rates and priority data needs. If two nodes send their packets in the shortest path to the parent node in a crowded place, a source node must prioritize the data and uses data that have lower priorities of a suitable detour nodes consisting of low or non- active consciously. The proposed algorithm is applied to the nodes near the base station (which convey more traffic) after the congestion detection mechanism detected the congestion. Obtained results from simulation test done by NS-2 simulator demonstrate the innovation and validity of proposed method with better performance in comparison with CCF, PCCP and DCCP protocols.

Cite This Paper

Akbar Majidi, Hamid Mirvaziri,"Congestion Control in WMSNs by Reducing Congestion and Free Resources to Set Accurate Rates and Priority", IJCNIS, vol.6, no.9, pp.37-42, 2014. DOI: 10.5815/ijcnis.2014.09.05


[1]Akbar MAJIDI, Hamid MIRVAZIRI. BDCC: Backpressure routing and dynamic prioritization for congestion control in WMSNs. I.J. Computer Network and Information Security; 2014, 5, 29-34.

[2]Akyildiz I, Melodia WT, Chowdhury KR. A survey on wireless multimedia sensor networks. Computer Networks 2007; 51:921–960.

[3]Akyıldız IF, Su W, Sankarasubramaniam Y, Çayırcı E. Wireless Sensor Networks: Survey. Computer Networks 2002; 38:393–422.

[4]Neely M. J and Urgaonkar R. Optimal Backpressure Routing in Wireless Networks with Multi-Receiver Diversity. Ad Hoc Networks 2009; 7: 862-881.

[5]H.A. Shayanfar, E.S. Barazandeh, S.J. Seyed Shenava, A. Ghasemi, O. Abedinia. SOLVING OPTIMAL UNIT COMMITMENT BY IMPROVED HONEY BEE MATING OPTIMIZATION. International Journal on “Technical and Physical Problems of Engineering” (IJTPE) 2012; 4, 38-45.

[6]Yaghmaee MH, Adjerohb DA. Priority-based rate control for service differentiation and congestion control in wireless multimedia sensor networks.Computer Networks 2009; 53: 1798–1811.

[7]LIN Q, Wang R, Jian. Novel congestion control approach in wireless multimedia sensor networks. Journal of China Universities of Posts and Telecommunications 2012; 18: 1–8.

[8]Swastik Brahma, Mainak Chatterjee, Kevin Kwiat, Pramod K. Varshney. Traffic management in wireless sensor networks: Decoupling congestion control and fairness. Computer Communications 2012; 35:670-681.

[9]Mattsson N. A DCCP module for ns-2. MSc, Luleå University of Technology, Luleå, Sweden, 2004.

[10]Harjot Bawa,Parminder Singh,Rakesh Kumar, “An Efficient Novel Key Management Scheme for Enhancing User Authentication in A WSN", IJCNIS, vol.5, no.1, PP.56-64, DOI: 10.5815/ijcnis.2013.01.07.

[11]Qinghua Wang. Traffic Analysis, Modeling and Their Applications in Energy-Constrained Wireless-Sensor Networks - On Network Optimization and Anomaly Detection. Phd, Information Technology and Media Mid Sweden University, Sundsvall, Sweden, 2010.

[12]Ozlem Durmaz Ince. A survey on multi-channel communication in wireless sensor networks. Computer Networks 2011; 55:3081–3099.

[13]Yin X, Zhou X, Huang R, Fang Y, Li S. A fairness – aware congestion control scheme in wireless sensor networks. IEEE Transactions on Vehicular Technology 2009; 58:5225–5234.

[14]Zawodniok M, Jagannathan S. Predictive congestion control protocol for wireless sensor networks. IEEE Transactions on Wireless Communications 2007; 6:3955–3963.

[15]Felemban E, Chang-Gun Lee, Ekici E. MMSPEED: multipath multi- SPEED protocol for QoS guarantee of reliability and timeliness in wireless sensor networks. IEEE Transactions on Mobile Computing 2006; 5:738–754.