Distributed synchronization algorithm for infrastructure-less public safety networks

In this paper, we propose a distributed synchronization algorithm for infrastructure-less public safety networks. The proposed algorithm aims to minimize the number of out-of-sync user equipments (UEs) by efficiently forming synchronization groups and selecting synchronization reference (SyncRef) UEs in a distributed manner. For the purpose, we introduce a novel affinity propagation technique which enables an autonomous decision at each UE based on local message-passing among neighboring UEs. Our simulation results show that the proposed algorithm reduces the number of out-of-sync UEs by up to 31% compared to the conventional scan-and-select strategy.

[1]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[2]  Sriram Vishwanath,et al.  Distributed Algorithms for Spectrum Access in Cognitive Radio Relay Networks , 2012, IEEE Journal on Selected Areas in Communications.

[3]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[4]  Nada Golmie,et al.  Nationwide Public Safety Broadband Network Deployment: Network Parameter Sensitivity Analysis , 2015 .

[5]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[6]  George Tsirtsis,et al.  LTE for public safety networks , 2013, IEEE Communications Magazine.

[7]  Jeffrey G. Andrews,et al.  Belief Propagation for Distributed Downlink Beamforming in Cooperative MIMO Cellular Networks , 2011, IEEE Transactions on Wireless Communications.

[8]  Xinming Zhang,et al.  A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks , 2013, IEEE Transactions on Mobile Computing.

[9]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[10]  Oriol Sallent,et al.  LTE: the technology driver for future public safety communications , 2013, IEEE Communications Magazine.

[11]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[12]  Yike Guo,et al.  Parallel Clustering Algorithm for Large-Scale Biological Data Sets , 2014, PloS one.

[13]  Gianmarco Baldini,et al.  Survey of Wireless Communication Technologies for Public Safety , 2014, IEEE Communications Surveys & Tutorials.

[14]  Markus Rupp,et al.  Simulating the long term evolution uplink physical layer , 2011, Proceedings ELMAR-2011.

[15]  Brendan J. Frey,et al.  A Binary Variable Model for Affinity Propagation , 2009, Neural Computation.

[16]  Sang Hyun Lee,et al.  Distributed Relay Pairing for Bandwidth Exchange Based Cooperative Forwarding , 2015, IEEE Communications Letters.

[17]  Sang Hyun Lee,et al.  Affinity Propagation for Energy-Efficient BS Operations in Green Cellular Networks , 2015, IEEE Transactions on Wireless Communications.

[18]  Nei Kato,et al.  Toward modeling ad hoc networks: current situation and future direction , 2013, IEEE Wireless Communications.

[19]  Shahrokh Valaee,et al.  Mobility-Based Clustering in VANETs Using Affinity Propagation , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[20]  J. Kiefer,et al.  Sequential minimax search for a maximum , 1953 .

[21]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[22]  W. C. Jakes,et al.  Microwave Mobile Communications , 1974 .