ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An approximation to the QoS aware throughput region of a tree network under IEEE 802.15.4 CSMA/CA with application to wireless sensor network design

Bhattacharya, Abhijit and Kumar, Anurag (2015) An approximation to the QoS aware throughput region of a tree network under IEEE 802.15.4 CSMA/CA with application to wireless sensor network design. In: AD HOC NETWORKS, 33 . pp. 35-54.

[img] PDF
Ad_Hoc_Net_33-35_2015.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: http://dx.doi.org/10.1016/j.adhoc.2015.04.003

Abstract

In the context of wireless sensor networks, we are motivated by the design of a tree network spanning a set of source nodes that generate packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count, that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive explicit conditions on the packet generation rates at the sources, so that the tree network approximately provides certain quality of service (QoS) such as end-to-end delivery probability and mean delay. The structures of our conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the tree network. Our numerical experiments suggest that our approximations are able to capture a significant part of the QoS aware throughput region (of a tree network), that is adequate for many sensor network applications. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and the data sink) that meet the conditions derived in the paper, a shortest path tree achieves the maximum throughput. (C) 2015 Elsevier B.V. All rights reserved.

Item Type: Journal Article
Publication: AD HOC NETWORKS
Publisher: ELSEVIER SCIENCE BV
Additional Information: Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Keywords: Throughput optimal network design; Wireless sensor networks; QoS based design of wireless sensor networks; Throughput region of CSMA/CA; Design of multihop CSMA networks
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 05 Nov 2015 06:54
Last Modified: 05 Nov 2015 06:54
URI: http://eprints.iisc.ac.in/id/eprint/52682

Actions (login required)

View Item View Item