Research progress of triangle counting in big data by Hongqiao JIN, Yihong DONG

“…Counting triangles in a graph is an important step to calculate the clustering coefficient and the transitivity ratio of the network，which is widely used in important role identification，spam detection，community discovery，biological detection etc.Counting triangles algorithm is mainly faced with two major problems of space-time consumption and accuracy.The representative algorithm of the counting triangles in the big graph was introduced.There existed two kinds of algorithms，which were exact counting algorithm and approximate counting algorithm.Exact counting algorithms were divided into internal memory algorithm，external memory algorithm and distributed algorithm.The space-time consumption or I/O consumption of exact counting algorithm was very large.Approximate counting algorithms were divided into auxiliary algorithm，static algorithm and streaming algorithm.In the end，the counting triangles algorithms were summarized.…”
Get full text

Distributed Constrained Optimization Algorithms for Drones by Hongzhe Liu

“…The primary objective is to develop a distributed algorithm capable of tackling this optimization problem. …”
Get full text

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

“…In a distributed algorithm, each process has access only to its local variables and incident edge parameters. …”
Get full text

Distributed Voronoi coverage algorithm in wireless sensor networks by XU Peng-fei1, CHEN Zhi-gang1, DENG Xiao-heng1

“…On the hypothesis conditions that wireless sensor networks only covered partial target region and the commu-nication radius was no less than twice of the sensing radius,a coverage-preserved and connected distributed Voronoi cov-erage algorithm was presented.Firstly,a method of detecting coverage redundancy sensors based on the local Voronoi re-gions was proposed,whose computational complexity was unconcerned with the density of sensors.Then,an en-ergy-prior self-scheduling strategy based on local Voronoi neighbors was proposed,where those sensors that were com-munication neighbors but not local Voronoi neighbors could synchronously execute self-scheduling,which improved the astringency of distributed scheduling.The simulation results show that the average number and coverage-degree of active sensors produced by the proposed algorithm are close to the centralized algorithm and smaller than the general distributed algorithm,while the proposed algorithm has more advantages in terms of active sensors’ average energy,scheduling as-tringency and runtime.…”
Get full text

Multicell adaptive power allocation scheme based on game theory in OFDMA systems by ZHANG Tian-kui, ZENG Zhi-min, ZHANG Ying-ying

“…The existence and uniqueness of Nash equilibrium of this game framework was analyzed, and a distributed algorithm for this game was proposed. The performance of the proposed scheme is verified by simulation in the single cell and multiple cell scenario respectively, as well as the influence of pricing factor on system performance. …”
Get full text

Consensus Information Filtering for Large-Scale Systems with Application to Heat Conduction Process by Liguo Zhang, Ying Lyu

“…The performance of the proposed distributed algorithm is compared to the centralized Kalman filtering.…”
Get full text

Two-layer distributed cache in D2D integrated fog-RAN by Chengyu XIA, Yanxiang JIANG

“…With the development of mobile communications,people’s demands for low-latency transmission networks are rapidly increasing.Fog-RAN,as a new architecture suitable for 5G/B5G communication networks,has broad application prospects.Considering the fog network of device-to-device communication,a two-layer distributed cache based on device-to-device communication and fog-RAN was proposed to reduce the delay for users to download files.Firstly,a closed-form solution of the download delay of the two-layer cache and a closed-form solution of the delay gain were obtained.On this basis,a distributed algorithm was designed to obtain the best cache strategy,so that each fog-based wireless access point (F-AP) or user equipment (UE) only needed to use the information of the neighboring devices to complete the caching.The simulation results show that the two-layer distributed cache can effectively reduce the download delay.…”
Get full text

Distributed Intrusion Detection of Byzantine Attacks in Wireless Networks with Random Linear Network Coding by Jen-Yeu Chen, Yi-Ying Tseng

“…In this paper, a distributed algorithm is developed to effectively detect, locate, and isolate the Byzantine attackers in a wireless ad hoc network with random linear network coding (RLNC). …”
Get full text

An Efficient Algorithm of Constructing Virtual Backbone Scheduling for Maximizing the Lifetime of Dual-Radio Wireless Sensor Networks by Bing-Hong Liu, Van-Trung Pham, Ngoc-Tu Nguyen

“…In addition, rather than proposing a centralized algorithm, a distributed algorithm, called a Dominating-Set-Based Algorithm (DSBA), is proposed for a wide range of wireless sensor networks to find a backbone when a new one is required. …”
Get full text

Hierarchical Node Replication Attacks Detection in Wireless Sensor Networks by Wassim Znaidi, Marine Minier, Stéphane Ubéda

“…In this work, we first introduce a new hierarchical distributed algorithm for detecting node replication attacks using a Bloom filter mechanism and a cluster head selection (see also Znaidi et al. (2009)). …”
Get full text

