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

Forwarding Set Based distributed algorithm for Connected Dominating Set in WSN

SENSOR LETTERS 2012年第8期10卷 1918-1924页

作者： Tang, Yong Zhang, Jun Wang, Wenyong Xiang, Yu Zhang, Jun Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China

In wireless sensor networks, virtual backbone network is an important approach to reduce reduplicate data transmission, save energy and bandwidth. Constructing a virtual backbone is identical with calculating connected dominating set, which is a NP-complete problem in graph theory. An algorithm using only 1-hop neighbor's information to attain CDS, named FWCDS (Forwarding set based distributed algorithm for Connected Dominating Set), is proposed in this paper. FWCDS algorithm is an enhancement of OHDC algorithm. There are two stages in the calculating process of our algorithm. In the first stage each node calculates the forwarding set severally. In the second stage, each node in the forwarding set determines whether it is a dominating node. Simulation results show that less extra messages and less convergence time is achieved by the algorithm with smaller CDS size.

关键词： Forwarding Set Connected Dominating Set distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Generic cooperative and distributed algorithm for recovery of signals with the same sparsity profile in wireless sensor networks: a non-convex approach

引用

JOURNAL OF SUPERCOMPUTING 2019年第5期75卷 2315-2340页

作者： Azarnia, Ghanbar Tinati, Mohammad Ali Rezaii, Tohid Yousefi Univ Tabriz Fac Elect & Comp Engn Tabriz Iran

Most of the wireless sensor networks (WSNs) are equipped with battery-powered devices with limited processing/communication resources which necessitate the designed algorithms to reduce the computational burden on nodes as much as possible. This could be achieved using distributed algorithms in which the computations are distributed between all of the nodes. In WSNs, the sensors observe phenomena that could be common to some of them, in addition to the intra-signal correlation;therefore, the acquired signals by the sensors possess some inter-signal correlation. These joint structures could be exploited if the designed algorithms are cooperative. On this basis, in this paper a new distributed and cooperative signal recovery algorithm in the application of compressive sensing for WSNs is proposed. We consider a situation that the sensor nodes intend to recover signals that differ from one sensor to another, in the underdetermined systems of equations, while these signals have common sparsity profile. In fact, we introduce a general structure which can be applied to many optimization problems with different non-convex objective functions and different constraints. In this paper, this method will be used on three problems with different constraints and will result in three completely distributed methods. The simulation results show that the proposed method presents better performance compared to the other existing algorithms in terms of both recovery and convergence rate.

关键词： Wireless sensor networks Sparse signals Compressive sensing distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for a maximal 2-packing set in Halin graphs

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2020年 142卷 62-76页

作者： Flores-Lamas, Alejandro Alberto Fernandez-Zepeda, Jose Antonio Trejo-Sanchez, Joel Ctr Sci Res & Higher Educ Ensenada CICESE Dept Comp Sci Carretera Ensenada Tijuana 3918 Ensenada 22860 Baja California Mexico CONACYT Ctr Invest Matemat Carretera Sierra Papacal Chuburna Puerto Km 5 Sierra Papacal 97302 Yuc Mexico

In this work, we propose MAXIMAL-2-PACKING-HALIN, a distributed algorithm that finds a maximal 2-packing set in undirected non-geometric Halin graphs of order n in linear time. First, this algorithm finds an external face of the input graph through the application of graph-reduction rules. Second, each vertex determines if it belongs to a maximal 2-packing set by applying a set of vertex-coloring rules. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Maximal 2-packing set Halin graph distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed algorithm to identify and traceback DDoS traffic

引用

COMPUTER JOURNAL 2006年第4期49卷 418-442页

作者： Wong, T. Y. Law, K. T. Lui, John C. S. Wong, M. H. Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China

distributed denial-of-service attack is one of the most pressing security problems that the Internet community needs to address. Two major requirements for effective traceback are (i) to quickly and accurately locate potential attackers and (ii) to filter attack packets so that a host can resume the normal service to legitimate clients. Most of the existing IP traceback techniques focus on tracking the location of attackers after-the-fact. In this work, we provide an efficient methodology for locating potential attackers who employ the flood-based attack. We propose a distributed algorithm so that a set of routers can correctly (in a distributed sense) gather statistics in a coordinated fashion and that a victim site can deduce the local traffic intensities of all these participating routers. We prove the correctness of our distributed algorithm, and given the collected statistics, we provide a method for the victim site to locate attackers who sent out dominating flows of packets. The proposed distributed traceback methodology can also complement and leverage on the existing ICMP traceback so that a more efficient and accurate traceback can be obtained. We carry out simulations to illustrate that the proposed methodology can locate the attackers in a short period of time. Moreover, the applications as well as the limitations of the proposed methodology are covered. We believe this work also provides the theoretical foundation on how to correctly and accurately perform distributed measurement and traffic estimation on the Internet.

