电子科技大学学报2012，Vol.41Issue(3)：441-446,6.DOI:10.3969/j.issn.1001-0548.2012.03.023
三维传感器网络中贪婪算法的可达性分析
Deliverability Analysis of Greedy Routing in 3D Sensor Networks
摘要
Abstract
Considering that greedy routing may fail due to routing voids on random network topologies, greedy routing's deliverability is defined and studied in a typical hemi-sphere 3D sensor network deployment scenario. Based on nodes' distribution characteristics, the relationship between the sensor transmission radius and the probability of guaranteed delivery for greedy routing is analyzed. A very tight analytical upper bound on the sensor transmission radius to ensure the designed deliverability probability is derived, and the corresponding numerical solution of this upper bound is proposed. The correctness and tightness of the derived upper bound are verified by extensive simulations, and hence the results can be used to design the minimal transmission for actual sensor network deployment关键词
临界传输半径/可达率/贪婪算法/三维传感器网络Key words
critical transmission radius/ deliverability probability/ greedy routing/ 3D sensor network分类
信息技术与安全科学引用本文复制引用
侯孟书,李玉军,秦志光..三维传感器网络中贪婪算法的可达性分析[J].电子科技大学学报,2012,41(3):441-446,6.基金项目
国家自然科学基金(61073177) （61073177）
中央高校基金(2YGX2011J062) （2YGX2011J062）
