Topological properties of the one dimensional exponential random geometric graph

Gupta, Bhupendra; Iyer, Srikanth K.; Manjunath, D.

doi:10.1002/rsa.20174

Cited by 20 publications

(16 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In RGGs, n nodes are placed independently at random according to some spatial probability distribution and two nodes can connect by an edge if and only if their distance is less than a critical cutoff r [18]. ERGGs is a special kind of RGGs, it requires the inter-node distance following exponential distribution [24].…”

Section: B Exponential Random Geometric Model For Vanetmentioning

confidence: 99%

“…We can see in [17] [19], RGGs are excellent model to describe the communication between nodes in wireless sensor network. The ERGGs is a special kind of RGGs, it requires the inter-node distance following exponential distribution [24]. We are very concerned about the distributions of distance between successive vehicles during analyzing VANETs connectivity [15].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Connectivity analysis for vehicular ad hoc network based on the Exponential Random Geometric Graphs

Zhang

Sun

et al. 2014

2014 IEEE Intelligent Vehicles Symposium Proceedings

View full text Add to dashboard Cite

Network connectivity is a fundamental requirement for applying the vehicular ad hoc networks (VANETs) to real traffic systems. The high mobility of vehicles results in rapid changes in network topology generating dynamic variation in network connectivity. Therefore, a new approach of using Exponential Random Geometric Graphs (ERGGs) to analyze VANETs connectivity is presented considering the high randomness of vehicles' velocity and headway under the scenario of free flow state on highway. Vehicles enter the highway according to a Poisson distribution, and the headway follows a negative exponential distribution. Assuming that each vehicle is assigned a random speed chosen from normal distribution and maintains the speed while it travels on the highway. The dynamic topology properties, such as one-step transition probability matrix, are derived from ERGGs by analyzing the evolving process of the headway. In addition, the static topology properties such as connectivity probability and communication duration between vehicles are also calculated. The analysis of results agrees with a idealized scenario, which shows the ERGGs can be used to analyze the evolution of network connectivity.

show abstract

Section: B Exponential Random Geometric Model For Vanetmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Connectivity analysis for vehicular ad hoc network based on the Exponential Random Geometric Graphs

Zhang

Sun

et al. 2014

2014 IEEE Intelligent Vehicles Symposium Proceedings

View full text Add to dashboard Cite

show abstract

“…In Gupta et al (2006); Karamchandani et al (2005) the node locations are assumed to be at distances that are i.i.d. exponential from the origin and many topological properties are derived.…”

Section: 2a Topological Propertiesmentioning

confidence: 99%

A tutorial survey of topics in wireless networking: Part II

Kumar

Manjunath

2007

Sadhana

Self Cite

View full text Add to dashboard Cite

This is the second part of the survey of recent and emerging topics in wireless networking. We provide an overview of the area of wireless networking as that of dealing with problems of resource allocation so that the various connections that utilise the network achieve their desired performance objectives.In Part I we provided a taxonomy of wireless networks as they have been deployed. We then provided a quick survey of the main issues in the wireless 'physical' layer. We then discussed some resource allocation formulations in CDMA (code division multiple access) cellular networks and OFDMA (orthogonal frequency division multiple access) networks.In this part we begin with a discussion of random access wireless networks. We first provide an overview of the evolution of random access networks from Aloha to the currently popular 802·11 (Wi-Fi) networks. We then analyse the performance of the 802·11 random access protocol. We briefly discuss the problem of optimal association of nodes to Wi-Fi access points. Next, we consider topics in ad hoc multihop wireless networks. We first discuss topology and cross layer control. For the latter, we describe the important maximum weight link scheduling algorithm. The connectivity and capacity of randomly deployed networks are then analysed. Finally, we provide an overview of the technical issues in the emerging area of wireless sensor networks.

show abstract

“…This showed that for n nodes uniformly, independently and identically distributed (i.i.d.) in a disk of area A, with the particular radio transmission range is given by (1).…”

Section: Related Workmentioning

confidence: 99%

“…The goal was to construct a special subgraph, the Restricted Delaunay Graph, that permits efficient routing, based only on local information. In [1,13,18] the authors studied the toplogy and connectivity properties of random geometric graphs.…”

Section: Introductionmentioning

confidence: 99%

Connectivity and Coverage in Hybrid Wireless Sensor Networks using Dynamic Random Geometric Graph Model

Norman¹

2011

J GRAPH-HOC

View full text Add to dashboard Cite

show abstract

Topological properties of the one dimensional exponential random geometric graph

Cited by 20 publications

References 20 publications

Connectivity analysis for vehicular ad hoc network based on the Exponential Random Geometric Graphs

Connectivity analysis for vehicular ad hoc network based on the Exponential Random Geometric Graphs

A tutorial survey of topics in wireless networking: Part II

Connectivity and Coverage in Hybrid Wireless Sensor Networks using Dynamic Random Geometric Graph Model

Contact Info

Product

Resources

About