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

United Against the Enemy: Anti-Jamming Based on Cross-Layer Cooperation in Wireless Networks

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2016年第8期15卷 5733-5747页

作者： Zhang, Liyang Guan, Zhangyu Melodia, Tommaso Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

Denial-of-service attacks launched by malicious jammers can pose significant threats to infrastructure-less wireless networks without a centralized controller. While significant recent research efforts have dealt with such attacks and several possible countermeasures have been proposed, little attention has been paid to the idea of cooperative anti-jamming. Inspired by this observation, this paper proposes and studies a cooperative anti-jamming scheme designed to enhance the quality of links degraded by jammers. To achieve this objective, users are allowed to cooperate at two levels. First, they cooperate to optimally regulate their channel access probabilities, so that jammed users gain a higher share of channel utilization. Second, users leverage multiple-input single-output cooperative communication techniques to enhance the throughput of jammed links. The problem of optimal cooperative anti-jamming is formulated as a distributed pricing-based optimization problem, and a best-response algorithm is proposed to solve it in a distributed way. Simulations demonstrate that the proposed algorithm achieves considerable gains (compared with traditional non-cooperative anti-jamming) especially under heavy traffic or high jamming power. Furthermore, the proposed distributed algorithm is shown to achieve close-to-global optimality with moderate traffic load.

关键词： Anti-jamming cooperative relay cross-layer optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Real-time Pricing Scheme for Local Power Supplier in Smart Community 22

Distributed Real-time Pricing Scheme for Local Power Supplie...

引用

22nd IEEE International Conference on Parallel and distributed Systems (ICPADS)

作者： Mu, Lan Yu, Nuo Huang, Hejiao Du, Hongwei Jia, Xiaohua Harbin Inst Technol Shenzhen Grad Sch Harbin Peoples R China Anhui Polytech Univ Dept Elect Engn Wuhu Anhui Peoples R China

ISBN: (纸本)9781509044573

In this paper, we consider the real-time pricing problem for a small scale local power supplier (LPS) in a smart energy community. The LPS supplies power to the residential users (RUs) in a local area and sells the remaining power to the main grid. Since the selling price to the main grid is relative low, LPS intends to sell more power to the RUs with an appropriate price. The LPS determines the price based on the proposed pricing scheme to maximize its revenue. The price is informed to RUs through the communication infrastructure. According to the announced price of LPS, each RU schedules its power consumption to maximize its utility. We model the interactions between the local power supplier and all users as a one-leader multi-followers Stackelberg game, where the LPS acts as the leader and RUs act as the followers. To address this problem, a distributed algorithm based on information exchange between the LPS and RUs is proposed. Simulation results show that the distributed algorithm converges to the Stackelberg equilibrium.

关键词： Demand response distributed algorithm distributed real-time pricing Energy storage Smart grid Stackelberg game

来源：评论

学校读者我要写书评

暂无评论

distributed Optimal Active Power Control in Microgrid with Communication Delays 35

Distributed Optimal Active Power Control in Microgrid with C...

引用

第35届中国控制会议

作者： CHEN Gang ZHAO Zhongyuan School of Automation Chongqing University

ISBN: (纸本)9781509009107

This paper investigates the distributed optimal active power control problem for microgrids with time delays in communication ***,a novel algorithm is proposed to solve the economic dispatch problem for microgrids in a distributed *** effectiveness of the algorithm and the impact of the time-delay on the convergence are analyzed and strictly proved by the frequency analysis *** on the distributed economic dispatch solution,an optimal cooperative control scheme is presented to coordinate the operation of *** bus in a microgrid contains two function modules,i.e.,the distributed economic dispatch module and the cooperative control *** cooperative control module receives and tracks the active power generation reference provided by the distributed economic dispatch *** proposed approach can minimize the total cost and maintain the supply-demand balance of the *** case studies are carried out to verify the effectiveness of the proposed approach.

关键词： Economic dispatch time delay microgrid distributed algorithm consensus

