检索结果-内蒙古大学图书馆

A Simple distributed Channel Allocation algorithm for D2D Communication Pairs

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2018年第11期67卷 10960-10969页

作者： Zhao, Haitao Ding, Kaiqi Sarkar, Nurul, I Wei, Jibo Xiong, Jun Natl Univ Def Technol Coll Elect Sci Changsha 410073 Hunan Peoples R China Auckland Univ Technol Dept IT & Software Engn Auckland 1142 New Zealand

Device-to-device (D2D) communication is a promising technology to achieve high spectrum efficiency, low energy consumption, and enhanced system capacity. In D2D communications, the channel allocation plays a crucial role to avoid interference, which usually involves a centralized coordination. With the increasing number of devices or terminals as well as the dynamic network environment, the computation and information exchange during the centralized channel allocation would be a big burden for wireless networks. We tackle this problem by proposing a distributed channel allocation method with blind rendezvous to enable collision-free concurrent transmissions over multiple channels. Specifically, we first present a receiver-oriented channel allocation algorithm to reduce interference and then propose a sender-jump blind channel rendezvous algorithm based on channel hopping techniques. The proposed channel allocation method allows each sender-receiver pair to obtain an appropriate channel for collision-free transmissions requires no centralized coordination. Theoretical analysis, simulation results and test-bed experiments validate the proposed solution. Our findings reported in this paper may help network designers to contribute in the development of high-density Internet of Things.

关键词： Multi-channel network device-to-device (D2D) communication channel allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Nash equilibrium seeking for individual linear dynamics subject to limited communication resources

引用

SYSTEMS & CONTROL LETTERS 2022年 161卷 105162-105162页

作者： Liu, Pin Xiao, Feng Wei, Bo Yu, Mei North China Elect Power Univ State Key Lab Alternate Elect Power Syst Renewabl Beijing 102206 Peoples R China North China Elect Power Univ Sch Control & Comp Engn Beijing 102206 Peoples R China

In this paper, non-cooperative game problems with individual linear dynamics of players are addressed. In the case of limited communication resources, event-triggering mechanisms equip players to determine event instants. A period of dwell time is enforced after each event. In the dwell time, monitoring event-triggering conditions is avoided for each player, which saves resources. After the dwell time, each player triggers the broadcast to its neighbors once a fully distributed event-triggering condition is satisfied. Along this line, the Zeno behavior is excluded. The proposed control algorithm with discrete-time communications converges the systems to an NE. The effectiveness of the proposed control algorithms and event-triggering mechanisms is demonstrated through simulations. (c) 2022 Elsevier B.V. All rights reserved.

关键词： distributed algorithm Nash equilibrium Partial information Discrete-time communications

来源：评论

学校读者我要写书评

暂无评论

DSCAN: distributed Structural Graph Clustering for Billion-Edge Graphs 31st

DSCAN: Distributed Structural Graph Clustering for Billion-E...

引用

31st International Conference on Database and Expert Systems Applications (DEXA)

作者： Shiokawa, Hiroaki Takahashi, Tomokatsu Univ Tsukuba Ctr Computat Sci Tsukuba Ibaraki Japan Univ Tsukuba Grad Sch SIE Tsukuba Ibaraki Japan

ISBN: (纸本)9783030590031;9783030590024

The structural graph clustering algorithm (SCAN) is an essential graph mining tool that reveals clusters, hubs, and outliers included in a given graph. Although SCAN is used in various applications, it has two serious drawbacks when handling large graphs. First, SCAN is computationally expensive since it requires iterative computations for all nodes and edges. Second, SCAN is not designed to handle large graphs that cannot fit in the main memory. This paper presents a distributed structural graph clustering algorithm, DSCAN, to address the aforementioned problems on a cluster of computers. DSCAN employs edge pruning techniques to reduce the communication and computation overheads of the distributed algorithm. Our extensive experiments on real-world billion-edge graphs demonstrate that DSCAN outperforms state-of-the-art algorithms in terms of running time even though DSCAN outputs the same clusters as SCAN.

关键词： Graph Clustering distributed algorithm Community detection

来源：评论

学校读者我要写书评

暂无评论

distributed Detection of Malicious Attacks on Consensus algorithms with Applications in Power Networks 7

Distributed Detection of Malicious Attacks on Consensus Algo...

引用

7th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Patel, Sourav Khatana, Vivek Saraswat, Govind Salapaka, Murti, V Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA Natl Renewable Energy Lab Golden CO USA

ISBN: (纸本)9781728159539

Consensus-based distributed algorithms are well suited for coordination among agents in a cyber-physical system. These distributed schemes, however, suffer from their vulnerability to cyber attacks that are aimed at manipulating data and control flow. In this article, we present a novel distributed method for detecting the presence of such intrusions for a distributed multi-agent system following ratio consensus. We employ a Max-Min protocol to develop low cost, easy to implement detection strategies where each participating node detects the intrusion independently, eliminating the need for a trusted certifying agent in the network. The effectiveness of the detection method is demonstrated by numerical simulations on a 1000 node network to demonstrate the efficacy and simplicity of implementation.

关键词： Ratio consensus distributed intruder detection cybersecurity smart microgrids distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

USTEP: Unfixed Search Tree for Efficient Log Parsing 21

USTEP: Unfixed Search Tree for Efficient Log Parsing

引用

21st IEEE International Conference on Data Mining (IEEE ICDM)

作者： Vervaet, Arthur Chiky, Raja Callau-Zori, Mar ISEP 3DS OUTSCALE Paris France ISEP Inst Super Elect Paris Paris France 3DS OUTSCALE Paris France

ISBN: (纸本)9781665423984

Logs record valuable system information at runtime. They are widely used by data-driven approaches for development and monitoring purposes. Parsing log messages to structure their format is a classic preliminary step for log-mining tasks. As they appear upstream, parsing operations can become a processing time bottleneck for downstream applications. The quality of parsing also has a direct influence on their efficiency. Previous approaches toward online log parsing focused on stateful methods. But an increasing number of tasks ask for real time monitoring. Regarding this problem, we propose USTEP, an online log parsing method based on an evolving tree structure. Evaluation results on a panel of 13 datasets coming from different real-world systems demonstrate USTEP superiority in terms of both effectiveness and robustness when compared to other online methods. We also introduce USTEP-UP, a way of running multiple decentralized instances of USTEP in parallel.

关键词： Log parsing Online algorithm distributed algorithm Log mining

来源：评论

学校读者我要写书评

暂无评论

Adaptive CSMA scheduling algorithm for queuing delay enhancement and energy optimization

引用

AD HOC NETWORKS 2022年 134卷

作者： Jawad, Saja M. -K. Al-Ali, Mohannad H. Jasim, Abbas. A. Univ Basrah Comp Engn Dept Basrah 61004 Basrah Province Iraq Univ Missouri Elect Engn & Comp Sci Dept Columbia MO 65201 USA Basrah Univ Oil & Gas Coll Oil & Gas Engn Basrah 61004 Basrah Province Iraq

This paper proposes an adaptive carrier sense multiple access (CSMA) algorithm for link scheduling in a network of conflict graph structures. The algorithm optimizes throughput and brings the queue size of packets at a node close to zero as it makes the average service rate strictly larger than the arrival rate of packets. It also minimizes energy consumption of the node owing to the incorporation of sleep-wake up strategy when attempting to access the physical medium. This CSMA scheme utilizes a simple subgradient descent algorithm to obtain its inherent parameters for each node in an iterative and distributed manner. The conducted numerical results corroborate the superiority of the developed CSMA over the state-of-art schedulers in terms of transmission rate, queue length and energy saving.

关键词： CSMA distributed algorithm Lagrange dual function Queue length Sleep-wake up strategy Throughput and energy optimization

来源：评论

学校读者我要写书评

暂无评论

distributed multi-agent optimization via event-triggered based continuous-time Newton-Raphson algorithm

引用

NEUROCOMPUTING 2018年 275卷 1416-1425页

作者： Li, Yushuai Zhang, Huaguang Han, Ji Sun, Qiuye Northeastern Univ Coll Informat Sci & Engn Box 134 Shenyang 110819 Liaoning Peoples R China Northeastern Univ Natl Educ Minist Key Lab Integrated Automat Proc Ind Shenyang 110004 Liaoning Peoples R China

This paper investigates the problem of distributed convex optimization for multi-agent networks, where the objective function is the summation of local and multidimensional cost functions associated to private agents. To begin with, we develop a continuous-time Newton-Raphson algorithm, which features reduced communication, fast convergence and distributed execution, to solve such a problem. To avoid continuous control signal updating, an asynchronous event-triggered scheme is proposed for each agent. As a consequence, the continuous-time Newton-Raphson can be implemented with discrete-time control law driven by our designed trigger conditions, which is more suitable for practical applications. In addition, the triggering instants for each agent are not influenced by its neighboring agents' latest triggering instants, resulting in reduced total triggering events. It is proved that each agent can exponentially converge to the global optimal point by implementing the proposed algorithms and the proposed event-triggered scheme is naturally free of Zeno behavior. Several examples illustrate our results. (c) 2017 Elsevier B.V. All rights reserved.

关键词： Convex optimization Multi-agent Event-triggered distributed algorithm Newton-Raphson

