Orchestrating Resilient Communication Topology for Smart Connected Cities

Author(s):  
Chaitanya Kapoor ◽  
R V Pankajavalli ◽  
Kiran Khanna ◽  
Dasari Hasmita ◽  
Athira Nair K ◽  
...  
2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xiaochu Wang ◽  
Kaichun Zhao ◽  
Zheng You ◽  
Lungui Zheng

In order to avoid a potential waste of energy during consensus controls in the case where there exist measurement uncertainties, a nonlinear protocol is proposed for multiagent systems under a fixed connected undirected communication topology and extended to both the cases with full and partial access a reference. Distributed estimators are utilized to help all agents agree on the understandings of the reference, even though there may be some agents which cannot access to the reference directly. An additional condition is also considered, where self-known configuration offsets are desired. Theoretical analyses of stability are given. Finally, simulations are performed, and results show that the proposed protocols can lead agents to achieve loose consensus and work effectively with less energy cost to keep the formation, which have illustrated the theoretical results.


2021 ◽  
Author(s):  
Cheng-Wei Ching ◽  
Hung-Sheng Huang ◽  
Chun-An Yang ◽  
Yu-Chun Liu ◽  
Jian-Jhih Kuo

Author(s):  
Natarajan Meghanathan

The authors propose a generic graph intersection-based benchmarking algorithm to arrive at upper bounds for the lifetimes of any communication topology that spans the entire network of secondary user (SU) nodes in a cognitive radio ad hoc network wherein the SUs attempt to access the licensed channels that are not in use. At any time, instant t when we need a stable communication topology spanning the entire network, the authors look for the largest value of k such that the intersection of the static SU graphs from time instants t to t+k, defined as the mobile graph Gt...t+k(SU) = Gt(SU) ∩ Gt+1(SU) ∩ .... ∩ Gt+k(SU), is connected and Gt...t+k+1(SU) is not connected. The authors repeat the above procedure for the entire network session to determine the sequence of longest-living instances of the mobile graphs and the corresponding instances of the topology of interest such that the number of topology transitions is the global minimum. They prove the theoretical correctness of the algorithm and study its effectiveness by implementing it to determine a sequence of maximum lifetime shortest path trees.


Sign in / Sign up

Export Citation Format

Share Document