摘要
AMinimizingIntermediateMulticastRoutingprotocol(MIMR)isproposedfordynamicmulti-hopadhocnetworks.InMIMR,multicastsessionsarecreatedandreleasedonlybysourcenodes.Ineachmulticastsessionprocess,thesourcenodekeepsalistofintermediatenodesanddestinations,whichisencapsulatedintothepacketheaderwhenthesourcenodesendsamulticastpacket.Nodesreceivingmulticastpacketsdecidetoacceptorforwardthepacketaccordingtothelist.Dependingontopologymatrixmaintainedbyunicastrouting,theshortestvirtualhierarchyroutingtreeiscon-structedbyimprovedDijkstraalgorithm.MIMRcanachievetheminimumnumberofintermediatenodes,whicharecomputedthroughthetree.Nocontrolpacketistransmittedintheprocessofmul-ticastsession.Loadofthenetworkislargelydecreased.ExperimentalresultshowsthatMIMRisflexibleandrobustfordynamicadhocnetworks.
出版日期
2007年03月13日（中国期刊网平台首次上网日期，不代表论文的发表时间）
