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

distributed algorithm for the maximal 2-packing in geometric outerplanar graphs

JOURNAL OF PARALLEL AND distributed COMPUTING 2014年第3期74卷 2193-2202页

作者： Antonio Trejo-Sanchez, Joel Alberto Fernandez-Zepeda, Jose Ctr Sci Res & Higher Educ Ensenada CICESE Dept Comp Sci Ensenada 22860 BC Mexico Univ Caribe Dept Basic Sci Cancun 77528 Quintana Roo Mexico

In this paper, we present a deterministic distributed algorithm that computes the maximal 2-packing set in a geometric outerplanar graph. In a geometric outerplanar graph, all the vertices have location coordinates in the plane and lie on the boundary of the graph. Our algorithm consists of three phases. First, it elects a vertex as the leader. Second, it explores the graph to determine relevant information about the structure of the input graph. Third, with this information, it computes a maximal 2-packing set. When the input graph is a ring, the algorithm computes a maximum 2-packing set. The execution time of this algorithm is O(n) steps and it uses O(n log n) messages. This algorithm does not require knowledge of the size of the input graph. To the best of our knowledge, this is the first deterministic distributed algorithm that solves such a problem for a geometric outerplanar graph in a linear number of steps. (C) 2013 Elsevier Inc. All rights reserved.

关键词： distributed algorithm Geometric graph Outerplanar graph Ear decomposition 2-packing set

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for optimal sequence and power allocation in uplink code division multiple access systems

引用

IET COMMUNICATIONS 2008年第2期2卷 292-299页

作者： Lacatus, C. Popescu, D. C. Shadaram, M. Univ Texas San Antonio Dept Elect & Comp Engn San Antonio TX 78249 USA Old Dominion Univ Dept Elect & Comp Engn Norfolk VA USA

An alternative approach is presented for centralised algorithms that design optimal sequences and powers under quality of service constraints in the uplink of a code division multiple access systems. The authors propose a distributed algorithm, where each user designs its optimal codeword in such a way to transmit minimum power, based on certain feedback information sent from the base station. The authors define the user cost function, which is the user power written as a convex function of user codewords for a defined signal-to-interference plus noise ratio target. For the constrained optimisation problem, optimal codewords are designed based on feasible direction method and the optimal user powers are the minimum values of the user cost functions. For the optimal configuration, the matched filter employed at receiver will have the same performance as the minimum mean squared error filter. Even if the optimal user powers are unique, the optimal codewords do not correspond to a unique allocation, but rather to an entire class of codewords that can be related by unitary transformations. The algorithm works properly in the presence of multiple access interference with white or coloured additive noise and requires no ordering. The proposed algorithm is analysed and illustrated with numerical examples obtained from simulations.

关键词： constrained optimisation problem optimal codeword design distributed algorithm distributed algorithms interference (signal) telecommunication links optimal sequence allocation AWGN convex programming code division multiple access least mean squares methods power allocation convex function coloured additive noise signal-to-interference noise ratio minimum mean squared error filter quality of service constraint matched filters uplink code division multiple access system white noise quality of service matched filter

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm TO PREVENT MUTUAL DRIFT BETWEEN N-LOGICAL CLOCKS

引用

INFORMATION PROCESSING LETTERS 1987年第3期24卷 199-202页

作者： RAYNAL, M IRISA Université de Rennes I Campus de Beaulieu 35042 Rennes Cédex France

Many distributed algorithms that control computations are based on logical clocks. Each process has a logical clock that behaves as a counter. The counter is initialized to zero and then increases each time an event is produced by the process. This value is then used to stamp the event. Along with the distinct process name, this stamp uniquely identifies the event. Since the logical speeds of the processes are independent, a logical clock may drift with respect to the other clocks. Two control methods exist to correct the values of logical clocks: 1. the a posteriori method, in which the drift is detected and then corrected, and 2. the a priori one, in which the drift is prevented. An a priori technique for correcting logical clocks is examined, and the algorithm used in this technique is studied in several environments.

关键词： distributed algorithm logical time correctness programming methodology protocol network

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for a finite time horizon resource allocation over a directed network

引用

IET CONTROL THEORY AND APPLICATIONS 2020年第9期14卷 1170-1182页

