Name
Abstract | ||
|---|---|---|
Network coding has been shown to be able to improve the throughput and power efficiency of wireless networks by mixing packets from different flows into a single packet. However, forcing packets to be coded may induce large delay and packet loss rate which is intolerable to some services such as real-time communications. Considering the diversity of traffic flows and the stochastic nature of the packet arrival process in wireless networks, we propose an opportunistic scheduling called Probabilistic Network Coding with Priority (PNCP) method. The relay node can transmit either network-coded or un-coded packets. Service priority and queue state are the two most important facts that determine a packet's transmission with or without network coding. By using a Markov Chain model, the average packet delay and packet loss rate of PNCP are presented. We validate the theoretical results through simulations and demonstrate that it can serve different flows with priority. More importantly, we discuss the impact of different parameters on the performance of PNCP and show that the opportunistic scheduling can significantly reduce the packet loss rate and average delay. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/CIT.2011.26 | CIT |
Keywords | DocType | Citations |
different flow,wireless network coding,opportunistic scheduling,network coding,wireless network,packet arrival process,average packet delay,average delay,un-coded packet,single packet,packet loss rate,performance analysis,simulation,power efficiency,encoding,wireless networks,scheduling,traffic flow,markov chain model,markov process,markov processes | Conference | 5 |
PageRank | References | Authors |
0.61 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhang Rui | 1 | 23 | 4.15 |
| Quan Qian | 2 | 13 | 4.54 |
| Mingjun Xin | 3 | 41 | 10.73 |
| Bofeng Zhang | 4 | 179 | 41.38 |