Throughput Enhancement using CDS Based Dijkstra's Technique In Wireless Mesh Networks

International Journal of Mobile Computing and Application
© 2017 by SSRG - IJMCA Journal
Volume 4 Issue 1
Year of Publication : 2017
Authors : Lekshmi Revi.N and Neenu P.A
How to Cite?

Lekshmi Revi.N and Neenu P.A, "Throughput Enhancement using CDS Based Dijkstra's Technique In Wireless Mesh Networks," SSRG International Journal of Mobile Computing and Application, vol. 4,  no. 1, pp. 1-4, 2017. Crossref,


Wireless mesh networks are absolutely necessary in our day to day lives. Because of it’s excessive reliability, low placement costs, and adaptability, wireless mesh networks had a considerable advancement in recent years. Wireless mesh networks gives excess broadband access to a vast number of users. Network coding is extremely applicable for WMN. To increase the throughput of a system network coding can be effectively used, by utilizing some scientific operations which reduces the number of transmissions. Larger end to end delay is a harsh problem in a network flow and it will reduce the network performance .To avoid this problem, routing should be depicted with an ideal coding opportunity path.A coding agent having optimum coding opportunity with CDS preference can be used to find the best routing path with CDS preference. This work proposes a Connected dominating set (CDS) based Dijkstra’s algorithm to enhance the throughput of a network.CDS based Dijkstra’s technique outperforms the existing CDS based FCR technique in terms of increased throughput and lowest end to end delay.


Network coding,Connected Dominating Set,Dijkstra’s Technique.


