Maintaining throughput network connectivity in ad hoc networks

This paper focuses on the challenge of maintaining reliable connectivity in an ad hoc network, where interference is possible. To cope with such interference, the paper introduces throughput connectivity and weighted throughput connectivity. Throughput connectivity reflects the possibility of establishing communication between nodes for given a signal power level, while weighted throughput connectivity associates the throughput as a weight in the associated network graph. Throughput connectivity is less sensitive to network's parameters than the one based on weighted throughput connectivity. It makes maintaining throughput connectivity protocol less resource consuming (say, by sending less frequently channel state information (CSI)). Whereas, weighted throughput protocol is more efficient in power allocation due to employing a continuous scale in Laplacian matrix. To illustrate these notions, two approaches to maximize connectivity were considered: (a) an adaptive transmission protocol that re-allocates transmission power between nodes, and (b) detecting and eliminating a malicious threat to maintain accumulated connectivity over time slots. The first problem was modeled by a maxmin problem, and solved by Semi-Definite Programming. The second problem was modeled by a stochastic game and solved explicitly.

[1]  Mohamed-Slim Alouini,et al.  On the Energy Detection of Unknown Signals Over Fading Channels , 2007, IEEE Transactions on Communications.

[2]  Sergio Barbarossa,et al.  Distributed Estimation and Control of Algebraic Connectivity Over Random Graphs , 2013, IEEE Transactions on Signal Processing.

[3]  Andrey Garnaev,et al.  Dependence of optimal monitoring strategy on the application to be protected , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[4]  H. V. Trees.  Detection, Estimation, And Modulation Theory , 2001 .

[5]  Ali Jadbabaie,et al.  Decentralized Control of Connectivity for Multi-Agent Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[6]  Stephen P. Boyd,et al.  Growing Well-connected Graphs , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[7]  Mehran Mesbahi,et al.  On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian , 2006, IEEE Transactions on Automatic Control.

[8]  Morteza Romoozi,et al.  Improvement of Connectivity in Mobile Ad Hoc Networks by Adding Static Nodes Based on a Realistic Mobility Model , 2009, 2009 Second International Conference on Machine Vision.

[9]  K. J. Ray Liu,et al.  An anti-jamming stochastic game for cognitive radio networks , 2011, IEEE Journal on Selected Areas in Communications.

[10]  M. Dufwenberg.  Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[11]  Andrey Garnaev,et al.  Anti-jamming Strategies: A Stochastic Game Approach , 2014, MONAMI.

[12]  Cristina Comaniciu,et al.  Wireless Networks: Multiuser Detection in Cross-Layer Design , 2005 .

[13]  K. J. Ray Liu,et al.  Improving Connectivity via Relays Deployment in Wireless Sensor Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[14]  Andrey Garnaev,et al.  Bandwidth scanning involving a Bayesian approach to adapting the belief of an adversary's presence , 2014, 2014 IEEE Conference on Communications and Network Security.

[15]  H. Urkowitz.  Energy detection of unknown deterministic signals , 1967 .

[16]  Andrey Garnaev,et al.  Anti-jamming Strategy Versus a Low-Power Jamming Attack When Intelligence of Adversary’s Attack Type is Unknown , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[17]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[18]  Wade Trappe,et al.  Jammer forensics: Localization in peer to peer networks based on Q-learning , 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[19]  W. Marsden.  I and J , 2012 .

[20]  B. Borchers.  CSDP, A C library for semidefinite programming , 1999 .

[21]  Tansu Alpcan,et al.  Stochastic games for security in networks with interdependent nodes , 2009, 2009 International Conference on Game Theory for Networks.

[22]  Zhu Han,et al.  Optimization of MANET connectivity via smart deployment/movement of unmanned air vehicles , 2009, IEEE Transactions on Vehicular Technology.

[23]  Kim-Chuan Toh,et al.  SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .

[24]  Kim-Chuan Toh,et al.  Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..

[25]  J. Alberto Bandoni,et al.  Eigenvalue And Singular Value Optimization , 2003 .

[26]  Masakazu Kojima,et al.  SDPA-M (SemiDefinite Programming Algorithm in MATLAB) User's Manual — Version 6.2.0 , 2003 .

[27]  M. Melamed.  Detection , 2021, SETI: Astronomy as a Contact Sport.

[28]  A. Gualtierotti.  H. L. Van Trees, Detection, Estimation, and Modulation Theory, , 1976 .

[29]  Andrey Garnaev,et al.  Stationary Equilibrium Strategies for Bandwidth Scanning , 2013, MACOM.

[30]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[31]  Gruia Calinescu,et al.  Stochastic Strategic Routing Reduces Attack Effects , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[32]  Fabio Morbidi.  On the control of the algebraic connectivity and clustering of a mobile robotic network , 2013, 2013 European Control Conference (ECC).