Subscribe
Issue No.09 - September (2009 vol.20)
pp: 1233-1245
Chih-Wei Yi , National Chiao Tung University, Hsinchu City
ABSTRACT
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.
INDEX TERMS
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.
CITATION
Chih-Wei Yi, "A Unified Analytic Framework Based on Minimum Scan Statistics for Wireless Ad Hoc and Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 9, pp. 1233-1245, September 2009, doi:10.1109/TPDS.2008.220
REFERENCES
 [1] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W.M. McEneaney, G. Yin, and Q. Zhang, eds., pp.547-566, Birkhauser, Mar. 1998. [2] M.D. Penrose, “On $k$ -Connectivity for a Geometric Random Graph,” Random Structures and Algorithms, vol. 15, no. 2, pp.145-164, Sept. 1999. [3] C.-W. Yi, P.-J. Wan, X.-Y. Li, and O. Frieder, “Asymptotic Distribution of the Number of Isolated Nodes in Wireless AdHoc Networks with Bernoulli Nodes,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '03), Mar. 2003. [4] P.-J. Wan and C.-W. Yi, “Asymptotic Critical Transmission Radius and Critical Neighbor Number for $k$ -Connectivity in Wireless AdHoc Networks,” Proc. ACM MobiHoc '04, pp. 1-8, May 2004. [5] H. Zhang and J. Hou, “On Deriving the Upper Bound of $\alpha$ -Lifetime for Large Sensor Networks,” Proc. ACM MobiHoc '04, pp.121-132, May 2004. [6] P. Auer and K. Hornik, “On the Number of Points of a Homogeneous Poisson Process,” J. Multivariate Analysis, vol. 48, pp. 115-156, 1994. [7] M.D. Penrose, “Focusing of the Scan Statistic and Geometric Clique Number,” Advances in Applied Probability, vol. 34, no. 4, pp.739-753, Dec. 2002. [8] J. Glaz and N. Balakrishnan, Scan Statistics and Applications. Birkhäuser, 1999. [9] P.-J. Wan and C.-W. Yi, “Coverage by Randomly Deployed Wireless Sensor Networks,” IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2658-2669, June 2006. [10] H. Dette and N. Henze, “The Limit Distribution of the Largest Nearest-Neighbour Link in the Unit $d$ -Cube,” J. Applied Probability, vol. 26, pp. 67-80, 1989. [11] M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” The Annals of Applied Probability, vol. 7, no. 2, pp. 340-361, May 1997. [12] P.-J. Wan and C.-W. Yi, “Asymptotic Critical Transmission Ranges for Connectivity in Wireless Ad Hoc Networks with Bernoulli Nodes,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '05), Mar. 2005. [13] C.-W. Yi, P.-J. Wan, K.-W. Lin, and C.-H. Huang, “Asymptotic Distribution of the Number of Isolated Nodes in Wireless Ad Hoc Networks with Unreliable Nodes and Links,” Proc. 49th Ann. IEEE GLOBECOM Technical Conf. (GLOBECOM '06), Nov./Dec. 2006. [14] P.-J. Wan and C.-W. Yi, “Coverage by Randomly Deployed Wireless Sensor Networks,” Proc. Fourth IEEE Int'l Symp. Network Computing and Applications (NCA '05), July 2005. [15] C.-W. Yi, P.-J. Wan, X.-Y. Li, and O. Frieder, “Asymptotic Distribution of the Number of Isolated Nodes in Wireless AdHoc Networks with Bernoulli Nodes,” IEEE Trans. Comm., vol. 54, no. 3, pp. 510-517, Mar. 2006. [16] G.T. Toussaint, “The Relative Neighbourhood Graph of a Finite Planar Set,” Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980. [17] E.N. Gilbert, “Random Plane Networks,” J. Soc. Industrial and Applied Math., vol. 9, no. 4, pp. 533-543, Dec. 1961. [18] N. Li, J.C. Hou, and L. Sha, “Design and Analysis of a MST-Based Distributed Topology Control Algorithm for Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM '03, vol. 3, pp. 1702-1712, Apr. 2003. [19] Y. Wang and X.-Y. Li, “Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks,” Proc. 2003 Joint Workshop Foundations of Mobile Computing (DIALM-POMC '03), pp. 59-68, Sept. 2003. [20] J. Cartigny, F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic, “Localized LMST and RNG Based Minimum-Energy Broadcast Protocols in Ad Hoc Networks,” Ad Hoc Networks, vol. 3, no. 1, pp.1-16, 2004. [21] P.-J. Wan and C.-W. Yi, “On the Longest Edge of Gabriel Graphs in Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 1, pp. 111-125, Jan. 2007. [22] P.-J. Wan, C.-W. Yi, F. Yao, and X. Jia, “Asymptotic Critical Transmission Radius for Greedy Forward Routing in Wireless AdHoc Networks,” Proc. ACM MobiHoc '06, pp. 25-36, May 2006. [23] F. Lin and X. Yang, Geometric Measure Theory: An Introduction. Int'l Press, 2003. [24] J. Geißler and H. von Weizsäcker, Fractal Sets and Preparation to Geometric Measure Theory, script, http://www.mathematik.uni-kl.de/~wwwstoch/ 2002wskriptrev.pdf, Feb. 2006. [25] M. Cifre, “Optimizing the Perimeter and the Area of Convex Sets with Fixed Diameter and Circumradius,” Archiv der Math., vol. 79, no. 2, pp. 147-157, Aug. 2002.