Priority Based Bandwidth Allocation in Wireless Sensor Networks

Cherian, Mary; Nair, T. R. Gopalakrishnan

doi:10.5121/ijcnc.2014.6609

Cited by 8 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The protocol aims at obtaining the fairness among the nodes rather than among the traffic types. Traffic priorities are considered in Caccamo et al (2002) and Cherian and Nair (2014), which exploit earliest deadline first scheduling and priority queues, respectively. The protocols proposed in Caccamo et al (2002) require an accurate knowledge of the network topology and divide the motes into cells.…”

Section: Related Workmentioning

confidence: 99%

“…Then, the communication intra-cell and extra-cell are handled in different ways. The scheme proposed in Cherian and Nair (2014) simply proposes a priority scheduler for each mote. Although this allows a single node to use priority for its own transmission, the correlation among the motes is not taken into account.…”

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 2 more Smart Citations

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: Related Workmentioning

confidence: 99%

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

show abstract

“…The protocol aims at obtaining the fairness among the nodes rather than among the traffic types. Traffic priorities are considered in [3,4] that exploit earliest deadline first scheduling and priority queues, respectively. The protocols proposed in [3] require an accurate knowledge of the network topology and divide the motes into cell.…”

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

“…In addition to MAC layer approach, Cherian and Nair [36] presented the priority queuing model at the node based on average waiting time. N queue saturation point depends on the sum of the loads of the classes of priority up to .…”

Section: Mac and Schedulingmentioning

confidence: 99%

A Survey on Real-Time Communications in Wireless Sensor Networks

Kim

Park

Kim

et al. 2017

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Generally, various traffic requirements in wireless sensor network are mostly dependent on specific application types, that is, eventdriven, continuous, and query-driven types. In these applications, real-time delivery is one of the important research challenges. However, due to harsh networking environment around a node, many researchers usually take different approach from conventional networks. In order to discuss and analyze the advantage or disadvantage of these approaches, some comprehensive survey literatures were published; however they are either out of date or compiled for communication protocols on single layer. Based on this deficiency, in this paper, we present the up-to-date research approaches and discuss the important features related to real-time communications in wireless sensor networks. As for grouping, we categorize the approaches into hard, soft, and firm real-time model. Furthermore, in all these categories, research has been focused on MAC and scheduling and routing according to research area or objective in second level. Finally, the article also suggests potential directions for future research in the field.

show abstract

Priority Based Bandwidth Allocation in Wireless Sensor Networks

Abstract: ABSTRACT

Cited by 8 publications

References 17 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

A Survey on Real-Time Communications in Wireless Sensor Networks

Contact Info

Product

Resources

About