Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation Problems by Ajay D. Kshemkalyani, Anshuman Misra

“…These problems are the following: mutual exclusion, global snapshot recording, termination detection, deadlock detection, predicate detection, causal ordering, spanning tree construction, minimum spanning tree construction, all–all shortest paths computation, and maximal independent set computation. In a distributed algorithm, each process has access only to its local variables and incident edge parameters. …”
Get full text

Energy-Aware Distributed Intelligent Data Gathering Algorithm in Wireless Sensor Networks by Rongbo Zhu, Yingying Qin, Jiangqing Wang

“…In cluster formation phase, an energy-efficient distributed clustering scheme is proposed to form a coverage-efficient WSN, which constructs a minimum connected dominating set (MCDS) based on maximal independent sets (MISs) in distributed and localized manner, and the node with more power is selected to be the cluster head in turn to prolong the network lifetime. …”
Get full text

Counting Periodic Points in Parallel Graph Dynamical Systems by Juan A. Aledo, Ali Barzanouni, Ghazaleh Malekbala, Leila Sharifan, Jose C. Valverde

“…In order to do this, we use methods based on the notions of minimal dominating sets and maximal independent sets in graphs, respectively. More specifically, we find a lower bound for the number of fixed points and a lower bound for the number of 2-periodic points of F. …”
Get full text