来源：评论

学校读者我要写书评

暂无评论

A distributed Minimum Spanning Tree for Cognitive Radio Networks 12

A Distributed Minimum Spanning Tree for Cognitive Radio Netw...

引用

12th International Conference on Communication Networks (ICCN) / 12th International Conference on Data Mining and Warehousing (ICDMW) / 12th International Conference on Image and Signal Processing (ICISP)

作者： Murmu, Mahendra Kumar Firoz, Akheel M. Meena, Sandeep Jain, Shubham Natl Inst Technol Kurukshetra 136119 Haryana India

The minimum spanning tree is a classical problem in distributed system environment. We extend this challenge in Cognitive Radio Networks (CRN). In CRN, the spectrum mobility and the node mobility creates connectivity problem during neighbour discovery. Thus, finding edges (or relation graph) between the SU nodes in order to create communication graph for Minimum Spanning Tree (MST) is a challenge in cognitive radio network. In the present work, we propose a solution to the problem of creating minimum spanning tree ( MST) in cognitive radio network. It is a message passing based distributed algorithm. The MST algorithm find shortest path between any pairs of SUs (or vertices) in the communication graph of CRN. The communication message complexity of our algorithm is 6E, where E represents the edges. The MST is useful for data dissemination in cognitive radio network. (C) 2016 The Authors. Published by Elsevier B.V.

关键词： Cognitive Radio Network Minimum Spanning Tree Minimum Cost distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Evacuation in Graphs with Multiple Exits 1

引用

23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Borowiecki, Piotr Das, Shantanu Dereniowski, Dariusz Kuszner, Lukasz Gdansk Univ Technol Fac Elect Telecommun & Informat Gdansk Poland Aix Marseille Univ CNRS LIF Marseille France

ISBN: (数字)9783319483146

ISBN: (纸本)9783319483146;9783319483139

We consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy based on locations of other agents in the graph, in order to minimize the total time needed for evacuation. We consider two scenarios: (i) the centralized (or offline) setting where the agents have full knowledge of initial positions of other agents, and (ii) the distributed (or online) setting where the agents do not have prior knowledge of the location of other agents but they can communicate locally with nearby agents and they must modify their strategy in an online fashion while they move and obtain more information. In the former case we present an offline polynomial time solution to compute the optimal strategy for evacuation of all agents. In the online case, we present a constant competitive algorithm when agents can communicate at distance two in the graph. We also show that when the agents are heterogeneous and each agent has access to only a subgraph of the original graph then computing the optimal strategy is NP-hard even with full global knowledge. This result holds even if there are only two types of agents.

关键词： Discrete evacuation distributed algorithm Mobile agents Network flow

来源：评论

学校读者我要写书评

暂无评论

distributed Load Shedding over Directed Communication Networks with Time Delays

Distributed Load Shedding over Directed Communication Networ...

引用

IEEE/PES Transmission and Distribution Conference and Exposition (T&D)

作者： Yang, Tao Wu, Di Pacific Northwest Natl Lab Richland WA 99354 USA

ISBN: (纸本)9781509021574

When generation is insufficient to support all loads in a power system under emergencies, effective and efficient load shedding needs to be deployed in order to prevent system collapse. This paper presents a ratio consensus based distributed algorithm to discover the system overload after disturbance. In the proposed algorithm, the agent at each bus only communicates with its neighboring agents via directed communication links possibly with arbitrarily large but bounded time-varying communication delays. Simulation results are used to validate the proposed method.

关键词： Directed graph distributed algorithm load shedding multi-agent systems ratio consensus time-varying delays

来源：评论

学校读者我要写书评

暂无评论

distributed Multi-robot Dynamic Network Topology Control While Preserving Connectivity 8

Distributed Multi-robot Dynamic Network Topology Control Whi...

引用

8th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)

作者： Cai, Da Wu, Sentang Beihang Univ Sch Automat Sci & Elect Engn Beijing Peoples R China

ISBN: (纸本)9781509007684

