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

A New Method for Peer Matching and Negotiation of Prosumers in Peer-to-Peer Energy Markets

IEEE TRANSACTIONS ON SMART GRID 2021年第3期12卷 2472-2483页

作者： Khorasany, Mohsen Paudel, Amrit Razzaghi, Reza Siano, Pierluigi Monash Univ Dept Elect & Comp Syst Engn Melbourne Vic 3800 Australia Univ British Columbia Okanagan Fac Appl Sci Sch Engn Kelowna Kelowna BC V1V 1V7 Canada Univ Salerno Dept Management & Innovat Syst I-84084 Fisciano Italy

This article presents a scalable mechanism for peer-to-peer (P2P) energy trading among prosumers in a smart grid. In the proposed mechanism, prosumers engage in a non-mediated negotiation with their peers to reach an agreement on the price and quantity of energy to be exchanged. Instead of concurrent bilateral negotiation between all peers with high overheads, an iterative peer matching process is employed to match peers for bilateral negotiation. The proposed negotiation algorithm enables prosumers to come to an agreement, given that they have no prior knowledge about the preference structure of their trading partners. A greediness factor is introduced to model the selfish behavior of prosumers in the negotiation process and to investigate its impact on the negotiation outcome. In order to recover the costs related to power losses, a transaction fee is applied to each transaction that enables the grid operator to recover incurred losses due to P2P trades. The case studies demonstrate that the proposed mechanism discourages greedy behavior of prosumers in the negotiation process as it does not increase their economic surplus. Also, it has an appropriate performance from the computation overheads and scalability perspectives.

关键词： Peer-to-peer computing Economics Optimization Indexes Computational complexity Smart grids Scalability decentralized algorithm market design multi-issue negotiation peer-to-peer market prosumer smart grids transaction fee

来源：评论

学校读者我要写书评

暂无评论

decentralized Inference With Graph Neural Networks in Wireless Communication Systems

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2023年第5期22卷 2582-2598页

作者： Lee, Mengyuan Yu, Guanding Dai, Huaiyu Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou Peoples R China Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou Peoples R China North Carolina State Univ Dept Elect & Comp Engn Raleigh NC USA

Graph neural network (GNN) is an efficient neural network model for graph data and is widely used in different fields, including wireless communications. Different from other neural network models, GNN can be implemented in a decentralized manner during the inference stage with information exchanges among neighbors, making it a potentially powerful tool for decentralized control in wireless communication systems. The main bottleneck, however, is wireless channel impairments that deteriorate the prediction robustness of GNN. To overcome this obstacle, we analyze and enhance the robustness of the decentralized GNN during the inference stage in different wireless communication systems in this paper. Specifically, using a GNN binary classifier as an example, we first develop a methodology to verify whether the predictions are robust. Then, we analyze the performance of the decentralized GNN binary classifier in both uncoded and coded wireless communication systems. To remedy imperfect wireless transmission and enhance the prediction robustness, we further propose novel retransmission mechanisms for the above two communication systems, respectively. Through simulations on the synthetic graph data, we validate our analysis, verify the effectiveness of the proposed retransmission mechanisms, and provide some insights for practical implementation.

关键词： Wireless communication Robustness Training Predictive models Data models Resource management Prediction algorithms Machine learning graph neural network decentralized algorithm retransmission robustness

来源：评论

学校读者我要写书评

暂无评论

Novel Multidimensional Models of Opinion Dynamics in Social Networks

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2017年第5期62卷 2270-2285页

作者： Parsegov, Sergey E. Proskurnikov, Anton V. Tempo, Roberto Friedkin, Noah E. Russian Acad Sci ICS RAS VA Trapeznikov Inst Control Sci Moscow Russia Univ Groningen Engn & Technol Inst ENTEG Groningen Netherlands Russian Acad Sci IPME St Petersburg Russia ITMO Univ St Petersburg Russia Politecn Torino CNR IEIIT Turin Italy Univ Santa Barbara Santa Barbara CA USA

Unlike many complex networks studied in the literature, social networks rarely exhibit unanimous behavior, or consensus. This requires a development of mathematical models that are sufficiently simple to be examined and capture, at the same time, the complex behavior of real social groups, where opinions and actions related to them may form clusters of different size. One such model, proposed by Friedkin and Johnsen, extends the idea of conventional consensus algorithm (also referred to as the iterative opinion pooling) to take into account the actors' prejudices, caused by some exogenous factors and leading to disagreement in the final opinions. In this paper, we offer a novel multidimensional extension, describing the evolution of the agents' opinions on several topics. Unlike the existing models, these topics are interdependent, and hence the opinions being formed on these topics are also mutually dependent. We rigorously examine stability properties of the proposed model, in particular, convergence of the agents' opinions. Although our model assumes synchronous communication among the agents, we show that the same final opinions may be reached "on average" via asynchronous gossip-based protocols.

