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

17th IEEE International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zhao, Yanchao Wu, Jie Lu, Sanglu Nanjing Univ Dept Comp Sci & Technol State Key Lab Novel Software Nanjing Jiangsu Peoples R China Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

ISBN: (纸本)9780769545769

Recently, the SINR-model has been widely utilized in link scheduling, spectrum allocation and other applications. The SINR model requires the receiving power information of all potential link peers, which is usually assumed to be known as priori or following a uniform propagation model. We have performed experiments to illustrate how real power data could improve the performance of the SINR-based applications with considerable margin. Thus, obtaining the real power data through measurements is promising. However, this method faces many challenges. We propose a pathloss model based solution, including a representative link selection method to cut down the measurement pairs;accuracy control to determine the sample size;and a measurement distribution method to shorten the measurement duration. Our experiments show that our solution significantly improves the SINR-based scheduling's performance.

关键词： SINR estimation throughput optimization pathloss model centralized algorithm spectrum assignment

来源：评论

学校读者我要写书评

暂无评论

Mobile Robot Task Allocation in Hybrid Wireless Sensor Networks

Mobile Robot Task Allocation in Hybrid Wireless Sensor Netwo...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Coltin, Brian Veloso, Manuela Carnegie Mellon Univ Inst Robot 5000 Forbes Ave Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781424466757

Hybrid sensor networks consisting of both inexpensive static wireless sensors and highly capable mobile robots have the potential to monitor large environments at a low cost. To do so, an algorithm is needed to assign tasks to mobile robots which minimizes communication among the static sensors in order to extend the lifetime of the network. We present three algorithms to solve this task allocation problem: a centralized algorithm, an auction-based algorithm, and a novel distributed algorithm utilizing a spanning tree over the static sensors to assign tasks. We compare the assignment quality and communication costs of these algorithms experimentally. Our experiments show that at a small cost in assignment quality, the distributed tree-based algorithm significantly extends the lifetime of the static sensor network.

关键词： auction-based algorithm centralized algorithm distributed algorithms distributed tree-based algorithm hybrid wireless sensor networks mobile robot task allocation mobile robots spanning tree static sensor trees (mathematics) wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Load-Based Approach for Selecting the Backbone Terminals for a Hierarchical Ad Hoc Network 33

A Load-Based Approach for Selecting the Backbone Terminals f...

引用

33rd Annual IEEE Military Communications Conference on Affordable Mission Success - Meeting the Challenge (MILCOM)

作者： Hazarika, Raihan Russell, Harlan B. Clemson Univ Dept Elect & Comp Engn Clemson SC USA

ISBN: (纸本)9781479967704

Efficient routing in mobile ad hoc networks (MANETs) is highly desired and connected dominating sets (CDS) have been gaining significant popularity in this regard. The CDS based approach reduces the search for a minimum cost path between a source and destination terminals to the set of terminals forming the backbone network. Researchers over the years have developed numerous distributed and localized algorithms for constructing CDSs which minimize the number of terminals forming the backbone or which provide multiple source-destination paths between each pair of terminals. However none of this research focuses on minimizing the load at the bottleneck terminal of the backbone network constructed by the CDS algorithms. A terminal becomes a bottleneck if the offered traffic load is greater than its effective transmission rate. In this paper we analyze the load based performance of a CDS algorithm and a k-connected k-dominating set (k-CDS) algorithm and compare it with our centralized algorithm which has been designed to minimize the load at the bottleneck terminals of the backbone network. We verify the effectiveness of our algorithm by simulating a large number of random test networks.

关键词： distributed algorithms mobile ad hoc networks telecommunication network routing telecommunication terminals telecommunication traffic MANETs backbone network backbone terminal selection centralized algorithm connected dominating sets destination terminals efficient routing hierarchical ad hoc network k-CDS algorithm k-connected k-dominating set load-based approach localized algorithms minimum cost path multiple source-destination paths random test networks source terminals traffic load Ad hoc networks algorithm design and analysis Approximation algorithms Color Measurement Routing Throughput Mobile ad hoc networks backbone network distributed algorithms Ad hoc networks telecommunication terminals algorithm design and analysis Transportation load telecommunication network routing telecommunication traffic Approximation algorithms Network routing destination terminal Throughput Device Terminal shortest path

来源：评论

学校读者我要写书评

暂无评论

Distributed Bayesian Network Structure Learning

Distributed Bayesian Network Structure Learning

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Na, Yongchan Yang, Jihoon Sogang Univ Seoul South Korea

ISBN: (纸本)9781424463916

