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

Toward Optimal distributed Monitoring of Multi-Channel Wireless Networks

IEEE TRANSACTIONS ON MOBILE COMPUTING 2016年第7期15卷 1826-1838页

作者： Shin, Dong-Hoon Bagchi, Saurabh Wang, Chih-Chun Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85282 USA Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47906 USA

This paper studies an optimal channel assignment problem for passive monitoring in multi-channel wireless networks, where a set of sniffers capture and analyze the network traffic to monitor the wireless network. The objective of this problem is to maximize the total amount of traffic captured by sniffers by judiciously assigning the radios of sniffers to a set of channels. This problem is NP-hard, with the computational complexity growing exponentially with the number of sniffers. We develop distributed online solutions for large-scale and dynamic networks. The dynamism in the network may arise from mobility of the nodes being monitored. Our algorithm is guaranteed to achieve at least 1 - 1/e times the optimum, regardless of the network topology and the channel assignment of nodes to be monitored, while providing a distributed solution amenable to online implementation. Further, our algorithm is cost-effective, in terms of communication and computational overheads, due to the use of purely local communication and the incremental adaptation to network changes. We present two operational modes of our algorithm for two types of networks that change at different rates;one is a proactive mode for fast-varying networks, while the other is a reactive mode for slowly-varying networks. Simulation results demonstrate the effectiveness of the two modes of our algorithm and compare it to the theoretically optimal algorithm.

关键词： Wireless networks multi-channel monitoring distributed algorithm approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

Implementation of a distributed Microgrid Controller on the Resilient Information Architecture Platform for Smart Systems (RIAPS)

Implementation of a Distributed Microgrid Controller on the ...

引用

North American Power Symposium (NAPS)

作者： Du, Yuhua Tu, Hao Lukic, Srdjan Lubkeman, David Dubey, Abhishek Karsai, Gabor North Carolina State Univ FREEDM Syst Ctr Raleigh NC 27695 USA Vanderbilt Univ Inst Software Integrated Syst 221 Kirkland Hall Nashville TN 37235 USA

ISBN: (纸本)9781538626993

Formation of microgrids have been proposed as a solution to improve grid reliability, and enable smoother integration of renewables into the grid. Microgrids are sections of the grid that can operate in isolation from the main power system. Maintaining power balance within an islanded microgrid is a challenging task, due to the low system inertia, which requires complex control to maintain stable and optimized operation. Many studies have demonstrated feasible distributed microgrid controllers that can maintain microgrid stability in grid connected and islanded modes. However, there is little emphasis on how to implement these distributed algorithms on a computational platform that allows for fast and seamless deployment. This paper introduces a decentralized software platform called Resilient Information Architecture Platform for Smart Systems (RIAPS) that runs on processors embedded with the microgrid component. As an example, we describe the implementation of a distributed microgrid secondary control and resynchronization algorithms on RIAPS platform. The controller developed on RIAPS platform is validated on a real-time microgrid testbed.

关键词： Microgrid RIAPS platform distributed algorithm Hierarchical control Resynchronization

来源：评论

学校读者我要写书评

暂无评论

distributed Power Allocation for Femtocell Networks Subject to Macrocell SINR Balancing

引用

IEEE COMMUNICATIONS LETTERS 2016年第11期20卷 2296-2299页

作者： Cho, In-Sop Baek, Seung Jun Korea Univ Coll Informat & Commun Seoul 02841 South Korea

We consider the power allocation for the two-tier heterogeneous network where a macrocell (MC) coexists with multiple femtocells (FCs). Each FC aims to maximize the weighted sum-rate of its users subject to MC signal-to-interference-plus-noise ratio (SINR) balancing, which means that a prescribed SINR is guaranteed to MC users. We formulate a noncooperative game which captures bidirectional cross-tier interference. We develop a fully decentralized algorithm, and derive a sufficient condition for its convergence to a unique equilibrium.

关键词： Femtocell networks power allocation distributed algorithm macrocell SINR balancing

来源：评论

学校读者我要写书评

暂无评论

Constrained optimization and distributed computation based car following control of a connected and autonomous vehicle platoon

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2016年 94卷 314-334页

作者： Gong, Siyuan Shen, Jinglai Du, Lili IIT Dept Civil Architectural & Environm Engn Chicago IL 60616 USA Univ Maryland Baltimore Cty Dept Math & Stat Baltimore MD 21250 USA