关键词： Opinion dynamics social network multi-agent system decentralized algorithm

来源：评论

学校读者我要写书评

暂无评论

decentralized User Scheduling for Rate-Constrained Sum-Utility Maximization in the MIMO IBC

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2020年第10期68卷 6215-6229页

作者： Antonioli, Roberto Pinto Fodor, Gabor Soldati, Pablo Maciel, Tarcisio Ferreira Univ Fed Ceara Wireless Telecom Res Grp BR-60440900 Fortaleza Ceara Brazil Ericsson Res Radio Dept S-16480 Stockholm Sweden KTH Royal Inst Technol Div Decis & Control Syst S-10044 Stockholm Sweden Ericsson Res Stand & Technol S-16480 Stockholm Sweden

While the problems of sum-rate maximization and sum-power minimization subject to quality of service (QoS) constraints in the multiple input multiple output interference broadcast channel (MIMO IBC) have been widely studied, most of the proposed solutions have neglected the user scheduling aspect assuming that a feasible set of users has been previously selected. However, ensuring QoS for each user in the MIMO IBC involves the joint optimization of transmit/receive beamforming vectors, transmit powers, and user scheduling variables. To address the full problem, we propose a novel formulation of a rate-constrained sum-utility maximization problem which allows to either deactivate users or minimize the QoS degradation for some scheduled users in infeasible scenarios. Remarkably, this is achieved avoiding the complexity of traditional combinatorial formulations, but rather by introducing a novel expression of the QoS constraints that allows to solve the problem in a continuous domain. We propose centralized and decentralized solutions, where the decentralized solutions focus on practical design and low signaling overhead. The proposed solutions are then compared with benchmarking algorithms, where we show the effectiveness of the joint scheduling and transceiver design as well as the flexibility of the proposed solution performing advantageously in several MIMO IBC scenarios.

关键词： Quality of service MIMO communication Interference Scheduling Transceivers Signal to noise ratio Degradation User scheduling transceiver design decentralized algorithm MIMO IBC sum-rate maximization

来源：评论

学校读者我要写书评

暂无评论

decentralized Radio Resource Adaptation in D2D-U Networks

引用

IEEE INTERNET OF THINGS JOURNAL 2021年第8期8卷 6720-6732页

作者： Yin, Rui Wu, Zheyi Liu, Shengli Wu, Celimuge Yuan, Jiantao Chen, Xianfu Zhejiang Univ City Coll Sch Informat & Elect Engn Hangzhou 310018 Peoples R China KwaZulu Natal Univ Sch Elect Elect & Comp Engn ZA-4041 Durban South Africa Zhejiang Univ Sch Informat & Elect Engn Hangzhou 310027 Peoples R China Univ Electrocommun Grad Sch Informat & Engn Tokyo 1828585 Japan Valt Teknillinen Tutkimuskeskus Tech Res Ctr Finl Oulu 90570 Finland

Unlike the conventional device-to-device (D2D) networks, the unlicensed D2D (D2D-U) pairs can not only reuse the licensed channels with the base station (BS) but also share the unlicensed channels with the WiFi stations. One challenge arises from the fact that the co-channel interference on licensed channels and the collision probability on unlicensed channels may cause extra power consumption at the terminals. Accordingly, we first propose a channel access method for the D2D-U pairs on unlicensed channels. Then, a decentralized joint spectrum and power allocation scheme is designed to minimize the power consumption at D2D-U pairs. Different from the existing distributed schemes, the proposed scheme can guarantee the global minimization of power consumption across the D2D-U pairs. Simulation results validate the theoretical analysis and verify the performance from the proposed scheme.

关键词： Resource management Device-to-device communication Wireless fidelity 5G mobile communication Power demand Cellular networks Computational complexity decentralized algorithm new radio (NR) radio resource management unlicensed D2D (D2D-U)

来源：评论

学校读者我要写书评

暂无评论

Spatially-Temporally Collaborative Service Placement and Task Scheduling in MEC Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2023年第12期72卷 16650-16666页

