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

On the minimum number of neighbours for good routing performance in MANETs

In a mobile ad hoc network, where nodes are deployed without any wired infrastructure and communicate via multihop wireless links, the network topology is based on the nodes’ locations and transmission ranges. The nodes communicate through wireless links, with each node acting as a relay when necessary to allow multihop communications. The network topology can have a major impact on network performance. We consider the impact of number and placement of neighbours on mobile network performance. Specifically, we consider how neighbour node placement affects the network overhead and routing delay. We develop an analytical model, verified by simulations, which shows widely varying performance depending on source node speed and, to a lesser extent, number of neighbour nodes

Connectivity in Secure Wireless Sensor Networks under Transmission Constraints

In wireless sensor networks (WSNs), the Eschenauer-Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although connectivity properties of secure WSNs with the EG scheme have been extensively investigated, few results address physical transmission constraints. These constraints reflect real-world implementations of WSNs in which two sensors have to be within a certain distance from each other to communicate. In this paper, we present zero-one laws for connectivity in WSNs employing the EG scheme under transmission constraints. These laws help specify the critical transmission ranges for connectivity. Our analytical findings are confirmed via numerical experiments. In addition to secure WSNs, our theoretical results are also applied to frequency hopping in wireless networks.Comment: Full version of a paper published in Annual Allerton Conference on Communication, Control, and Computing (Allerton) 201