Hits:

Indexed by:期刊论文

Date of Publication:2016-05-01

Journal:SENSORS

Included Journals:SCIE、EI、PubMed

Volume:16

Issue:5

ISSN No.:1424-8220

Key Words:packet delivery; optimal retransmission threshold; in time

Abstract: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 Delta . 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 Delta is the given upper bound of the transmission delay of the delivery path. If Delta is greater than the polynomial, to reduce the time complexity, a linear programming-based (1 + p(min))-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.