Motivated by the advancement in connected and autonomous vehicle technologies, this paper develops a novel car-following control scheme for a platoon of connected and autonomous vehicles on a straight highway. The platoon is modeled as an interconnected multi-agent dynamical system subject to physical and safety constraints, and it uses the global information structure such that each vehicle shares information with all the other vehicles. A constrained optimization based control scheme is proposed to ensure an entire platoon's transient traffic smoothness and asymptotic dynamic performance. By exploiting the solution properties of the underlying optimization problem and using primal-dual formulation, this paper develops dual based distributed algorithms to compute optimal solutions with proven convergence. Furthermore, the asymptotic stability of the unconstrained linear closed-loop system is established. These stability analysis results provide a principle to select penalty weights in the underlying optimization problem to achieve the desired closed-loop performance for both the transient and the asymptotic dynamics. Extensive numerical simulations are conducted to validate the efficiency of the proposed algorithms. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Connected and autonomous vehicles Car-following control Optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Load Balancing via Message Passing for Heterogeneous Cellular Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2016年第11期65卷 9287-9298页

作者： Sohn, Illsoo Lee, Sang Hyun Gachon Univ Dept Elect Engn Seongnam 461701 South Korea Pusan Natl Univ Dept Elect Engn Busan 46241 South Korea

This paper presents a distributed load-balancing algorithm that maximizes the network-wide sum rate in heterogeneous cellular networks ( HetNets). Unlike previous studies that have considered a logarithmic utility defined with respect to the sum rate, we maximize the sum rate directly to achieve the best user association for the HetNet. To capture realistic communication scenarios, we also consider a minimum rate constraint for individual users. The corresponding problem is formulated as a combinatorial optimization of which finding the solution becomes computationally demanding as the size of the network grows. Another challenge in HetNets is that the information exchange among base stations ( BSs) is limited if each tier of BSs is deployed by different network vendors or users, and this brings about the need for distributed control. To resolve these challenges, we introduce a promising approach based on a message-passing framework and derive a distributed load-balancing algorithm. The proposed algorithm developed via message passing provides a very efficient solution for the load-balancing problem with reduced computational complexity. We compare the proposed algorithm with existing load-balancing strategies. Simulation results verify that the proposed algorithm significantly improves resource utilization and mitigates the congestion of macro BSs, thereby resulting in a multifold gain to the sum rate.

关键词： distributed algorithm heterogeneous network load balancing message passing user association

来源：评论

学校读者我要写书评

暂无评论

distributed wireless link scheduling in the SINR model

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2016年第1期32卷 278-292页

作者： Yu, Dongxiao Wang, Yuexuan Hua, Qiangsheng Yu, Jiguo Lau, Francis C. M. Univ Hong Kong Dept Comp Sci Pokfulam Hong Kong Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Zhejiang Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Cluster & Grid Comp Lab Serv Comp Technol & Syst Lab Wuhan 430074 Peoples R China Qufu Normal Univ Sch Informat Sci & Engn Rizhao 276800 Peoples R China

We present an approximation algorithm for wireless link scheduling under the physical SINR interference model. In the link scheduling problem, it is given a set of links in a metric space, each of which is a sender-receiver pair, and the objective is to schedule the links using the minimum amount of time. We focus on a variant of this fundamental problem where the power is fixed, i.e., the power assignment of links is given as part of the input. Specifically, we consider an important category of power assignments called length-monotone sublinear power assignment, which includes the widely studied uniform, mean and linear power assignments. We present a distributed algorithm that can schedule all links in rounds with high probability, where is the ratio between the longest link and the shortest link and is the maximum nearly-equilength class affectance of the link set. It is shown that the proposed algorithm is approximate to the optimal schedule in dense networks with . To the best of our knowledge, our algorithm is the first distributed one whose approximation ratio is independent of the network size . Our result also shows that the lower bound (Halldrsson and Mitra in: ICALP, 2011) on the approximation ratio does not hold for link sets with .

关键词： Wireless link scheduling SINR model distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling With Fading Channels

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2016年第3期24卷 1476-1488页

作者： Joo, Changhee Lin, Xiaojun Ryu, Jiho Shroff, Ness B. Ulsan Natl Inst Sci & Technol Sch Elect & Comp Engn Ulsan South Korea Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

It has been known that scheduling algorithms designed to achieve throughput optimality and good delay performance often require solving the Maximum Weighted Independent Set (MWIS) problem. However, under most realistic network settings, the MWIS problem is known to be NP-hard. In non-fading environments, low-complexity scheduling algorithms have been provided that converge either to the MWIS solution in time or to a solution that achieves at least a provable fraction of the achievable throughput. However, in more practical systems the channel conditions can vary at faster time-scales than convergence occurs in these lower-complexity algorithms. Hence, these algorithms cannot take advantage of opportunistic gains, and may no longer result in achieving good performance. In this paper, we propose a low-complexity scheduling scheme that performs provably well under fading channels and is amenable to implement in a distributed manner. To the best of our knowledge, this is the first scheduling scheme under fading environments that requires only local information, has a low complexity that grows logarithmically with the network size (provided that the conflict graph has bounded maximum vertex degree), and achieves provable performance guarantees (arbitrarily close to that of the well-known centralized Greedy Maximal Scheduler). We verify that the throughput and the delay of our proposed scheme are close to those of the optimal MaxWeight that solves MWIS at each time. Further, we implement our algorithm in a testbed by modifying the existing IEEE 802.11 DCF. The experiment results show that our implementation successfully accounts for wireless fading, attains the short-term opportunistic gains in practice, and hence substantially outperforms IEEE 802.11 DCF.