作者： Feng, Chunhui Yang, Qinghai Quek, Tony Q. S. Wu, Weihua Guo, Kun Xidian Univ Sch Telecommun Engn State Key Lab Integrated Serv Network Xian 710071 Peoples R China Singapore Univ Technol & Design Singapore 487372 Singapore Yonsei Univ Yonsei Frontier Lab Seoul 03722 South Korea Shaanxi Normal Univ Sch Phys & Informat Technol Xian 710062 Peoples R China East China Normal Univ Shanghai Key Lab Multidimens Informat Proc Shanghai 200241 Peoples R China

Mobile edge computing provides the opportunity for edge systems to underpin a variety of computation-intensive yet delay-sensitive applications. We acknowledge that the limited computing and storage resource of an individual edge server allows only a subset of services to be placed at a time. This raises the question of service placement, which refers to where to place each type of service. Moreover, which service to place allows which type of tasks to be processed, and thereby affects task scheduling performance, which refers to where/whether to schedule each task and task splitting among edge and cloud. Respect of the interactions between service placement and task scheduling (SPTS), a joint optimized design of SPTS is investigated in this article. Our main contribution is a novel spatial-temporal collaboration of SPTS to minimize the overall cost of edge systems. Spatial collaboration is explored to enable edge servers within specific geographic regions collaboratively serve users' demands, while temporal collaboration is explored to optimize the SPTS in multiple time slots and pursue a long-term performance. We first propose an online and decentralized algorithm for spatial-temporal collaborative of SPTS. We then extend the proposed single-timescale of the proposed algorithm into multiple timescales to have service (re)placed at a larger timescale and hence alleviate service interruption. While proved to preserve the asymptotic optimality, the larger timescale slow down the optimal service placement decision. A learn-and-adapt strategy is further designed to speed up the service placement. Theoretical analysis and simulations are performed to validate the efficiency of the proposed algorithm.

关键词： Mobile edge computing collaborative service placement and task scheduling decentralized algorithm stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

DTA-HMR-TT: Dynamic Task Allocation for a Heterogeneous Team of Mobile Robots With Task Transfer

引用

IEEE ACCESS 2024年 12卷 177050-177063页

作者： Verma, Ashish Gautam, Avinash Singh Shekhawat, Virendra Mohan, Sudeept Birla Inst Technol & Sci Dept Comp Sci & Informat Syst Pilani 333031 Rajasthan India

Managing time-sensitive deliveries in settings like hospitals is a challenging task, especially when multiple pickup and delivery requests need to be coordinated efficiently within strict time windows. This paper focuses on the Multi-Pickup and Delivery Problem with Time Windows (MPDPTW), where a fleet of autonomous mobile robots works together to fulfill client requests that involve picking up items from specified origins and delivering them to designated destinations. Our objective is to minimize penalties associated with late deliveries while maximizing the number of successfully completed requests. To address this, we introduce a novel approach using a heterogeneous team of robots equipped with an efficient and cost-effective scheduling algorithm. Users submit requests with specific time constraints, and our proposed decentralized algorithm-Dynamic Task Allocation for Heterogeneous Mobile Robots with Task Transfer (DTA-HMR-TT)-optimizes task sharing between robots, ensuring timely service. The algorithm dynamically adjusts to handle rejected or delayed tasks and manages the complex transfer of tasks between robots to improve delivery efficiency. Extensive simulations have demonstrated that our approach significantly outperforms state-of-the-art methods. For smaller task sets (50 to 150 tasks), penalties were reduced by 27%, while for larger sets (150 to 300 tasks), penalties were lowered by 36%. Our results highlight the effectiveness of DTA-HMR-TT in enhancing task scheduling and coordination in multi-robot systems, offering a promising solution for improving delivery performance in structured environments.

关键词： Robots Resource management Robot sensing systems Mobile robots Heuristic algorithms Robot kinematics Hospitals Genetic algorithms Dynamic scheduling Time factors Multi-robot system pickup and delivery temporal constraint online task allocation task transfer decentralized algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Prior-Based Channel Estimation and Activity Detection in Cell-Free mMTC Systems

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2024年 72卷 5500-5516页

作者： Rajoriya, Anupama Singh, Nakul Budhiraja, Rohit Chaturvedi, Ajit K. IIT Kanpur Dept Elect Engn Kanpur 208016 India Georgia Inst Technol Atlanta GA 30332 USA

