三维传感器网络中贪婪算法的可达性分析  

Deliverability Analysis of Greedy Routing in 3D Sensor Networks

作　　者：侯孟书[1] 李玉军[1] 秦志光[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都611731

出　　处：《电子科技大学学报》2012年第3期441-446,共6页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(61073177);中央高校基金(2YGX2011J062)

摘　　要：针对贪婪算法存在路由空洞现象,定义并研究了半球型3D传感器网络中贪婪算法的可达性问题。基于节点随机分布的数学特性,分析了传感器传输半径与贪婪算法的可达率之间的定量关系,推导出保证设定可达率的传感器传输半径的理论上界,并给出了相应的数值求解方法。仿真实验数据验证了理论上界的正确性和严密性,为确定节点最小传输半径奠定了理论基础。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.

关 键 词：临界传输半径 可达率 贪婪算法 三维传感器网络 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]