The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - Aug. (2012 vol.11)
pp: 1274-1286
Yuxing Peng , National University of Defense Technology, Changsha
ABSTRACT
Efficient estimation of global information 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 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 paper, we develop a novel protocol FLAKE to efficiently and accurately estimate the global information of large-scale sensor networks based on the sparse sampling theory. Specially, FLAKE disseminates a small number of messages called seeds to the network and issues a query about which nodes receive a seed. The number of nodes that have the information of interest can be estimated by counting the seeds disseminated, the nodes queried, and the nodes that receive a seed. FLAKE can be easily implemented in a distributed manner due to its simplicity. Moreover, desirable tradeoffs can be achieved between the accuracy of estimation and the system overhead. Our simulations show that FLAKE significantly outperforms several existing schemes on accuracy, delay, and message overhead.
INDEX TERMS
Channel estimation, Wireless sensor networks, Accuracy, Information analysis, Monitoring, Global communication, estimation., Sensor networks, fast release/capture sampling
CITATION
Yuxing Peng, "Fast Release/Capture Sampling in Large-Scale Sensor Networks", IEEE Transactions on Mobile Computing, vol.11, no. 8, pp. 1274-1286, Aug. 2012, doi:10.1109/TMC.2011.152
REFERENCES
[1] S. Gandhi, S. Suri, and E. Welzl, "Catching Elephants with Mice: Sparse Sampling for Monitoring Sensor Networks," Proc. Fifth Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2007.
[2] G. Tolle, J. Polastre, R. Szewczyk, and D. Culler, "A Macroscope in the Redwoods," Proc. Third Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2005.
[3] Z. Govindarajulu, Elements of Sampling Theory and Methods. Prentice Hall, 1999.
[4] J. Rice, Mathematical Statistics and Data Analysis, third ed. Duxbury Press, 1999.
[5] S. Funke, "Topological Hole Detection in Wireless Sensor Networks and Its Applications," Proc. Joint Workshop Foundations of Mobile Computing (DIALM-POMC), 2005.
[6] W.W. Terpstra, J. Kangasharju, C. Leng, and A.P. Buchmann, "Bubblestorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search," Proc. SIGCOMM, 2007.
[7] A. Dimakis, A. Sarwate, and M.J. Wainwright, "Geographic Gossip: Efficient Aggregation for Sensor Networks," Proc. Int'l Conf. Information Processing in Sensor Networks (IPSN), 2006.
[8] C.-S. Hsu, J.-P. Sheu, and Y.-J. Chang, "Efficient Broadcasting Protocols for Regular Wireless Sensor Networks," Wireless Comm. and Mobile Computing, vol. 6, pp. 35-48, 2006.
[9] F. Wang and J. Liu, "Duty-Cycle-Aware Broadcast in Wireless Sensor Networks," Proc. IEEE INFOCOM, Apr. 2009.
[10] D. Kempe, A. Dobra, and J. Gehrke, "Gossip-Based Computation of Aggregate Information," Proc. Ann. IEEE Symp. Foundations of Computer Science (FOCS), 2003.
[11] L. Massoulie, E.L. Merrer, A. Kermarrec, and A. Ganesh, "Peer Counting and Sampling in Overlay Networks: Random Walk Methods," Proc. Ann. ACM Symp. Principles of Distributed Computing (PODC), 2006.
[12] A. Kamra, V. Misra, and D. Rubenstein, "Counttorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks," Proc. Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2007.
[13] F. Kai-Wei, S. LIU, and S. Prasun, "Structure-Free Data Aggregation in Sensor Networks," IEEE Trans. Mobile Computing, vol. 6, no. 8, pp. 929-942, Aug. 2007.
[14] M. Ding and X. Cheng, "Robust Event Boundary Detection in Sensor Networks—A Mixture Model Based Approach," Proc. IEEE INFOCOM, Apr. 2009.
[15] Y. Wang, J. Gao, and J. Mitchell, "Boundary Recognition in Sensor Networks by Topological Methods," Proc. ACM MobiCom, 2006.
[16] S. Gandhi, J. Hershberger, and S. Suri, "Approximate Isocontours and Spatial Summaries for Sensor Networks," Proc. Int'l Conf. Information Processing in Sensor Networks (IPSN), 2007.
[17] W. Xue, Q. Luo, L. Chen, and Y. Liu, "Contour Map Matching for Event Detection in Sensor Networks," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), 2006.
[18] Y. Wang, J. Gao, and J.S.B. Mitchell, "Boundary Recognition in Sensor Networks by Topological Methods," Proc. ACM MobiCom, pp. 122-133, Sept. 2006.
[19] M. Li and Y. Liu, "Rendered Path: Range-Free Localization in Anisotropic Sensor Networks with Holes," IEEE/ACM Trans. Networking, vol. 18, no. 1, pp. 320-332, Feb. 2010.
[20] Y. He, J. Chen, D.K.Y. Yau, H. Shao, and Y. Sun, "Energy-Efficient Capture of Stochastic Events by Global- and Local-Periodic Network Coverage," Proc. ACM MobiHoc, May 2009.
[21] B.A. Bash and P.J. Desnoyers, "Exact Distributed Voronoi Cell Computation in Sensor Networks," Proc. Int'l Conf. Information Processing in Sensor Networks (IPSN), 2007.
[22] T. He, J.A. Stankovic, C. Lu, and T.F. Abdelzaher, "SPEED: A Stateless Protocol for Real-Time Communication in Ad Hoc Sensor Networks," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), 2003.
[23] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with Guaranteed Delivery in Ad Hoc Wireless Networks," Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001.
[24] B. Karp and H.T. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," Proc. ACM MobiCom, pp. 243-254, 2000.
[25] Y. Li, Y. Yang, and X. Lu, "Routing Metric Designs for Greedy, Face and Combined Greedy-Face Routing," Proc. IEEE INFOCOM, Apr. 2009.
[26] A. Woo, T. Tong, and D. Culler, "Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks," Proc. Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2003.
[27] D.S.J.D. Couto, D. Aguayo, J. Bicket, and R. Morris, "A High-Throughput Path Metric for Multi-Hop Wireless Routing," Proc. ACM MobiCom, 2003.
[28] B.A. Bash, J.W. Byers, and J. Considine, "Approximately Uniform Random Sampling in Sensor Networks," Proc. Int'l Workshop Data Management for Sensor Networks: In Conjunction with VLDB (DMSN), 2004.
[29] W.W. Terpstra, C. Leng, and A.P. Buchmann, "Practical Summation via Gossip," Proc. Ann. ACM Symp. Principles of Distributed Computing (PODC), 2007.
[30] D. Mosk-Aoyama and D. Shah, "Computing Separable Functions via Gossip," Proc. Ann. ACM Symp. Principles of Distributed Computing (PODC), 2006.
[31] X. Zeng, R. Bagrodia, and M. Gerla, "Glomosim: A Library for Parallel Simulation of Large-Scale Wireless Networks," Proc. Workshop Parallel and Distributed Simulation (PADS), 1998.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool