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

6th IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Meng, Wei Xiao, Wendong Xie, Lihua Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore ASTAR Inst Infocomm Res Singapore Singapore

ISBN: (纸本)9781424487554

We consider source localization in a wireless sensor network in the absence of a fusion center, where each sensor makes hybrid time-of-arrival (TOA) and direction-of-arrival (DOA) measurements. Specially, in this paper, we focus on the bounded noise case. distributed location estimation is posed as a consensus problem. The average consensus method in the literature can be used for a linear fusion estimator which can be written as the ratio of two averages. The disadvantage of this average consensus method is that it can only used for linear model and needs to wait for the final convergence to achieve an acceptable accuracy. However, generally its convergence rate is low. Alternatively, we present a convex projection consensus method where we show that the resulting estimator at each sensor converges to a common point lying in the intersection of convex regions that are determined based on local sensor measurements and also the minimum number of sensors required to meet a certain estimation error tolerance is derived. Numerical results are presented showing the convergence properties and root mean squared error under both the average consensus and the convex projection methods.

关键词： source localization TOA DOA distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for big data analytics in healthcare 18

Distributed algorithm for big data analytics in healthcare

引用

IEEE/WIC/ACM International Conference on Web Intelligence (WI)

作者： Forestiero, Agostino Papuzzo, Giuseppe CNR ICAR Via Pietro Bucci8-9 C I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9781538673256

In the last few years, the exponential' expansion of social media is making available an enormous and continuous stream of data containing laminable information. A wide range of medical and healthcare applications, including clinical trials, disease surveillance, personalized medicines and population health management, can be also supported by analyzing these data. Obviously, new approaches and innovative methodologies are needed to investigate data characterized by high velocity, volume and variability. Dedicated services, comprising data sources and middleware, can be considered a dynamic content and then handled by exploiting a Content Delivery Networks (CDNs), an effective solution to manage contents in distributed systems. However, CDNs show limits in dynamic and Large systems in which a great amount of data is managed. This paper introduces a distributed and sell -organizing algorithm to build a management system for big data analytics in highly dynamite environments like healthcare domain. Thanks to autonomous and local operations performed by hosts of a 'distributed system, a logically organized overlay network emerges and the resource discovery operations became faster and efficient, Preliminary experimental results show the effectiveness of our approach.

关键词： healthcare distributed algorithm self-organization big data analytics

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm-based Equilibrium Analysis for Downward Regulation Market with Demand Response Resource 40

Distributed Algorithm-based Equilibrium Analysis for Downwar...

引用

40th Chinese Control Conference (CCC)

作者： Huang, Lidan Zhang, Shaohua Wang, Xian Ma, Jingjie Shanghai Univ Sch Mechatron Engn & Automat Shanghai Peoples R China Shanghai Inst Technol Sch Elect & Elect Engn Shanghai Peoples R China

ISBN: (纸本)9789881563804

Regulating capacity shortage will impose negative impact on the accommodation of renewable energy in a power system. Especially in off-peak load periods, the accommodation of wind power is highly dependent on the downward regulation capability of the power system. To encourage the provision of the downward regulation services and reasonably evaluate their market value, this paper presents a downward regulation market where power generators and demand response resources compete by submitting bids to meet the demand of downward regulation capacity in off-peak load periods. To investigate the bidding strategies in the downward regulation market, a game-theoretic equilibrium model is developed, in which supply function bid is considered. The equilibrium model can be transformed into a convex optimization model based on the equivalence of the optimality condition. Then, a distributed algorithm is applied to solve the convex optimization model and achieve equilibrium results. Numerical results illustrate the effectiveness of the proposed model and algorithm.

关键词： Downward regulation market Demand response Supply function equilibrium model distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Self Organizing LTE Interference Coordination

Distributed Algorithm for Self Organizing LTE Interference C...

引用

1st International ICST Conference on Mobile Networks and Management (MONAMI)

作者： Karla, Ingo Alcatel Lucent Bell Labs D-70435 Stuttgart Germany

ISBN: (纸本)9783642118166

A novel generic distributed algorithm is presented, which assigns in a self organizing way resources to the cells in cellular networks under the constraints that resource restrictions need to be considered between the cells. The algorithm operates in a fully distributed way, running independently inside each base station without any central entity. It optimizes the resource assignment, is capable to resolve sub-optimal aspects as well as comprises methods to detect and resolve possible instabilities such as contradicting decisions like ping pongs of two neighbouring base stations. The algorithm is here applied for LTE inter-cell interference coordination and simulations have shown that this distributed algorithm is always capable to solve reliably the resource assignment task.

关键词： distributed algorithm Colouring Self Organizing Networks SON Self-X Inter-Cell Interference Coordination ICIC IFCO Cellular Network 3GPP Long Term Evolution LTE

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Full-View Barrier Coverage with Rotatable Camera Sensors 58

Distributed Algorithm for Full-View Barrier Coverage with Ro...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Yang, Rui Gao, Xiaofeng Wu, Fan Chen, Guihai Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Key Lab Scalable Comp & Syst Shanghai 200030 Peoples R China

ISBN: (纸本)9781479959525

In wireless sensor networks, barrier coverage is a fundamental category of coverage problems and its surveillance capability can be reinforced when utilizing camera sensors. In this paper, we propose a distributed algorithm to solve the problem of Full-View Barrier Coverage with rotatable camera sensors (FBR). Our goal is to minimize the active sensor number when guaranteeing the surveillance capabilities. Correspondingly, we propose a distributed Proliferation algorithm (DPA) which is the first distributed algorithm to deal with such problem. In DPA, each sensor has five possible phases: Initial Phase, Update Phase, Expand Phase, Wait Phase, and Terminate Phase. The main idea of DPA is spreading the sensor direction along the barrier with the help of auxiliary conflicting graph. We design a greedy strategy based on DFS. Moreover, local Dijkstra algorithm is utilized to select the shortest path to reduce active sensor number from global view. The mass number of numerical experiments validate the efficiency of DPA which can construct a full-view barrier line with fewer sensors compared with previous work.

关键词： full-view barrier coverage rotatable camera sensors distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing distributed algorithm for local mutual inclusion

引用

INFORMATION PROCESSING LETTERS 2015年第6-8期115卷 562-569页

作者： Kakugawa, Hirotsugu Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka 5650871 Japan

Local mutual inclusion is a process synchronization problem where, for each process, at least one of its processes and neighbors must be in the critical section. We propose a self-stabilizing distributed solution to the local mutual inclusion problem. Convergence time of the proposed algorithm is one round under the weakly fair distributed daemon. (c) 2015 Elsevier B.V. All rights reserved.

关键词： distributed algorithm Mutual inclusion Mutual exclusion Process synchronization Self-stabilization

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Optimization of Chiral Metasurface for Sensing Based on a distributed algorithm

IEEE PHOTONICS JOURNAL

引用

IEEE PHOTONICS JOURNAL 2024年第1期16卷 1页

作者： Liao, Xianglai Gui, Lili Bi, Shulei Gao, Ang Yu, Zhenming Xu, Kun Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Dept Phys Beijing 100876 Peoples R China

We propose a distributed multi-objective optimization (DMO) method for designing chiral plasmonic metasurface that satisfies multiple objectives simultaneously. We aim to improve the refractive index sensitivity of the archetypical Born-Kuhn type chiral plasmonic metasurface while ensuring that circular dichroism (CD) is as pronounced as possible at a designated resonance wavelength. By leveraging distributed technology, the proposed method significantly improves the time efficiency of the optimization process. The simulation results demonstrate approximately 33% enhancement in sensitivity by DMO, as well as greater than 100% boost in time efficiency compared to stand-alone optimization approaches. These findings highlight the potential of the proposed method to guide the design of chiral plasmonic metasurface sensors, enabling the simultaneous optimization of multiple objectives and facilitating advancements in chiral optics and sensing applications.

关键词： Metasurfaces Statistics Sociology Optimization Sensors Plasmons Genetic algorithms Chiral plasmonic metasurface refractive index sensing multi-objective optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Achieving Near-Optimal Traffic Engineering Using a distributed algorithm in Hybrid SDN