We consider the problem of joint channel estimation (CE) and device activity detection (DAD) in the uplink of a cell-free millimeter wave massive multiple-input multiple output (mMIMO) system for massive machine-type communication. We know that the mMIMO channel is spatially correlated, and is sparse in the angular domain. The correlation and sparsity are captured by tailoring a Gaussian prior. This prior is then used to design a centralized variational Bayesian learning (cVBL) algorithm for CE and DAD. The variational approximation in cVBL algorithm reduces its complexity from cubic to linear in terms of devices. We next propose an asynchronous decentralized VBL (adVBL) algorithm, wherein each AP locally estimates its channel from all the devices. The adVBL algorithm is robust to the AP failures, and its complexity is invariant of the number of APs. The adVBL algorithm is developed by reformulating cVBL updates as global optimization problems, and by deriving their local counterparts using the alternating direction method of multipliers. Through extensive numerical studies, we show that the proposed cVBL and adVBL algorithms i) outperform several existing algorithms;ii) require much less pilot overhead;and iii) estimate large-scale fading, unlike the existing ones.

关键词： Approximation algorithms Signal processing algorithms Correlation Channel estimation Antennas Millimeter wave communication Complexity theory Optimization Bayes methods Vectors decentralized algorithm expectation maximization variational Bayesian learning

来源：评论

学校读者我要写书评

暂无评论

Spatial gossip and resource location protocols

引用

JOURNAL OF THE ACM 2004年第6期51卷 943-967页

作者： Kempe, D Kleinberg, J Demers, A Univ So Calif Los Angeles CA USA Cornell Univ Ithaca NY USA

The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. Gossip protocols are mechanisms for this task in which nodes communicate with one another according to some underlying deterministic or randomized algorithm, exchanging information in each communication step. In a variety of contexts, the use of randomization to propagate information has been found to provide better reliability and scalability than more regimented deterministic approaches. In many settings, such as a cluster of distributed computing hosts, new information is generated at individual nodes, and is most "interesting" to nodes that are nearby. Thus, we propose distance-based propagation bounds as a performance measure for gossip mechanisms: a node at distance d from the origin of a new piece of information should be able to learn about this information with a delay that grows slowly with d, and is independent of the size of the network. For nodes arranged with uniform density in Euclidean space, we present natural gossip mechanisms, called spatial gossip, that satisfy such a guarantee: new information is spread to nodes at distance d, with high probability, in O(log(1+epsilon) d) time steps. Such a bound combines the desirable qualitative features of uniform gossip, in which information is spread with a delay that is logarithmic in the full network size, and deterministic flooding, in which information is spread with a delay that is linear in the distance and independent of the network size. Our mechanisms and their analysis resolve a conjecture of Demers et al. [1987]. We further show an application of our gossip mechanisms to a basic resource location problem, in which nodes seek to rapidly learn of the nearest copy of a resource in a network. This problem, which is of considerable practical importance, can be solved by a very simple protocol using Spatial Gossip, whereas we

关键词： algorithms gossip resource location decentralized algorithm

来源：评论

学校读者我要写书评

暂无评论

Monotonic self-stabilization and its application to robust and adaptive pattern formation

引用

THEORETICAL COMPUTER SCIENCE 2022年 934卷 21-46页

作者： Asahiro, Yuichi Suzuki, Ichiro Yamashita, Masafumi Kyushu Sangyo Univ Fukuoka Japan Univ Wisconsin Milwaukee Milwaukee WI USA Kyushu Univ Fukuoka Japan Kyushu Sangyo Univ Dept Informat Sci 2-3-1 Matsukadai Higashi ku Fukuoka 8138503 Japan

We introduce, as an enhancement of self-stabilization, the concept of monotonic self -stabilization for distributed systems that ensures that a certain measure of quality of state monotonically improves when the system in an illegitimate state progresses toward a legitimate state. In the concept, the quality is measured by a real-valued function that can be chosen from a certain class of functions. The concept is applied to a multi-robot pattern formation problem in which a group of autonomous mobile robots move from their respective initial positions to the goal positions like a marching band. We solve the problem by presenting two monotonic self-stabilizing pattern formation algorithms, one of which is for FSYNC model and the other is for SSYNC model. The considered real-valued functions to measure the quality take into account both the distance to the goal location and the accuracy of the formation. We present a formal proof of the algorithms' correctness and monotonic self-stability.(c) 2022 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： decentralized algorithm Formation change Motion planning Monotonic self -stabilization Pattern formation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：