In this paper, the system saturation throughput of the cooperative MAC with opportunistic relaying for ad hoc networks is evaluated by exploiting the proposed analytical model based on the Markov chain model of DCF. B...In this paper, the system saturation throughput of the cooperative MAC with opportunistic relaying for ad hoc networks is evaluated by exploiting the proposed analytical model based on the Markov chain model of DCF. Both of the cooperative scheme and opportunistic relaying are considered into the analytical model. Simulations are also performed to validate the proposed analytical model. Simulation results show that the cooperative MAC with opportunistic relaying can significantly improve the system performance. Furthermore, we also reveal the impact of the opportunistic relaying on the performance from the MAC layer perspectives.展开更多
Abstract The authors prove an almost sure central limit theorem for partial sums based on an irreducible and positive recurrent Markov chain using logarithmic means, which realizes the extension of the almost sure cen...Abstract The authors prove an almost sure central limit theorem for partial sums based on an irreducible and positive recurrent Markov chain using logarithmic means, which realizes the extension of the almost sure central limit theorem for partial sums from an i.i.d, sequence of random variables to a Markov chain.展开更多
基金Supported by the Important National Science ＆ Technology Specific Project （No. 2010ZX03006 -002 -04） , and the National Natural Science Foundation of China （No, 60972051）.
文摘In this paper, the system saturation throughput of the cooperative MAC with opportunistic relaying for ad hoc networks is evaluated by exploiting the proposed analytical model based on the Markov chain model of DCF. Both of the cooperative scheme and opportunistic relaying are considered into the analytical model. Simulations are also performed to validate the proposed analytical model. Simulation results show that the cooperative MAC with opportunistic relaying can significantly improve the system performance. Furthermore, we also reveal the impact of the opportunistic relaying on the performance from the MAC layer perspectives.
基金supported by the National Natural Science Foundation of China (No. 11171275)the Program for Excellent Talents in Chongqing Higher Education Institutions (No. 120060-20600204)Liaocheng University Foundation (No. X09005)
文摘Abstract The authors prove an almost sure central limit theorem for partial sums based on an irreducible and positive recurrent Markov chain using logarithmic means, which realizes the extension of the almost sure central limit theorem for partial sums from an i.i.d, sequence of random variables to a Markov chain.