来源：评论

学校读者我要写书评

暂无评论

distributed Slot Scheduling for QoS Guarantee over TSCH-based IoT Networks via Adaptive Parameterization 19

Distributed Slot Scheduling for QoS Guarantee over TSCH-base...

引用

19th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)

作者： Jung, Jinhwan Kim, Daewoo Lee, Taeyoung Kang, Joohyun Ahn, Namjo Yi, Yung Korea Adv Inst Sci & Technol Dept Elect Engn Daejeon South Korea

ISBN: (纸本)9781728154978

Internet of Things (IoT), which connects a large number of devices with wireless connectivity, has conic into the spotlight. As the scope of IoT applications becomes wider, we observe a surge of mission-critical IoT services, e.g., industrial automation systems and medical IoT systems, requiring to satisfy stringent latency, reliability, and/or energy efficiency guarantees. For this purpose, a new MAC, called Time Slotted Channel 1 lopping (TSCH), has been standardized in IEEE 802.15.4e. However, it is challenging to design a distributed scheduling protocol that achieves the required QoS and energy efficiency at the same time due to complicated tradeoff (providing enough number of slots for QoS vs. minimizing scheduled slots for energy efficiency). In this paper, we propose a novel framework for providing QoS, called SSAP, which is designed to maximize network lifetime in a distributed fashion while satisfying given reliability and latency requirements. TO this end, we decompose our goal into two crucial design components: (i) scheduling of slot and channel, and (ii) control of medium access period, each of which is performed by low-complexity and distributed mechanisms. To the best of our knowledge, this paper is the first work to comprehensively handle multiple QoSes for TSCH-based IoT networks. We implement SSAP in Contiki OS and perform extensive simulations and real experiments under various scenarios. Our evaluation results demonstrate that SSAP satisfies highly reliable communication and latency requirements while having the network lifetime that is 1.6 times longer compared to existing protocols for TSCH.

关键词： TSCH distributed algorithm Internet-of-Things (IoT)

来源：评论

学校读者我要写书评

暂无评论

ADMM-Based Sparse distributed Learning for Stochastic Configuration Networks

ADMM-Based Sparse Distributed Learning for Stochastic Config...

引用

Chinese Automation Congress (CAC)

作者： Zhou, Yujun Ai, Wu Guilin Univ Technol Coll Sci Guilin Peoples R China

ISBN: (纸本)9781728176871

Stochastic configuration networks (SCNs) are a new model of random neural networks (RNNs), which have demonstrated excellent capabilities in large-scale data analysis. For the processing of increasing data, distributed algorithms have become increasingly important. In this paper, the data sets are stored in multiple agents, and the centralized SCNs are reconstructed into equivalent sub-problems. The input weights and deviations are randomly generated under the constraints of supervised inequalities, ensuring the general approximation of the model, and proposed Based on the Alternating Direction Method of Multipliers (ADMM) distributed algorithm, L1 regularization is applied, sparse solutions are found, output weights are obtained, and the stochastic neural network model is improved. This method proves to be effective and greatly reduces the amount of information that needs to be exchanged between computing agents.

关键词： distributed algorithm stochastic configuration network ADMM L1 regularization

来源：评论

学校读者我要写书评

暂无评论

distributed Consensus of Second-Order Multi-Vehicle Systems With Heterogeneous and Unavailable Inertia Matrices 35

Distributed Consensus of Second-Order Multi-Vehicle Systems ...

引用

35th Youth Academic Annual Conference of Chinese-Association-of-Automation (YAC)

作者： Zou, Yao Zhang, Haojie He, Wei Univ Sci & Technol Beijing Sch Automat & Elect Engn Beijing 100083 Peoples R China Univ Sci & Technol Beijing Inst Artificial Intelligence Beijing 100083 Peoples R China

ISBN: (纸本)9781728176840

The consensus problem of second-order multi-vehicle systems with inertias in terms of a general directed network topology is studied. Rather than the current consensus algorithms for multi-vehicle systems with just scalar inertias, we allow the inertias to be matrices. What's more, the inertia matrices are assumed to be heterogeneous as well as unavailable. In particular, a fully distributed consensus algorithm is proposed such that global information is unnecessary for the achievement of the consensus objective. Moreover, a novel adaptive strategy is designed to address the dilemma arising from the heterogeneity and unavailability of the inertia matrices. It is demonstrated that, under the strongly connected graph condition, the designed distributed algorithm ensures the asymptotic convergence of the required consensus objective. The efficacy of the developed distributed algorithm is finally validated by numerical simulations.

关键词： Multi-vehicle systems distributed algorithm consensus adaption strong connectivity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：