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

A distributed Double-Consensus algorithm for Residential We-Energy

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2019年第8期15卷 4830-4842页

作者： Sun, Qiuye Fan, Ruyi Li, Yushuai Huang, Bonan Ma, Dazhong Northeastern Univ Sch Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China Univ Denver Dept Elect & Comp Engn Denver CO 80208 USA

This paper investigates the residential energy management problems in the power-heat-coupling system. For better solving this issue, based on the novel concept of We-Energy (WE) for energy Internet (EI), this paper proposes a residential WE (R-WE) framework faced by the terminal users who play an important role in renewable energy consumption. Inspired by the full-duplex feature of R-WE, the power and heat supply-demand balance constraints are fulfilled in a regional unit of EI, but it may be inequality constraints for corresponding consumer, producer, or WE operation modes in only one R-WE. The R-WE framework can be classified into four operation modes, which is island mode, consumer mode, producer mode, and WE mode. On this basis, the R-WE models cooperate to achieve the objective of minimizing the operation costs, smoothing out the loads' variations, and renewable resource fluctuations. Specifically, the R-WE framework with respect to the heat-power-coupling problem can be solved in the distributed double-consensus algorithm (DDCA), which is designed two sets of consensus algorithms by using four completely different consensus variables to calculate the power and heat multipliers, evaluate the power and heat generations and, thereby, further obtain the power mismatches of electricity and heat. Also, the Karush-Kuhn-Tucker (KKT) optimal conditions of the proposed DDCA is further proved. Meanwhile, a novel projection operation method for combined heat and power devices is designed to take the infeasible solutions mapped into the feasible region. Finally, the simulation results in different cases further demonstrate that the proposed R-WE frame can be an appropriate method to analyze the terminal consumers and harmonize multienergy producers in the process of constructing EI projects. And an R-WE framework of the campus has experimented with minority loads in island mode.

关键词： distributed algorithm renewable energy residential energy management We-Energy (WE)

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency 22

Brief Announcement: Deterministic Consensus and Checkpointin...

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Chlebus, Bogdan S. Kowalski, Dariusz R. Olkowski, Jan Augusta Univ Sch Comp & Cyber Sci Augusta GA 30912 USA Univ Maryland Dept Comp Sci College Pk MD USA

ISBN: (纸本)9781450392624

We study consensus and checkpointing in synchronous distributed systems. There are n nodes that communicate by sending messages, and any two nodes can communicate directly. The nodes are prone to crashing, with an upper bound t on the number of crashes. algorithms use overlay networks of choice to save on the amount of communication. We explore using Ramanujan graphs as such overlay networks. We demonstrate that Ramanujan graphs have topological properties conducive to fault-tolerance and time/communication efficiency of distributed algorithms. Our consensus algorithm assumes binary input values, runs in O(t) time and sends O(n+t log t) bits. The algorithm sends the optimum number O(n) of bits for t = O(n/log n), thus for this range of t it improves on the algorithm by Galil, Mayer and Yung [FOCS 1995] that also sends O(n) bits but works in exponential time. The consensus algorithm can be implemented such that a node sends a message to at most one node at a round while maintaining the asymptotic time and communication performance bounds. Our checkpointing algorithm runs in linear time O(n) and with O(n log(7) n) messages. It improves on the most communication-efficient and time-optimal algorithm by Galil, Mayer and Yung [FOCS 1995], which may have O(n(1+epsilon)) messages sent, for any chosen constant epsilon > 0.

关键词： distributed algorithm message passing synchrony node crash consensus checkpointing Ramanujan graph runtime performance communication performance

来源：评论

学校读者我要写书评

暂无评论

distributed Resource Allocation for NOMA-Based Mobile Edge Computing with Content Caching

Distributed Resource Allocation for NOMA-Based Mobile Edge C...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Zhang, Zhen Li, Qingqing Chen, Wuhui Hong, Zicong Sun Yatsen Univ Sch Data & Comp Sci Guangzhou Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

ISBN: (纸本)9781728195070

Nonorthogonal multiple access (NOMA) and content caching have been introduced to effectively utilize and save bandwidth resources, thus relieving network transmission pressure. Therefore, we develop a computation offloading framework blending NOMA and content caching to further improve the computational performance. We formulate the joint computation offloading decision, resources allocation, and caching decision as an utility maximization problem under the constrains of bandwidth, computing and storage resources. We convert the original non-convex problem to a convex problem via variable relaxation and substitution. We then decompose it and introduce an alternative direction method of multipliers based distributed algorithm to solve it. Finally, simulation results show that our algorithm can quickly converge and reach up to 95% of the optimal value. It also performs well over various parameter settings.

关键词： Computation offloading NOMA content caching resources assignment distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

On temporal graph exploration

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2021年 119卷 1-18页

作者： Erlebach, Thomas Hoffmann, Michael Kammer, Frank Univ Leicester Sch Informat Leicester Leics England Univ Appl Sci Mittelhessen THM Wiesenstr 14 D-35390 Giessen Germany

