Show simple item record

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

dc.contributor.authorAslam, Naumanen_GB
dc.contributor.authorPhillips, Williamen_GB
dc.contributor.authorSafdar, Ghazanfar Alien_GB
dc.date.accessioned2013-05-08T09:21:33Z
dc.date.available2013-05-08T09:21:33Z
dc.date.issued2012
dc.identifier.citationAslam, N., Phillips, W. and Safdar, G.A. (2012) 'Worst case bounds of a cluster-based MAC protocol for wireless sensor networks' Wireless Telecommunications Symposium (WTS), London, UK, 18-20 April. London: IEEE, pp.1-6.en_GB
dc.identifier.issn1934-5070
dc.identifier.doi10.1109/WTS.2012.6266102
dc.identifier.urihttp://hdl.handle.net/10547/288615
dc.description.abstractQuality 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.
dc.language.isoenen
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCen_GB
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6266102en_GB
dc.subjectCalculusen_GB
dc.subjectMedia Access Protocolen_GB
dc.subjectSensorsen_GB
dc.subjectTime division multiple accessen_GB
dc.subjectWireless sensor networksen_GB
dc.titleWorst case bounds of a cluster-based MAC protocol for wireless sensor networksen
dc.typeConference papers, meetings and proceedingsen
html.description.abstractQuality 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.


This item appears in the following Collection(s)

  • Centre for Wireless Research (CWR)
    The Centre for Wireless Research brings together expertise in the areas of mobile and wireless sensor networks. The breadth and depth of the expertise make the Centre rich with research and innovation potential.

Show simple item record