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

Aslam, Nauman, Phillips, William and Safdar, Ghazanfar (2012) Worst case bounds of a cluster-based MAC protocol for wireless sensor networks. In: 2012 Wireless Telecommunications Symposium (WTS), 18-20 April 2012, London.

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1109/WTS.2012.6266102


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.

Item Type: Conference or Workshop Item (Paper)
Subjects: G400 Computer Science
Department: Faculties > Engineering and Environment > Computer and Information Sciences
Depositing User: Ellen Cole
Date Deposited: 21 Dec 2012 15:32
Last Modified: 13 Oct 2019 00:32
URI: http://nrl.northumbria.ac.uk/id/eprint/10721

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics