Sensors 2013, 13(12), 16424-16450; doi:10.3390/s131216424
Article

A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks

1 Department of Information Management, National Taiwan University, No. 1 Section 4, Roosevelt Road, Taipei City 106, Taiwan 2 Department of Information Management, Shih Hsin University, No. 1, Lane 17, Mu-Cha Road, Section 1, Taipei City 116, Taiwan
* Author to whom correspondence should be addressed.
Received: 28 October 2013; in revised form: 20 November 2013 / Accepted: 22 November 2013 / Published: 2 December 2013
(This article belongs to the Section Sensor Networks)
PDF Full-text Download PDF Full-Text [818 KB, uploaded 2 December 2013 10:44 CET]
Abstract: One of the important applications in Wireless Sensor Networks (WSNs) is video surveillance that includes the tasks of video data processing and transmission. Processing and transmission of image and video data in WSNs has attracted a lot of attention in recent years. This is known as Wireless Visual Sensor Networks (WVSNs). WVSNs are distributed intelligent systems for collecting image or video data with unique performance, complexity, and quality of service challenges. WVSNs consist of a large number of battery-powered and resource constrained camera nodes. End-to-end delay is a very important Quality of Service (QoS) metric for video surveillance application in WVSNs. How to meet the stringent delay QoS in resource constrained WVSNs is a challenging issue that requires novel distributed and collaborative routing strategies. This paper proposes a Near-Optimal Distributed QoS Constrained (NODQC) routing algorithm to achieve an end-to-end route with lower delay and higher throughput. A Lagrangian Relaxation (LR)-based routing metric that considers the “system perspective” and “user perspective” is proposed to determine the near-optimal routing paths that satisfy end-to-end delay constraints with high system throughput. The empirical results show that the NODQC routing algorithm outperforms others in terms of higher system throughput with lower average end-to-end delay and delay jitter. In this paper, for the first time, the algorithm shows how to meet the delay QoS and at the same time how to achieve higher system throughput in stringently resource constrained WVSNs.
Keywords: Wireless Sensor Networks; Wireless Visual Sensor Networks; system perspective; user perspective; QoS; Near-Optimal Distributed QoS Constrained (NODQC) routing algorithm; Lagrangian Relaxation

Article Statistics

Load and display the download statistics.

Citations to this Article

Cite This Article

MDPI and ACS Style

Lin, F.Y.-S.; Hsiao, C.-H.; Yen, H.-H.; Hsieh, Y.-J. A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks. Sensors 2013, 13, 16424-16450.

AMA Style

Lin FY-S, Hsiao C-H, Yen H-H, Hsieh Y-J. A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks. Sensors. 2013; 13(12):16424-16450.

Chicago/Turabian Style

Lin, Frank Y.-S.; Hsiao, Chiu-Han; Yen, Hong-Hsu; Hsieh, Yu-Jen. 2013. "A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks." Sensors 13, no. 12: 16424-16450.

Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert