Connectivity in a random interval graph with access points

Authors:
Yilun Shang
Affiliations:
Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240, China
Venue:
Information Processing Letters
Year:
2009

Citing 2
Cited 2

On the connectivity of a random interval graph

Proceedings of the seventh international conference on Random structures and algorithms
On Range Matrices and Wireless Networks in d Dimensions

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

Fast distributed consensus seeking in large-scale sensor networks via shortcuts

International Journal of Computational Science and Engineering
Ad hoc node connectivity improvement analysis - Why not through mesh clients?

Computers and Electrical Engineering

Quantified Score

Hi-index	0.89

Visualization

Abstract

We derive closed analytical formulae of connectivity for random interval graphs in the presence of fixed access points. We examine the influence of positions of access points on the graph accessible connectivity. The results developed in this paper are useful in the design and engineering of random wireless access network in the future.