INDIGO: An In Situ Distributed Gossip Framework for Sensor Networks by Paritosh Ramanan, Goutham Kamath, Wen-Zhan Song

“…With the onset of Cyber-Physical Systems (CPS), distributed algorithms on Wireless Sensor Networks (WSNs) have been receiving renewed attention. …”
Get full text

Cooperative Downloading in Mobile Ad Hoc Networks: A Cost-Energy Perspective by He Li, Yang Yang, Xuesong Qiu, Zhipeng Gao, Guizhen Ma

“…This paper proposes a cost distribution (OCD) algorithm and a content distribution algorithm based on auction (OCDA) for mobile ad hoc networks based on relative location of nodes and local optimization theory. …”
Get full text

A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling by Ruochen Liu, Chenlin Ma, Wenping Ma, Yangyang Li

“…Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. …”
Get full text

EDECO: An Enhanced Educational Competition Optimizer for Numerical Optimization Problems by Wenkai Tang, Shangqing Shi, Zengtong Lu, Mengying Lin, Hao Cheng

“…To this end, this paper proposes an enhanced educational competition optimizer, named EDECO, by incorporating estimation of distribution algorithm and replacing some of the best individual(s) using a dynamic fitness distance balancing strategy. …”
Get full text

A Globally Convergent Parallel SSLE Algorithm for Inequality Constrained Optimization by Zhijun Luo, Lirong Wang

“…A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. …”
Get full text

Survey on SSDF attack and defense for distributed cooperative cognitive radio by Guangyue LU, Hang SU

“…Cooperative spectrum sensing (CSS) improves the reliability of spectrum sensing,however,it is susceptible to spectrum sensing data falsification (SSDF) due to the fusion mechanism.To insight into the current research and development trend of defense strategy against the SSDF attack,several typical distributed strategies were concluded and the types of distributed algorithms were analyzed in several aspects.Finally,the future research of SSDF distributed defense strategy was prospected based on the problems found in the current research.…”
Get full text

Experimental Evaluation of Optimal Rate Delay and Power Allocation Algorithm in Wireless Control Networks by Muhammad Tahir, S. K. Mazumder

“…The network utility maximization (NUM) framework, widely used for wireless networks to achieve optimal resource allocation, has led to both centralized as well as distributed algorithms. We compare the convergence performance of centralized realization of the NUM framework with that of distributed realization by implementing the algorithms using a hardware test-bed. …”
Get full text

Clustered P2P based resource query and dissemination for multi-hop wireless mesh network by Ji-gang WEN, Kun XIE, Gao-gang XIE, Guang-xing ZHANG, Ren-fa LI

“…According to the character of mesh topology and character of the different types of mesh nodes,the multi-hop wireless mesh network was modeled as clustered P2P.Moreover,in order to save the message bandwidth,the Bloom filter as the message to represent the resource list abstract was used,and the message was transmitted among the constructed P2P clusters.To minimize the downloading interruption due to mobility of clients,a resource-density-sensitive resource query and dissemination algorithm in which the query was transmitted to the cluster that had the maximum number of replica resources was proposed.The simulation results show that the proposed resource query and distribution algorithm can provide appealing resource downloading performance.…”
Get full text

Un Algoritmo de Estimación de Distribuciones copulado con la Distribución Generalizada de Mallows para el Problema de Ruteo de Autobuses Escolares con Selección de Paradas by Ricardo Pérez-Rodríguez, Arturo Hernández-Aguirre

“…Palabras clave: Algoritmo de estimación de distribuciones, distribución de Mallows, problema de ruteo de vehículos, problema de ruteo de autobuses escolares, Keywords: Estimation of distribution algorithm, Mallows distribution, vehicle routing problem, school bus routing problem…”
Get full text

Adaptive federated learning secure aggregation scheme based on threshold homomorphic encryption by Zhuo MA, Jiayu JIN, Yilong YANG, Yang LIU, Zuobin YING, Teng LI, Junwei ZHANG

“…Aiming at the communication bottleneck problem when the current federated learning security aggregation algorithm was applied in a complex network environment, an adaptive federated learning secure aggregation scheme based on threshold homomorphic encryption was proposed.While protecting gradient privacy, users adaptively compress gradients based on the current available bandwidth, greatly reduced communication overhead for federated users.Furthermore, the new dynamic decryption task distribution algorithm and gradient combination algorithm were designed in the phase of aggregation gradient decryption, which relieved the user’s uplink communication pressure.The experimental results show that the proposed scheme can sharply reduce the amount of communication to 4% compared with the existing federated learning scheme with a trivial model accuracy loss of 1%.…”
Get full text

Resource allocation mechanism in the TWDM-PON and C-RAN joint architecture with hybrid energy supply by Ruyan WANG, Ningning XU

