{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:34:11Z","timestamp":1760243651408,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:00:00Z","timestamp":1385942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>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 \u201csystem perspective\u201d and \u201cuser perspective\u201d 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.<\/jats:p>","DOI":"10.3390\/s131216424","type":"journal-article","created":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T03:18:09Z","timestamp":1386040689000},"page":"16424-16450","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks"],"prefix":"10.3390","volume":"13","author":[{"given":"Frank","family":"Lin","sequence":"first","affiliation":[{"name":"Department of Information Management, National Taiwan University, No. 1 Section 4,  Roosevelt Road, Taipei City 106, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8475-7400","authenticated-orcid":false,"given":"Chiu-Han","family":"Hsiao","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Taiwan University, No. 1 Section 4,  Roosevelt Road, Taipei City 106, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Hsu","family":"Yen","sequence":"additional","affiliation":[{"name":"Department of Information Management, Shih Hsin University, No. 1, Lane 17,  Mu-Cha Road, Section 1, Taipei City 116, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Jen","family":"Hsieh","sequence":"additional","affiliation":[{"name":"Department of Information Management, Shih Hsin University, No. 1, Lane 17,  Mu-Cha Road, Section 1, Taipei City 116, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2013,12,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1","article-title":"An efficient implementation of an algorithm for finding k shortest simple paths","volume":"34","author":"Hadjiconstantinou","year":"1999","journal-title":"Networks"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MWC.2009.4907559","article-title":"Challenging issues in visual sensor networks","volume":"16","author":"Charfi","year":"2009","journal-title":"IEEE Wirel. Commun."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1109\/TCSVT.2009.2017411","article-title":"Distributed algorithms for network lifetime maximization in wireless visual sensor networks","volume":"19","author":"He","year":"2009","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/SURV.2008.080404","article-title":"A survey of multimedia streaming in wireless sensor networks","volume":"10","author":"Misra","year":"2008","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2009\/640386","article-title":"A survey of visual sensor networks","volume":"2009","author":"Soro","year":"2009","journal-title":"Adv. Multimed."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MNET.2008.4435906","article-title":"A general interference-aware framework for joint routing and link scheduling in wireless mesh networks","volume":"22","author":"Badia","year":"2008","journal-title":"IEEE Netw."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/997122.997130","article-title":"Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks","volume":"8","author":"Raniwala","year":"2004","journal-title":"ACM Mob. Comput. Commun. Rev."},{"key":"ref_8","unstructured":"Kyasanur, P., and Vaidya, N.H. (2005, January 13\u201317). Routing and Interface Assignment in Multi-Channel Multi-Interface Wireless Networks. New Orleans, LA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Subramanian, A.P., Gupta, H., and Das, S.R. (2007, January 18\u201321). Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks. San Diego, CA, USA.","DOI":"10.1109\/SAHCN.2007.4292860"},{"key":"ref_10","unstructured":"Draves, R., Padhye, J., and Zill, B. (October, January 26). Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks. Philadelphia, PA, USA."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Liu, T., and Liao, W. (2006, January 11\u201315). Capacity-Aware Routing in Multi-Channel Multi-Rate Wireless Mesh Networks. Istanbul, Turkey.","DOI":"10.1109\/ICC.2006.255059"},{"key":"ref_12","unstructured":"Tzeng, Y.C. (2006). Backhaul Assignment and Routing Algorithm with End-to-End QoS Constraints in Wireless Mesh Networks. [MS.c. or Ph.D. Thesis, Department of Information Management, National Taiwan University]."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/MNET.2008.4435902","article-title":"Joint power-frequency-time resource allocation in clustered wireless mesh networks","volume":"22","author":"Cheng","year":"2008","journal-title":"IEEE Netw."},{"key":"ref_14","unstructured":"Alicherry, M., Bhatia, R., and Li, L. (September, January 28). Joint Channel Assignment and Routing for Throughput Optimization in Multi-Radio Wireless Mesh Networks. Coldgue, Germany."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.proeng.2012.01.835","article-title":"Performance analysis of AODV, DSR, OLSR and DSDV routing protocols using NS2 Simulator","volume":"30","author":"Mohapatra","year":"2012","journal-title":"Proced. Eng."},{"key":"ref_16","unstructured":"Forouzan, B.A. (2003). Data Communication and Networking, McGraw Hill. [3]."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Tang, J., Xue, G., and Zhang, W. (2005, January 25\u201328). Interference-Aware Topology Control and QoS Routing in Multi-Channel Wireless Mesh Networks. IL, USA.","DOI":"10.1145\/1062689.1062700"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Wasiq, S., Arshad, W., Javaid, N., and Bibi, A. (2011, January 22\u201324). Performance Evaluation of DSDV, OLSR and DYMO Using 802.11 and 802.11 p MAC-Protocols. Karachi, Pakistan.","DOI":"10.1109\/INMIC.2011.6151504"},{"key":"ref_19","first-page":"545","article-title":"Performance comparison of AODV, DSDV, OLSR and DSR routing protocols in mobile ad hoc networks","volume":"2","author":"Ade","year":"2010","journal-title":"Int. J. Inf. Technol. Knowl. Manag."},{"key":"ref_20","unstructured":"Kumawat, R., and Somani, V. (August, January 3). Comparative Analysis of DSDV and OLSR Routing Protocols in MANET at Different Traffic Load. Maui, HI, USA."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.5121\/ijngn.2010.2205","article-title":"Performance of DSDV protocol over sensor networks","volume":"2","author":"Tripathi","year":"2010","journal-title":"Int. J. Next Gener. Netw."},{"key":"ref_22","unstructured":"Yen, H.H., and Lin, F.Y.S. (2001, January 22\u201326). Near-Optimal Delay Constrained Routing in Virtual Circuit Networks. Anchorage, AK, USA."},{"key":"ref_23","unstructured":"Kleinrock, L. (1976). Queueing Systems, Wiley-Interscience."},{"key":"ref_24","unstructured":"Wen, Y.F. (2007). Performance Optimization Algorithm for Wireless Networks. [MS.c. or Ph.D. Thesis, Department of Information Management, National Taiwan University]."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TCOM.1977.1093711","article-title":"A minimum delay routing algorithm using distributed computation","volume":"25","author":"Gallager","year":"1997","journal-title":"IEEE Trans. Commun."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/26.48893","article-title":"Distributed routing with on-line marginal delay estimation","volume":"38","author":"Cassandras","year":"1990","journal-title":"IEEE Trans. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian Relaxation and its use in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Program. Study 2"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","article-title":"An application oriented guide to Lagrangian Relaxation","volume":"15","author":"Fisher","year":"1985","journal-title":"Interfaces"},{"key":"ref_29","unstructured":"Cheng, K.T., and Lin, F.Y.S. (1995, January 14\u201316). Minimax End-to-End Delay Routing and Capacity Assignment for Virtual Circuit Networks. New Orleans, LA, USA."},{"key":"ref_30","first-page":"10","article-title":"The Lagrangian Relaxation Method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Manag. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","article-title":"An efficient algorithm for k shortest simple paths","volume":"12","author":"Katoh","year":"1981","journal-title":"Networks"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/13\/12\/16424\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:51:01Z","timestamp":1760219461000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/13\/12\/16424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,2]]},"references-count":31,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2013,12]]}},"alternative-id":["s131216424"],"URL":"https:\/\/doi.org\/10.3390\/s131216424","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2013,12,2]]}}}