generalized geometric distribution
Recently Published Documents


TOTAL DOCUMENTS

11
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

2017 ◽  
Vol 46 (6) ◽  
pp. 4708-4721 ◽  
Author(s):  
Zawar Hussain ◽  
Javid Shabbir ◽  
Zahid Pervez ◽  
Said Farooq Shah ◽  
Manzoor Khan

2016 ◽  
Vol 46 (11) ◽  
pp. 5453-5465 ◽  
Author(s):  
E. Gómez–Déniz ◽  
M. E. Ghitany ◽  
Ramesh C. Gupta

2015 ◽  
Vol 45 (18) ◽  
pp. 5427-5442 ◽  
Author(s):  
D. V. S. Sastry ◽  
Deepesh Bhati ◽  
R. N. Rattihalli ◽  
E. Gómez-Déniz

2015 ◽  
Vol 2015 ◽  
pp. 1-12
Author(s):  
Wang Dongyang ◽  
Wu Muqing ◽  
Lv Bo ◽  
Liao Wenxing

Modeling the forwarding feature and analyzing the performance theoretically for opportunistic routing in wireless multihop network are of great challenge. To address this issue, a generalized geometric distribution (GGD) is firstly proposed. Based on the GGD, the forwarding probability between any two forwarding candidates could be calculated and it can be proved that the successful delivery rate after several transmissions of forwarding candidates is irrelevant to the priority rule. Then, a discrete-time queuing model is proposed to analyze mean end-to-end delay (MED) of a regular opportunistic routing with the knowledge of the forwarding probability. By deriving the steady-state joint generating function of the queue length distribution, MED for directly connected networks and some special cases of nondirectly connected networks could be ultimately determined. Besides, an approximation approach is proposed to assess MED for the general cases in the nondirectly connected networks. By comparing with a large number of simulation results, the rationality of the analysis is validated. Both the analysis and simulation results show that MED varies with the number of forwarding candidates, especially when it comes to connected networks; MED increases more rapidly than that in nondirectly connected networks with the increase of the number of forwarding candidates.


Sign in / Sign up

Export Citation Format

Share Document