Back Pressure Algorithm with CBDS

International Journal of Electronics and Communication Engineering
© 2016 by SSRG - IJECE Journal
Volume 3 Issue 12
Year of Publication : 2016
Authors : S.Jotheeshwaran and A.Kumaravel
How to Cite?

S.Jotheeshwaran and A.Kumaravel, "Back Pressure Algorithm with CBDS," SSRG International Journal of Electronics and Communication Engineering, vol. 3,  no. 12, pp. 8-11, 2016. Crossref,


 In mobile ad hoc networks (MANETs), a primary requirement for the establishment of communication among nodes is that nodes should cooperate with each other. In the presence of malevolent nodes, this requirement may lead to serious security concerns; for instance, such nodes may disrupt the routing process. In this algorithm, to protect backpressure algorithm based routing and scheduling protocols against various insider threats. This paper attempts to resolve this issue by designing a dynamic source routing (DSR)-based routing mechanism, which is referred to as the cooperative bait detection scheme (CBDS), that integrates the advantages of both proactive and reactive defense architectures. Our CBDS method implements a reverse tracing technique to help in achieving the stated goal.


Mobile adhoc network, Routing, DSR, CBDS.


[1] A. Baadache, and A.Belmehdi, "Avoiding Black hole and Cooperative Black hole Attacks in Wireless Ad hoc Networks," International Journal of Computer Science and Information Security," Vol. 7, No. 1, 2010.
[2] V. K and A. J PAUL, “Detection and Removal of Cooperative Black/Gray hole attack in Mobile Ad Hoc Networks,” 2010 International Journal of Computer Applications, Vol. 1, No.22, 2010
[3] Scalable Network Technologies (SNT). Qual- Net.
[4] Durgesh Kumar Mishra Mahakal Singh Chandel, Rashid Sheikh. “Security Issues in MANET: A Review”.
[5] Li Shi-Chang, Yang Hao-Lan, Zhu Qing-Sheng College of Computer Science Chongqing University Chongqing, China. Research on MANET Security Architecture design.
[6] L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Trans. Automatic Control, vol. 37, pp. 1936–1948, Dec. 1992.
[7] M. Alresaini, M. Sathiamoorthy, B. Krishnamachari, and M. J. Neely, “Backpressure with adaptive redundancy (BWAR),” in Proc. of IEEE INFOCOM, 2012.
[8] A. Warrier, S. Janakiraman, S. Ha, and I. Rhee, “DiffQ: Practical differential backlog congestion control for wireless networks,” in Proc. of IEEE INFOCOM, 2009.
[9] H. Seferoglu and E. Modiano, “Diff-Max: Separation of routing and scheduling in backpressure-based wireless networks,” in Proc. of IEEE INFOCOM, 2013.
[10] L. Huang, S. Moeller, M. J. Neely, and B. Krishnamachari, “LIFO-backpressure achieves near optimal utility-delay tradeoff,” ACM/IEEE Trans. Networking, pp. 831–844, June 2013.