[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Revisiting Probabilistic Schedule-Based Asynchronous Duty Cycling

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

Schedule-based asynchronous duty cycling is a simple duty cycling technique that requires no synchronization, control traffic or expensive computation. Thus, it is an interesting choice for WSNs. However, most of the literature on the design of asynchronous schedules has been limited by the exaggerated restriction that the schedules present a property named rotation closure. While more flexible probabilistic schedules have been proposed, they were considered inferior under the argument that they do not provide an upper bound on the communication latency. In this paper we revisit the probabilistic schedules with the goal of showing they may be the preferred method in several scenarios. We argue that under realistic assumptions no schedule can guarantee a latency upper bound. We show that probabilistic schedules better support asymmetric duty cycle operation, while also providing unlimited duty cycle granularity and range. Finally, by means of simulation, we compare a probabilistic schedule belonging to the family of Birthday Protocols, the Birthday–Listen–and–Transmit (BLT), with traditional deterministic schedules. Results show that, on top of its other qualitative advantages, BLT achieves competitive latencies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. We should actually refer to a Symmetric Block Design. However, in networking literature, Block Designs and Symmetric Block Designs are commonly treated as synonyms, and usually defined with lack of mathematical rigor. For conciseness, we will proceed likewise.

  2. For BD and NBD only projective planes were considered because they are the most efficient schedules for these methods.

References

  1. G. Anastasi, M. Conti, M. Di Francesco, and A. Passarella, Energy conservation in wireless sensor networks: A survey, Ad Hoc Networks, Vol. 7, pp. 537–568, 2009.

  2. M. Bakht, M. Trower, and R. H. Kravets. Searchlight: Won’t you be my neighbor? In International Conference on Mobile Computing and Networking (MOBICOM), Mobicom ’12, pages 185–196, 2012.

  3. R. Carrano, D. Passos, L. Magalhaes, and C. Albuquerque, An exact model of the neighbor discovery time for schedule-based asynchronous duty cycling, IEEE Wireless Communications Letters, Vol. 2, No. 6, pp. 635–638, 2013.

  4. R. Carrano, D. Passos, L. Magalhaes, and C. Albuquerque, Nested block designs: Flexible and efficient schedule-based asynchronous duty cycling, Computer Networks, Vol. 57, No. 17, pp. 3316–3326, 2013.

  5. R. Carrano, D. Passos, L. Magalhaes, and C. Albuquerque, A comprehensive analysis on the use of schedule-based asynchronous duty cycling in wireless sensor networks, Ad Hoc Networks, Vol. 16, pp. 142–164, 2014.

  6. R. Carrano, D. Passos, L. Magalhaes, and C. Albuquerque, Survey and taxonomy of duty cycling mechanisms in wireless sensor networks, IEEE Communications Surveys & Tutorials, Vol. 16, No. 1, pp. 181–194, 2014.

  7. L. Chen and K. Bian, Neighbor discovery in mobile sensing applications: A comprehensive survey, Ad Hoc Networks, Vol. 48, pp. 38–52, 2016.

    Article  Google Scholar 

  8. L. Chen, R. Fan, K. Bian, M. Gerla, T. Wang, and X. Li. On heterogeneous neighbor discovery in wireless sensor networks. In IEEE Conference on Computer Communications (INFOCOM), pages 693–701, 2015.

  9. L. Chen, K. Bian, and M. Zheng, Never live without neighbors: From single- to multi-channel neighbor discovery for mobile sensing applications, IEEE/ACM Transactions on Networking, Vol. 24, No. 5, pp. 3148–3161, 2016.

  10. P. Dutta and D. Culler. Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications. In ACM conference on Embedded network sensor systems (SenSys), ACM, New York, NY, USA, pages 71–84, 2008.

  11. J. Jiang, Y. Tseng, C. Hsu, and T. Lai, Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks, Mobile Networks and Applications, Vol. 10, pp. 169–181, 2005.

  12. A. Kandhalu, K. Lakshmanan, and R. R. Rajkumar. U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol. In ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN), ACM, New York, NY, USA, pages 350–361, 2010.

  13. Z. Ma, D. Zhang, S. Liu, J. Song, and Y. Hou, A novel compressive sensing method based on SVD sparse random measurement matrix in wireless sensor network, Engineering Computations, Vol. 33, No. 8, pp. 2448–2462, 2016.

  14. M. J. McGlynn and S. A. Borbash. Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks. In ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc), MobiHoc, pages 137–145, 2001.

  15. T. Meng, F. Wu, and G. Chen. On designing neighbor discovery protocols: A code-based approach. In IEEE Conference on Computer Communications (INFOCOM), pages 1689–1697, 2014.

  16. Y. Qiu, S. Li, X. Xu, and Z. Li. Talk more listen less: Energy-efficient neighbor discovery in wireless sensor networks. In IEEE International Conference on Computer Communications (INFOCOM), pages 1–9, 2016.

  17. T. Rault, A. Bouabdallah, and Y. Challal, Energy efficiency in wireless sensor networks: A top-down survey, Computer Networks, Vol. 67, pp. 104–122, 2014.

  18. W. Sun, Z. Yang, K. Wang, and Y. Liu. Hello: A generic flexible protocol for neighbor discovery. In IEEE Conference on Computer Communications (INFOCOM), pages 540–548, 2014.

  19. S. Vasudevan, D. Towsley, D. Goeckel, and R. Khalili. Neighbor discovery in wireless networks and the coupon collector’s problem. In International Conference on Mobile Computing and Networking (MOBICOM), MobiCom ’09, pages 181–192, 2009.

  20. K. Wang, X. Mao, and Y. Liu, Blinddate: A neighbor discovery protocol, IEEE Transactions on Parallel and Distributed Systems, Vol. 26, No. 4, pp. 949–959, 2015.

  21. W. Zeng, S. Vasudevan, X. Chen, B. Wang, A. Russell, and W. Wei. Neighbor discovery in wireless networks with multipacket reception. In ACM International Symposium on Mobile Ad Hoc Networking and Computing, pages 3:1–3:10, 2011.

  22. D. Zhang, G. Li, K. Zheng, X. Ming, and Z. Pan, An energy-balanced routing method based on forward-aware factor for wireless sensor networks, IEEE Transactions on Industrial Informatics, Vol. 10, No. 1, pp. 766–773, 2014.

  23. D. Zhang, X. Kang, and J. Wang, A novel image de-noising method based on spherical coordinates system, Journal on Advances in Signal Processing, Vol. 1, p. 110, 2012.

  24. D. Zhang, C. Zhao, Y. Liang, and Z. Liu, A new medium access control protocol based on perceived data reliability and spatial correlation in wireless sensor network, Computers & Electrical Engineering, Vol. 38, No. 3, pp. 694–702, 2012.

  25. D. Zhang, Y. Zhu, C. Zhao, and W. Dai, A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the internet of things (IOT), Computers & Mathematics with Applications, Vol. 64, No. 5, pp. 1044–1055, 2012.

  26. D. Zhang, X. Song, X. Wang, and Y. Ma, Extended AODV routing method based on distributed minimum transmission (DMT) for WSN, AEU - International Journal of Electronics and Communications, Vol. 69, No. 1, pp. 371–381, 2015.

  27. D. Zhang, X. Wang, and X. Song, New medical image fusion approach with coding based on SCD in wireless sensor network, Journal of Electrical Engineering & Technology, Vol. 10, No. 6, pp. 2384–2392, 2015.

  28. D. Zhang, X. Wang, X. Song, T. Zhang, and Y. Zhu, A new clustering routing method based on PECE for WSN, EURASIP Journal on Wireless Communications and Networking, Vol. 1, p. 162, 2015.

  29. D. Zhang, K. Zheng, T. Zhang, and X. Wang, A novel multicast routing method with minimum transmission for WSN of cloud computing service, Soft Computing, Vol. 19, No. 7, pp. 1817–1827, 2015.

  30. D. Zhang, W. Li, S. Liu, and X. Zhang. Novel fusion computing method for bio-medical image of WSN based on spherical coordinate, Journal of Vibroengineering, Vol. 18, No. 1, 2016.

  31. D. Zhang, S. Liu, T. Zhang, and Z. Liang, Novel unequal clustering routing protocol considering energy balancing based on network partition & distance for mobile education, Journal of Network and Computer Applications, Vol. 88, pp. 1–9, 2017.

  32. D. Zhang, H. Niu, and S. Liu, Novel PEECR-based clustering routing approach, Soft Computing, Vol. 21, No. 24, pp. 7313–7323, 2017.

  33. D. Zhang, S. Zhou, and Y. Tang. A low duty cycle efficient MAC protocol based on self-adaption and predictive strategy, Mobile Networks and Applications, 1–12, 2017.

  34. R. Zheng, J. C. Hou, and L. Sha. Asynchronous wakeup for ad hoc networks. In ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc), ACM, New York, NY, USA, pages 35–45, 2003.

Download references

Acknowledgements

This work is supported in part by CGI/FAPESP, CNPq, CAPES and FAPERJ.

Author information

Authors and Affiliations

  1. Institute of Computing, Universidade Federal Fluminense, Rua Passo da Pátria, 156 - Bloco E - 4 andar - Sala 408 São Domingos, Niterói, RJ, CEP 24.210-240, Brazil

    Helga D. Balbi, Diego Passos & Célio Albuquerque

  2. Telecommunications Department, Universidade Federal Fluminense, Rua Passo da Pátria, 156 - Bloco E - 4 andar - Sala 408 São Domingos, Niterói, RJ, CEP 24.210-240, Brazil

    Ricardo C. Carrano

Authors
  1. Helga D. Balbi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ricardo C. Carrano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Diego Passos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Célio Albuquerque
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Helga D. Balbi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Balbi, H.D., Carrano, R.C., Passos, D. et al. Revisiting Probabilistic Schedule-Based Asynchronous Duty Cycling. Int J Wireless Inf Networks 26, 24–38 (2019). https://doi.org/10.1007/s10776-018-0420-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10776-018-0420-5

Keywords

Search

Navigation