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

Joint channel assignment and routing protocol for cognitive radio ad hoc networks

INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2017年第4期26卷 222-236页

作者： Kok, Gin-Xian Chow, Chee-Onn Xu, Yi-Han Ishii, Hiroshi Univ Malaya Dept Elect Engn Fac Engn Kuala Lumpur 50603 Malaysia Nanjing Forestry Univ Coll Informat Sci & Technol Nanjing 025 Jiangsu Peoples R China Tokai Univ Sch Informat & Telecommun Engn Dept Commun & Network Engn Minato Ku 2-3-23 Takanawa Tokyo 1088619 Japan

Conventional single channel wireless ad hoc networks usually suffer from low network throughput owing to the higher number of packet transmissions required for multi-hop communication. Using multiple channels within a single network can improve the network throughput. In multi-channel communication networks, the channels must be assigned appropriately to maximise network performance. Existing channel assignment methods are usually based on the approach of interference reduction/minimisation, for example, by making a link to operate on only one channel and different links to operate on different channels. In this paper, we go in the opposite direction and propose to make links to operate on more channels. A new distributed joint channel assignment and routing protocol for cognitive radio ad hoc networks called cognitive radio-enhanced AOMDV is proposed. Simulation studies showed that our method outperforms other methods.

关键词： distributed method channel assignment routing multi-hop wireless networks wireless mesh networks cognitive radio ad hoc networks interference channel metric performance evaluation simulation

来源：评论

学校读者我要写书评

暂无评论

distributed Low-Complexity Multi-cell Coordinated Multicast Beamforming with Large-Scale Antennas 19

Distributed Low-Complexity Multi-cell Coordinated Multicast ...

引用

19th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Yu, Jiawei Dong, Min Univ Ontario Inst Technol Dept Elect Comp & Software Engn Oshawa ON Canada

ISBN: (纸本)9781538635124

We consider downlink multicast beamforming in a multi-cell network with large-scale antennas. To reduce both communication and computation complexity in coordinated multicast beamforming, we propose the signal-to-leakage ratio (SLR) based coordinated multicast beamforming design to maximize the minimum SLR in the network. The SLR metric allows coordinated beamforming to be computed distributively and independently at each BS. To further reduce the complexity in obtaining the beam solution, we consider weighted maximum ratio transmission beamforming structure which transforms the multicast beamforming optimization into a weight optimization problem which is solved by the semi-definite relaxation approach. Our proposed distributed solution requires no communication or information sharing among cells and has very low computational complexity not depending on the number of antennas. Simulation shows that our proposed solution results in only a small loss to the centralized coordinated beamforming solution, but is significantly better than the non-coordinated methods.

关键词： Multicast beamforming massive MIMO multi-cell coordination distributed method maximum ratio transmission

来源：评论

学校读者我要写书评

暂无评论

A distributed method for state estimation and false data detection in power networks

A distributed method for state estimation and false data det...

引用

IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Pasqualetti, Fabio Carli, Ruggero Bullo, Francesco Univ Calif Santa Barbara Ctr Control Dynam Syst & Computat Santa Barbara CA 93106 USA

ISBN: (纸本)9781457717024

This work presents a distributed method for control centers to monitor the operating condition of a power network. Specifically we consider (static) state estimation problems, in which the state vector consists of the voltage magnitude and angle at all network buses. We consider the state to be linearly related to network measurements, which include power flows, current injections, and voltages phasors at some buses. We admit the presence of several cooperating control centers, and we design two distributed methods for them to compute the minimum variance estimate of the state given the network measurements. The two distributed methods rely on different modes of cooperation among control centers: in the first method an incremental mode of cooperation is assumed, whereas, in the second method, a diffusive interaction is implemented. These estimation methods, which are proved to converge in finite time, are further exploited to develop a distributed algorithm to detect corrupted data among network measurements.

关键词： Equations Monitoring Power measurement State estimation Transmission line measurements Vectors control centers current injections diffusive interaction distributed control distributed method false data detection load flow minimum variance estimate network

来源：评论

学校读者我要写书评