We propose a new method for learning the structure of a Bayesian network from distributed data sources. Traditional Bayesian network learning takes place at the central site with all data. In many cases, data are distributed over different sites and gathering them at one place is not practical. Our algorithm starts with individual learning at each site with the local data. Then it transmits the learned Bayesian network to the central site. Last, the central site determines the final Bayesian network by looking for frequently occurring parts among the aggregated structures. Experimental results verify that our algorithm successfully finds the same structure that the centralized algorithm produces, with comparable classification accuracy and even higher learning speed.

关键词： Bayesian network belief networks centralized algorithm data structures distributed data source learning (artificial intelligence) machine learning network operating systems structure learning

来源：评论

学校读者我要写书评

暂无评论

Load Balanced Energy-aware Genetic algorithm Clustering in Wireless Sensor Networks 1

Load Balanced Energy-aware Genetic Algorithm Clustering in W...

引用

1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC)

作者： Farahmand, Ebrahim Sheikhpour, Saeide Mahani, Ali Taheri, Nooshin Shahid Bahounar Universit Dept Elect Engn Kerman Iran Shahid Bahounar Univ Dept Elect Engn Kerman Iran

ISBN: (纸本)9781467387378

Extending lifetime of wireless sensor networks is a major issue in WSNs due to their energy resource constraint. To solve this problem, various approaches have been proposed recently. Clustering is an effective topology control technique, among these approaches. This paper introduces a novel Load balanced Energy-aware Genetic algorithm Clustering (LEGAC) technique applied in WSNs. This technique is implemented at the base station. In the proposed technique, two-stage GA is employed to select optimal set of clusters. In the first stage, the technique picks up the optimal cluster heads. In the second stage, this technique assigns appropriate cluster members to these cluster heads. Moreover, intra-cluster distance is optimized tacking into account load-balancing constraint. The objective is to minimize energy consumption. The performance of this technique is compared with similar techniques, i.e., UCFIA-unequal clustering algorithm using Fuzzy logic, GCA- multihop clustering, and SCP- load balanced staggered clustering protocol. Simulation results show that LEGAC outperforms all these techniques in the same set up in terms of network lifetime, energy efficiency and network coverage.

关键词： sensor networks load balanced clustering Genetic algorithm centralized algorithm lifetime

来源：评论

学校读者我要写书评

暂无评论

A Distributed Consensus algorithm via LMI-Based Model Predictive Control and Primal/Dual Decomposition Methods

A Distributed Consensus Algorithm via LMI-Based Model Predic...

引用

IEEE International Conference on Control Applications Part of 2010 IEEE Multi-Conference on Systems and Control

作者： Wakasa, Yuji Tanaka, Kanya Nishimura, Yuki Yamaguchi Univ Grad Sch Sci & Engn Yamaguchi 7558611 Japan

ISBN: (纸本)9781424453634

This paper deals with an output consensus problem of multiple agents and first presents a centralized algorithm for solving it by a model predictive control method based on linear matrix inequalities. It can be shown that the outputs of all the agents controlled by the presented method asymptotically converge to a common point, i.e., consensus point. Then two kinds of algorithms for solving the consensus problem in a decentralized way are presented by using primal and dual decomposition methods. In general, these algorithms require a large number of iterations, i.e., a large number of communications between agents. To cope with this communication burden, a method that can reduce the number of iterations and guarantee the convergence to a consensus point is proposed by exploiting the property that the primal and dual decomposition methods can give upper and lower bounds of the optimal value of the optimization problem to be solved. The numerical example is given to illustrate the effectiveness of the proposed method.

关键词： LMI-based model predictive control centralized algorithm distributed algorithms distributed consensus algorithm linear matrix inequalities linear matrix inequalities predictive control primal/dual decomposition method

来源：评论

学校读者我要写书评

暂无评论

Novel Modification of the Collective Dynamic Routing Method for Sensors' Communication in Wi-Fi Public Networks

引用

SENSORS 2022年第22期22卷 8602-8602页

作者： Kozlov, Sergey Spirina, Elena Ashaev, Ivan Bukharina, Anna Gaysin, Artur Kazan Natl Res Tech Univ Radioelect & Telecommun Syst Dept Kazan 420111 Russia

