Reliable low-energy group formation for infrastructure-less public safety networks

In this paper, we study an infrastructure-less public safety network (IPSN) where energy efficiency and reliability are critical requirements in the absence of cellular infrastructure, i.e., base stations and wired backbone lines. We formulate the IPSN group formation as a clustering problem. A subset of user equipments (UEs), called group owners (GOs), are chosen to serve as virtual base stations, and each non-GO UE, referred to as group member, is associated with a GO as its member. We propose a novel clustering algorithm in the framework of affinity propagation, which is a state-of-the-art message-passing technique with a graphical model approach developed in the machine learning field. Unlike conventional clustering approaches, the proposed clustering algorithm minimizes the total energy consumption while guaranteeing link reliability by adjusting the number of GOs. Simulation results verify that the IPSN optimized by the proposed clustering algorithm reduces the total energy consumption of the network by up to 31 % compared to the conventional clustering approaches.

[1]  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.

[2]  Francesco Chiti,et al.  Emergency satellite communications: research and standardization activities , 2015, IEEE Communications Magazine.

[3]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

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

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

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

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

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

[9]  Zhu Han,et al.  A Bayesian Overlapping Coalition Formation Game for Device-to-Device Spectrum Sharing in Cellular Networks , 2015, IEEE Transactions on Wireless Communications.

[10]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[11]  Yanhong Wang,et al.  Application of Multiscale Fiber Optical Sensing Network Based on Brillouin and Fiber Bragg Grating Sensing Techniques on Concrete Structures , 2012, Int. J. Distributed Sens. Networks.

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

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

[14]  Neelesh B. Mehta,et al.  Quick, Decentralized, Energy-Efficient One-Shot Max Function Computation Using Timer-Based Selection , 2015, IEEE Transactions on Communications.

[15]  Youtsos Anastasius Research and Standardization Activities on Neutron Methods at HFR Petten , 2005 .

[16]  Vijay Laxmi,et al.  Energy efficient LEACH-C protocol for wireless sensor network , 2013 .

[17]  Mohamed Hamdi,et al.  A Dynamic Distributed Key Tunneling Protocol for Heterogeneous Wireless Sensor Networks , 2012, 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications.

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

[19]  P. Sasikumar,et al.  K-Means Clustering in Wireless Sensor Networks , 2012, 2012 Fourth International Conference on Computational Intelligence and Communication Networks.

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

[21]  Sudip Misra,et al.  Bayesian Coalition Game-based optimized clustering in Wireless Sensor Networks , 2015, 2015 IEEE International Conference on Communications (ICC).

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

[23]  Adam Dunkels,et al.  Solar-aware clustering in wireless sensor networks , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[24]  Jiguo Yu,et al.  Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey , 2013, Comput. Commun..

[25]  Noureddine Boudriga,et al.  DynTunKey: a dynamic distributed group key tunneling management protocol for heterogeneous wireless sensor networks , 2014, EURASIP J. Wirel. Commun. Netw..

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

[27]  Saad Harous,et al.  LEACH-CKM: Low Energy Adaptive Clustering Hierarchy protocol with K-means and MTE , 2014, 2014 10th International Conference on Innovations in Information Technology (IIT).

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

[29]  Quanyan Zhu,et al.  Hierarchical Network Formation Games in the Uplink of Multi-Hop Wireless Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[30]  Hisao Ishibuchi,et al.  Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[31]  Ameer Ahmed Abbasi,et al.  A survey on clustering algorithms for wireless sensor networks , 2007, Comput. Commun..

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

[33]  Peng-Jun Wan,et al.  Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.

[34]  Zhu Han,et al.  Coalitional game theory for communication networks , 2009, IEEE Signal Processing Magazine.

[35]  Xiao Lu,et al.  Hierarchical cooperation for operator-controlled device-to-device communications: A layered coalitional game approach , 2015, 2015 IEEE Wireless Communications and Networking Conference (WCNC).

[36]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

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

[38]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..

[39]  Xuxun Liu,et al.  A Survey on Clustering Routing Protocols in Wireless Sensor Networks , 2012, Sensors.

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

[41]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[42]  Hee Yong Youn,et al.  A Novel Cluster Head Selection Method based on K-Means Algorithm for Energy Efficient Wireless Sensor Network , 2013, 2013 27th International Conference on Advanced Information Networking and Applications Workshops.

[43]  K. Raja Sekhar,et al.  A Neighbor Coverage based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad hoc Networks , 2014 .

[44]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[45]  Ru Li,et al.  Improved LEACH Routing Communication Protocol for a Wireless Sensor Network , 2012, Int. J. Distributed Sens. Networks.

[46]  Yueming Cai,et al.  A Cooperative Communication Scheme Based on Coalition Formation Game in Clustered Wireless Sensor Networks , 2012, IEEE Transactions on Wireless Communications.