On the power law relationship of the critical transmitting range and the number of nodes of ad hoc networks

2010 ◽  
Vol 7 (4) ◽  
pp. 228 ◽  
Author(s):  
Mun Loong Kam ◽  
Gerard Leng
2013 ◽  
Vol 20 (1) ◽  
pp. 110-113 ◽  
Author(s):  
Yong Li ◽  
Depeng Jin ◽  
Zhaocheng Wang ◽  
Lieguang Zeng ◽  
Sheng Chen

2007 ◽  
Vol 2007 ◽  
pp. 1-11 ◽  
Author(s):  
Philippe Jacquet ◽  
Amina Meraihi Naimi ◽  
Georgios Rodolakis

This paper addresses the problem of the evaluation of the delay distribution via analytical means in IEEE 802.11 wireless ad hoc networks. We show that the asymptotic delay distribution can be expressed as a power law. Based on the latter result, we present a cross-layer delay estimation protocol and we derive new delay-distribution-based routing algorithms, which are well adapted to the QoS requirements of real-time multimedia applications. In fact, multimedia services are not sensitive to average delays, but rather to the asymptotic delay distributions. Indeed, video streaming applications drop frames when they are received beyond a delay threshold, determined by the buffer size. Although delay-distribution-based routing is an NP-hard problem, we show that it can be solved in polynomial time when the delay threshold is large, because of the asymptotic power law distribution of the link delays.


2005 ◽  
Vol DMTCS Proceedings vol. AD,... (Proceedings) ◽  
Author(s):  
Philippe Jacquet ◽  
Amina Meraihi Naimi ◽  
Georgios Rodolakis

International audience In this paper we show that the CSMA IEEE 802.11 protocol (Wifi) provides packet access delays asymptotics in power law. This very feature allows us to specify optimal routing via polynomial algorithm while the general case is NP-hard.


2012 ◽  
Vol 2 (3) ◽  
pp. 77-80
Author(s):  
V. Karamchand Gandhi ◽  
◽  
D.P.Jeyabalan D.P.Jeyabalan

Sign in / Sign up

Export Citation Format

Share Document