[1] S. Katti, H. Rahul, W. Hu, D. Katabi, M. M'edard and J. Croweroft. XORs in the Air: Practical Wireless Network Coding. Proceedings of ACM SIGCOMM. pp. 243-254.2006.
[2] Wei X. Zhao L. Xi J, Wang Q. Network coding aware routing prodSocol for lossy wireless networks. In: Proceedings of the 5th international conference on wireless communications, networking and mobile computing (WiCom'09); 2009
[3] T. Nage, F. Richard Yu and M. St-Hilaire," Adaptive Control of Packet Overhead in XOR Network Coding," Proceedings of Conference on IEEE International Conference on Communications (ICC'2010), pp.1-5,2010.
[4] J. Le. J. C. S. Lui, and D. M. Chiu, "DCAR: Distributed coding ¬aware routing in wireless networks," IEEE Transactionson Mobile Computing.
[5] A.Campo and A.Grant,"Robustness of Random NetworkCoding to Interfering Sources," in Proc. 7th Australian Communications Theory Workshop, pp. 120-124, Feb. 2006
[6] E.Fasolo, M. Rossi, J. Widmer, and M. Zorzi, MAC S cheduling and Packet Combination Strategies for PracticalRandom Network Coding,-in Proc. IEEE ICC'07, pp. 3582-3589, June 2007
[7] J. Jin and B. Li, "Adaptive Random Network Coding in WiMAX," inProc. IEEE ICC08, pp. 2576-2580, May 2008.
[8] Christina Fragouli and Emina Soljanin. Networkcoding fundamentals. Foundations and Trends in Networking, 2(1).2007.
[9] S. Deb, M. Effros, T. Ho, D. R. Karger, R. Koetter, D. S. Lun, M'edard. and N. Ratnakar. Network coding for wireless applications: A brief tutorial. InIWWAN, 20
[10] R. Draves, J. Padhye, and B. Zill. Comparison of Routing Metrics for Multi-Hop Wireless Networks. In Proceedings of ACM SIGCOMM. 2004.
[11] Z Fu. P. Zerfos, H. Luo. S. La, L Zhang, and M. Gerla. The impact of multihop wireless channel on tcp throughput and loss. In INFOCOM 2005
[12] Anwar Al Hamra, Chadi Barakat, and Thierry Turleth Network coding for wireless mesh networks: A case study. InWOWMOM '06: Proceedings of the 2006 International Symposium on World of Wireless Mobile and Multimedia Networks, pages 103-114,
[13] J. N. Laneman and G. Wornell. Exploiting distributed spatial diversity in wireless networks. Computing, October 2000 Network.
[14] of Lipschitz-Hankel type involving products of Bessel functions,” Phil. Trans. Roy. Soc. London, vol. A247, pp. 529-551, April 1955. (references)
[15] J. Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed., vol. 2. Oxford: Clarendon, 1892, pp.68-73.
[16] I.S. Jacobs and C.P. Bean, “Fine particles, thin films and exchange anisotropy,” in Magnetism, vol. III, G.T. Rado and H. Suhl, Eds. New York: Academic, 1963, pp. 271-350.
[17] K. Elissa, “Title of paper if known,” unpublished.
[18] R. Nicole, “Title of paper with only first word capitalized,” J. Name Stand. Abbrev., in press.
[19] Y. Yorozu, M. Hirano, K. Oka, and Y. Tagawa, “Electron spectroscopy studies on magneto-optical media and plastic substrate interface,” IEEE Transl. J. Magn. Japan, vol. 2, pp. 740-741, August 1987 [Digests 9th Annual Conf. Magnetics Japan, p. 301, 1982].
[20] M. Young, The Technical Writer’s Handbook. Mill Valley, CA: University Science, 1989.s 
[21] H.Li,J,Wu:”Dominating set based routing in ad hoc wireless networks” in proc.of international workshop on discrete algorithms and methods for mobile computing and communications usa(1999)
[22] Stojmenovic, M. Seddigh, J. Zunic: Dominating Sets and Neighbor Elimination-based Broadcasting Algorithms in Wireless Networks. 
[23] IEEE Transactions on Parallel and Distributed Systems, January (2002)
[24] Stojmenovic, M. Seddigh, J. Zunic: Dominating Sets and Neighbor Elimination-based Broadcasting Algorithms in Wireless Networks. 
[25] IEEE Transactions on Parallel and Distributed Systems, January (2002)
[26] F. Theoleyre and F. Valois: A Virtual Structure for Mobility Management in Hybrid Networks. In Wireless Communications and Networking Conference (WCNC) IEEE, Vol. 5, pp. 1035-1040, Atlanta, USA, March (2004))
[27] S. K. Sarkar, T. G. Basavaraju, C. Puttamadappa: Ad Hoc Mobile Wireless Networks, Principles, Protocoles, and Application. Taylor edition (2008) 
[28] P. Santi,” Topology Control in Wireless Ad Hoc and Sensor Networks,” Wiley edition (2005) 
[29] M. L. M. Kiah, L. K. Qabajeh and M. M. Qabajeh: Unicast Position-based Routing Protocols for Ad-Hoc Networks. Acta Polytechnica Hungarica, Vol. 7, No. 5, 2010
[30] S. Basagni: Distributed Clustering Ad Hoc Networks. In Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN) (1999) 
[31] N. Benaouda, HervéGuyennet, Ahmed Hammad and M. Mostefai: A New Two Level Hierarchy Structuring for node Partitionning in Ad Hoc Networks. In Proceedings of ACM Symposium on Applied Computing, SAC'10, Zurich, Switzerland, pp. 719-726, March (2010) 
[32] M. Jiang, J. Li, Y. C. Tay: Cluster-based Routing Protocol (CBRP). Internet Draft, draft-ietf-manet-cbrp-spec-01.txt, 14 August (1999)
[32] X. Cheng, D. Du: Virtual Backbone-based Routing in  uko Multihop Ad Hoc Wireless Networks. Technical Report -002,        University of Minnesota, Minnesota, USA, January (2002)
[33] N. Malpani, J. L. Welch, N. Vaidya: Leader Election Algorithms for Mobile Ad Hoc Networks. In InternationalWorkshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), USA, August (2000) 
[34]  K. Drira, H. Khedouci, N. Tabbane:Virtual Dynamic Topology for Routing in Mobile Ad Hoc Networks. Proceedings of the International Conference on Late Advances in Networks (ICLAN'2006) pp. 129-134, Paris France (2006
[35] B. Haggar: Self-Stabilizing Clustering Algorithm for Ad Hoc Networks. Wireless and Mobile Communications, 2009. ICWMC '09. Fifth International Conference, Cannes, La Bocca (2009), March (2000)