关键词： security and protection programmable routers distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for dynamic channel allocation

引用

MOBILE NETWORKS & APPLICATIONS 2002年第2期7卷 115-126页

作者： Boukerche, A Hong, SB Jacob, T Univ N Texas Dept Comp Sci Parallel Simulat & Distributed Syst Res PARADI Denton TX 76203 USA

Recent demand for mobile telephone service has been growing rapidly while the electro-magnetic spectrum of frequencies allocated for this purpose remains limited. Any solution to the channel assignment problem is subject to this limitation, as well as the interference constraint between adjacent channels in the spectrum. Channel allocation schemes provide a flexible and efficient access to bandwidth in wireless and mobile communication systems. In this paper, we present an efficient distributed algorithm for dynamic channel allocation based upon mutual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels cannot be shared concurrently within the cluster. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most (worst case) O(Ng . N-n log N-n) messages, where N-g is the number of groups and N-n is the number of neighbors. This is compared to Choy's algorithm which requires O(N-g(2) . N-n), where N-g is the number of groups and N-n is the number of neighboring cells in the system. We report our algorithm's performance with several channel systems using different types of call arrival patterns. Our results indicate that significant low denial rate, low message complexity and low acquisition time can be obtained using our algorithm.

关键词： distributed algorithm channel/resource allocation wireless/mobile communications mutual exclusion

来源：评论

学校读者我要写书评

暂无评论

Cooperative Car-Following Control: distributed algorithm and Impact on Moving Jam Features

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2016年第5期17卷 1459-1471页

作者： Wang, Meng Daamen, Winnie Hoogendoorn, Serge P. van Arem, Bart Delft Univ Technol Dept Transport & Planning NL-2628 Delft Netherlands

We design controllers and derive implementable algorithms for autonomous and cooperative car-following control (CFC) systems under a receding horizon control framework. An autonomous CFC system controls vehicle acceleration to optimize its own situation, whereas a cooperative CFC (C-CFC) system coordinates accelerations of cooperative vehicles to optimize the joint situation. To realize simultaneous control of many vehicles in a traffic system, decentralized and distributed algorithms are implemented in a microscopic traffic simulator for CFC and C-CFC controllers, respectively. The impacts of the proposed controllers on dynamic traffic flow features, particularly on formation and propagation of moving jams, are investigated through a simulation on a two-lane freeway with CFC/C-CFC vehicles randomly distributed. The simulation shows that the proposed decentralized CFC and distributed C-CFC algorithms are implementable in microscopic simulations, and the assessment reveals that CFC and C-CFC systems change moving jam characteristics substantially.

关键词： Car-following cooperative systems receding horizon control distributed algorithm moving jam

来源：评论

学校读者我要写书评

暂无评论

An iterative distributed algorithm for multi-constraint multicast routing

引用

COMPUTER COMMUNICATIONS 2006年第17期29卷 3647-3661页

作者： Huang, Tzu-Lun Lee, D. T. Natl Taiwan Univ Dept Comp Sci & Informat Engn Grad Inst Elect Engn Taipei 10764 Taiwan Acad Sinica Inst Sci Informat Taipei 115 Taiwan

In this paper, we propose a group computation based distributed algorithm for solving. the problem of multi-constraint multicast routing. This algorithm is fully distributed and can generate within acceptable time and message complexities a multicast routing tree, which not only satisfies the required multiple QoS constraints but also has a sub-optimal network cost. The results of the simulations show that the multicast routing tree generated by our algorithm has better performance than the previous well-known results. (c) 2006 Elsevier B.V. All rights reserved.

关键词： multicast multicast routing tree multiple constraints QoS routing protocol distributed algorithm NP-hardness heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

ADMM-Based distributed algorithm for Energy Management in Multi-Microgrid System

引用

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2024年第1期19卷 79-89页