The widespread use of the Internet of Things makes it relevant to use public IP networks for simultaneous access by both users and wireless sensors. To achieve this, a significant reduction in the subscriber devices' energy consumption is required. This paper analyzes the application features of the collective dynamic routing method both with and without the use of a robust method for estimating the channel data rate for sensors' communication in wireless public networks. Based on the analysis, a novel modification of the collective dynamic routing method has been developed that reduces the sensors' energy consumption while keeping a high data rate and short delivery time for users. An analysis of the network load, the total data transfer rate over the network, and the parameters affecting the sensors' energy consumption was carried out for a segment of a seamless IEEE 802.11ax network. The simulation demonstrated a high efficiency of using a novel modification of the collective dynamic routing method for access to users and wireless sensors.

关键词： IoT energy-efficient Wi-Fi IEEE 802 11ax robust algorithm collective dynamic routing centralized algorithm

来源：评论

学校读者我要写书评

暂无评论

On geometric shape construction via growth operations

引用

THEORETICAL COMPUTER SCIENCE 2024年 984卷

作者： Almalki, Nada Michail, Othon Univ Liverpool Dept Comp Sci Liverpool England Taif Univ Dept Informat Technol Taif Saudi Arabia Univ Liverpool Dept Comp Sci Ashton St Liverpool L69 3BX England

We study algorithmic growth processes under a geometric setting. Each process begins with an initial shape of nodes S-I = S-0 and, in every time step t >= 1, by applying (in parallel) one or more growth operations of a specific type to the current shape, St-1, generates the next, S-t, always satisfying vertical bar S-t vertical bar > vertical bar St-1 vertical bar. We define three types of growth operations and explore the algorithmic and structural properties of their resulting processes. Our goal is to characterize the classes of shapes that can be constructed in O(log n) or polylog n time steps, n being the size of the final shape S-F. Moreover, we want to determine whether a given shape S-F can be constructed from a given initial shape S-T using a finite sequence of growth operations of a given type, called a constructor of S-F. We give exact and partial characterizations of classes of shapes that can be constructed in polylog n time steps, polynomial-time centralized algorithms for deciding reachability between pairs of input shapes S-I, S-F) and for generating constructors when S-F can be constructed from S-I, as well as some negative results.

关键词： centralized algorithm Geometric growth operation Growth process Programmable matter Constructor

来源：评论

学校读者我要写书评

暂无评论

Energy Management Without Iteration-A Regional Dispatch Event-Triggered algorithm for Energy Internet

引用

FRONTIERS IN ENERGY RESEARCH 2022年 10卷

作者： Tan, Jiaming Liaoning Tech Univ Fac Elect & Control Engn Huludao Peoples R China

centralized algorithms and distributed algorithms have gained great attention on the energy Internet nowadays. The centralized algorithm presses too much communication and numeration load to its control center in large-scale and neterogeny EI. The distributed algorithm requests too many times of iteration, and the performance and convergence speed is quite slow. The current literature presents a regional dispatch event-triggered algorithm (RDETA). Energy management in RDETA can transform between a centralized model and distributed model. With the effort, the energy management does notrequire iteration times in quantity. And due to event-triggered asynchronous communication, energy management not only relieson a global synchronous clock but also decreasecommunication frequency in most cases and increasecommunication frequency in exigency. In addition, RDETA adopts regional communication and regional energy dispatch, which can automatically modulate the scale of dispatch area by the degree of the energy problem. Finally, simulation results and theoretical demonstration show the aforementioned contributions of the proposed algorithm.

关键词： asynchronous communication centralized algorithm distributed algorithm energy internet energy management multi-agent system renewable energy source zone control

来源：评论

学校读者我要写书评

暂无评论

QoS-aware multicast routing protocol based on centralized and distributed algorithms

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2005年第8期42卷 1403-1408页

作者： Huang, Dongjun Chen, Songqiao Wang, Jianxin College of Information Science and Engineering Central South University Changsha 410083 China

QoS-aware multicast service is an essential component in the future high speed Internet. QoS-aware multicast routing algorithm and protocol are the core of QoS-based multicast architecture. Proposed in this paper is a multi-path and QoS-aware multicast routing protocol integrated with both a centralized algorithm and a distributed one. A node initially takes, from a special node called the manager, some information about the existing tree the receiver wants to join. Then it uses Dijkstra's minimum cost algorithm with some costs as the parameters to calculate several minimum cost paths from the joining receiver to the source node and the on-tree nodes of the group, and regards them as a set of feasible paths for selection. When a joining receiver gets the set, it employs a heuristic to select the best path to join multicast tree. Analysis and experiments prove that this algorithm can be used to solve the delay and bandwidth-constrained minimum-cost multicast tree problem for it has many advantages such as loop-free, high average call accepted ratio, shorter average call setup time, and better scalability.

关键词： centralized algorithm Distributed algorithm Evaluation Heuristic Multi-path Multicast routing QoS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：