期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2013
卷号：2
期号：8
页码：2415-2423
出版社：IJECS
摘要：Minimum Spanning Network Connectivity possesses self adaptcity. In order to construct telecommunications, wirelesscommunications, routing is one of the key challenging issues to be addressed. In this paper, A new Algorithm for MinimumSpanning Network Connectivity is proposed. This algorithm is proposed based on the Pandit’s approach. Proposed new algorithmincorporates with drainage system in a city, Vehicle routing, Linked with different rivers etc. Thus new algorithm aims to chooseoptimal minimum spanning network connectivity from nodes to the destination. This algorithm is compared with previouslysuggested algorithms to performance differences. Extension experimental evaluations are performed from suitable numericalexample. It is shows that the new algorithm for minimum spanning network connectivity provides better than the previouslysuggested algorithms
