无线网络中的一种多点传送与数据收集的快速算法.pptVIP

LOGOLOGOLOGOLOGO无线网络中的一种多点传送与数据收集的快速算法Fastalgorithmformulticastanddatagatheringinwirelessnetworks01040203CommunicationSystemsEngineeringDepartment,Ben-GurionUniversityoftheNegev,Beer-Sheva84105,IsraelReceived15April2007;receivedinrevisedform5November2007;accepted18December2007Availableonline21February2008CommunicatedbyS.E.Hambrusch摘要Abstract：GivenawirelessnetworkG=(V,E),weconsideramaximumcriticalenergyproblem[J.Park,S.Sahni,Maximumlifetimebroadcastinginwirelessnetworks,IEEETransactionsonComputers54(9)(2005)1081–1090]thathasanobjectiveofincreasingthechancesofdoingasequenceofbroadcasts.WepresentanoptimalgeneralizedsolutionalgorithmrunninginimprovedoptimalO(|V|+|E|)time,whereVstandsforasetofnodesandEstandsforasetoflinksinthenetwork.Ourapproachisapplicableinanomnidirectionalantennamodelandcanbeusedtosolvetheproblemofmulticastingtrafficsoastomaximizethelifetimeofthenetwork[A.Orda,B.-A.Yassour,Maximum-lifetimeroutingalgorithmsfornetworkswithomnidirectionalanddirectionalantennas,in:Proc.ACMMOBIHOC,2005]andadatagatheringproblemwithanimprovedrunningtime给定一个无线网络G=(V，E)，我们提出以提高执行一系列广播的可能性为目的最大临界能源问题。本文提出了一种改进最佳O(|V||E|)时间（其中V代表一组节点，E表示一组的网络中的链接）的最佳解决方案算法。这种算法适用于一个全方向的天线模型且可解决多址广播通信，以最大限度地提高网络的生存期问题并改善数据收集的运行时间问题。引言Awirelessnetworkconsistsofasetoftransceiverscommunicatingwitheachotherbyradio.Itiscustomarytoassumethattheminimaltransmissionpowerrequiredtotransmittoadistancedisdα,wherethedistancepowergradientαisusuallytakentobeintheinterval[2,4](see[10]).Thetransmissionpossibilitiesresultingfromapowerassignmentinduceacommunicationgraph.一个无线网络就是指一组收发器通过无线电波来相互进行通信。它通常假定其传输到d距离所需的最小能量为。传输可能产生能量分派从而引起通信图形。我们解决一个最大临界能源问题[11]和全方向天线模型的多点传送队列及数据收集问题。无线网络由加权定向图形表示G=(V，E)（|V|节点