Abstract
Efficient estimation of population size is a common requirement for many wireless sensor network applications. Examples include counting the number of nodes alive in the network and measuring the scale and shape of physically correlated events. These tasks must be accomplished at extremely low overhead due to the severe resource limitation of sensor nodes, which poses a challenge for large-scale sensor networks. In this article we design a novel measurement technique, FLAKE based on sparse sampling that is generic, in that it is applicable to arbitrary wireless sensor networks (WSN). It can be used to efficiently evaluate system size, scale of event, and other global aggregating or summation information of individual nodes over the whole network in low communication cost. This functionality is useful in many applications, but hard to achieve when each node has only a limited, local knowledge of the network. Therefore, FLAKE is composed of two main components to solve this problem. One is the Injected Random Data Dissemination (Sampling) method, the other is sparse sampling algorithm based on Inverse Sampling, upon which it improves by achieving a target variance with small error and low communication cost. FLAKE uses approximately uniform random data dissemination and sparse sampling in sensor networks, which is an unstructured and localized method. At last we provide experimental results demonstrating the effectiveness of our algorithm on both small-scale and large-scale WSNs. Our measurement technique appears to be the practical and appropriate choice.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Arora A, Dutta P, Bapat S, Kulathumani V. A line in the sand: A wireless sensor network for target detection, classification, and tracking. Computer Networks, 2004, 46(5): 605–634.
Gandhi S, Suri S, Welzl E. Catching elephants with mice: Sparse sampling for monitoring sensor networks. In Proc. the 5th International Conference on Embedded Networked Sensor Systems (SenSys 2007), Sydney, Australia, July 18–21, 2007, pp.601–616.
Tolle G, Polastre J, Szewczyk R, Culler D. A macroscope in the redwoods. In Proc. the 3rd International Conference on Embedded Networked Sensor Systems (SenSys 2005), San Diego, USA, July 18–21, 2005, pp.101–110.
Govindarajulu Z. Elements of Sampling Theory and Methods. New York: Prentice Hall, 1999.
Funke S. Topological hole detection in wireless sensor networks and its applications. In Proc. DIALM-POMC 2005, Cologne, Germary, July 18–21, 2005, pp.50–61.
Hsu C-S, Sheu J-P, Chang Y-J. Efficient broadcasting protocols for regular wireless sensor networks. Wireless Communications and Mobile Computing, 2006, 6(1): 35–48.
Dimakis A G, Sarwate A D,Wainwright M J. Geographic gossip: Efficient aggregation for sensor networks. In Proc. IPSN 2006, Nashville, USA, Jul. 15–20, 2006, pp.1–10.
Kempe D, Dobra A, Gehrke J. Gossip-based computation of aggregate information. In Proc. FOCS2003, Cambridge, USA, Feb. 14–17, 2003, pp.1–10.
Massoulie L, Merrer E L, Kermarrec A, Ganesh A. Peer counting and sampling in overlay networks: Random walk methods. In Proc. PODC2006, Denver, USA, July 23–26, 2006, pp.211–222.
Wang Y, Gao J, Mitchell J. Boundary recognition in sensor networks by topological methods. In Proc. MOBICOM2006, Los Angeles, USA, Sept. 18–21, 2006, pp.56–168.
Gandhi S, Hershberger J, Suri S. Approximate isocontours and spatial summaries for sensor networks. In Proc. IPSN 2007, Cambridge, USA, April 25{27, 2007, pp.1–13.
Xue W, Luo Q, Chen L, Liu Y. Contour map matching for event detection in sensor networks. In Proc. SIGMOD2006, Chicago, USA, Jun. 26–29, 2006, pp.233–243.
Bash B A, Desnoyers P J. Exact distributed Voronoi cell computation in sensor networks. In Proc. IPSN 2007, Cambridge, USA, April 25–27, 2007, pp.211–222.
He T, Stankovic J A, Lu C, Abdelzaher T F. Speed: A stateless protocol for real-time communication in ad hoc sensor networks. In Proc. ICDCS, Providence, USA, July 22–26, 2003, pp.101–110.
Bose P, Morin P, Stojmenovic I, Urrutia J. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 2001, 7(6): 609–616.
Karp B, Kung H T. GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. MobiCom 2000, Boston, USA, Aug. 6–11, 2000, pp.243–254.
Bash B A, Byers J W, Considine J. Approximately uniform random sampling in sensor networks. In Proc. DMSN2004, Toronto, Canada, Aug. 30, 2004, pp.180–188.
Zeng X, Bagrodia R, Gerla M. Glomosim: A library for parallel simulation of large-scale wireless networks. In Proc. PADS1998, Banff, Canada, May 26–29, 1998, pp.101–110.
Author information
Authors and Affiliations
Corresponding author
Additional information
The work described in this paper is supported by the National Basic Research 973 Program of China under Grant Nos. 2005CB321801 and 2006CB303000, the National High-Tech Research and Development 863 Program of China under Grant No. 2006AA01Z332, and the National Natural Science Foundation of China under Grant No. 60773019.
Rights and permissions
About this article
Cite this article
Peng, SL., Li, SS., Liao, XK. et al. Estimation of a Population Size in Large-Scale Wireless Sensor Networks. J. Comput. Sci. Technol. 24, 987–997 (2009). https://doi.org/10.1007/s11390-009-9273-9
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-009-9273-9