The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. In the first and second part of the paper, we consider only undirected temporal graphs that are connected at each time step. For such temporal graphs with n nodes, we show that it is NP-hard to approximate TEXP with ratio O (n(1-epsilon)) for every epsilon > 0 and present several solutions for special graph classes. In the third part of the paper, we consider settings where the graphs in future time steps are not known. We show that m-edge temporal graphs with regularly present edges and with probabilistically present edges can be explored online in O (m) time steps and O (m log n) time steps with high probability, respectively. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Non-approximability Planar graphs Bounded treewidth Regularly present edges Random edges distributed algorithm Gossiping problem

来源：评论

学校读者我要写书评

暂无评论

Cost-effective live video streaming for internet of connected vehicles using heterogeneous networks

引用

AD HOC NETWORKS 2024年 153卷

作者： Chowdhury, Debanjan Roy Nandi, Sukumar Goswami, Diganta Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 Assam India

Smart vehicles of Internet of Connected Vehicles (IoCV) create Ad-Hoc networks and are persistently connected to the Internet through different network access technologies like Wifi, cellular, and dedicated short range communication (DSRC). A vehicle may prefer one network access technology over another based on availability, coverage area, and network access cost. The choice also depends on application requirements, like delay -tolerant or delay-sensitive, and application objectives, like maximizing data rate, maximizing cellular traffic offloading, etc. Cellular traffic offloading using Wifi access points and vehicle-to-vehicle (V2V) collaborations are very challenging due to the intermittent short coverage areas of Wifi access points and highly dynamic connectivity of V2V Ad-Hoc network. Most existing works on traffic offloading have considered delay-tolerant or on-demand services, whereas delay-constrained live video streaming services are mostly ignored. This work is focused on live video streaming services over IoCVs, where the non-triviality of the network selection task is demonstrated by formulating the task as an integer linear programming problem (ILPP). Accordingly, a distributed algorithm is proposed, which greedily maximizes cellular traffic offloading while significantly reducing the control packet overheads. Compared to existing works, the proposed work provides the best service effectiveness with a balanced performance on traffic offloading, service efficiency, and user satisfaction.

关键词： Internet of connected vehicles Network access technology selection Collaborative live video streaming distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Sublinear message bounds of authenticated implicit Byzantine agreement

引用

THEORETICAL COMPUTER SCIENCE 2024年 1022卷

作者： Kumar, Manish Molla, Anisur Rahaman IIT Madras Dept Comp Sci & Engn Chennai 600036 India Indian Stat Inst Cryptol & Secur Res Unit Kolkata 700108 India

This paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the so-called implicit Byzantine agreement problem where each node starts with an input value and at the end a non-empty subset of the honest nodes should agree on a common input value by satisfying the BA properties (i.e., there can be undecided nodes)(3). We show that a sublinear (in n, number of nodes) message complexity BA protocol under honest majority is possible in the standard PKI model when the nodes have access to an unbiased global coin and hash function. In particular, we present a randomized Byzantine agreement algorithm which, with high probability achieves implicit agreement, uses O(root n) messages, and runs in O(1) rounds while tolerating (1/2-& varepsilon;)n Byzantine nodes for any fixed & varepsilon;>0, the notation O hides a O(polylogn) factor(4). The algorithm requires standard cryptographic setup PKI and hash function with a static Byzantine adversary. The algorithm works in the CONGEST model and each node does not need to know the identity of its neighbors, i.e., works in the KT0 model. The message complexity (and also the time complexity) of our algorithm is optimal up to a polylog n factor, as we show a Omega(n) lower bound on the message complexity. We further extend the result to Byzantine subset agreement, where a non-empty subset of nodes should agree on a common value. Lastly, we analyze several relevant results that follow from the construction of the main result. To the best of our knowledge, this is the first sublinear message complexity result of Byzantine agreement. A quadratic message lower bound is known for any deterministic BA protocol (due to Dolev-Reischuk [JACM 1985]). The existing randomized BA protocols have at least quadratic message complexity in the honest majority setting. Our result shows the power of a global coin in achieving significant improv

关键词： distributed algorithm Randomized algorithm Byzantine agreement Message complexity Global coin Cryptographic assumptions

来源：评论

学校读者我要写书评

暂无评论

Building-level Demand-side Energy Management Based on Game Theory 19

Building-level Demand-side Energy Management Based on Game T...

引用

19th IEEE International Conference on Mechatronics and Automation (IEEE ICMA)

作者： Zhang, Yang Ma, Yunfei Zhang, Shuang Chen, Lixian Liu, Hongda China Southern Power Grid Guangzhou Power Supply Bur Tianhe Rd Guangzhou Peoples R China Dongfang Elect Co Ltd Int Business Dept Airport Rd Yantai Peoples R China Harbin Engn Univ Coll ISSE Harbin Peoples R China

ISBN: (数字)9781665408530

ISBN: (纸本)9781665408530;9781665408523

