Skip to main content
SpringerLink
Log in

A proportional fairness scheduling for wireless sensor networks

  • Original Article
  • Published:
Personal and Ubiquitous Computing Aims and scope Submit manuscript

Abstract

This paper describes a packet scheduling algorithm for wireless sensor networks (WSNs) that meets the proportional fairness principle. Based on the weighted round-robin strategy, the proposed scheduling algorithm allocates a different service quota to different traffic according to the average packet arrival rate. This guarantees proportional fairness in terms of the average packet delivery delay and the average packet loss ratio. Since the scheduling algorithm does not perform high-load operations such as time stamping and sorting, it can be implemented easily and is suitable for resource-limited WSNs. The proposed scheduling algorithm is tested in a WSN and is found to guarantee the proportional fairness of the average packet delivery delay when this is used as the performance metric, and to realize proportional fairness in the average packet loss ratio when all the queues are overflowing and the average packet loss ratio is used as the performance metric.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Callaway EH (2003) Wireless sensor networks: architectures and protocols. CRC Press, Boca Raton

    Book  Google Scholar 

  2. Kurose J (1993) Open issues and challenges in providing quality of service guarantees in high-speed networks. In: SIGCOMM computer communication review, San Francisco, USA

  3. Shi H, Hou R (2006) Study on the QoS mechanism of wireless sensor networks. Inf Control 35(2):246–251

    MathSciNet  Google Scholar 

  4. Yang SJ, de Veciana G (2004) Enhancing both network and user performance for networks supporting best effort traffic. IEEE/ACM Trans Netw 12(2):349–360

    Article  Google Scholar 

  5. Braden R, Clark D, Shenker S (1994) Integrated services in the internet architecture: an overview. RFC 1633

  6. Blake S, Black D, Carlson M (1998) An architecture for differentiated services framework. RFC 2475

  7. Braden R, Zhang L, Berson S, Herzog S (1997) Resource reservation protocol (RSVP)—version 1 functional specification. RFC 2205

  8. Nichols K, Blake S, Baker F (1998) Definition of the differentiated services field (DS field) in the IPv4 and IPv6 headers. RFC 2474

  9. Kurose J (1999) Providing guaranteed services without per flow management. In: SIGCOMM’99: proceedings of the conference on applications, technologies, architectures, and protocols for computer communication, Cambridge, USA

  10. Zheng X, Cai Z, Li J, Gao H (2015) An application-aware scheduling policy for real-time traffic. In: The 35th IEEE international conference on distributed computing systems. IEEE

  11. Chen Q, Gao H, Cheng S, Cai Z (2015) Approximate scheduling and constructing algorithms for minimum-energy multicasting in duty-cycled sensor networks. In: 2015 International conference on identification, information, and knowledge in the internet of things. IEEE

  12. Zheng X, Cai Z, Li J, Gao H (2016) Scheduling flows withmultiple service frequency constraints. IEEE Internet Things J PP(99):1–9

    Article  Google Scholar 

  13. Guo L, Li Y, Cai Z (2016) Minimum-latency aggregation scheduling in wireless sensor network. J Comb Optim 31(1):279–310

    Article  MathSciNet  MATH  Google Scholar 

  14. Dovrolis C, Ramanathan P (2001) Dynamic class selection: from relative differentiation to absolute QoS. In: The 9th international conference on network protocols. IEEE

  15. Dovrolis C, Stiliadis D (2002) Proportional differentiated services: delay differentiation and packet scheduling. IEEE/ACM Trans Netw 10(1):12–26

    Article  Google Scholar 

  16. Leung MKH, Lui JCS (2001) Adaptive proportional delay differentiated services: characterization and performance evaluation. IEEE/ACM Trans Netw 9(6):801–817

    Article  Google Scholar 

  17. Dovrolis C (2000) Proportional differentiated service, part: loss rate differentiation and packet dropping. In: Proceedings of international workshop on quality of service. IEEE

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Technology, Chinese Academy of Science, Beijing, China

    Jianhui Huang & Jingping Bi

Authors
  1. Jianhui Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingping Bi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianhui Huang.

Additional information

This work has been supported by the National Natural Science Foundation of China (Nos. 61472403, 61303243, 61003225, and 61272475)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, J., Bi, J. A proportional fairness scheduling for wireless sensor networks. Pers Ubiquit Comput 20, 695–703 (2016). https://doi.org/10.1007/s00779-016-0948-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00779-016-0948-2

Keywords

Search

Navigation