“…Aiming at the problems of low resource utilization rate,high energy consumption and poor user service quality in the existing virtualized Cloud Radio Access Network,an energy-aware virtualized resource allocation mechanism with hybrid energy supply was proposed.According to the energy sources and energy consumption of different network devices,energy arrival and energy consumption models were established.Furthermore,under the premise of guaranteeing the quality of user services,considering proportional fairness and energy consumption optimization,distributed algorithms based on asynchronous update were used to allocate resources and harvested energy for different types of virtual cloud radio access networks and user virtual base stations to effectively improve the energy efficiency of network.The simulation results show that the proposed resource allocation mechanism can reduce energy consumption while effectively reducing the latency and improving the throughput.…”
Get full text

Distributed Vector Quantization over Sensor Network by Chunguang Li, Yiliang Luo

“…Simulation results show that both of the proposed distributed algorithms have good performance.…”
Get full text

An Adaptive Subspace Similarity Search Approach by Jianxin Ren, Huahui Chen

“…In recent years，such database fields as multimedia information retrieval，similarity join and time series matching，where similarity search has attracted much attention.Existing researches mostly compute nearest neighbor to solve problems about search target set，such as kNN and kNNJ，by metric distance functions in the Euclidean space.But some studies showed that high dissimilarity dimensions had got great effect on the accuracy of answer and flexibility and robustness still were lacked in corresponding solutions.Thus centralized dynamic subspace or partial dimensions similarity search problem and algorithms were proposed at first.Furthermore，with the emerge of very large dataset，centralized algorithms can，t extend very well.Finally，the distributed ones under hadoop framework were proposed.Experiments prove that distributed algorithms outperform centralized ones in the performance without accuracy loss.…”
Get full text

Decentralized Algorithm for Sensors Fault Detection in HVAC Systems by Wang Shiqiang, Jiang Ziyan, Xing Jianchun, Dai Yunchuang, Yang Qiliang

“…Unlike traditional centralized and distributed algorithms, this algorithm does not need to build a central node, regardless of increasing hardware or time redundancy, with good parallelism and simplicity. …”
Get full text

A Comparative Study of EAG and PBIL on Large-Scale Global Optimization Problems by Imtiaz Hussain Khan

“…Estimation of Distribution Algorithms (EDAs) use global statistical information effectively to sample offspring disregarding the location information of the locally optimal solutions found so far. …”
Get full text

CT-TDMA:efficient TDMA protocol for underwater sensor networks by Lu HONG, Feng HONG, Zheng-bao LI, Zhong-wen GUO

“…Aimed at underwater acoustic sensor networks(UWSN),a novel sender based conflict model with the schemes of allocating continuous time was presented,including local conflict graph(LCG)and a distribute algorithm to generate LCG.Moreover,CT-TDMA,an efficient TDMA protocol based on the conflict model was also proposed,which used heuristic priority rules to allocate transmitting moments for all nodes.CT-TDMA exploits the diversity of propagation delay of different links in UWSN to decrease the idle time between packets at the same receiving node,which helps in improving the throughput.And a heuristic schedule algorithm is applied to shorten the process of allocating continuous time for each node.Simulation results show that,compared with traditional TDMA protocols such as ST-MAC,network throughput of CT-TDMA has increased 20% and end to end delay has decreased 18%;compared to the theoretically optimal scheme with global knowledge,CT-TDMA has achieved 80% network throughput and the end to end delay is only 12% longer.…”
Get full text

CT-TDMA:efficient TDMA protocol for underwater sensor networks by Lu HONG, Feng HONG, Zheng-bao LI, Zhong-wen GUO

“…Aimed at underwater acoustic sensor networks(UWSN),a novel sender based conflict model with the schemes of allocating continuous time was presented,including local conflict graph(LCG)and a distribute algorithm to generate LCG.Moreover,CT-TDMA,an efficient TDMA protocol based on the conflict model was also proposed,which used heuristic priority rules to allocate transmitting moments for all nodes.CT-TDMA exploits the diversity of propagation delay of different links in UWSN to decrease the idle time between packets at the same receiving node,which helps in improving the throughput.And a heuristic schedule algorithm is applied to shorten the process of allocating continuous time for each node.Simulation results show that,compared with traditional TDMA protocols such as ST-MAC,network throughput of CT-TDMA has increased 20% and end to end delay has decreased 18%;compared to the theoretically optimal scheme with global knowledge,CT-TDMA has achieved 80% network throughput and the end to end delay is only 12% longer.…”
Get full text

Routing-Aware Clustering Algorithms for Two-Tiered Sensor Networks by Ataul Bari, Fangyun Luo, Arunita Jaekel, Subir Bandyopadhyay

“…In this paper, we have proposed two routing-aware, distributed algorithms for assigning sensor nodes to clusters in two-tiered networks. …”
Get full text

Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks by Manuel Blanco Abello, Zbigniew Michalewicz

“…In particular, McBAR is compared to a technique called, Estimation Distribution Algorithm (EDA). As with McBAR, EDA is applied to solve the dynamic problem, an application that is unique in the literature.…”
Get full text

A Systematic Study on the Extraction and Image Reproduction of Ceramic Sculpture Artworks by Yuhong Wang

“…The results show that the feature points detected by the one-dimensional normal distribution algorithm are on average 0.1%, 0.5%, 1.7%, 4.4%, and 9.2%. …”
Get full text