Connectivity is one of the most fundamental properties, if not the most fundamental property,
of communication networks. A communication network is said to be connected if there is a …

In this paper, we study transmission power to secure the connectivity of a network. Instead of
requiring all nodes to be connected, we require that only a large fraction (eg, 95%) be …

In this paper, we study the phase transition behavior of k-connectivity (k= 1, 2,...) in wireless
multihop networks where a total of n nodes are randomly and independently distributed …

In this paper, we study the problem of maintaining the connectivity of a Wireless Sensor
Network (WSN) using decentralised topology control protocols. Previous algorithms on …

In this paper, we study the giant component, the largest component containing a non-
vanishing fraction of nodes, in wireless multi-hop networks in R d (d= 1, 2). We assume that …

Topology control protocols construct a logical topology out of the physical communication
graph. Logical topology is maintained by logical neighbor lists in every node. Logical …

Topology of a mobile wireless sensor/ad hoc network is prone to link breakages due to node
mobility which compels the periodic re-construction of the topology in so called “hello” …

In this paper, we study the giant component, the largest component containing a non-
vanishing fraction of nodes, in a wireless multi-hop network where n nodes are randomly …

k-Neigh is a basic neighbor-based topology control protocol based on the construction of k-
neighbor graph as logical communication graph. Several topological aspects of the …

In this paper, we study the well-known phase transition behavior of connectivity in a wireless
multi-hop network, but, in contrast to other studies, in a shadowing environment. We …