Deliverability analysis of greedy routing in the spherical cap 3D sensor networks

• Published in: Science China. Information sciences Vol. 56; no. 7; pp. 48 - 59
• Main Authors: Hou, MengShu, Yang, YaLing, Li, YuJun
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01-07-2013; Springer Nature B.V
• Subjects: Computer networks; Computer Science; Information Systems and Communication Service; Monitors; Networks; Research Paper; Routing (telecommunications); Sensors; Spherical caps; Stations; Three dimensional; Tightness; Upper bounds; 产能分析; 传感器网络; 概率模型; 模拟验证; 球形; 网络监测; 路由; deliverability probability; critical transmission radius; greedy routing; 3D sensor network
• ISSN: 1674-733X; 1869-1919
• DOI: 10.1007/s11432-013-4811-z

For 3D sensor networks to monitor the ocean, forest and aerosphere, etc., sensors can forward their data to the base station by greedy routing. It is critical to quantitatively greedy routing＇s deliverability for evaluating network＇s functionality and performance. The probability that all sensors can successfully send their data to the base station by greedy routing is usually modeled as the probability of guaranteed delivery. For a typical spherical cap 3D sensor network deployment scenario where nodes follow a homogeneous Poisson point process, the relationship between the sensor transmission radius and the probability of guaranteed delivery is studied, and a tight analytical upper bound on the sensor transmission radius to ensure the designed deliverability probability is derived in this paper. The correctness and tightness of the derived upper bound are verified by extensive simulations.