Next Article in Journal
Determination of the Optimum Harvest Window for Apples Using the Non-Destructive Biospeckle Method
Next Article in Special Issue
A Task-Centric Cooperative Sensing Scheme for Mobile Crowdsourcing Systems
Previous Article in Journal
An Efficient Seam Elimination Method for UAV Images Based on Wallis Dodging and Gaussian Distance Weight Enhancement
Previous Article in Special Issue
Search Techniques for the Web of Things: A Taxonomy and Survey
Article Menu

Export Article

Open AccessArticle
Sensors 2016, 16(5), 665;

Optimizing Retransmission Threshold in Wireless Sensor Networks

1,†,* , 2
Department of Computer Science, Dalian University of Technology, Dalian 116000, China
Department of Computer Science, Georgia State University, Atlanta, GA 30303, USA
Current address: No. 2 Linggong Road, Hi-Tech Zone, Dalian 116000, China
Author to whom correspondence should be addressed.
Academic Editor: Yunchuan Sun
Received: 22 March 2016 / Revised: 23 April 2016 / Accepted: 29 April 2016 / Published: 10 May 2016
(This article belongs to the Special Issue Identification, Information & Knowledge in the Internet of Things)
Full-Text   |   PDF [904 KB, uploaded 10 May 2016]   |  


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 Δ · max 1 i 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 Δ is the given upper bound of the transmission delay of the delivery path. If Δ 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. View Full-Text
Keywords: packet delivery; optimal retransmission threshold; in time packet delivery; optimal retransmission threshold; in time

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Bi, R.; Li, Y.; Tan, G.; Sun, L. Optimizing Retransmission Threshold in Wireless Sensor Networks. Sensors 2016, 16, 665.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top