دانلود مقاله ISI انگلیسی شماره 67608
ترجمه فارسی عنوان مقاله

تقریب به منطقه عملیاتی آگاه در QoS از IEEE 802.15.4 CSMA / CA تحت یک شبکه درخت با نرم افزار طراحی شبکه حسگر بی سیم

عنوان انگلیسی
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 ☆
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
67608 2015 20 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Ad Hoc Networks, Volume 33, October 2015, Pages 35–54

ترجمه کلمات کلیدی
طراحی شبکه بهینه توان؛ شبکه های حسگر بی سیم؛ QoS طراحی بر اساس شبکه های حسگر بی سیم؛ منطقه توان CSMA / CA؛ طراحی شبکه های CSMA چند هاپ
کلمات کلیدی انگلیسی
Throughput optimal network design; Wireless sensor networks; QoS based design of wireless sensor networks; Throughput region of CSMA/CA; Design of multihop CSMA networks
پیش نمایش مقاله
پیش نمایش مقاله  تقریب به منطقه عملیاتی آگاه در QoS  از IEEE 802.15.4 CSMA / CA تحت یک شبکه درخت با نرم افزار طراحی شبکه حسگر بی سیم

چکیده انگلیسی

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.