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

Conference on Optical Fiber Communication (OFC)/National Fiber Optic Engineers Conference(NFOEC)

作者： Esmaeili, M. Peng, M. Khan, S. Finochietto, J. Jin, Y. Ghani, N. Univ New Mexico Albuquerque NM 87131 USA Wuhan Univ Wuhan Peoples R China North Dakota State Univ Fargo ND USA Univ Nacl Cordoba Cordoba Argentina Shanghai Jiao Tong Univ Shanghai Peoples R China

A novel multi-domain path routing solution is proposed for improving connection reliability under multiple correlated failure events. The formulation assumes probabilistic failures and jointly incorporates traffic eng... 详细信息

ISBN: (纸本)9781557529060

关键词： Assignment algorithms Dense wavelength division multiplexing Distortion Network survivability routing algorithms Wavelength assignment Networks (060.4250) Networks, assignment and routing algorithms (060.4251) Networks, network survivability (060.4257)

来源：评论

学校读者我要写书评

暂无评论

Communication Systems Principles Using MATLAB 1

引用

丛书名： []

2018年

作者： John W. Leis

ISBN: (数字)9781119470687

ISBN: (纸本)9781119470670

Discover the basic telecommunications systems principles in an accessible learn-by-doing format Communication Systems Principles Using MATLAB covers a variety of systems principles in telecommunications in an accessible format without the need to master a large body of theory. The text puts the focus on topics such as radio and wireless modulation, reception and transmission, wired networks and fiber optic communications. The book also explores packet networks and TCP/IP as well as digital source and channel coding, and the fundamentals of data encryption. Since MATLAB® is widely used by telecommunications engineers, it was chosen as the vehicle to demonstrate many of the basic ideas, with code examples presented in every chapter. The text addresses digital communications with coverage of packet-switched networks. Many fundamental concepts such as routing via shortest-path are introduced with simple and concrete examples. The treatment of advanced telecommunications topics extends to OFDM for wireless modulation, and public-key exchange algorithms for data encryption. Throughout the book, the author puts the emphasis on understanding rather than memorization. The text also: Includes many useful take-home skills that can be honed while studying each aspect of telecommunications Offers a coding and experimentation approach with many real-world examples provided Gives information on the underlying theory in order to better understand conceptual developments Suggests a valuable learn-by-doing approach to the topic Written for students of telecommunications engineering, Communication Systems Principles Using MATLAB® is the hands-on resource for mastering the basic concepts of telecommunications in a learn-by-doing format.

关键词： telecommunications building blocks root mean square maximum power transfer decibel wired telecommunications wireless telecommunications optical telecommunications pulse shaping line codes transmission lines standing waves radio wave reflection radio wave diffraction intermodulation principles of optical fiber light sources for optical fiber light detectors for optical fiber amplitude modulation frequency modulation phase modulation orthogonal signals orthogonal frequency division multiplexing OFDM WiFi OFDM using FFT spread spectrum packet switching wired local area networks wireless local area networks LANs WLANs IP addressing subnetworks transmission control protocol TCP congestion control object data structures routing algorithms shortest path algorithms quantization vector quantization channel capacity entropy image coding discrete cosine transform DCT audio encoding modified DCT linear predictive coding LPC block error codes Hamming codes convolutional coding Viterbi trellis error checking cyclic redundancy check CRC checksum digital signatures hash functions encryption enciphering key exchange public key encryption

来源：评论

学校读者我要写书评

暂无评论

A method of communication route switching by a distributed algorithm

引用

SYSTEMS AND COMPUTERS IN JAPAN 1996年第3期27卷 1-17页

作者： Kawahara, H Member NTT Information and Communication Systems Laboratories Yokosuka Japan 238

In the field of computer-network routing methods, there has been less research on fixed routing systems than on adaptive ones. However, there are a great many fixed routing systems in use on actual networks because they are simple. In fixed routing, a principal issue is which method should be used for switching to alternate routes in cases where damage to links or nodes blocks off primary routes. In the majority of cases, routing is changed by switching the links over which the packets are sent (called outgoing links). However, the methods have not yet been perfected-ping pong, looping, and other erroneous-routing phenomena arise occasionally. This paper presents a distributed algorithm to solve these problems. An algorithm will be given for restoring the original routes after recovery from damage. Finally, it will be proved that erroneous routing will not arise even when multiple chains of operations based on the algorithms presented are in progress at the same time.

