摘要
Abstract
This paper researches on the problem of real-time packet forwarding in wireless multi-hop networks with lossy and bursty links. The objective is to maximize the probability that individual packets reach their destination before a hard deadline. While the instantaneous channel statuses are not accessible, they can be estimated by observations of success and failure rate during the actual packet transmissions. The packet forwarding problem can be regarded as a partial observable Markov decision process and it can also get the optimal transmission strategy for maximizing the probability of on-time packet delivery. In addition, the approximate solution based on maximum-volume inscribed ellipsoids is obtained to reduce the complexity of implementation. The simulation results also show the effectiveness of the proposed scheme.关键词
无线多跳网络/报文转发/限期/马尔科夫链/最优转发策略/最大体积内切椭球Key words
Wireless Multi-hop Networks/Packet Forwarding/Deadline/Markov Chains/Optimal Forwarding Policy/Maxi-mum-volume Inscribed Ellipsoids分类
信息技术与安全科学
