An Analytical Expression for k-connectivity of Wireless Ad Hoc Networks

Over the last few years coverage and connectivity of wireless ad hoc networks have fascinated considerable attention. The presented paper analyses and investigates the issues of k-connectivity probability and its robustness in wireless ad hoc-network while considering fading techniques like lognormal fading, Rayleigh fading, and nakagami fading in the ad hoc communication environment, by means of shadowing and fading phenomenon. In case of k-connected wireless sensor network (WSNs), this technique permits the routing of data packets or messages via individual (one or more) of minimum k node disjoint communication paths, but the other remaining paths can also be used. The major contribution of the paper is mathematical expressions for k-connectivity probability

An analysis of k-connectivity in shadowing and Nakagami fading wireless multi-hop networks

In this paper, we develop kappa-connectivity in wireless multi-hop networks in the presence of both the log-normal shadowing and Nakagami-m fading. The formula are generally applicable in a variety of realistic physical situations. Based on the results, we are able to find the critical node density to satisfy node kappa-connectivity almost with probability 1. In addition, kappa-connectivity shows significant difference with distinct channel conditions, which necessitates a generic result. The result is useful for the design of a wireless multi-hop network in practice.Accepted versio