A Survey on Bandwidth Resource Allocation and Scheduling in Wireless Sensor Networks

Chitnis, Mangesh; Pagano, Paolo; Lipari, Giuseppe; Liang, Yao

doi:10.1109/nbis.2009.77

Cited by 21 publications

(12 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Second, we compare our theoretical contribution in terms of CTMC analysis with respect to the literature. The problem of bandwidth assignment in wireless sensor networks have been addressed by a large number of articles (see Chitnis et al (2009) and the references therein). In Woo and Culler (2001), the authors introduce the Adaptive Rate Control (ARC) scheme.…”

Section: Related Workmentioning

confidence: 99%

“…These are special nodes that collect the data harvested by the motes' sensors and may govern the actuators (e.g., they may raise a fire alarm in case some motes communicate a sudden rise in the temperature). In this setting, the wireless channel represents a shared resource among the motes whose access must be carefully governed to avoid the congestion collapse of the WSN (see, e.g., Akyildiz and Kasimoglu (2004), Sankarasubramabiam et al (2003), Cherian and Nair (2014), Chitnis et al (2009), and Khan et al (2012)). In this view, we can say that large WSNs represent an example of Collective Adaptive System (CAS) (Frescha 2015;Feng et al 2016), since they share a decentralised control, an autonomous behaviour of the motes, and a competition of the bandwidth resource.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs

Marin

Rossi

Burato

et al. 2018

ACM Trans. Model. Comput. Simul.

View full text Add to dashboard Cite

Wireless Sensor Networks (WSNs) are important examples of Collective Adaptive System, which consist of a set of motes that are spatially distributed in an indoor or outdoor space. Each mote monitors its surrounding conditions, such as humidity, intensity of light, temperature, and vibrations, but also collects complex information, such as images or small videos, and cooperates with the whole set of motes forming the WSN to allow the routing process. The traffic in the WSN consists of packets that contain the data harvested by the motes and can be classified according to the type of information that they carry. One pivotal problem in WSNs is the bandwidth allocation among the motes. The problem is known to be challenging due to the reduced computational capacity of the motes, their energy consumption constraints, and the fully decentralised network architecture. In this article, we study a novel algorithm to allocate the WSN bandwidth among the motes by taking into account the type of traffic they aim to send. Under the assumption of a mesh network and Poisson distributed harvested packets, we propose an analytical model for its performance evaluation that allows a designer to study the optimal configuration parameters. Although the Markov chain underlying the model is not reversible, we show it to be ρ-reversible under a certain renaming of states. By an extensive set of simulations, we show that the analytical model accurately approximates the performance of networks that do not satisfy the assumptions. The algorithm is studied with respect to the achieved throughput and fairness. We show that it provides a good approximation of the max-min fairness requirements.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs

Marin

Rossi

Burato

et al. 2018

ACM Trans. Model. Comput. Simul.

View full text Add to dashboard Cite

show abstract

“…Secondly, we compare our theoretical contribution in terms of CTMC analysis with respect to the literature. The problem of bandwidth assignment in wireless sensor networks have been addressed by a large number of papers (see [5] and the references therein). In [20] the authors introduce the Adaptive Rate Control (ARC)scheme.…”

Section: Related Workmentioning

confidence: 99%

Priority-based bandwidth allocation in wireless sensor networks

Marin

Rossi

2016

Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

In Wireless Sensor Networks (WSN) a set of motes monitors the environment by measuring some physical phenomena such as humidity, light, temperature, vibrations. The coexistence of different data types arises the problem of assigning the network resources in a fair way by taking into account possible different priorities among the traffic streams. In this paper we propose an allocation control scheme which is easy to implement, meets the limited resources of sensor nodes, and does not require extra control traffic in the WSN. Our scheme is based on the idea that the motes maintain a window with the classes of the latest transmissions. We propose an analytical model and provide an algorithm to study the performance of this allocation scheme with respect to the throughput and the fairness achieved. The model is a continuous time Markov chain which is proved to be dynamically reversible (although not reversible) and admits a product-form equilibrium distribution

show abstract

“…A review of scheduling strategies can be found in . The studies referred in this work, however, are related to generic wireless networks.…”

Section: Related Work On Resource Allocation For Time Division Multipmentioning

confidence: 99%

Label switching over IEEE802.15.4e networks

Morell

Vilajosana

Vicario

et al. 2013

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

An open issue still to be addressed in low‐power lossy networks (LLNs) is how the application requirements, the available transport services, the network layer routes, and the data link‐layer resources are mapped efficiently. This can be explained by the fact that, in most LLNs, link‐layer resources cannot be easily managed; this results in a best effort IP layer, and traffic engineering performed solely through flow control at the transport layer. The new IEEE802.15.4e standard defines a link‐layer mechanism by which motes in the network synchronise and communicate by following a schedule. Each slot in that schedule can be seen as an atomic link‐layer resource, which can be allocated to any arbitrary link in the network. The schedule can be built to match the bandwidth, latency and power requirements of each mote in the network. Managing that schedule is performed centrally in IEEE802.15.4e networks today. This paper explores a solution to achieve the same goal in a distributed manner. Specifically, we argue that this problem is very similar to traffic engineering on today's Internet. We show how multiprotocol label switching can be mapped to LLNs to manage the network's schedule. By using the completely fair distributed scheduler, we show by simulation how this novel link‐layer resource allocation scheme yields a proper distribution of end‐to‐end delays among the motes and an average throughput that achieves the 70% of the maximum possible throughput in the worst conditions tested. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

A Survey on Bandwidth Resource Allocation and Scheduling in Wireless Sensor Networks

Cited by 21 publications

References 10 publications

A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs

A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs

Priority-based bandwidth allocation in wireless sensor networks

Label switching over IEEE802.15.4e networks

Contact Info

Product

Resources

About