{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:18:49Z","timestamp":1760242729581,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T00:00:00Z","timestamp":1462838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["(DUT15RC(3)088, DUT15QY26, DUT14QY06"],"award-info":[{"award-number":["(DUT15RC(3)088, DUT15QY26, DUT14QY06"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572104, 61402076"],"award-info":[{"award-number":["61572104, 61402076"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Startup Fund for the Doctoral Program of Liaoning Province","award":["20141023"],"award-info":[{"award-number":["20141023"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is O n \u0394 \u00b7 max 1 \u2264 i \u2264 n { u i } , where u i is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and \u0394 is the given upper bound of the transmission delay of the delivery path. If \u0394 is greater than the polynomial, to reduce the time complexity, a linear programming-based ( 1 + p m i n ) -approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O ( 1 ) -approximation algorithm with time complexity O ( 1 ) is proposed. Experimental results show that the proposed algorithms have better performance.<\/jats:p>","DOI":"10.3390\/s16050665","type":"journal-article","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T08:52:17Z","timestamp":1462870337000},"page":"665","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing Retransmission Threshold in Wireless Sensor Networks"],"prefix":"10.3390","volume":"16","author":[{"given":"Ran","family":"Bi","sequence":"first","affiliation":[{"name":"Department of Computer Science, Dalian University of Technology, Dalian 116000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingshu","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Georgia State University, Atlanta, GA 30303, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guozhen","family":"Tan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Dalian University of Technology, Dalian 116000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Sun","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Dalian University of Technology, Dalian 116000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"5198","DOI":"10.1109\/TVT.2014.2375330","article-title":"Curve Query Processing in Wireless Sensor Networks","volume":"64","author":"Cheng","year":"2015","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.tcs.2015.07.056","article-title":"Approximate aggregation for tracking quantiles and range countings in wireless sensor networks","volume":"607","author":"He","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"5415","DOI":"10.1016\/j.tcs.2009.05.013","article-title":"A 3.4713-approximation algorithm for the capacitated multicast tree routing problem","volume":"410","author":"Cai","year":"2009","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Cai, Z., Goebel, R., and Lin, G. (2009, January 10\u201312). Size-constrained tree partitioning: A story on approximation algorithm design for the multicast k-tree routing problem. Proceedings of the Third International Conference on Combinatorial Optimization and Applications, Huangshan, China.","key":"ref_4","DOI":"10.1007\/978-3-642-02026-1_34"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"42:1","DOI":"10.1145\/2700272","article-title":"Toward stable network performance in wireless sensor networks: A multilevel perspective","volume":"11","author":"Lin","year":"2015","journal-title":"ACM Trans. Sens. Netw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TSG.2012.2209209","article-title":"Taming uncertainties in real-time routing for wireless networked sensing and control","volume":"4","author":"Liu","year":"2013","journal-title":"IEEE Trans. Smart Grid"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TII.2013.2261082","article-title":"R3E: Reliable reactive routing enhancement for wireless sensor networks","volume":"10","author":"Niu","year":"2014","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.3390\/s8021099","article-title":"QoS challenges and opportunities in wireless sensor\/actuator networks","volume":"8","author":"Feng","year":"2008","journal-title":"Sensors"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TPDS.2013.98","article-title":"QoF: Towards comprehensive path quality measurement in wireless sensor networks","volume":"25","author":"Wang","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"crossref","unstructured":"Liu, T., and Cerpa, A. (2014). Data-driven link quality prediction using link features. ACM Trans. Sens. Netw., 10.","key":"ref_10","DOI":"10.1145\/2530535"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2293","DOI":"10.1109\/TPDS.2012.327","article-title":"Routing metrics for minimizing end-to-end delay in multiradio multichannel wireless networks","volume":"24","author":"Li","year":"2013","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"crossref","unstructured":"Shi, T., Cheng, C., and Cai, Z. (2016, January 10\u201315). Adaptive Connected Dominating Set Discovering Algorithm in Energy-Harvest Sensor Networks. Proceedings of the IEEE International Conference on Computer Communications INFOCOM 2016, San Francisco, CA, USA.","key":"ref_12","DOI":"10.1109\/INFOCOM.2016.7524504"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1864","DOI":"10.1109\/TPDS.2013.240","article-title":"QoS aware geographic opportunistic routing in wireless sensor networks","volume":"25","author":"Cheng","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"crossref","unstructured":"Bi, R., Li, J., Gao, H., and Chen, Q. (2015). Deadline aware retransmission threshold setting protocol in cyber-physical systems. Int. J. Distrib. Sens. Netw., 2015.","key":"ref_14","DOI":"10.1155\/2015\/271259"},{"doi-asserted-by":"crossref","unstructured":"Dong, W., Liu, Y., He, Y., and Zhu, T. (2013, January 14\u201319). Measurement and analysis on the packet delivery performance in a large scale sensor network. Proceedings of the IEEE International Conference on Computer Communications INFOCOM 2013, Turin, Italy.","key":"ref_15","DOI":"10.1109\/INFCOM.2013.6567076"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TC.2015.2417543","article-title":"Spatial reusability-aware routing in multi-hop wireless networks","volume":"65","author":"Meng","year":"2016","journal-title":"IEEE Trans. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"851","DOI":"10.12720\/jcm.9.11.851-858","article-title":"Routing metric of expected delay in multi-radio multi-channel wireless mesh networks","volume":"9","author":"Shi","year":"2014","journal-title":"J. Commun."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/TWC.2014.2329568","article-title":"Link-correlation-aware opportunistic routing in wireless networks","volume":"14","author":"Wang","year":"2015","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.inffus.2013.02.005","article-title":"Adaptive routing in wireless sensor networks: QoS optimisation for enhanced application performance","volume":"22","author":"Hammoudeh","year":"2015","journal-title":"Inf. Fusion"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1109\/TNET.2014.2306592","article-title":"EDAL: An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for heterogeneous wireless sensor networks","volume":"23","author":"Yao","year":"2015","journal-title":"IEEE ACM Trans. Netw."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TMC.2014.2313576","article-title":"Dynamic routing for data integrity and delay differentiated services in wireless sensor networks","volume":"14","author":"Zhang","year":"2015","journal-title":"IEEE Trans. Mob. Comput."},{"unstructured":"Cai, Z., Lin, G., and Xue, G. (2005, January 16\u201329). Improved Approximation Algorithms for the Capacitated Multicast Routing Problem. Proceedings of 11th Annual International Conference on Computing and Combinatorics COCOON 2005, Kunming, China.","key":"ref_22"},{"key":"ref_23","first-page":"3966","article-title":"Assignment of segmented slots enabling reliable real-time transmission in industrial wireless sensor networks","volume":"62","author":"Yang","year":"2015","journal-title":"IEEE Trans. Ind. Electron."},{"doi-asserted-by":"crossref","unstructured":"Pan, M., Zhang, C., Li, P., and Fang, Y. (2011, January 10\u201315). Joint routing and link scheduling for cognitive radio networks under uncertain spectrum supply. Proceedings of the IEEE International Conference on Computer Communications INFOCOM 2011, Shanghai, China.","key":"ref_24","DOI":"10.1109\/INFCOM.2011.5935039"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/TPDS.2013.60","article-title":"ALBA-R: Load-balancing geographic routing around connectivity holes in wireless sensor networks","volume":"25","author":"Petrioli","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1109\/TC.2014.2322609","article-title":"End-to-end communication delay analysis in industrial wireless networks","volume":"64","author":"Saifullah","year":"2015","journal-title":"IEEE Trans. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s11276-006-0731-9","article-title":"Multiconstrained QoS multipath routing in wireless sensor networks","volume":"14","author":"Huang","year":"2008","journal-title":"Wirel. Netw."},{"doi-asserted-by":"crossref","unstructured":"Wang, Z., Bulut, E., and Szymanski, B.K. (2009, January 14\u201318). Energy efficient collision aware multipath routing for wireless sensor networks. Proceedings of the IEEE International Conference on Communications, Dresden, Germany.","key":"ref_28","DOI":"10.1109\/ICC.2009.5198989"},{"doi-asserted-by":"crossref","unstructured":"Vazirani, V.V. (2013). Approximation Algorithms, Springer Science & Business Media.","key":"ref_29","DOI":"10.21236\/ADA579025"},{"unstructured":"Dantzig, G.B. (1998). Linear Programming and Extensions, Princeton University Press.","key":"ref_30"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/16\/5\/665\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:23:34Z","timestamp":1760210614000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/16\/5\/665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,10]]},"references-count":30,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2016,5]]}},"alternative-id":["s16050665"],"URL":"https:\/\/doi.org\/10.3390\/s16050665","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2016,5,10]]}}}