作者： Lou, Huen Fujimura, Shigeru Waseda Univ Grad Sch Informat Prod & Syst 2-7 HibikinoWakamatsu Ku Kitakyushu Fukuoka 8080135 Japan

This article focuses on Energy Management Problem (EMP) in Muti-microgrid systems. Each microgrid (MG) has four basic equipments including Renewable Generator (RG), Fuel Generator (FG), Storage Device (SD) and Smart Load (SL). In consideration of equipment capacity, confidence interval for forecasts of RG output, supply-demand balance and other factors, an optimization model with the objective of minimizing operation cost was established. Through Lagrange dual problem and variable substitution, we transform the centralized problem into an equivalent distributed form. Then, a completely distributed algorithm based on Alternating Direction Method of Multipliers (ADMM) and Average Consensus (AC) is proposed to attain a global optimal schedule plan. The algorithm overcomes the defect that each microgrid needs to know the total must-run load in advance. At the same time, the electricity clearing price is related to the objective function through Lagrange dual variables, which can be obtained while the optimal plan is determined. Finally, the simulation verifies the convergence of the algorithm, and the calculated optimal cost is the same as that of the centralized method, ensuring its effectiveness. Besides, the algorithm also has good performance in plug-and-play scenarios. (c) 2023 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC.

关键词： microgrid energy management problem distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

4-DMWM Approach for Caching Based Optimal D2D Pairing and Channel Allocation: Centralized and distributed algorithm Design

引用

IEEE ACCESS 2016年 4卷 9213-9224页

作者： Miao, Lu Bai, Bo Chen, Wei Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

Caching popular contents at mobile devices can potentially improve the quality of service for mobile users and relieve traffic burden of base station in cellular networks. In this paper, we jointly consider the resource allocation, the cached contents, and the distance between two devices for the optimal device pairing problem in centralized and distributed cases, where the BS is the central controller in the centralized case. The joint optimization problem of device-to-device (D2D) caching with channel allocation is formulated as a weighted four-uniform hypergraph model. The optimal solution for the problem is 4-D maximum weighted matching (4-DMWM), which is NP-hard unfortunately. To approach the 4-DMWM with low-complexity, we adopt the greedy algorithm and the squareIMP algorithm in the centralized case. Moreover, distributed algorithms are also designed for the caching problem in both synchronous and asynchronous cases. The simulation results will illustrate that the squareIMP algorithm can be used to get a better transmission rate with the complexity of O(n(5)), while the greedy algorithm can be used in the case with stringent latency requirement for centralized 4-DMWM problem. The sum rate of distributed asynchronous algorithm is close to the centralized greedy algorithm with the complexity of O(n(2)) for each device. However, the simulation result of the synchronous algorithm is slightly lower than the centralized algorithm, where each device performs O(n(2)) computational operations in each iteration. Therefore, the algorithms proposed in this paper can be used in different cases for solving optimal D2D pairing and channel allocation problem.

关键词： D2D caching weighted 4-uniform hypergraph 4-dimensional maximum weighted matching (4-DMWM) centralized algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Continuous-Time distributed algorithm for Seeking Fixed Points of Multiagent Quasi-Nonexpansive Operators

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2024年第3期11卷 1238-1250页

作者： Nian, Xiaohong Liu, Dongxin Li, Fan Cent South Univ Key Lab Inst Cluster Unmanned Syst Sch Automat Changsha 410083 Peoples R China

This article investigates the distributed fixed point seeking problem for the operator in real Hilbert spaces over the multiagent networks, where each local operator can only be approximately and privately accessed by the corresponding agent. Specifically, two cases, including the global operator is sum separable and block separable, are considered. Under the assumption that the local operator is Lipschitz and the global operator is quasi-nonexpansive, continuous-time distributed algorithms over balanced time-varying digraphs and strongly connected fixed digraphs are designed for two cases, respectively, and it is proved in both cases that the algorithms weakly converge to a fixed point of the considered operator. To the best of our knowledge, these two algorithms are the first continuous-time dynamical system results for the distributed fixed point seeking problem. Meanwhile, the designed algorithms can also be applied to solve resource allocation, noncooperative games, and multicluster games, providing a unified framework for their solution. Finally, several numerical simulations are presented to verify the theoretical results.

关键词： distributed algorithms Signal processing algorithms Heuristic algorithms Optimization Games Hilbert space Network systems distributed algorithm distributed optimization fixed point theory game theory multiagent networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：