Traffic Prioritization in Sensor Networks using Bandwidth Scavenging

2011 ◽  
pp. 290-310
Author(s):  
Anthony Plummer ◽  
Mahmoud Taghizadeh ◽  
Subir Biswas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Usage Pattern ◽  
Real Time Traffic ◽  
Access Channel ◽  
Channel Bandwidth ◽  
Traffic Prioritization

This chapter presents a history-based statistical channel access mechanism for enabling traffic prioritization in wireless sensor networks. Prioritized access is realized such that low priority non-real-time sensors can access channel bandwidth that is unused by high priority real-time traffic. The key idea is for the low priority sensor nodes to first observe and statistically model the channel usage pattern by the high priority traffic, then make advantageous probabilistic transmissions so that the non-priority traffic throughput is maximized while protecting the high-priority traffic from disruptions. The chapter details a practical whitespace measurement scheme and presents a channel history based prioritization protocol. The access mechanism is implemented in a TelosB mote-based sensor testbed in which the non-priority motes continually measure the RSSI to infer the channel usage pattern and probabilistically access the channel while different types of traffic are sent by high-priority TelosB motes.

Scheduling Real-Time Traffic in Underwater Acoustic Wireless Sensor Networks

2016 ◽  
pp. 150-162 ◽  
Author(s):  
Rodrigo Santos ◽  
Javier Orozco ◽  
Matías Micheletto ◽  
Sergio F. Ochoa ◽  
Roc Meseguer ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Wireless Sensor ◽  
Underwater Acoustic ◽  
Real Time Traffic

scholarly journals Deployment of Wireless Sensor Networks for Oilfield Monitoring by Multiobjective Discrete Binary Particle Swarm Optimization

2016 ◽  
Vol 2016 ◽  
pp. 1-15 ◽  
Author(s):  
Zhen-Lun Yang ◽  
Angus Wu ◽  
Hua-Qing Min
Keyword(s):  
Wireless Sensor Networks ◽  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Real Time ◽  
Monitoring System ◽  
Particle Swarm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Binary Particle Swarm Optimization ◽  
Swarm Optimization

The deployment problem of wireless sensor networks for real time oilfield monitoring is studied. As a characteristic of oilfield monitoring system, all sensor nodes have to be installed on designated spots. For the energy efficiency, some relay nodes and sink nodes are deployed as a delivery subsystem. The major concern of the construction of the monitoring system is the optimum placement of data delivery subsystem to ensure the full connectivity of the sensor nodes while keeping the construction cost as low as possible, with least construction and maintenance complexity. Due to the complicated landform of oilfields, in general, it is rather difficult to satisfy these requirements simultaneously. The deployment problem is formulated as a constrained multiobjective optimization problem and solved through a novel scheme based on multiobjective discrete binary particle swarm optimization to produce optimal solutions from the minimum financial cost to the minimum complexity of construction and maintenance. Simulation results validated that comparing to the three existing state-of-the-art algorithms, that is, NSGA-II, JGGA, and SPEA2, the proposed scheme is superior in locating the Pareto-optimal front and maintaining the diversity of the solutions, thus providing superior candidate solutions for the design of real time monitoring systems in oilfields.

Real-Time Communications in Wireless Sensor Networks

2010 ◽  
pp. 69-78
Author(s):  
Isabelle Augé-Blum ◽  
Fei Yang ◽  
Thomas Watteyne
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Communication Protocols ◽  
The State ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Trends ◽  
Wireless Links

This chapter presents the state-of-the-art of real-time communication in the challenging topic of Wireless Sensor Networks (WSNs). In real-time communication, the duration between the event which initiates the sending of a message, and the instant this message is received must be smaller than a known delay. Because topologies are extremely dynamic and not known priori, this type of constraint is very hard to meet in WSNs. In this chapter, the different communication protocols proposed in the literatures, together with their respective advantages and drawbacks, are discussed. We focus on MAC and routing because they are key layers in real-time communication. As most existing protocols are not suitable under realistic constraints where sensor nodes and wireless links are unreliable, we give, at the end of this chapter, some insights about future trends in designing real-time protocols. We hope to give the reader an overview of recent research works in this complex topic which we consider to be essential in critical applications.