Resource scheduling strategy based on simulated annealing algorithm in hybrid D2D cellular networks by Xiang YU, Haibo ZHANG, Lu YANG

“…D2D communication is a short distance communication mode in the future 5G network.In the process of communication,the information is transmitted from the sender to the receiver directly,without the need to transmit through the base station.The introduction of D2D communication in the traditional cellular network can greatly improve the total throughput of the system,increase the utilization of spectrum resources and reduce the power consumption of the transmitter.A resource allocation method which was used in hybrid D2D cellular network was mainly introduced,spectrum resources was distributed by Lagrange multiplier method combined with simulated annealing algorithm,a consideration of channel capacity and energy consumption of the resource scheduling strategy based on simulated annealing algorithm was put forward.This algorithm was simulated by the simulation platform in Vienna,compared to the traditional greedy optimization algorithm,it can significantly increase the total system throughput and bandwidth utilization and reduce the power consumption.In addition,the distributed algorithm was adopted,that D2D users searched for a suitable target channel and calculated their transmit power according to the algorithm steps,which reduced the signaling overhead of the base station.…”
Get full text

Cooperative Localization of Multi-UAVs via Dynamic Nonparametric Belief Propagation under GPS Signal Loss Condition by Jiuqing Wan, Liping Zhong, Fan Zhang

“…Furthermore, dNBP provides the basis for distributed algorithm in which messages are exchanges between neighboring UAVs. …”
Get full text

Fuzzy Rules for Ant Based Clustering Algorithm by Amira Hamdi, Nicolas Monmarché, Mohamed Slimane, Adel M. Alimi

“…Our proposed approach, called F-ASClass algorithm, is a distributed algorithm inspired by foraging behavior observed in ant colonyT. …”
Get full text

Low-latency algorithm for improving data persistence in mobile low-duty-cycle wireless sensor network by Chan JIANG, Taoshen LI, Junbin LIANG

“…,the probability that all data can be recovered after some nodes die in the networks) is low.A distributed algorithm named LT-MDS for improving data persistence in MLDC-WSN was proposed.The algorithm used a new infectious data dissemination method to transmit the data,which enabled the data to be received by almost all the mobile nodes in a network with low latency and improved the reliability of the network.When a node receives the data,it would use LT (Luby transform) codes to encode and save them.By this way,the nodes with limited storage spaces can save more data information.Theoretical analyses and simulations show that LT-MDS can complete the process of data dissemination and preservation with low latency,and it can achieve high data persistence.…”
Get full text

Distributed nash equilibrium seeking for heterogeneous second-order nonlinear noncooperative games with communication delays by Rui Yu, Li Li, Qianyao Wang, Xianchao Zhang, Sixu Lu

“…Then, considering two different types of communication delays, respectively slowly-varying communication delays and fast-varying communication delays, the distributed algorithm is designed to seek the Nash equilibrium (NE). …”
Get full text

Adaptive Probabilistic Proactive Routing for Dense MANETs by Abdelfettah Belghith, Mohamed Amine Abid, Adel Ben Mnaouer

“…Then, we present a distributed algorithm to collect the cartography of the network. …”
Get full text

A Phoenix++ Based New Genetic Algorithm Involving Mechanism of Simulated Annealing by Luokai Hu, Jin Liu, Chao Liang, Fuchuan Ni, Hang Chen

“…Phoenix++ implements the MapReduce programming model that processes and generates large data sets with our parallel, distributed algorithm on a cluster. The experiments indicate that the convergence speed of GA algorithm is significantly faster after adding the simulated annealing algorithm on Phoenix++ platform.…”
Get full text

Distributed Joint Cluster Formation and Resource Allocation Scheme for Cooperative Data Collection in Virtual MIMO-Based M2M Networks by Xi Luan, Jianjun Wu, Yuxin Cheng, Haige Xiang

“…Since the optimization problem on this issue is an NP-hard problem, a feasible joint scheme for the cluster formation and resource allocation is proposed in this paper, which is carried out via coalition formation game with a distributed algorithm. This scheme can reduce the complexity while keeping an attractive performance. …”
Get full text

Optimizing Spectrum Trading in Cognitive Mesh Network Using Machine Learning by Ayoub Alsarhan, Anjali Agarwal

“…Another contribution is proposing a new distributed algorithm to manage spectrum sharing among PUs. …”
Get full text

A Decentralised Task Mapping Approach for Homogeneous Multiprocessor Network-On-Chips by Peter Zipf, Gilles Sassatelli, Nurten Utlu, Nicolas Saint-Jean, Pascal Benoit, Manfred Glesner

“…The results show that the mapping quality achieved by our distributed algorithm is within 25% of that of the exact algorithm. …”
Get full text