The multi-robot network topology control and connectivity preserving problem is studied. We introduce the global message connectivity to represent the quality of service (QoS) of the network. A combined distributed algorithm of topology control and connectivity motion control is proposed. Simulation results show that the algorithm can improve the global message connectivity while keeping the network connected.

关键词： multi-robot network topology control connectivity preserving distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Convergence Analysis on Variable Sample distributed Methods for Stochastic Nash Equilibrium 28

Convergence Analysis on Variable Sample Distributed Methods ...

引用

28th Chinese Control and Decision Conference

作者： Zhang, Dali Shanghai Jiao Tong Univ Antai Coll Econ & Management Sino US Global Logist Inst Shanghai 200030 Peoples R China

ISBN: (纸本)9781467397148

In this paper, we propose a variable sample distributed algorithm for the computation of stochastic Nash equilibrium in which the objective functions are replaced, at each iteration, by sample average approximations. We investigate the contraction mapping properties of the variable sample distributed algorithm and show that the accuracy of estimators yielded in the algorithms to their true counterparts are determined by both the sample size schedules and the contraction mapping parameters. We also investigate conditions on the sample size schedules under which the accumulation point generated by the algorithm asymptotically converges to the true Nash equilibrium.

关键词： Monte Carlo methods distributed algorithm stochastic Nash equilibrium sample size schedule

来源：评论

学校读者我要写书评

暂无评论

Impacts of Time Delays on distributed algorithms for Economic Dispatch

Impacts of Time Delays on Distributed Algorithms for Economi...

引用

General Meeting of the IEEE-Power-and-Energy-Society

作者： Yang, Tao Wu, Di Sun, Yannan Lian, Jianming Pacific NW Natl Lab 902 Battelle Blvd Richland WA 99352 USA

ISBN: (纸本)9781467380409

Economic dispatch problem (EDP) is an optimization problem with the objective to minimize the total generation cost subject to the power balance constraint and generator capacity limits. Typically, EDP is solved in a centralized manner, however, recently, several consensus-based algorithms have been proposed to solve EDP in a distributed manner. In these algorithms, it is assumed that information are exchanged through the perfect communication network. However time delays are ubiquitous in the communication network. This paper investigates impacts of communication time delays on a distributed algorithm. This algorithm has been tested by applying time delays to different types of information exchange. Several case studies are carried out to evaluate the effectiveness and performance of the algorithm in the presence of time delays in communication networks. It is found that time delays can negatively affect convergence rate, resulting in the algorithm either converging to an incorrect value or failing to converge altogether.

关键词： Consensus distributed algorithm economic dispatch multi-agent systems time delays

来源：评论

学校读者我要写书评

暂无评论

A distributed Downlink Resource Allocation algorithm for Dense Small Cell Networks

A Distributed Downlink Resource Allocation Algorithm for Den...

引用

7th IEEE International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Cheng, Lin Zheng, Jun Xiao, Jie Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9781467376877

This paper considers the dynamic downlink spectrum resource allocation problem in dense small cell networks. To address the problem, we propose a distributed downlink resource allocation (DDRA) algorithm, which allows each base station to perform resource allocation for its users in a distributed manner. To support the DDRA algorithm, each base station needs to maintain a couple of interference tables, SITable and WITable, which are used to store those base stations that have a strong interference and a weak interference to each user in the corresponding cell in each timeslot, respectively. Meanwhile, it also needs to maintain a couple of resource status tables, SRSTable and WRSTable, which are used to store the RBs that have been allocated by those base stations contained in the SITable and WITable in each timeslot, respectively. Based on the resource status tables, each base station performs resource block (RB) allocation for its users. For each new user, those RBs that would cause a strong interference are not considered in allocation. Only those RBs that would not cause any interference or only cause a weak interference are considered. Simulation results show that the proposed DDRA algorithm can significantly increase the system capacity as compared to an existing resource allocation algorithm.

关键词： distributed algorithm downlink resource allocation small cell network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：