Indian Journal of Science and Technology
Year: 2015, Volume: 8, Issue: Supplementary 7, Pages: 1-8
P. Ramya1* and V. Gopalakrishnan2
1 Department of Information Technology Vidyaa Vikas College of Engineering and Technology Thiruchengode, Namakkal, Tamil Nadu, India; [email protected]
2 Department of Electrical and Electronics Engineering Government College of Technology Coimbatore, Tamil Nadu, India
Objective: The main intent of this research is to enhance the network capacity and compute the shortest path for reducing congestion in the wireless adhoc networks. Methods: In this manuscript, an innovative technique is introduced which is used to enhance the performance of α-MOC-CD based broadcasting and routing by using D equivalence classes of CDS. With that, we also apply minimum spanning tree for calculating the shortest path for avoiding the congestion to accomplish proficient broadcasting and routing in wireless networks. Results: The alpha-DEC-MOC-CDS (alpha-D-equivalence classMOC-CDS) shows high network capacity when compared to the existing alpha-MOC-CDS. The proposed method improves the network capacity by using D equivalence classes and also the minimum spanning tree is used to recognize the shortest path. If the number of iterations is increased, the transmission capacity in alpha-DEC-MOC-CDS is 4.07, the medium, routing path length is 6.72 and the average routing path length is 5.73. The comparison result shows that the proposed method achieves better network capacity when compared to the existing system. Conclusion: The findings demonstrate that the alpha-D-equivalence class-MOC-CDS method is presented and suggested that this method high network capacity.
Keywords: ConnectedDominating Set(CDS),D-Equivalence Classes, Minimum Routing Cost CDS (α-MOC-CDS), Minimum Support Tree, Shortest Path
Subscribe now for latest articles and news.