Connectivity in wireless ad-hoc networks with a log-normal radio model

Authors:
R. Hekmat;P. Van Mieghem
Affiliations:
Delft University of Technology, Electrical Engineering, Mathematics and Computer Science, GA Delft, The Netherlands;Delft University of Technology, Electrical Engineering, Mathematics and Computer Science, GA Delft, The Netherlands
Venue:
Mobile Networks and Applications
Year:
2006

Citing 10
Cited 21

Small worlds: the dynamics of networks between order and randomness

Small worlds: the dynamics of networks between order and randomness
On k-connectivity for a geometric random graph

Random Structures & Algorithms
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Universal Wireless Personal Communications

Universal Wireless Personal Communications
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Radio Propagation for Modern Wireless Systems

Radio Propagation for Modern Wireless Systems
Connectivity of wireless multihop networks in a shadow fading environment

MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Combinatorics, Probability and Computing
Impact of interferences on connectivity in ad hoc networks

IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks

IEEE Transactions on Information Theory

Connectivity in one-dimensional ad hoc networks: a queueing theoretical approach

Wireless Networks
Effects of Correlated Shadowing: Connectivity, Localization, and RF Tomography

IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Analysis of per-node traffic load in multi-hop wireless sensor networks

IEEE Transactions on Wireless Communications
Connectivity analysis of wireless sensor networks with regular topologies in the presence of channel fading

IEEE Transactions on Wireless Communications
Correlated link shadow fading in multi-hop wireless networks

IEEE Transactions on Wireless Communications
On the giant component in wireless multi-hop networks

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Sampling networks by the union of m shortest path trees

Computer Networks: The International Journal of Computer and Telecommunications Networking
Analyzing the effect of node mobility in clustered wireless ad hoc networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Increased connectivity at lower cost: The case for multi-radio nodes in multi-hop wireless networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Connectivity model of wireless networks via dependency links random graphs

The Journal of Supercomputing
Coverage extension by means of non-conventional multi-hop communications

Computer Communications
On the implications of the log-normal path loss model: an efficient method to deploy and move sensor motes

Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems
Cross-layering between physical layer, medium access control, and routing in wireless ad-hoc networks

International Journal of Ad Hoc and Ubiquitous Computing
Towards a better understanding of large-scale network models

IEEE/ACM Transactions on Networking (TON)
Understanding the limits of RF-based collaborative localization

IEEE/ACM Transactions on Networking (TON)
Packet-centric approach to distributed sparse-graph coding in wireless ad hoc networks

Ad Hoc Networks
Network topology models for multihop wireless networks

ISRN Communications and Networking
A Prioritization Based Congestion Control Protocol for Healthcare Monitoring Application in Wireless Sensor Networks

Wireless Personal Communications: An International Journal
An efficient hop count routing protocol for wireless ad hoc networks

International Journal of Automation and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding the link probability between nodes we use a radio model that takes into account statistical variations of the radio signal power around its mean value. We show that these variations, that are unavoidably caused by the obstructions and irregularities in the surroundings of the transmitting and the receiving antennas, have two distinct effects on the network. Firstly, they reduce the amount of correlation between links causing the geometric random graph tend to behave like a random graph with uncorrelated links. Secondly, these variations increase the probability of long links, which enhances the probability of connectivity for the network.Another new result in our paper is an equation found for the calculation of the giant component size in wireless ad-hoc networks, that takes into account the level of radio signal power variations. With simulations we show that for the planning and design of wireless ad-hoc networks or sensor networks the giant component size is a good measure for "connectivity".