Worst case bounds of a cluster-based MAC protocol for wireless sensor networks

Nauman Aslam; William Phillips; Ghazanfar Safdar

doi:10.1109/WTS.2012.6266102

Worst case bounds of a cluster-based MAC protocol for wireless sensor networks

Nauman Aslam
, William Phillips
, Ghazanfar Safdar

Institute for Research in Applicable Computing (IRAC)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Citations (Scopus)

Abstract

Quality of service is becoming highly important in wireless sensor networks (WSNs) due to many emerging applications; hence the need to know the worst case bounds for traffic delay and backlog in such networks is valuable. Network calculus provides a methodology for determining the worst case bounds in packet scheduling using the concept of arrival and service curves. Using Network Calculus, this paper presents a mathematical model of a TDMA-based medium access control protocol, where a cluster based system is modeled and arrival/service curve is proposed. In addition, the model is also extended to allow finding the maximum delay and backlog bounds for applications with certain QoS requirements.

Original language	English
Title of host publication	nan
Publisher	Institute of Electrical and Electronics Engineers Inc.
DOIs	https://doi.org/10.1109/WTS.2012.6266102
Publication status	Published - 13 Aug 2012
Event	Wireless Telecommunications Symposium 2012 - London Duration: 18 Apr 2012 → 20 Apr 2012

Conference

Conference	Wireless Telecommunications Symposium 2012
City	London
Period	18/04/12 → 20/04/12
Other	Wireless Telecommunications Symposium 2012 (18/04/2012-20/04/2012, London)

Keywords

MAC protocols
Wireless Sensor Networks (WSNs)

Access to Document

10.1109/WTS.2012.6266102

https://ieeexplore.ieee.org/document/6266102

Handle.net

Persistent link

Cite this

@inproceedings{fd1a028104c743e189b891f0f20f8c66,

title = "Worst case bounds of a cluster-based MAC protocol for wireless sensor networks",

abstract = "Quality of service is becoming highly important in wireless sensor networks (WSNs) due to many emerging applications; hence the need to know the worst case bounds for traffic delay and backlog in such networks is valuable. Network calculus provides a methodology for determining the worst case bounds in packet scheduling using the concept of arrival and service curves. Using Network Calculus, this paper presents a mathematical model of a TDMA-based medium access control protocol, where a cluster based system is modeled and arrival/service curve is proposed. In addition, the model is also extended to allow finding the maximum delay and backlog bounds for applications with certain QoS requirements.",

keywords = "MAC protocols, Wireless Sensor Networks (WSNs)",

author = "Nauman Aslam and William Phillips and Ghazanfar Safdar",

year = "2012",

month = aug,

day = "13",

doi = "10.1109/WTS.2012.6266102",

language = "English",

booktitle = "nan",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "Wireless Telecommunications Symposium 2012 ; Conference date: 18-04-2012 Through 20-04-2012",

}

TY - GEN

T1 - Worst case bounds of a cluster-based MAC protocol for wireless sensor networks

AU - Aslam, Nauman

AU - Phillips, William

AU - Safdar, Ghazanfar

PY - 2012/8/13

Y1 - 2012/8/13

N2 - Quality of service is becoming highly important in wireless sensor networks (WSNs) due to many emerging applications; hence the need to know the worst case bounds for traffic delay and backlog in such networks is valuable. Network calculus provides a methodology for determining the worst case bounds in packet scheduling using the concept of arrival and service curves. Using Network Calculus, this paper presents a mathematical model of a TDMA-based medium access control protocol, where a cluster based system is modeled and arrival/service curve is proposed. In addition, the model is also extended to allow finding the maximum delay and backlog bounds for applications with certain QoS requirements.

AB - Quality of service is becoming highly important in wireless sensor networks (WSNs) due to many emerging applications; hence the need to know the worst case bounds for traffic delay and backlog in such networks is valuable. Network calculus provides a methodology for determining the worst case bounds in packet scheduling using the concept of arrival and service curves. Using Network Calculus, this paper presents a mathematical model of a TDMA-based medium access control protocol, where a cluster based system is modeled and arrival/service curve is proposed. In addition, the model is also extended to allow finding the maximum delay and backlog bounds for applications with certain QoS requirements.

KW - MAC protocols

KW - Wireless Sensor Networks (WSNs)

U2 - 10.1109/WTS.2012.6266102

DO - 10.1109/WTS.2012.6266102

M3 - Conference contribution

BT - nan

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - Wireless Telecommunications Symposium 2012

Y2 - 18 April 2012 through 20 April 2012

ER -

Worst case bounds of a cluster-based MAC protocol for wireless sensor networks

Abstract

Conference

Keywords

Access to Document

Handle.net

Fingerprint

Cite this