关键词： computer networks distributed algorithms routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Low-power multicast routing algorithm in green Internet

引用

Tongxin Xuebao/Journal on Communications 2014年 35卷 134-140页

作者： Zhang, Jin-Hong Wang, Xing-Wei Huang, Min College of Information Science and Engineering Northeastern University Shenyang110819 China

A path node-driven strategy based one-to-many multicast routing algorithm in green Internet (GIOMR) is proposed to generate a low-power shortest path tree, fully making use of the path node sharing paths and meanwhile improving user's QoS satisfaction degree. The GIOMR is implemented over CERNET2 topology by simulation. It has been shown that GIOMR has better performance on the network power consumption, the success rate of routing and the running time than efficient heuristics for energy-aware routing (EHER) algorithm. ©, 2014, Editorial Board of Journal on Communications. All right reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

QoS routing algorithm in overlay multicast network

引用

Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) 2008年第SUPPL. 1期38卷 339-343页

作者： Pan, Yun Zhang, Li Wang, Licheng Yu, Zhenwei Computer School Communication University of China Beijing 100024 China School of Computer Science and Technology Henan Polytechnic University Jiaozuo 454000 China Department of Information Security Beijing University of Posts and Telecommunications Beijing 100876 China School of Mechanical Electronic and Information Engineering China University of Mining and Technology-Beijing Beijing 100083 China

In order to enhance the quality of multi-media service, in this paper, degree-constraint conditions are simultaneously concerned during the process of minimizing the maximal multicast delays. An integral method is employed to deal with the delay resulted from transportation and node processing. Based on this method, an optimization model for QoS-constrained Overlay multicast routing is introduced;and then, a heuristic algorithm for solving this model is proposed. The time complexity of the algorithm is O(|V|3), which is better than O(|V|4) of the complexities of most algorithms for solving the same problem, where V is the node number of the given network. Meanwhile, the simulation presented in this paper suggests that the quality of the solutions from our algorithm is better, i.e., there are less delays.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on a routing algorithm for clustered wireless sensor networks

引用

Tongxin Xuebao/Journal on Communications 2010年第8 A期31卷 63-69页

作者： Guo, Shu-Cheng Lu, Yu Xu, Ding-Gen Academy of Equipment Command and Technology Beijing 101416 China Ordnance Engineering College Shijiazhuang 050003 China

In wireless sensor networks, clustering algorithm prolongs networks' lifetime drastically. For a large size of WSN, the cluster head will consume too much energy if it transmits message to the sink directly. At first the EDR(energy distance ratio) was proposed for the problem, which gave the relationship between transmitting distance and energy efficiency. Afterward, a routing algorithm for transmitting message from cluster head to the sink was brought forward. In the algorithm, every node saved the information about location and energy of other nodes in current cluster. A transmitter selected the relaying node from its memory. If there was no node to relay in this cluster, the transmitter would send asking information to neighbor cluster and one of nodes in neighbor cluster answered the transmitter who was the relaying node. At last, simulation exhibited the algorithm was able to reduce energy consumption of WSN and also do well for balancing energy for WSN.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving Route Selections in ZigBee Wireless Sensor Networks

引用

SENSORS 2020年第1期20卷 164-164页

作者： Meka, Srikar Fonseca, Benedito, Jr. Underwriters Labs UL Inc 333 Pfingsten Rd Northbrook IL 60062 USA Northern Illinois Univ Dept Elect Engn 590 Garden Rd De Kalb IL 60115 USA