作者： Li, Wei Lin, Zhiyun Cai, Kai Yan, Gangfeng Zhejiang Univ Coll Elect Engn Hangzhou 310007 Zhejiang Peoples R China Hangzhou Dianzi Univ Sch Automat Hangzhou 310007 Zhejiang Peoples R China Osaka City Univ Urban Res Plaza Osaka 5588585 Japan

This work investigates a finite time horizon resource allocation problem under a strongly connected multi-agent network. In this network, each agent at each time is associated with a resource variable and a quadratic cost function. The objective is to minimise the total cost of all agents over the finite time horizon in a distributed manner, while enforcing a total amount of resources per time unit and per agent. The major challenge of this problem lies in the coupled equality constraints across the agents and time periods, which should be satisfied simultaneously in the end. In addition, the local information structure imposed by the digraph within the time horizon should be taken into account when solving the problem. This study develops a consensus-based multipliers decomposition method to solve the problem. The authors show that the convergence and optimality can be ensured provided that the digraph within the time horizon is strongly connected. Numerical simulations are presented to verify the effectiveness of the proposed algorithm.

关键词： resource allocation directed graphs distributed algorithms stochastic processes distributed algorithm directed network multiagent network resource variable quadratic cost function finite-time horizon resource allocation problem numerical simulations consensus-based multiplier decomposition method

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Tree-Structured Data Aggregation Service Placement in Smart Grid

引用

IEEE SYSTEMS JOURNAL 2014年第2期8卷 553-561页

作者： Lu, Zongqing Wen, Yonggang Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

Smart grid, regarded as the next generation of power grid, uses two-way flows of electricity and information to create a widely distributed automated energy delivery network. One distinguishing aspect of smart grid communication networks is the large-scale deployment of smart meters and sensors. Thus, a large amount of data and information will be generated from metering, sensing, monitoring, etc. Data aggregation (integration or fusion) aims at the merging of data from disparate sources with differing conceptual, contextual, and typographical representations. In order to satisfy the requirement of different information services, the placement of data aggregation services in smart grid communication networks is a critical design issue. In this paper, we propose a minimum-cost-forwarding-based asynchronous distributed algorithm to find the optimal placement for the data aggregation service tree with optimal cost of in-network processing. It is shown that minimum-cost forwarding can dramatically reduce message overheads of the asynchronous algorithm. It is also shown that our algorithm has less message overheads than the synchronous algorithm (Sync) by both mathematical analysis and simulation-based evaluation. For a regular grid network and a complete binary service tree, the messages sent at each node are O(root NM) for our proposed algorithm and O(root NM log(2)M) for the Sync, where N is the number of network nodes and M is the number of data objects in the service tree.

关键词： distributed algorithm minimum-cost forwarding service tree placement smart grid

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Learning to Coordinate in Infrastructure-Less Network

引用

IEEE COMMUNICATIONS LETTERS 2019年第2期23卷 362-365页

作者： Kumar, Rohit Darak, Sumit J. Hanawal, Manjesh K. Sharma, Ajay K. Tripathi, Rajiv K. Natl Inst Technol Delhi Dept ECE New Delhi 110040 India Indraprastha Inst Informat Technol Delhi Dept ECE New Delhi 110020 India Indian Inst Technol Dept IEOR Mumbai 400076 India IK Gujral Punjab Tech Univ Dept CSE Kapurthala 144603 India

We consider the spectrum access in an unlicensed spectrum (i.e., no incumbent users) for infrastructure-less networks where the number of users are unknown and they cannot coordinate with others due to lack of a control channel or a central controller. Also, users do not have spectrum sensing capability due to size and power constraints in battery operated radios. Such a setup is being studied for Internet of Things applications to enable sensors to communicate sensed data without the need of dedicated spectrum and network infrastructure. Using multi-user multi-armed bandit-based learning framework, we propose a new distributed algorithm which achieves a lower regret (i.e., throughput loss) than existing algorithms while keeping the number of collisions low. Fewer collisions save power which would have been otherwise wasted due to re-transmissions. High confidence bounds on the regret and number of collisions along with simulation results validate the effectiveness of our algorithm.

关键词： Infrastructure-less network multi-armed bandit distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for real time cooperative synthesis of wireless cell coverage patterns

