Multi-Objective-Based Multi-Heterogeneous- Agent Deep Reinforcement Learning for Minimization of Voltage Deviation and Operation Cost in Active Distribution System by Anurak Deanseekeaw, Watcharakorn Pinthurat, Boonruang Marungsri

“…Specifically, it delivers node voltage deviations close to nominal values, with an average deviation of 0.0042 p.u. and a standard deviation of 0.0065 p.u. …”
Get full text

Path planning algorithm for WCE with joint energy replenishment and data collection based on multi-objective optimization by Zhenchun WEI, Renhao SUN, Zengwei LYU, Jianghong HAN, Lei SHI, Junyi XU

“…Considering limited energy of the wireless charging equipment (WCE) in wireless rechargeable sensor network,an energy replenishment strategy and a data collection strategy are designed.On the basis of these,a path planning model for WCE with functions of joint energy replenishment and data collection based on multi-objective optimization is constructed with two optimization objectives,maximizing the total energy utility of WCE and minimizing the average delay of data transmission of all the sensor nodes in the network.To deal with it,a multi-objective ant colony optimization algorithm based on elitist strategy was proposed,where the state transition strategy and the pheromone updating strategy were improved.Then,the Pareto set was obtained in terms of this multi-objective optimization problem.The parameter setting of ant colony algorithm’s effects on the proposed algorithm were analyzed under 20 sensor nodes.50 groups of contrastive experiments show that the average number of energy utilization obtained by ES-MOAC algorithm is 4.53% higher than that of NSGA-II algorithm.The average number of average delay of all node data transmission obtained by ES-MOAC algorithm is 5.12% lower than that of NSGA-II algorithm.…”
Get full text

Primary-user behavior based joint routing and channel allocation algorithm in cognitive radio networks by Jing LIU, Pin-yi REN, Shao-li XUE, Chao ZHANG

“…To resolve the unstable routing problem due to the variation of spectrum availability caused by primary users’ behaviors in cognitive radio networks (CRN),a primary-user behavior based joint routing and channel allocation (PUB-JRCA) algorithm was proposed.The PUC-JRCA algorithm characterized the primary-user behavior by using the call-based model.According to the route discovery mechanism in the dynamic source routing protocol,the destination node selected the route which received the least impact from primary-user behaviors after receiving a number of route requests.Then,the destination sent back the route reply packet (RREP) along the selected route,and the channel allocation was performed when the RREP passed each node on this route.Theoretic analyses prove that the expected available transmission time for the packet delivery is inversely proportional to the probability that PU is active.Moreover,the computational complexity of the proposed algorithm is proportional to the number of nodes in the CRN.Simulation results show that the proposed algorithm has higher packet delivery ratio and lower average packet delay than the Gymkhana routing scheme.…”
Get full text

Does Long-Term Sport Practice Facilitate the Development of Idiopathic Bradycardia Requiring Early Pacemaker Implantation During the Course of Life? by Sergei Bondarev, Leonardo Brotto, Francesca Graziano, Alberto Cipriani, Domenico Corrado, Alessandro Zorzi

“…<i>Conclusions:</i> In a cohort of patients who received a PM for bradyarrhythmia before the age of 70 years old in the absence of secondary causes, former athletes were implanted on average ≈5 years before non-athletes. This may suggest a contributing role of cumulative sports activity volume in the development of idiopathic sinus/AV node dysfunction.…”
Get full text

Evolutionary Cost Analysis and Computational Intelligence for Energy Efficiency in Internet of Things-Enabled Smart Cities: Multi-Sensor Data Fusion and Resilience to Link and Devi... by Khalid A. Darabkh, Muna Al-Akhras

“…Our protocol employs hierarchical Data Fusion Head (DFH), relay DFHs, and marine predators algorithm, the latter of which is a reliable metaheuristic algorithm which incorporates a fitness function that optimizes parameters such as how closely the Sensor Nodes (SNs) of a data fusion group (DFG) are gathered together, the distance to the sink node, proximity to SNs within the data fusion group, the remaining energy (RE), the Average Scale of Building Occlusions (ASBO), and Primary DFH (PDFH) rotation frequency. …”
Get full text

Energy-efficient cluster head selection in Internet of Things networks using an optimized evaporation rate water-cycle algorithm by Cong Lv, Guiling Long

“…Abstract This paper presents a new scheme for energy-efficient clustering in Internet of Things (IoT) networks by employing an optimized evolutionary rate water cycle algorithm (OERWCA), aiming to address crucial issues, such as energy conservation measured through average energy consumption per node, network longevity quantified by total operational rounds until node depletion, and throughput as an indicator of data transmission efficiency. …”
Get full text

A comparative analysis of the most common deterministic methods for the calculation of electricity losses in industrial networks by E. I. Gracheva, Z. M. Shakurova, R. E. Abdullazyanov

“…It is shown that for the method of graphical integration, initial data on the dependences of load schedules for each network element are required, and the method of calculating losses by average node loads can be used in networks with relatively constant loads. …”
Get full text

Penerapan Mekanisme Komunikasi Multi-hop pada Bluetooth Low Energy by Agung Setia Budi, Muhammad Hanif Azhar Efendi, Adhitya Bhawiyuga, Mochammad Hannats Hanafi Ichsan

“…The experiment result shows that the transmissionof data from a Sensor Node to a Sink Node through two Relay Nodes (3-hops) needs the average time of 1846,4 ms. …”
Get full text

Research on routing strategy of wireless sensor network in intelligent substation based on improved EEUC algorithm by LIU Yuming, CUI Chen, SUN Yanzhi, LI Xu, TIAN Feng

