A Unified Analytic Framework Based on Minimum Scan Statistics for Wireless Ad Hoc and Sensor Networks
Issue No. 09 - September (2009 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.220
Chih-Wei Yi , National Chiao Tung University, Hsinchu City
Due to limitations on transmission power of wireless devices, areas with sparse nodes are decisive to some extreme properties of network topology. In this paper, we assume wireless ad hoc and sensor networks are represented by uniform point processes or Poisson point processes. Asymptotic analyses based on minimum scan statistics are given for some crucial network properties, including coverage of wireless sensor networks, connectivity of wireless ad hoc networks, the largest edge length of geometric structures, and local-minimum-free geographic routing protocols. We derive explicit formulas of minimum scan statistics. By taking the transmission radius as a major parameter, our results are applied to various network problems. This work offers a unified approach to solve various problems and reveals the evolution of network topology. In addition, boundary effects are thoroughly handled.
Wireless ad hoc networks, wireless sensor networks, minimum scan statistics, random deployment, Poisson point processes, uniform point processes, coverage, connectivity, grid routing, greedy forward routing, Gabriel graphs, relative neighborhood graphs.
C. Yi, "A Unified Analytic Framework Based on Minimum Scan Statistics for Wireless Ad Hoc and Sensor Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 1233-1245, 2008.