The node degree for wireless ad hoc networks in shadow fading environments

Node degree has been regarded as one of the important and convenient metrics to measure the connectivity of the wireless ad hoc networks. Many studies concerning node degree are based on the assumption of static connectivity graph on the number of nodes, which can not reflect the mobility characteristics in ad hoc networks. In this paper we investigate three fundamental characteristics of a wireless ad hoc network: its node degree distribution, its average node degree and its maximum node degree experienced by all the nodes during theirs movement. We employ a novel mathematical modeling to derive their analytical expressions in presence of radio channel fading. The results of this paper are useful in the study of connectivity and improving algorithm complexity of incentive protocols. Also, these results are of practical value for researchers in this area, e.g., if they set the parameters in a network-level simulation of a mobile ad hoc network or if they design a wireless sensor network.

[1]  Mischa Schwartz,et al.  Mobile Wireless Communications: Access and scheduling techniques in cellular systems , 2004 .

[2]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[3]  Christian Bettstetter,et al.  Connectivity of Wireless Multihop Networks in a Shadow Fading Environment , 2003, MSWIM '03.

[4]  Wenye Wang,et al.  The Impacts of Radio Channels and Node Mobility on Link Statistics in Mobile Ad Hoc Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[5]  Kwang-Cheng Chen,et al.  Distribution of the Node Degree for Wireless Ad Hoc Networks in Shadow Fading Environments , 2007, IEICE Trans. Commun..

[6]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[7]  I. Miller.  Probability, Random Variables, and Stochastic Processes , 1966 .

[8]  Christian Bettstetter.  Topology properties of Ad hoc networks with random waypoint mobility , 2003, MOCO.

[9]  F. Xhafa,et al.  Maximum Node Degree Mobility Metric for Wireless Ad Hoc Networks , 2008, 2008 The Second International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies.

[10]  M. Penrose.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[11]  Piet Van Mieghem,et al.  Degree distribution and hopcount in wireless ad-hoc networks , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[12]  Eitan Altman,et al.  Coverage and connectivity of ad hoc networks presence of channel randomness , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[14]  Piet Van Mieghem,et al.  Performance analysis of communications networks and systems , 2006 .

[15]  BettstetterChristian,et al.  Connectivity of wireless multihop networks in a shadow fading environment , 2005 .