“…The results show that compared with conventional routing algorithms, the proposed method can effectively balance network energy consumption and improve cluster head node energy consumption, average node energy consumption, network lifecycle, and throughput, which has certain application value.…”
Get full text

A Framework for Risk Evolution Path Forecasting Model of Maritime Traffic Accidents Based on Link Prediction by Shaoyong Liu, Jian Deng, Cheng Xie

“…A risk evolution network model was then constructed, within which the importance of each risk factor node was evaluated. Subsequently, several node similarity indices based on node importance were proposed. …”
Get full text

A multi strategy bidirectional RRT* algorithm for efficient mobile robot path planning by Yourui Huang, Wenxin Jiang, Shanyong Xu

“…Simulation results in five typical environments show that, compared with RRT*, BI-RRT*, APF-RRT*, BI-APF-RRT*, and GB-RRT*, MS-BI-RRT* algorithm reduces the average execution time by 77.50%, decreases the number of nodes by 76.41%, shortens the path length by 4.37%, and achieves a 100% success rate in all environments. …”
Get full text

Reliable heuristic mapping method for survivable virtual network by Qiang ZHU, Hui-qiang WANG, Chun-guang MA, Guang-sheng FENG, Hong-wu LV

“…For reliable virtual network mapping problem,virtual network survivability constraints are introduced to ensure that the rest of the mapped virtual network remains connected under a single node failure condition in the substrate network,which makes sure the completeness of the virtual network and continuity of services.In order to reduce cost of the substrate network,the reliable heuristic mapping problem is considered as an integer linear programming model and a reliable heuristic mapping method for survivable virtual network is proposed to solve the problem.The simulation results show that average usage of links is reduced and the success rate,average revenue of mapping,recovery success rate of virtual network are increased compared with the existing reliable mapping algorithms.…”
Get full text

Level Set Based Coverage Holes Detection and Holes Healing Scheme in Hybrid Sensor Network by Xiaosheng Yu, Chengdong Wu, Dongyue Chen, Nan Hu

“…This algorithm could leverage mobility to optimize the average coverage rate and the average movement distance of the mobile nodes. …”
Get full text

Local congestion control algorithm with fair channel allocation by Geng-ming ZHU, Zhi-qiang WANG, Zhe-tao LI, Ren-fa LI

“…A local congestion control algorithm with fair channel allocation (FCA) was presented to mitigate local congestion as well as to improve the fairness of channel utilization.In order to decrease the extra communication overhead for obtaining the real-time buffer length of neighbors and improve the accuracy of congestion detection model based on buffer occupancy of single node，FCA presented a new model considers the total buffer length of neighbors with predict-based mechanism for real-time buffer occupancy and the average transmission time of packet.To avoid deteriorating congestion with an explicit notified package，FCA embedded an additional node address to the ACK control frame to carry congestion information.During the congestion alleviation stage，FCA presented a fair channel allocation mechanism based on real-time buffer occupancy and queue priority to prevent some nodes from overflowing resulting in package loss due to the growth of buffer fast.Simulation results show that the proposed protocol has comparative advantages compare with 802.11，CODA and PCCP in terms of collision，package delivery ratio，throughput and fairness.…”
Get full text

Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model by Wenbin Liu, Bo Yang, Zhili Chen

“…First, the algorithm partitions the network into square cells according to the communication range of a sensor. Second, a node is selected randomly as the aggregated node to receive the data from the other nodes in the same cell. …”
Get full text

L2ER: Low-Latency and Energy-Based Routing Protocol for Cognitive Radio Ad Hoc Networks by Rana Asif Rehman, Byung-Seo Kim

“…Delay and node energy are important factors in ad hoc networks in which devices have limited power. …”
Get full text

Fatigue Characterization of EEG Brain Networks Under Mixed Reality Stereo Vision by Yan Wu, Chunguang Tao, Qi Li

“…By analyzing the node and edge properties at a local level, the average difference in betweenness centrality, clustering coefficients, and nodal efficiency across the three EEG frequency bands was computed to find significant brain regions. …”
Get full text

Real-time Evaluation Model for Metro Station Passenger Flow Streamline Congestion State by SHI Pingcui, HU Hua, HAO Yanxi, FANG Yong, LIU Zhigang

“…[Method] Passenger flow streamline facilities are categorized into node facilities and passageway facilities. Based on the spatiotemporal propagation characteristics of streamline congestion and the feasibility of extracting passenger flow parameters via video recognition technology, three evaluation indicators―average delay time at all node facilities, queue space overflow rate at all node facilities, and variation coefficient in walking speed across all passageway facilities―are defined and formulated. …”
Get full text

Diversified caching algorithm with cooperation between edge servers by Yongxuan Sang, Yukang Guo, Bo Wang, Ying Song

“…After the service request reaches the server, if it misses, the proposed algorithm will judge whether the neighbor node can provide services through the cache information of the neighbor node, and then the server and the neighbor node jointly decide how to cache the service. …”
Get full text

FORECASTING THE GROUNDWATER LEVEL OF CEMENT RAW MATERIALS DEPOSIT BASED ON DYNAMIC NEIGHBORHOOD MODELS by I. A. Sedykh

“…The definition of a dynamic neighborhood model with variable hierarchical neighborhoods is given, differing by time-varying double-level neighborhood communications between the first- and second-level nodes. At each next discrete instant of time, the neighborhood model nodes change their state under the influence of the online parameters and node states included in their neighborhood. …”
Get full text