Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/3665
Full metadata record
DC FieldValueLanguage
dc.contributor.authorArun K.B.R
dc.contributor.authorReddy L.C
dc.contributor.authorHiremath P.S.
dc.date.accessioned2020-06-12T15:01:05Z-
dc.date.available2020-06-12T15:01:05Z-
dc.date.issued2010
dc.identifier.citation2010 IEEE 2nd International Advance Computing Conference, IACC 2010 , Vol. , , p. 347 - 352en_US
dc.identifier.uri10.1109/IADCC.2010.5422930
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/3665-
dc.description.abstractIn this paper, we study the fundamental property of the ad hoc network using connectivity index. We investigate the construction of minimum cost multicast trees by selecting a link having minimum connectivity Index and comparing application required bandwidth with (available bandwidth - allocated bandwidth) of the link. We have shown that Increase in total connectivity Index of the entire network increases no. of spanning trees. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree Multicasting based on connectivity index with bandwidth constraint. ©2010 IEEE.en_US
dc.subjectBandwidth
dc.subjectConnectivity Index
dc.subjectEdge disjoint
dc.subjectMulticast
dc.subjectSpanning tree
dc.subjectTolerant
dc.titleRoute failure tolerant multicast in mobile ad hoc networks using disjoint minimum spanning trees based on connectivity index with bandwidth constrainten_US
dc.typeConference Paper
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.