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

communication algorithms in k-ary n-cube interconnection networks

INFORMATION PROCESSING LETTERS 1997年第1期61卷 43-48页

作者： Ashir, Y Stewart, IA Ahmed, A UNIV LEICESTER DEPT MATH & COMP SCILEICESTER LE1 7RHLEICSENGLAND UNIV BAHRAIN DEPT COMP SCIMANAMABAHRAIN

We consider several communication algorithms in the k-ary n-cube interconnection network;in particular, we develop and analyse routing, multi-node broadcasting, single-node scattering and total exchange algorithms, Al... 详细信息

关键词： interconnection networks parallel processing k-ary n-cubes communication algorithms

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Task Assignment and communication algorithms for Unmanned Aerial Vehicle Flocks

引用

JOURNAL OF AEROSPACE COMPUTING INFORMATION AND communication 2008年第8期5卷 234-250页

作者： Ben-Asher, Yosi Feldman, Sharoni Gurfil, Pini Feldman, Moran Univ Haifa Dept Comp Sci IL-31999 Haifa Israel Technion Israel Inst Technol Fac Aerosp Engn IL-32000 Haifa Israel Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

This work develops distributed hierarchical task assignments and communication algorithms for flocks of unmanned aerial vehicles dispersed in an unknown theater while engaging multiple moving targets. The dynamical changes require distributed algorithms, without relying on a central agent, which may constitute a single point-of-failure and is exposed to communication breaks. Our methodology overcomes the typical deficiencies of a centralized solution by organizing the agents in spanning trees. Whenever possible, the spanning trees merge into a single tree that clusters the maximum number of agents. Using relaxation methods and inputs from its parent and children, every agent attempts to optimize its own solution for task assignment while communicating using an ad-hoc protocol. Simulation experiments show clear-cut advantages of using the proposed task assignment and communication algorithms.

关键词： communication algorithms UAV Information Processing Multi Robot Systems Autonomous Robot Moving Target Indicators Distributed Computing Obstacle Avoidance Matching Algorithm Formation Flying

来源：评论

学校读者我要写书评

暂无评论

Efficient communication algorithms in Hexagonal Mesh Interconnection Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2012年第1期23卷 69-77页

作者： Albader, Bader Bose, Bella Flahive, Mary Kuwait Univ Dept Comp Sci Fac Sci Safat 13060 Kuwait Oregon State Univ Sch Elect Engn & Comp Sci Corvallis OR 97331 USA Oregon State Univ Dept Math Corvallis OR 97331 USA

In this paper, we show that the hexagonal mesh networks developed in the early 1990s are a special case of the EJ networks that have been considered more recently. Using a node addressing scheme based on the EJ number system, we give a shortest path routing algorithm for hexagonal mesh networks. We also extend the known efficient one-to-all broadcasting algorithm on hexagonal mesh networks to algorithms for one-to-one personalized broadcasting, all-to-all broadcasting, and all-to-all personalized broadcasting algorithms. Their time complexity and optimality are analyzed.

关键词： Parallel processing interconnection networks hexagonal mesh networks EJ networks broadcasting communication algorithms

来源：评论

学校读者我要写书评

暂无评论

CLIC-IoE - Cross Solution to communications under IoE

引用

AD HOC NETWORKS 2025年 170卷

作者： Hamrioui, Sofiane Lloret, Jaime Lorenz, Pascal ESAIP Engineer Sch St Barthelemy Anjou France Haute Alsace Univ IRIMAS Mulhouse Colmar France Paris 8 Univ PARAGRAPHE St Denis France Univ Politecn Valencia Valencia 46022 Spain Univ Haute Alsace IRIMAS Mulhouse Colmar France

The rapid expansion of connected devices has ushered in the Internet of Everything (IoE), enabling seamless integration among machines, people, and systems across diverse applications. However, the IoE faces significant challenges in ensuring efficient, reliable, and energy-conscious data transmission at scale. To address these issues, we present CLIC-IoE (Cross-Layer Solutions to Improve communications under IoE), an innovative cross-layer framework designed to significantly enhance communication performance within IoE environments. By intelligently coordinating multiple communication layers, CLIC-IoE achieves remarkable results: a 39.47% reduction in data errors, a 38.33% increase in delivery rates, and a decrease of 0.8 nanoseconds in end-to- end delays. Additionally, it optimizes energy consumption, demonstrating a 51.67% improvement in energy efficiency (CEA) and a 20% boost in Active Things Rate (ATR). These advancements position CLIC-IoE as a transformative solution that enhances the scalability and reliability of IoE systems while promoting sustainable energy use. This manuscript provides a comprehensive exploration of the CLIC-IoE architecture, algorithms, and performance evaluation, emphasizing its potential impact on future IoE deployments. By addressing the critical challenges faced in IoE environments, CLIC-IoE not only enhances communication performance but also paves the way for more sustainable and efficient IoT systems.

