Journal of Computer Science and Technology

, Volume 26, Issue 6, pp 962–970 | Cite as

Minimum-Time Aggregation Scheduling in Duty-Cycled Wireless Sensor Networks

Regular Paper

Abstract

Aggregation is an important and commonplace operation in wireless sensor networks. Due to wireless interferences, aggregation in wireless sensor networks often suffers from packet collisions. In order to solve the collision problem, aggregation scheduling is extensively researched in recent years. In many sensor network applications such as real-time monitoring, aggregation time is the most concerned performance. This paper considers the minimum-time aggregation scheduling problem in duty-cycled wireless sensor networks for the first time. We show that this problem is NP-hard and present an approximation algorithm based on connected dominating set. The theoretical analysis shows that the proposed algorithm is a nearly-constant approximation. Simulation shows that the scheduling algorithm has a good performance.

Keywords

aggregation duty-cycle scheduling sensor network 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

11390_2011_1193_MOESM1_ESM.pdf (97 kb)
(PDF 97.4 kb)

References

  1. [1]
    Mainwaring A, Culler D, Polastre J, Szewczyk R, Anderson J. Wireless sensor networks for habitat monitoring. In Proc. the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA 2002), Atlanta, USA, Sept. 28, 2002, pp.88-97.Google Scholar
  2. [2]
    Szewczyk R, Osterweil E, Polastre J, Hamilton M, Mainwaring A, Estrin D. Habitat monitoring with sensor networks. Communications of the ACM – Wireless Sensor Networks, 2004, 47(6): 34–40.Google Scholar
  3. [3]
    Szewczyk R, Mainwaring A, Polastre J, Anderson J, Culler D. An analysis of a large scale habitat monitoring application. In Proc. the 2nd ACM Conference on Embedded Networked Sensor Systems (Sensys 2004), Baltimore, USA, Nov. 3–5, 2004, pp.214-226.Google Scholar
  4. [4]
    Shrivastava N, Mudumbai R, Madhow U, Suri S. Target tracking with binary proximity sensors. ACM Transactions on Sensor Networks, 2009, 5(4): 251–264.CrossRefGoogle Scholar
  5. [5]
    Jeong J, Hwang T, He T, Du D. MCTA: Target tracking algorithm based on minimal contour in wireless sensor networks. In Proc. the 26th Annual IEEE Conference on Computer Communications (INFOCOM 2007), Anchorage, USA, May 6–12, 2007, pp.2371-2375.Google Scholar
  6. [6]
    Madden S, Franklin M J, Hellerstein J M, Hong W. TAG: A tiny aggregation service for ad-hoc sensor networks. In Proc. the 5th Symp. Operating Systems Design and Implementation (OSDI 2002), Boston, USA, Dec. 9–11, 2002, pp.131-146.Google Scholar
  7. [7]
    Shrivastava N, Buragohain C, Agrawal D, Suri S. Medians and beyond: New aggregation techniques for sensor networks. In Proc. the 2nd ACM Conference on Embedded Networked Sensor Systems (Sensys 2004), Baltimore, USA, Nov. 3–5, 2004, pp.239-249.Google Scholar
  8. [8]
    Chu D, Deshpande A, Hellerstein J, Hong W. Approximate data collection in sensor networks using probabilistic models. In Proc. the 22nd International Conference on Data Engineering (ICDE 2006), Atlanta, USA, Apr. 3–8, 2006, p.48.Google Scholar
  9. [9]
    Huang S C H, Wan P J, Vu C T, Li Y, Yao F. Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In Proc. the 26th Annual IEEE Conference on Computer Communications (INFOCOM 2007), Anchorage, USA, May 6–12, 2007, pp.366-372.Google Scholar
  10. [10]
    Wan P J, Huang S C H, Wang L, Wan Z, Jia X. Minimum-latency aggregation scheduling in multihop wireless networks. In Proc. the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2009), New Orleans, USA, May 18–21, 2009, pp.185-193.Google Scholar
  11. [11]
    Gandham S, Zhang Y, Huang Q. Distributed minimal time convergecast scheduling in wireless sensor networks. In Proc. the 26th International Conference on Distributed Computing Systems (ICDCS 2006), Lisboa, Portugal, Jul. 4–7, 2006, p.50.Google Scholar
  12. [12]
    Lu G, Sadagopan N, Krishnamachari B, Goel A. Delay efficient sleep scheduling in wireless sensor networks. In Proc. the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Miami, USA, Mar. 13–17, 2005, pp.2470-2481.Google Scholar
  13. [13]
    Beutel J, Gruber S, Hasler A et al. PermaDAQ: A scientific instrument for precision sensing and data recovery in environmental extremes. In Proc. the 8th ACM/IEEE Int. Conf. Information Processing in Sensor Networks (IPSN 2009), San Francisco, USA, Apr. 13–16, 2009, pp.265-276.Google Scholar
  14. [14]
    Burri N, von Rickenbach P, Wattenhofer R. Dozer: Ultra-low power data gathering in sensor networks. In Proc. the 6th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN 2007), Cambridge, USA, Apr. 25–27, 2007, pp.450-459.Google Scholar
  15. [15]
    Gu Y, He T. Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links. In Proc. the 5th ACM Conference on Embedded Networked Sensor Systems (Sensys 2007), Sydney, Australia, Nov. 6–9, 2007, pp.321-334.Google Scholar
  16. [16]
    Guo S, Gu Y, Jiang B, He T. Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links. In Proc. the 15th Annual International Conference on Mobile Computing and Networking (MOBICOM 2009), Beijing, China, Sept. 20–25, 2009, pp.133-144.Google Scholar
  17. [17]
    Wang F, Liu J. Duty-cycle-aware broadcast in wireless sensor networks. In Proc. the 28th Annual IEEE Conference on Computer Communications (INFOCOM 2009), Rio de Janeiro, Brazil, Apr. 19–25, 2009, pp.468-476.Google Scholar
  18. [18]
    Deshpande A, Guestrin C, Madden S, Hellerstein J, Hong W. Model-driven data acquisition in sensor networks. In Proc. the 30th International Conference on Very Large Data Bases (VLDB 2004), Toronto, Canada, Aug. 31-Sept. 3, 2004, pp.588-599.Google Scholar
  19. [19]
    Considine J, Li F, Kollios G, Byers J. Approximate aggregation techniques for sensor databases. In Proc. the 20th International Conference on Data Engineering (ICDE 2004), Boston, USA, Mar. 30-Apr. 2, 2004, pp.449-460.Google Scholar
  20. [20]
    Sharaf M A, Beaver J, Labrinidis A, Chrysanthis P K. TiNA: A scheme for temporal coherency-aware in-network aggregation. In Proc. the 3rd ACM International Workshop on Data Engineering for Wireless and Mobile Access (MobiDE 2003), San Diego, USA, Sept. 19, 2003, pp.69-76.Google Scholar
  21. [21]
    Manjhi A, Nath S, Gibbons P B. Tributaries and deltas: Efficient and robust aggregation in sensor network streams. In Proc. the 24th ACM SIGMOD International Conference on Management of Data (SIGMOD 2005), Baltimore, USA, Jun. 14–16, 2005, pp.287-298.Google Scholar
  22. [22]
    Nath S, Gibbons P B, Seshan S, Anderson Z R. Synopsis diffusion for robust aggregation in sensor networks. In Proc. the 2nd ACM Conference on Embedded Networked Sensor Systems (Sensys 2004), Baltimore, USA, Nov. 3–5, 2004, pp.250-262.Google Scholar
  23. [23]
    Chen X, Hu X, Zhu J. Minimum data aggregation time problem in wireless sensor networks. In Proc. the 1st International Conference on Mobile Ad hoc and Sensor Networks (MSN 2005), Wuhan, China, Dec. 13–15, 2005, pp.133-142.Google Scholar
  24. [24]
    Yu B, Li J, Li Y. Distributed data aggregation scheduling in wireless sensor networks. In Proc. the 28th Annual IEEE Conference on Computer Communications (INFOCOM 2009), Rio de Janeiro, Brazil, Apr. 19–25, 2009, pp.2159-2167.Google Scholar
  25. [25]
    Li Y, Guo L, Prasad S K. An energy-efficient distributed algorithm for minimum-latency aggregation scheduling in wireless sensor networks. In Proc. the 30th International Conference on Distributed Computing Systems (ICDCS 2010), Genoa, Italy, Jun. 21–25, 2010, pp.827-836.Google Scholar
  26. [26]
    Buettner M, Yee G V, Anderson E, Han R. X-MAC: A short preamble MAC protocol for duty-cycled wireless sensor networks. In Proc. the 4th ACM Conference on Embedded Networked Sensor Systems (Sensys 2006), Boulder, USA, Oct. 31-Nov. 3, 2006, pp.307-320.Google Scholar
  27. [27]
    Sun Y, Gurewitz O, Du S, Tang L, Johnson D B. ADB: An efficient multihop broadcast protocol based on asynchronous duty-cycling in wireless sensor networks. In Proc. the 7th ACM Conference on Embedded Networked Sensor Systems (Sensys 2009), Berkeley, USA, Nov. 4–6, 2009, pp.43-56.Google Scholar
  28. [28]
    Lai S, Ravindran B. On multihop broadcast over adaptively duty-cycled wireless sensor networks. In Proc. the 6th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS 2010), Santa Barbara, USA, Jun. 21–23, 2010, pp.158-171.Google Scholar
  29. [29]
    Jiao X, Lou W, Ma J, Cao J, Wang X, Zhou X. Duty-cycle-aware minimum latency broadcast scheduling in multi-hop wireless networks. In Proc. the 30th International Conference on Distributed Computing Systems (ICDCS 2010), Genoa, Italy, Jun. 21–25, 2010, pp.754-763.Google Scholar
  30. [30]
    Clark B N, Colbourn C J, Johnson D S. Unit disk graphs. Discrete Mathematics, 1990, 86(1–3): 165–177.CrossRefMATHMathSciNetGoogle Scholar
  31. [31]
    Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W H Freeman & Co., 1979.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC & Science Press, China 2011

Authors and Affiliations

  1. 1.School of Computer Science and Technology, Harbin Institute of TechnologyHarbinChina

Personalised recommendations