論文(計(jì)算機(jī)工程)-閱讀頁(yè)
2025-01-28 18:10本頁(yè)面
【正文】 法1以及適應(yīng)度函數(shù)法進(jìn)行路徑規(guī)劃，由表1可以看出二階段TSP算法相比較適應(yīng)度函數(shù)法在移動(dòng)節(jié)點(diǎn)數(shù)相同的情況下能夠快速地得到長(zhǎng)度更短更均衡的路徑。表1 兩種方法所得結(jié)果興趣點(diǎn)數(shù)算法路徑總長(zhǎng)度移動(dòng)節(jié)點(diǎn)數(shù)均衡度巡航覆蓋一周時(shí)間t30算法12適應(yīng)度函數(shù)法250算法13適應(yīng)度函數(shù)法3100算法15適應(yīng)度函數(shù)法51000算法118適應(yīng)度函數(shù)法18圖1 兩種方法獲得的移動(dòng)節(jié)點(diǎn)的訪問(wèn)路徑總結(jié)本文對(duì)無(wú)線傳感器網(wǎng)絡(luò)巡航覆蓋中移動(dòng)傳感器移動(dòng)路徑進(jìn)行規(guī)劃，采用二階段TSP算法規(guī)劃移動(dòng)節(jié)點(diǎn)的訪問(wèn)路徑。無(wú)線傳感器網(wǎng)絡(luò)巡航覆蓋中移動(dòng)節(jié)點(diǎn)路徑規(guī)劃無(wú)論對(duì)網(wǎng)絡(luò)成本、壽命、復(fù)雜度對(duì)有重大的影響。參考文獻(xiàn)[1] . Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey, Computer Networks, :393422.[2] Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci, A survey on sensor networks, IEEE Communications Magazine, 2002, 40(8):102114[3] Ian F. Akyildiz, Xudong Wang ,Weilin Wang, Wireless Mesh Networks: A Survey, Computer Networks Journal, 2005,47(4): 445487[4] S. Kumar, T. H. Lai, and J. Balogh, On kCoverage in a Mostly Sleeping Sensor Network, proceedings of ACM MobiCom, 2004.[5] C. F. Huang and Y. C. Tseng, The Coverage Problem in a Wireless Sensor Network, proceedings of ACM WSNA, 2003[6] M. Cardei and J. Wu, Energyefficient Coverage Problems in Wireless Ad Hoc Sensor Networks, Journal of Computer Communications on Sensor Networks, 2005[7] L. Lin and H. Lee, Distributed Algorithms for Dynamic Coverage in Sensor Networks, proceedings of ACM PODC, 2007[8] Poduri, S., Sukhatme, ., Constrained coverage for mobile sensor networks, proceedings of IEEE ICRA 2004, v1: 165 171[9] Andrew Howard, Maja J Matari1
環(huán)評(píng)公示相關(guān)推薦
鄂ICP備17016276號(hào)-1