引用

IEEE COMMUNICATIONS LETTERS 2008年第9期12卷 702-704页

作者： Jiang, Peng Bigham, John Khan, M. Anas Queen Mary Univ London Sch Elect Engn & Comp Sci London E1 4NS England

A real time fully distributed algorithm that would allow base stations (BSs) in cellular networks to autonomously and cooperatively find the wireless coverage pattern to optimize network performance is described. An antenna system that can change the radio frequency (RF) coverage is assumed at each base station. Simulations based on Mobile WiMAX technology show the effectiveness and robustness of the approach.

关键词： distributed algorithm cooperative control geographic load balancing mobile cellular network

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm FOR PERFORMANCE IMPROVEMENT THROUGH FILE REPLICATION, FILE MIGRATION, AND PROCESS MIGRATION

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1989年第11期15卷 1459-1470页

作者： HAC, A AT&T Bell Laboratories Naperville IL 60566

This paper presents a distributed algorithm for performance improvement through file replication, file migration, and process migration. This algorithm considers the number of read and write accesses to files for every process type, the number of processes and their demands on system resources, the utilization of bottlenecks on all machines, and file sizes. Performance improvement is discussed and proven by using the algorithm. A number of experiments executed in a distributed system are discussed to predict performance impacts of various algorithm strategies. These experiments show changes of system performance due to file and process placement, file replication, and file and process migration. [ABSTRACT FROM AUTHOR]

关键词： distributed algorithm distributed file system resource sharing system performance

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Generalized Nash Equilibria Seeking of Network Aggregative Game 36

Distributed Algorithm for Generalized Nash Equilibria Seekin...

引用

第36届中国控制会议

作者： Guanpu Chen Xianlin Zeng Peng Yi Yiguang Hong Academy of Mathematics and Systems Science Chinese Academy of Sciences Department of Electrical & Computer Engineering University of Toronto

ISBN: (纸本)9781538629185

This paper concentrates on seeking the generalized Nash equilibria of network aggregative games by using a distributed continuous-time *** considering the variational inequality related to the problem,we design a distributed algorithm seeking the variational equilibria,which are practically an essential part of generalized Nash equilibrium *** the novel distributed projected continuous-time algorithm is proved to find the variational equilibrium(some special generalized Nash equilibria) under mild ***,the algorithm is applied to a numerical example to show its efficacy.

关键词： distributed algorithm aggregative games generalized Nash equilibria multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Geographic Opportunistic Routing in VANETs at Road Intersection 15

Distributed Algorithm for Geographic Opportunistic Routing i...

引用

15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)

作者： Das, Debasis BITS Pilani Dept Comp Sci & Informat Syst KK Birla Goa CampusNH-17B Bypass Rd Zuarinagar 403726 Goa India

ISBN: (纸本)9781538619568

Geographic Opportunistic Routing (GOR) tries to avariciously send a message from source node to the closest neighboring node that's the highest priority toward the packet's destination at road Intersection in VANETs. Geographic Opportunistic Routing (GOR) may well be an advanced and efficient routing technique that was associated decent, economical and heightens routing scheme for VANETs. Vehicular Ad-Hoc Networks (VANETs) is a special type of wireless networks. In VANETs, the foremost challenge is that the extraordinarily dynamic property of mobile nodes (i.e., high mobility), therefore the extraordinarily dynamic topology suggests that topology changes over times. In this paper, we have a tendency to propose a new distributed geographical opportunistic routing protocol for vehicular ad-hoc situations referred to as distributed Geographical Opportunistic Routing (DGOR) protocol. To handle the node mobility, direction, and speed, we've got propose a new replacement metric that considers the geographical location of the vehicles, the amount of the neighboring nodes at road Intersection, and therefore the expected position of nodes victimization the motion vector of the vehicular nodes at road Intersection. We have introduced DGOR problem in Vehicular Ad-Hoc Networks at road Intersection and this problem is NP-complete. A O(nlogn) approximation algorithm is designed to solve the DGOR problem for Vehicular Ad-Hoc Networks at road Intersection.

关键词： Opportunistic Routing(OR) VANETs distributed algorithm Wireless Mediums Node Mobility Geographical Position

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：