The ZigBee wireless communication specifications forecast the use of multihop routes between nodes and define that nodes select their routes based on their costs. The specifications define how to compute a route cost from the probability of successfully transmitting on each of the routes' links;and it is recommended that such probabilities be obtained by counting received link status messages or averaging link quality indicators from received packets. In this paper, we study the performance of these two recommended procedures, show that they can lead to degraded route selections, and propose a procedure that can improve route selections without modifications to the ZigBee protocol or frame formats. Our procedure estimates the probability of successful transmission on each link, based on information from the medium access layer during unicast packet transmissions, and includes a modification into how ZigBee nodes treat routing messages internally in order to reduce variations in the link cost estimates. Focusing on a home environment with one or two hops, our simulation results show that, in several scenarios, our procedure performs better than either of the two procedures recommended in the ZigBee specifications.

关键词： wireless sensor networks ZigBee link cost estimation routing algorithms many-to-one routing

来源：评论

学校读者我要写书评

暂无评论

A New Efficient and Reliable Dynamically Reconfigurable Network-on-Chip

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2012年第unknown期2012卷 1-16页

作者： Killian, Cedric Tanougast, Camel Monteiro, Fabrice Dandache, Abbas Univ Lorraine Lab Interfaces Sensors & Microelect LICM EA 1776 F-57070 Metz France

We present a new reliable Network-on-Chip (NoC) suitable for Dynamically Reconfigurable Multiprocessors on Chip systems. The proposed NoC is based on routers performing online error detection of routing algorithm and data packet errors. Our work focuses on adaptive routing algorithms which allow to bypass faulty components or processor elements dynamically implemented inside the network. The proposed routing error detection mechanism allows to distinguish routing errors from bypasses of faulty components. The new router architecture is based on additional diagonal state indications and specific logic blocks allowing the reliable operation of the NoC. The main originality in the proposed NoC is that only the permanently faulty parts of the routers are disconnected. Therefore, our approach maintains a high run time throughput in the NoC without data packet loss thanks to a self-loopback mechanism inside each router.

关键词： NETWORKS on a chip RELIABILITY (Engineering) COMPUTER networks MULTIPROCESSORS ROUTERS (Computer networks) DEBUGGING in computer science routing algorithms DATA packets & packeting

来源：评论

学校读者我要写书评

暂无评论

Research on the WSN Node Localization Based on TOA

引用

JOURNAL OF APPLIED MATHEMATICS 2013年第unknown期000卷 1-6页

作者： Wang, Qing-hui Lu, Ting-ting Liu, Meng-long Wei, Li-feng Shenyang Univ Chem Technol Sch Informat Engn Shenyang 110142 Peoples R China

Regarding the tracking of moving target in the large-scale fixed scene, a new routing algorithm of LAODV in the principle of TOA localization is proposed. Then, the participation field of the fixed node based on the node location information is properly controlled, while the routing request area is reduced through combination of AODV and LAR during transmission of the location information. Simulation results show that the proposed algorithm renders satisfactory performance in terms of average delay reduction from end to end, packet loss rate, and routing overhead. As a result, the delay and system overhead during localization could be minimized.

关键词： WIRELESS sensor networks WIRELESS sensor nodes LOCALIZATION (Mathematics) LARGE scale systems routing algorithms INFORMATION theory

来源：评论

学校读者我要写书评

暂无评论

On chip network with increased performance for efficient wireless communication

引用

Measurement: Sensors 2023年 27卷

作者： Ponnan, Suresh Kumar, Tikkireddi Aditya Dept of ECE Vel Tech Rangarajan Dr Sagunthala R & D Institute of Science and Technology Avadi Tamilnadu Chennai600062 India

Core systems with network transactions deployed semiconductor materials to develop wireless networks-on-chip to minimize latency with increased performance. For transmitting data from the source point towards the target point, an appropriate reconfigurable routing method has to be deployed with respect to nodes. For overhead on-chip communication that involves the linking of many cores in a single chip, congestion may occur which has to be eliminated. A marching memory arbitrator is deployed in the path that is prone to congestion which computes the port as a buffer. The static degradation of energy power utilization in the router is solved by using a Marching memory buffer. The secure communication of data can be deployed with hash, identity, and address verification blocks. The traffic is then relaxed by routing arbitrator and then data transmission is done through frequency division multiplexing in the communication channel with reconfigurable routing. The analysis of simulation results is found to have a better throughput, less latency, and reduced power consumption. © 2023 The Authors

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：