Name
Abstract | ||
|---|---|---|
AbstractMany time-sensitive applications impose high requirement on real-time response. There exist many algorithms and routing protocols for efficient data packet delivery. However, previous works set the same retransmission threshold for all the relay nodes along a delivery path.The method decreases the probability of a packet being transmitted through the delivery path within given deadline. In this paper, we focus on finding the optimal retransmission thresholds for the relay nodes, such that the summation of the probability of a packet being transmitted to the next relay node or destination node within the specified deadline is maximized. A distributed greedy algorithm that can be run on sensor node is proposed, which enables the sensor node to adaptively set the optimal retransmission threshold. To avoid dropping the packet forwarded to the destination within given deadline with high probability, we develop a packet dropped protocol based on probabilistic delay bound. Experimental results show that the proposed protocols have better performance. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1155/2015/271259 | Periodicals |
Field | DocType | Volume |
Sensor node,Computer science,Retransmission,Network packet,Computer network,Greedy algorithm,Real-time computing,Cyber-physical system,Probabilistic logic,Relay,Distributed computing,Routing protocol | Journal | 2015 |
Issue | ISSN | Citations |
1 | 1550-1329 | 1 |
PageRank | References | Authors |
0.37 | 18 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ran Bi | 1 | 3 | 2.79 |
| Jianzhong Li | 2 | 3196 | 304.46 |
| Hong Gao | 3 | 1086 | 120.07 |
| Quan Chen | 4 | 51 | 7.05 |