Title :
Probabilistic Network Coding with Priority over Wireless Networks
Author :
Zhang, Rui ; Qian, Quan
Author_Institution :
Sch. of Comput. Eng. & Sci., Shanghai Univ., Shanghai, China
Abstract :
Network coding can significantly 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 a Probabilistic Network Coding with Priority (PNCP) method in this paper. PNCP keeps different queues in node buffer for different flows. Whether a packet is transmitted with or without network coding is determined by its priority and the queue state. A Markov Chain Model is formulated to analyze PNCP´s performance in terms of delay and packet loss. The developed theoretical results are also validated through simulations.
Keywords :
Markov processes; network coding; queueing theory; radio networks; telecommunication traffic; Markov chain model; node buffer; packet arrival process; packet-loss rate; power efficiency; probabilistic network coding with priority method; queue state; real-time communications; stochastic nature; throughput efficiency; traffic flows; wireless networks; Delay; Encoding; Markov processes; Network coding; Probabilistic logic; Relays; Wireless networks; network coding; probabilistic scheme; service priority; wireless networks;
Conference_Titel :
Measuring Technology and Mechatronics Automation (ICMTMA), 2011 Third International Conference on
Conference_Location :
Shangshai
Print_ISBN :
978-1-4244-9010-3
DOI :
10.1109/ICMTMA.2011.512