Synchronization in Random Geometric Graphs

Details Synchronization in Random Geometric Graphs Synchronization in Random Geometric Graphs

2008-01-19

arxiv.org/abs/0801.3044v1

Physics

Physics and Society

5 pages, 4 figures

Scientific paper

In this paper we study the synchronization properties of random geometric graphs. We show that the onset of synchronization takes place roughly at the same value of the order parameter that a random graph with the same size and average connectivity. However, the dependence of the order parameter with the coupling strength indicates that the fully synchronized state is more easily attained in random graphs. We next focus on the complete synchronized state and show that this state is less stable for random geometric graphs than for other kinds of complex networks. Finally, a rewiring mechanism is proposed as a way to improve the stability of the fully synchronized state as well as to lower the value of the coupling strength at which it is achieved. Our work has important implications for the synchronization of wireless networks, and should provide valuable insights for the development and deployment of more efficient and robust distributed synchronization protocols for these systems.

Affiliated with

Also associated with

No associations

Rating

Synchronization in Random Geometric Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Synchronization in Random Geometric Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synchronization in Random Geometric Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-18861