引用

IEEE ACCESS 2020年 8卷 29111-29124页

作者： Ren, Cheng Bai, Shiwei Wang, Yu Li, Yaxin Southwest Petr Univ Sch Elect Engn & Informat Chengdu 610500 Peoples R China Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu 610054 Peoples R China Univ South Brittany Lab Math Atlantic Brittany F-56000 Vannes France

To empower advanced traffic engineering (TE) mechanism, while considering the infeasibility of one-step migration to software-defined networking (SDN), SDN nodes are incrementally deployed into legacy network, which gives rise to hybrid SDN. In hybrid SDN, redirecting flow of every source-destination pair through at least one SDN node, can enhance TE performance and obtain flow manageability, while on the other hand leading to increasing demands of TCAM resources in SDN nodes. In this paper, we make minimization of maximum link utilization as the TE objective, and comply with SDN waypoint enforcement and TCAM resource limitation. We first formulate the TE problem as an integer linear programming (ILP) model and solve it in a centralized manner, where SDN waypoint selection and splitting fractions for each flow are jointly determined. Then, based on a fact that the logically centralized control plane in hybrid SDN is composed of multiple physically decentralized controllers, each of which manages part of SDN nodes, as well as considering a real situation that a centralized solution is infeasible or too fragile for large-scale network, we develop a distributed algorithm deriving from Lagrangian decomposition theory to effectively solve the TE problem. The simulation results indicate that, when 30;of the SDN nodes are deployed, the proposed traffic engineering-aware distributed routing (TEDR) algorithm obtains maximum link utilization comparable to that of full SDN, and has a limited influence on the routing efficiency.

关键词： Software-defined networking hybrid SDN traffic engineering resource allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for the dead end problem of location based routing in sensor networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2005年第4期54卷 1509-1522页

作者： Zou, L Lu, M Xiong, ZX Texas A&M Univ Dept Elect Engn College Stn TX 77843 USA

The dead end problem in greedy forwarding is an important issue of location based routing in sensor networks. It occurs when a message falls into a local minimum using greedy forwarding. Current solutions to this problem are insufficient in either eliminating traffic/path memorization or finding satisfactory short paths. In this paper, we propose a novel algorithm, called partial-partition avoiding geographic routing (PAGER), to solve the problem. The basic idea of PAGER is to divide a sensor network graph into functional subgraphs and provide each sensor node with message forwarding directions based on these subgraphs. PAGER results in loop free short paths without memorization of traffics/paths in sensor nodes. It does not require planarization of the underlying network graph. Further, the mobility adaptability of PAGER makes it suitable for use in mobile sensor networks with frequent topology changes. We implement the PAGER algorithm in two protocols and evaluate them in sensor networks with different parameters. Experimental results show the advantage of PAGER in the context of sensor networks.

关键词： distributed algorithm graph theory protocols routing sensor networks shortest path topology

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm FOR COOPERATIVE OPTIMIZATION WITH POLYNOMIAL OBJECTIVE FUNCTION

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2024年第6期20卷 2178-2192页

作者： Meng, Haozheng Li, Tai-fang Fu, Jun Bohai Univ Coll Control Sci & Engn Jinzhou 121013 Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110189 Peoples R China

In this paper, we focus on designing a distributed algorithm for solving a kind of unconstrained cooperative optimization problem with poly-nomial objective function subject to variable coupling. A Lasserre relaxation method is used to convert the studied cooperative optimization problem to an equivalent semi-definite programming problem. Underlying the knowledge of graph theory, we disassemble variables of connection matrix and introduce a distributed alternating directions method of multipliers to solve the semi-definite programming problem. Different from the existing results, the advan-tage of the introduced algorithm is that it gives a distributed computing way to solve a kind of cooperative optimization problem with objective function subject to variable coupling. Finally, two simulation examples are given to verify the effectiveness of the proposed algorithm.

关键词： Cooperative optimization distributed algorithm Lasserre relaxation semidefinite programming polynomial function

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：