关键词： IoE Next generation applications communication algorithms Transport Network Reliability Efficiency Collaborative approach QoS parameters Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

MIMO Cross-Layer Secure communication Algorithm for Cyber Physical Systems Based on Interference Strategies

引用

IEEE ACCESS 2020年 8卷 226797-226810页

作者： Hao, Yukai Qiu, Xin Wuhan Univ Technol Sch Management Wuhan 400070 Peoples R China Tibet Univ Sch Econ & Management Lhasa 850000 Peoples R China

In this paper, a detailed analysis of multi-input multi-output (MIMO) cross-layer secure communication algorithms in information-physical systems is investigated employing an interference strategy. A three-stage data-assisted channel estimation method is proposed in this paper for the acquisition of channel state information for complex jamming channels in large-scale MIMO two-layer systems. To implement the data-assisted scheme, assuming that there are no errors and no delay in the system, if the data detection and decoding data sequences are completed at a small cell base station, they are sent to the macro base station via a wired backhaul. Due to the sparsity of the channel at the macro base station after user grouping, a channel estimation algorithm based on optimal block orthogonal matching tracking(s) is proposed in the case where the downlink channel at the macro base station utilizes the decoded uplink data and known training sequences. The simulation results show that the data-assisted method proposed in this paper is effective in improving channel estimation accuracy. A machine learning algorithm is directly used to classify the channel difference or channel matrix to obtain the authentication results. In this paper, the scheme is first simulated using channel data from dynamic communication scenarios, its feasibility is analyzed, and the parameters in the scheme are compared, and the optimal scheme is the bagging tree authentication scheme using a 128-dimensional channel matrix as input. To address the interference problem caused by the dense arrangement of SAPs in heterogeneous networks and the unbalanced network load, large-scale MIMO techniques are introduced to reduce the downlink interference caused by the microcell boundary expansion in heterogeneous networks.

关键词： Interference Authentication Spread spectrum communication MIMO communication Licenses Jamming Transmitters Jamming strategies cyber physical systems MIMO cross-layer security communication algorithms

来源：评论

学校读者我要写书评

暂无评论

Attitude commands avoiding bright objects and maintaining communication with ground station

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1999年第6期22卷 759-767页

作者： Hablani, HB Boeing Co Reusable Space Syst Flight Control Syst Avion Engn Downey CA 90242 USA

The objective of the paper is to develop attitude commands for slewing a vehicle such that the angle of its boresight with the centroid of a bright object is not less than a minimum angle and its antennae do not lose communication with the ground. These commands involve three angles: the required pitch/yaw slew angle, the bright object's exclusion angle normal to the slew angle, and a roll angle for maintaining communication. The location of the bright object's centroid is formulated in terms of an angle normal to the ideal slew plane. If the ideal, minimum-angle slew path enters the forbidden perimeter around the bright object, two alternative exclusion angles are determined so as to pass the object tangentially from either side. Between the two angles, that exclusion angle is selected, which steers the ground station trace, in the communication beam, toward beam axis and not away from it. communication links of the antennae are maintained by rolling the vehicle before, during, or after slewing. The three-axis attitude and rate commands are illustrated for a stressing scenario in which two bright objects are close by and hence pose special circumstances for the algorithm to tackle.

关键词： Ground Station Antennas Yaw Earth Telescopes Quaternions communication algorithms Hubble Space Telescope Interplanetary Spacecraft Monte Carlo Simulation

来源：评论

学校读者我要写书评

暂无评论

communication in the two-way listen-in vertex-disjoint paths mode

引用

THEORETICAL COMPUTER SCIENCE 2001年第1期264卷 65-90页