In this paper, an improved building-level demandside management method is proposed based on load classification and real-time electricity pricing. Firstly, the loads are classified into uncontrollable loads, interruptible loads and transferable loads. The uncontrollable loads are forecasted as a part of the system state. The interruptible loads are controlled all the time. The transferable loads can be managed to work in proper periods in a day. Then, the user's electricity consumption is managed by the energy consumption controller, which solves a game problem between the user and the others. At last, we generate users' electricity consumption conditions using the Monte Carlo method and simulate the proposed managed system. Proved by experiments, the proposed method effectively reduces both the system cost and the users' payment, and improves the temporal distribution of the system load.

关键词： Demand-side energy management noncooperative game theory distributed algorithm real-time electricity pricing

来源：评论

学校读者我要写书评

暂无评论

Efficient Probabilistic Filtering of Data Subject to Channel Noise Under Local Pooling Conditions 11

Efficient Probabilistic Filtering of Data Subject to Channel...

引用

11th Mediterranean Conference on Embedded Computing (MECO) / 3rd Summer School on Cyber-Physical + Systems and Internet of Things (CPS and IoT)

作者： Lyakhov, Pavel A. Kalita, Diana, I Sinitca, Aleksandr M. Voznesensky, Alexander S. North Caucasus Fed Univ Dept Math Modeling Stavropol Russia St Petersburg Electrotech Univ LETI Dept Automat & Control Proc St Petersburg Russia

ISBN: (纸本)9781665468282

The widespread use of wireless sensor networks has led to the solution of one of the important problems associated with assessing their state in conditions of damaged communication channels. Known evaluation algorithms are based on a centralized or distributed data filtering structure. This paper proposes a distributed algorithm of three-stage Kalman filtering, which combines and processes data locally. The proposed design of the algorithm made it possible to reduce and stabilize the mean square error of the filter and limit it uniformly from above.

关键词： wireless sensor network probabilistic filtering Kalman filter distributed algorithm faulty channel local data aggregation

来源：评论

学校读者我要写书评

暂无评论

Zero Touch Coordinated UAV Network Formation for 360° Views of a Moving Ground Target in Remote VR Applications

Zero Touch Coordinated UAV Network Formation for 360° Views...

引用

IEEE Military Communications Conference (MILCOM)

作者： Wang, Yuhui Farooq, Junaid Univ Michigan Dept Elect & Comp Engn Dearborn MI 48128 USA

ISBN: (纸本)9781665485340

Unmanned aerial vehicles (UAVs) with on-board cameras are widely used for remote surveillance and video capturing applications. In remote virtual reality (VR) applications, multiple UAVs can be used to capture different partially overlapping angles of the ground target, which can be stitched together to provide 360 degrees views. This requires coordinated formation of UAVs that is adaptive to movements of the ground target. In this paper, we propose a joint UAV formation and tracking framework to capture 360 degrees angles of the target. The proposed framework uses a zero touch approach for automated and adaptive reconfiguration of multiple UAVs in a coordinated manner without the need for human intervention. This is suited to both military and civilian applications. Simulation results demonstrate the convergence and configuration of the UAVs with arbitrary initial locations and orientations. The performance has been tested for various number of UAVs and different mobility patterns of the ground target.

关键词： unmanned aerial vehicles connectivity virtual reality distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Distribution of Traffic in Manhattan Road Networks for Minimizing Routing-Time

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2021年第11期22卷 6799-6820页

作者： Sen Sarma, Sayan Sinha, Koushik Sub-r-pa, Chayanon Chakraborty, Goutam Sinha, Bhabani P. Univ Calcutta Dept Comp Sci & Engn Kolkata 700073 India Southern Illinois Univ Dept Comp Sci Carbondale IL 62901 USA King Mongkuts Inst Technol Ladkrabang Fac Informat Technol Bangkok 10520 Thailand Iwate Prefectural Univ Dept Software & Informat Sci Morioka Iwate 0208550 Japan

In a natural disaster, when there is a sudden rush in vehicle movement from dense residential areas of a city towards some designated evacuation centers, traffic needs to be distributed along the road network in an optimal way so as to minimize the travel time for reaching those evacuation centers. We address this traffic distribution problem in a k x k Manhattan road network with multiple traffic generating sources and a single fixed destination (sink) at a corner point. We first consider queuing delay at each grid point along with a fixed link delay. We then extend our idea to consider a rectangular grid and also real-life road networks where some of the links may he absent. We present a traffic distribution algorithm that would minimize the average time of all vehicles to reach the given destination point. Simulation of our algorithm using SUMO on the grid-structured road map of Manhattan borough in New York city and also on a part of non-grid road map of city of Carbondale, IL USA shows a much shorter average travel time compared to the existing popular algorithms based on dynamic traffic assignments (DTA). The proposed technique is also robust in the sense that even with 20% deviation from optimal assignment of traffic distribution at cross-points, we get significantly better results compared to the existing traffic distribution policies. We then propose a congestion control technique based on detouring of vehicles and show how variable link delay as a function of the volume of traffic flow through a link can be incorporated in our traffic distribution policy. Finally, we show how to extend our technique to consider a scenario with the destination point being anywhere on the grid, instead of being at the corner point.

关键词： Transportation network Manhattan grid network route planning traffic distribution queuing delay distributed algorithm shortest path routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：