Real-Time Communications in Wireless Sensor Networks

2012 ◽  
pp. 120-129
Author(s):  
Isabelle Augé-Blum ◽  
Fei Yang ◽  
Thomas Watteyne
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Communication Protocols ◽  
The State ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Trends ◽  
Wireless Links

This chapter presents the state-of-the-art of real-time communication in the challenging topic of Wireless Sensor Networks (WSNs). In real-time communication, the duration between the event which initiates the sending of a message, and the instant this message is received must be smaller than a known delay. Because topologies are extremely dynamic and not known priori, this type of constraint is very hard to meet in WSNs. In this chapter, the different communication protocols proposed in the literatures, together with their respective advantages and drawbacks, are discussed. We focus on MAC and routing because they are key layers in real-time communication. As most existing protocols are not suitable under realistic constraints where sensor nodes and wireless links are unreliable, we give, at the end of this chapter, some insights about future trends in designing real-time protocols. We hope to give the reader an overview of recent research works in this complex topic which we consider to be essential in critical applications.

scholarly journals Energy-Efficient Multi-Disjoint Path Opportunistic Node Connection Routing Protocol in Wireless Sensor Networks for Smart Grids

Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3789 ◽  
Author(s):  
Anees ◽  
Zhang ◽  
Baig ◽  
Lougou
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Smart Grids ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Disjoint Path

The gradual increase in the maturity of sensor electronics has resulted in the increasing demand for wireless sensor networks for many industrial applications. One of the industrial platforms for efficient usage and deployment of sensor networks is smart grids. The critical network traffic in smart grids includes both delay-sensitive and delay-tolerant data for real-time and non-real-time usage. To facilitate these traffic requirements, the asynchronous working–sleeping cycle of sensor nodes can be used as an opportunity to create a node connection. Efficient use of wireless sensor network in smart grids depends on various parameters like working–sleeping cycle, energy consumption, network lifetime, routing protocol, and delay constraints. In this paper, we propose an energy-efficient multi-disjoint path opportunistic node connection routing protocol (abbreviated as EMOR) for sensor nodes deployed in neighborhood area network. EMOR utilizes residual energy, availability of sensor node’s buffer size, working–sleeping cycle of the sensor node and link quality factor to calculate optimum path connectivity after opportunistic connection random graph and spanning tree formation. The multi-disjoint path selection in EMOR based on service differentiation of real-time and non-real-time traffic leads to an improvement in packet delivery rate, network lifetime, end-end delay and total energy consumption.

scholarly journals An Enhanced Packet Transmission Framework for Handling Real Time Burst Traffic in Wireless Sensor Networks

2022 ◽  
Author(s):  
Sangeetha Ganesan ◽  
Vijayalakshmi Muthuswamy
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Minimum Weight ◽  
Heavy Traffic ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Network Modelling ◽  
Real Time Traffic

Abstract Congestion control for real time traffic is an important network measure to be handled in case of repeated event triggers, continuous packet re-transmissions, node interference, node deaths and node failures in Wireless Sensor Networks (WSNs). Network modelling for transmission of packets from source node to sink using probabilistic M/Pareto and Poisson processes have been examined in the past. The existing methodologies are deficit in designing a queuing framework considering other network parameters such as energy consumption and delay for alleviating congestion and thereby efficiently routing packets to sink by reducing packet drops. To overcome this fall back, a Minimum Weight Estimation for Mitigating Congestion during Real Time Burst Traffic (MWCBT) framework is proposed. This gives a precautionary solution against heavy traffic occupancy among the interim and sink-neighbouring nodes in WSNs is proposed. Routing of packets using a congestion-free path is required to increase the node lifespan. An optimal M/Pareto stochastic traffic generator is used in combination with traffic factors such as energy and delay to predict amount of traffic across nodes. A simpler congestion prediction mechanism is performed to control the occurrence of heavy-tailed traffic distributions. A torrent weight value for incoming traffic is generated at each node periodically that directs routing of data packets to sink. The devised MWCBT framework supervises real-time traffic congestion and is found to be more optimal than the existing approaches for network traffic modelling. The proposed approach achieves greater packet delivery ratio and less node congestion compared to the existing network modelling techniques.

Sign in / Sign up

Export Citation Format

Share Document