暂无评论

distributed Interference Alignment in Partially Connected Networks Without Preliminary Topological Knowledge 4

Distributed Interference Alignment in Partially Connected Ne...

引用

4th IEEE International Conference on Future Internet of Things and Cloud (FiCloud)

作者： Farkas, Peter Staron, Matej Schindler, Frank Slovak Univ Technol Bratislava Inst Telecommun Ilkovicova 3 Bratislava 81219 Slovakia Pan European Univ Inst Appl Informat Tematinska 10 Bratislava 85105 Slovakia

In this paper a new very simple distributed method for interference alignment is proposed. It is applicable to partially connected interference networks. In contrast to the known topological interference alignment tec... 详细信息

ISBN: (纸本)9781509039463

关键词： interference alignment distributed method partially connected networks topology ad hoc networks wireless networks IoT protocol

来源：评论

学校读者我要写书评

暂无评论

distributed Energy Management for Supply-Demand Coordination in a Smart Grid

Distributed Energy Management for Supply-Demand Coordination...

引用

IEEE/PES Transmission and Distribution Conference and Exposition (T&D)

作者： Zhang, Yihe Gao, Ling Xu, Yinliang Sun Yat Sen Univ SYSU CMU Joint Inst Engn SYSU CMU Shunde Int Joint Res Inst Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9781509021574

New low-carbon appliances (renewable generator, electric vehicle, etc.) develop rapidly and require advance control strategies to address their new features such as dispersed location and intermittency. Traditional centralized methods may not be an effective and economical solution, since a sophisticated communication network is needed to collect global information and a powerful central controller is required to process huge amount of data. This paper proposes a distributed method to optimize the overall social benefit and maintain the supply demand balance in a smart grid, considering three different types of load models including electric vehicle, air conditioning, lighting and electronic devices. Only information exchange among neighboring nodes is utilized, which enables the sharing of the computation and communication burden among local controllers to simplify the communication network and avoid the investment of expensive and powerful central controller. The effectiveness of the proposed distributed method is demonstrated through the simulation in the IEEE 14-bus system.

关键词： smart grid load model distributed method supply demand balance

来源：评论

学校读者我要写书评

暂无评论

A distributed Production Scheduling method for Highly-distributed Manufacturing Systems 1

引用

IFIP WG 5.7 International Conference on Advances in Production Management Systems (APSM)

作者： Morinaga, Eiji Sakaguchi, Yuki Wakamatsu, Hidefumi Arai, Eiji Osaka Univ Div Mat & Mfg Sci Suita Osaka 565 Japan

ISBN: (数字)9783662447390

ISBN: (纸本)9783662447383

Recent development of computer network technologies is realizing highly-distributed manufacturing systems from the hardware point of view, where each facility is computerized and manages itself autonomously by communicating with other facilities. For this new type of manufacturing systems, a new discrete event simulation paradigm has been discussed, in which sorting of events is performed by exchanging messages about their occurrence times among the facilities. To make this paradigm beneficial enough, it is desirable that re-scheduling process performed after the simulation is carried out in a similar paradigm. We have developed some production scheduling methods for flexible flow-shop production of only one kind of products with just one stage. This paper presents an improved method which can be applied to flexible flowshop of multiple kinds of products with multiple stages.

关键词： production scheduling distributed method agile manufacturing

来源：评论

学校读者我要写书评

暂无评论

distributed average consensus based on structural weight-balanceability

引用

IET CONTROL THEORY AND APPLICATIONS 2015年第2期9卷 176-183页

作者： Haghighi, Reza Cheah, Chien Chern Nanyang Technol Univ Dept Elect & Elect Engn Singapore 639798 Singapore