作者： Böckenhauer, HJ Rhein Westfal TH Aachen Lehrstuhl Informat 1 D-52056 Aachen Germany

A new communication mode for the dissemination of information among processors of interconnection networks via vertex-disjoint paths is introduced and investigated. In this communication mode, in one communication step two processors communicating via a path P send their pieces of information to all other processors on this path, too. The complexity of a communication algorithm is measured by the number of communication steps (rounds). In this paper we will design optimal broadcast, accumulation, and gossip algorithms for various classes of networks including paths, cycles, and hypercube-like networks. The main results are optimal accumulation and gossip algorithms for the two-dimensional grid. The technique used for the design of these algorithms is based on finding Hamiltonian paths in the grid with certain endpoints or center points. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： communication algorithms parallel computations

来源：评论

学校读者我要写书评

暂无评论

Distributed moving horizon state estimation: Simultaneously handling communication delays and data losses

引用

SYSTEMS & CONTROL LETTERS 2015年 75卷 56-68页

作者： Zeng, Jing Liu, Jinfeng Shenyang Univ Chem Technol Liaoning Prov Key Lab Control Technol Chem Proc Shenyang 110142 Peoples R China Univ Alberta Dept Chem & Mat Engn Edmonton AB T6G 2V4 Canada

In this work, we consider distributed moving horizon state estimation of nonlinear systems subject to communication delays and data losses. In the proposed design, a local estimator is designed for each subsystem and the distributed estimators communicate to collaborate. To handle the delays and data losses simultaneously, a predictor is designed for each subsystem estimator. A two-step prediction-update strategy is used in the predictor design in order to get a reliable prediction of the system state. In the design of each subsystem estimator, an auxiliary nonlinear observer is also taken advantage of to calculate a reference subsystem state estimate. In the local estimator, the reference state estimate is used to generate a confidence region within which the local estimator optimizes its subsystem state estimate. Sufficient conditions under which the proposed design gives decreasing and ultimately bounded estimation error are provided. The effectiveness of the proposed approach is illustrated via the application to a chemical process example. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Nonlinear systems Distributed state estimation Moving horizon estimation communication algorithms Chemical processes

来源：评论

学校读者我要写书评

暂无评论

communication ASPECTS OF THE STAR GRAPH INTERCONNECTION NETWORK

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第7期5卷 678-687页

作者： MISIC, J JOVANOVIC, Z UNIV BELGRADE DEPT COMP SCIYU-11001 BELGRADEYUGOSLAVIA

Basic communication algorithms for star graph interconnection networks are developed by using the hierarchical properties or the star graph, with the assumption that one input channel can drive only one output communication channel at a time. With this constraint, communication algorithms for each node can be expressed only as sequences of generators corresponding to the communication channels. Sequences that are identical exploit the symmetry and hierarchical properties of the star graph and can be easily integrated in communication hardware. Their time complexities are evaluated and compared with the corresponding results for the hypercube.

关键词： communication algorithms INTERCONNECTION NETWORKS MULTICOMPUTERS CAYLEY GRAPHS STAR GRAPH

来源：评论

学校读者我要写书评

暂无评论

Cache Line Aware Algorithm Design for Cache-Coherent Architectures

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2016年第10期27卷 2824-2837页

作者： Ramos, Sabela Hoefler, Torsten Swiss Fed Inst Technol Scalable Parallel Comp Lab Dept Comp Sci Zurich Switzerland

The increase in the number of cores per processor and the complexity of memory hierarchies make cache coherence key for programmability of current shared memory systems. However, ignoring its detailed architectural characteristics can harm performance significantly. In order to assist performance-centric programming, we propose a methodology to allow semi-automatic performance tuning with the systematic translation from an algorithm to an analytic performance model for cache line transfers. For this, we design a simple interface for cache line aware optimization, a translation methodology, and a full performance model that exposes the block-based design of caches to middleware designers. We investigate two different architectures to show the applicability of our techniques and methods: the many-core accelerator Intel Xeon Phi and a multi-core processor with a NUMA configuration (Intel Sandy Bridge). We use mathematical optimization techniques to tune synchronization algorithms to the microarchitectures, identifying three techniques to design and optimize data transfers in our model: single-use, single-step broadcast, and private cache lines.

关键词： Cache coherence shared memory communication algorithms performance modeling Xeon Phi Sandy Bridge

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：