Optimized Quality of Service for Real-Time Wireless Sensor Networks Using a Partitioning Multipath Routing Approach
Multimedia sensor networks for real-time applications have strict constraints on delay, packet loss, and energy consumption requirements. For example, video streaming in a disaster-management scenario requires careful handling to ensure that the end-to-end delay is within the acceptable range and th...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Computer Networks and Communications |
Online Access: | http://dx.doi.org/10.1155/2013/497157 |
Summary: | Multimedia sensor networks for real-time applications have strict constraints on delay, packet loss, and energy consumption requirements. For example, video streaming in a disaster-management scenario requires careful handling to ensure that the end-to-end delay is within the acceptable range and the video is received properly without any distortion. The failure to transmit a video stream effectively occurs for many reasons, including sensor function limitations, excessive power consumption, and a lack of routing reliability. We propose a novel mathematical model for quality of service (QoS) route determination that enables a sensor to determine the optimal path for minimising resource use while satisfying the required QoS constraints.
The proposed mathematical model uses the Lagrangian relaxation mixed integer programming technique to define critical parameters and appropriate objective functions for controlling the adaptive QoS constrained route discovery process. Performance trade-offs between QoS requirements and energy efficiency were simulated using the LINGO mathematical programming language. The proposed approach significantly improves the network lifetime, while reducing energy consumption and decreasing average end-to-end delays within the sensor network via optimised resource sharing in intermediate nodes compared with existing routing algorithms. |
---|---|
ISSN: | 2090-7141 2090-715X |