This study presents the concept of structural weight-balanceability of network systems as a useful method to examine the average consensus of the systems. The authors introduce the notion of structurally unobservable node based on structural observability concept to determine the structural weight-balanceability of a network. They propose a simple technique to identify structurally unobservable nodes, and consequently infer on structural weight-balanceability of the network. A mathematical method based on principal minors of the associated Laplacian matrix of the network is developed to modify a structurally weight-balanceable network into a weight-balanced one. A distributed method is presented to compute normalised principal minors in a large-scale network system with directed communication topology. This is the first work that provides a rigorous mathematical formulation to check the structural weight-balanceability of network systems and make a structurally weight-balanceable network, weight-balanced. Finally, simulation results are presented to illustrate the performance of the proposed method in dealing with networks with a large number of nodes.

关键词： networked control systems directed graphs matrix algebra observability distributed decision making network theory (graphs) structural weight balanceability network control systems distributed average consensus structural observability structurally unobservable node identification mathematical method Laplacian matrix structurally weight balanceable network distributed method directed communication topology

来源：评论

学校读者我要写书评

暂无评论

On the reliability of large-scale distributed systems - A topological view

引用

COMPUTER NETWORKS 2009年第12期53卷 2140-2152页

作者： He, Yuan Ren, Hao Liu, Yunhao Yang, Baijian Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China Ball State Univ Dept Technol Muncie IN 47306 USA

In large-scale, self-organized distributed systems, such as peer-to-peer (P2P) overlays and wireless sensor networks (WSN), a small proportion of the nodes are likely to be more critical to the system's reliability than others. This paper focuses on detecting cut vertices so that we can either neutralize or protect these critical nodes. Detection of cut vertices is trivial if the global knowledge of the whole system is known but it is very challenging when the global knowledge is not available. In this paper, we propose a completely distributed scheme where every single node can determine whether it is a cut vertex or not. In addition, our design can also confine the detection overhead to a constant instead of being proportional to the size of a network. The correctness of this algorithm is theoretically proved and the key performance gains are measured and verified through trace-driven simulations. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Cut vertex Peer-to-peer Reliability Detection distributed method

来源：评论

学校读者我要写书评

暂无评论

distributed source localization via projection onto the nearest local minimum

Distributed source localization via projection onto the near...

引用

33rd IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Shi, Qingjiang He, Chen Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China

ISBN: (纸本)9781424414833

When addressing the energy-based source localization problem using wireless sensor networks, distributed localization method is necessary to reduce the energy and bandwidth consumption. In this paper, a novel distributed source localization method called projection onto the nearest local minimum (PONLM) is proposed, which can be carried out at each of active nodes with quite lightweight computation, in contrast to most existing centralized method. Simulation results show our method can yield much better performance than the previous methods.

关键词： energy-based source localization wireless sensor networks distributed method PONLM

来源：评论

学校读者我要写书评

暂无评论

A CONNECTIONIST LEARNING ALGORITHM WITH PROVABLE GENERALIZATION AND SCALING BOUNDS

引用

NEURAL NETWORKS 1990年第2期3卷 191-201页

作者： GALLANT, SI Northeastern University USA

A connectionist learning algorithm, the bounded, randomized, distributed (BRD) algorithm, is presented and formally analyzed within the framework of computational learning theory. From a neural network viewpoint this framework gives clear definitions to commonly used terms such as “generalization” and “scaling up,” and addresses the following questions: • • What class of functions is being learned? • • How many training examples should be used? • • How many iterations are required? • • With what certainty can we be assured of learning a good model? From a computational learning theory perspective, a new class of connectionist concepts is shown to be polynomially learnable using the BRD algorithm. Since a variant of the BRD algorithm is in current use for tasks such as pattern recognition, this makes it one of the few learning algorithms shown to be polynomial within the computational learning theory framework that is close to an “industrial strength” algorithm. The algorithm can fail for several reasons: (a) noisy inputs; (b) underestimation of the difficulty of the concept being learned (i.e., larger concept class required); or (c) bad luck. Whenever the algorithm fails, there are several “fallback bounds” available. Finally, the Appendix gives a learnable class of network functions that strictly enlarges a class of learnable functions, Rivest's k-decision lists.

关键词： Connectionist Neural network Computational learning theory PAC-Learning Valiant Model Pocket algorithm distributed method BRD algorithm Perceptron Vapnik-Chervonenkis dimension Decision lists k -order distributed networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：