Research on Wireless Multi-hop Networks: Current State and Challenges

Wireless multi-hop networks, in various forms and under various names, are being increasingly used in military and civilian applications. Studying connectivity and capacity of these networks is an important problem. The scaling behavior of connectivity and capacity when the network becomes sufficiently large is of particular interest. In this position paper, we briefly overview recent development and discuss research challenges and opportunities in the area, with a focus on the network connectivity.Comment: invited position paper to International Conference on Computing, Networking and Communications, Hawaii, USA, 201

Connectivity, Coverage and Placement in Wireless Sensor Networks

Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes

On the properties of giant component in wireless multi-hop networks

In this paper, we study the giant component, the largest component containing a non-vanishing fraction of nodes, in wireless multi-hop networks in Rd (d =1, 2). We assume that n nodes are randomly, in dependently and uniformly distributed in [0, 1]d, and each node has a uniform transmission range of r = r(n) and any two nodes can communicate directly with each other iff their Euclidean distance is at most r. For d = 1, we derive a closed-form analytical formula for calculating the probability of having a giant component of order above pn with any fixed 0.5 < p ≤ 1. The asymptotic behavior of one dimensional network having a giant component is investigated based on the derived result, which is distinctly different from its two dimensional counterpart. For d = 2, we derive an asymptotic analytical upper bound on the minimum transmission range at which the probability of having a giant component of order above qn for any fixed 0 < q < 1 tends to one as n → ∞. Based on the result, we show that significant energy savings can be achieved if we only require a large percentage of nodes (e.g. 95%)tobe connected rather than requiring all nodes to be connected. The results of this paper are of practical significance in the design and analysis of wireless ad hoc networks and sensor networks. © 2009 IEEE

On the Properties of Giant Component in Wireless Multi-hop Networks

In this paper, we study the giant component, the largest component containing a non-vanishing fraction of nodes, in wireless multi-hop networks in Rd (d =1, 2). We assume that n nodes are randomly, in dependently and uniformly distributed in [0, 1]d, an