Article

Connectivity of a Gaussian network

University of Cambridge, CB2 1TQ, Cambridge, UK
International Journal of Ad Hoc and Ubiquitous Computing (Impact Factor: 0.9). 01/2008; 3(3):204-213. DOI: 10.1504/IJAHUC.2008.018407
Source: DBLP

ABSTRACT Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R 2 distributed randomly with density given by a Gaussian distribution about the origin, and assume each transceiver can communicate with all other transceivers within distance s. We give bounds for the distance from the origin to the furthest transceiver connected to the origin, and that of the closest transceiver that is not connected to the origin.. He received PhDs from Eotvos Uni-versity, Budapest, Hungary and the University of Cambridge, England. He works in extremal and probabilistic combinatorics, polynomials of graphs, combinatorial prob-ability and percolation theory. He has written eight books, including Extremal Graph Theory, Random Graphs and Modern Graph Theory, and over 300 research papers. He has supervised over forty doctoral students, many of whom hold leading positions in prominent universities throughout the world. Paul Balister is a Professor at the University of Memphis, where he has been since 1998. He obtained his PhD from the University of Cambridge, England in 1992 and subsequently held positions at Harvard and Cambridge. He has worked in algebraic number theory, combinatorics, graph theory and probability theory. Amites Sarkar is a Visiting Assistant Professor at the University of Memphis. He ob-tained his PhD from the University of Cambridge in 1998, and has been at Memphis since 2003. He has worked in combinatorics and probability theory. Mark Walters is a Teaching Fellow at Peterhouse College, Cambridge. He obtained his PhD from the University of Cambridge in 2000, and was a Research Fellow of Trinity College, Cambridge. He has worked in combinatorics and probability theory.

0 Followers
 · 
100 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) consist of thousands of nodes that need to communicate with each other. However, it is possible that some nodes are isolated from other nodes due to limited communication range. This paper focuses on the influence of communication range on the probability that all nodes are connected under two conditions, respectively: (1) all nodes have the same communication range, and (2) communication range of each node is a random variable. In the former case, this work proves that, for , if the probability of the network being connected is , by means of increasing communication range by constant , the probability of network being connected is at least . Explicit function is given. It turns out that, once the network is connected, it also makes the WSNs resilient against nodes failure. In the latter case, this paper proposes that the network connection probability is modeled as Cox process. The change of network connection probability with respect to distribution parameters and resilience performance is presented. Finally, a method to decide the distribution parameters of node communication range in order to satisfy a given network connection probability is developed.
    International Journal of Distributed Sensor Networks 09/2013; 2013. DOI:10.1155/2013/482727 · 0.92 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this review paper, we shall discuss some recent results concerning several models of random geometric graphs, including the Gilbert disc model G r , the k-nearest neighbour model G k nn and the Voronoi model G P . Many of the results concern finite versions of these models. In passing, we shall mention some of the applications to engineering and biology.
    05/2010: pages 117-142;

Full-text (2 Sources)

Download
39 Downloads
Available from
May 29, 2014