关键词： distributed algorithm maximum weighted independent set wireless scheduling with fading channels

来源：评论

学校读者我要写书评

暂无评论

distributed multi-objective cross-layer optimization with joint hyperlink and transmission mode scheduling in network coding-based wireless networks

引用

AD HOC NETWORKS 2016年 37卷 460-474页

作者： Liu, Jain-Shing Tsai, Jichiang Providence Univ Dept Comp Sci & Informat Engn Taichung Taiwan Natl Chung Hsing Univ Dept Elect Engn Taichung 40227 Taiwan Natl Chung Hsing Univ Grad Inst Commun Engn Taichung 40227 Taiwan

In this work, we address a cross-layer multi-objective optimization problem of maximizing network lifetime and optimizing aggregate system utility with intra-flow network coding, solved in a distributed manner. Based on the network utility maximization (NUM) framework, we resolve this problem to accommodate routing, scheduling, and stream control from different layers in the coded networks. Specially, we consider that there are two scheduling primitives, namely hyperlink and transmission mode, to be concurrently activated for the multi-objective optimization. Given the constraints with respect to these primitives, the optimization problem is specifically formulated as a quadratically constrained quadratic programming (QCQP) problem that is NP-hard in general, and its scheduling subproblem even when reduced to account for only one of these primitives is a maximum weighted independent set (MWIS) problem that is NP-hard already. To alleviate this complex problem in a distributed manner, we resort to alternate convex search (ACS) and primal decomposition (PD) to approximate the optimal results by using biconvex programming model and subgradient-based algorithm that can iteratively approach to the optimal solution. For the wireless multihop networks, wherein an optimal solution could be practically approximated as its validity would be out-of-date soon in the error-prone wireless environment, our simulation results show that the distributed method can fulfill our requirements, and can make a good trade-off on the heterogeneous objectives with well computational efficiency. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Multi-objective Cross-layer optimization distributed algorithm Joint scheduling Network coding

来源：评论

学校读者我要写书评

暂无评论

Introducing distributed gradient descent distance vector routing (DGDDVR)

引用

ELECTRONICS LETTERS 2016年第23期52卷 1963-1965页

作者： Herbert, S. J. Univ Edinburgh Sch Engn Edinburgh Midlothian Scotland Blu Wireless Technol Bristol Avon England

A distributed algorithm is proposed which routes packets to minimise the expected latency in arbitrarily connected mesh networks, where each link has a set transmission rate. It is proven that the proposed algorithm converges to the global minimum. Initial simulations demonstrate the effectiveness of the proposed algorithm relative to current methods based on Dijkstra's algorithm.

关键词： telecommunication network routing gradient methods wireless mesh networks distributed algorithms distributed gradient descent distance vector routing DGDDVR algorithm Dijkstra's algorithm transmission rate arbitrarily connected mesh networks expected latency distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal bandwidth allocation for hybrid Video-on-Demand streaming with a distributed max flow algorithm

引用

COMPUTER NETWORKS 2015年 91卷 483-494页

作者： Tian, Chen Sun, Jingdong Wu, Weimin Luo, Yan Huazhong Univ Sci & Technol Sch Elect Informat & Commun Wuhan 430074 Peoples R China Univ Massachusetts Lowell Dept Elect & Comp Engn Lowell MA USA

Video-on-Demand (VoD) streaming counts for the largest share of Internet traffic, and commonly relies on P2P-CDN hybrid systems. In such hybrid systems, a peer's upload bandwidth utilization is critical to P2P mode, thus the bandwidth allocation algorithm is important to the performance of VoD streaming. The current research either makes impractical assumptions, or is inefficient in real scenarios. Meanwhile some industrial practice such as additive-increase/multiplicative-decrease (AIMD) heuristic, although effective in practice, lacks theoretical foundation. This paper develops an optimal bandwidth allocation algorithm for hybrid VoD streaming. Specifically, we propose a novel Demand Driven Max-Flow Formulation, which treats each peer's bandwidth demand as the flow commodity. The proposed distributed Free-for-All Push-Lift algorithm can solve the formulation in each peer, and is free of any lock, shared memory and atomic operation. Following the theoretical analysis, we implement the algorithms in real-world VoD streaming systems. Through extensive evaluations we demonstrate that our approach can provide high-quality bandwidth allocation for hybrid VoD systems. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Video-on-Demand Streaming Bandwidth allocation Max flow distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：