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

IEEE Global Communications Conference

作者： Qilie Liu Chunfeng Hu Yun Li Weiliang Zhao Yulu Ma Chongqing Key Lab of Mobile Communications Technology Chongqing University of Posts and Telecommunications China Telecom Shanghai Research Institute

ISBN: (纸本)9781479913510

In opportunistic networks, network topology constantly changes and instantaneous end-to-end paths are not available, nodes have narrow transmission ranges, limited storage space and energy. Lately, the consideration of social characteristics provides a new vision in the design of routing protocols and many routing protocols have been proposed to overcome the challenging conditions in the opportunistic networks. In this paper, we propose an Interest Community routing (ICR) algorithm which is founded on social network theory. Through the observation that people with similar interests are more willing to share their interests and communicate with each other, we define an interest metric and a message header to represent individual interests and data types in the networks. By comparing the similarity between the message header and the interest metric of node, the node will be put into corresponding interest community. After the work of detecting communities, considering the contact information among nodes, we have designed our routing algorithm and divided it into two parts: routing within the community and routing among communities. Finally, we implement our routing algorithm in the simulator. Comparing to other two classic routing algorithms, the results show that the proposed protocol ICR obtains better performance on delivery ratio, average overhead ratio and average packet delay.

关键词： routing algorithms routing protocols Network routing Communities Contact Information storage spaces interest Interests Social Characteristics Network theory data types Network Header Ion cyclotron resonance Ganglia

来源：评论

学校读者我要写书评

暂无评论

Topology-Agnostic Fault-Tolerant NoC routing Method 13

Topology-Agnostic Fault-Tolerant NoC Routing Method

引用

Design, Automation & Test in Europe Conference & Exhibition

作者： Eduardo Wachter Augusto Erichsen Alexandre Amory Fernando Moraes FACIN -- PUCRS Porto Alegre -- RS -- Brazil

ISBN: (纸本)9781450321532

routing algorithms for NoCs were extensively studied in the last 12 years, and proposals for algorithms targeting some cost function, as latency reduction or congestion avoidance, abound in the literature. Fault-tolerant routing algorithms were also proposed, being the table-based approach the most adopted method. Considering SoCs with hundred of cores in a near future, features as scalability, reachability, and fault assumptions should be considered in the fault-tolerant routing methods. However, the current proposals some have some limitations: (1) increasing cost related to the NoC size, compromising scalability;(2) some healthy routers may not be reached even if there is a source-target path;(3) some algorithms restricts the number of faults and their location to operate correctly. The present work presents a method, inspired in VLSI routing algorithms, to search the path between source-target pairs where the network topology is abstracted. Results present the routing path for different topologies (mesh, torus, Spidergon and Hierarchical-Spidergon) in the presence of faulty routers. The silicon area overhead and total execution time of the path computation is small, demonstrating that the proposed method may be adopted in NoC designs.

关键词： NoCs routing Method routing algorithms

来源：评论

学校读者我要写书评

暂无评论

VANET-enabled Eco-friendly Road Characteristics-aware routing for Vehicular Traffic

VANET-enabled Eco-friendly Road Characteristics-aware Routin...

引用

IEEE Vehicular Technology Conference

作者： Ronan Doolan Gabriel-Miro Muntean Performance Engineering Laboratory (PEL) RINCE Institute Dublin City University Dublin Ireland

ISBN: (纸本)9781467363365

The lack of significant breakthroughs in terms of alternative energy sources has caused both fuel consumption and gas emissions to constantly increase. In this context, improving fuel efficiency and reducing emissions in the transportation sector is vital, as vehicles are one of the important contributors to air pollution. This paper introduces EcoTrec, a novel eco-friendly routing algorithm for vehicular traffic which considers road characteristics such as surface conditions and gradients, as well as existing traffic conditions to improve the fuel savings of vehicles and reduce gas emissions. EcoTrec makes use of the Vehicular Ad-hoc NETworks (VANET) both for collecting data from distributed vehicles and to disseminate information in aid of the routing algorithm. The algorithm calculates the fuel efficiency of various routes and then directs the vehicle to a fuel efficient route, while also avoiding flash crowding. Simulation-based tests showed that by using EcoTrec, fuel emissions were significantly reduced, when compared with existing state-of-the-art vehicular routing algorithms.

关键词： ad-hoc networks routing vehicle communications wireless LAN road traffic VEHICULAR COMMUNICATIONS Ad hoc networks wireless local area network (WLAN) Network routing Road traffic Road Characteristics Fuel efficiency vehicle Traffic flow Air contamination routing algorithms Gas emissions Alternative energy sources

来源：评论

学校读者我要写书评

暂无评论

An Adaptive routing Algorithm for Load Balancing in Communication Networks

An Adaptive Routing Algorithm for Load Balancing in Communic...

引用

IEEE International Symposium on Circuits and Systems

作者： Jiajing Wu Chi K. Tse Francis C. M. Lau Ivan W. H. Ho Department of Electronic and Information Engineering The Hong Kong Polytechnic University Kowloon Hong Kong

ISBN: (纸本)9781467357609

In this paper, we study the packet routing process in communication networks. For efficient and reliable data transmission, the traffic load should be as uniformly distributed as possible in the network and the average distance travelled by the data should be short. The Internet has been demonstrated to have small-world and scale-free properties in its topology. Under the shortest path routing strategy, the traffic intensity of high degree nodes is much higher, thus causing congestion of the whole network. We propose an adaptive routing algorithm, which takes into consideration both the network structure property and the dynamic traffic information. Simulation results show that the proposed algorithm can effectively balance the traffic in the network and improve the overall traffic performance.

关键词： networks(communications) routing algorithms Load balancing traffic network Traffic density Transportation load averge distance carried Self tuning routing process topology

来源：评论

学校读者我要写书评

暂无评论

routing algorithms for translucent networks

引用

FIBER AND INTEGRATED OPTICS 2008年第4期27卷 256-264页

作者： Fiaschi, Giovanni Viglienzoni, Alfredo Ericsson R&D Co Marconi SpA I-16153 Genoa Italy

After a discussion on hybrid optical-electronic networks, the so-called translucent networks, this article presents routing algorithms for an efficient use of resources in dynamic traffic demands.

关键词： optical switching routing algorithms routing and wavelength assignment translucent networks

来源：评论

学校读者我要写书评

暂无评论

Fairness-aware resource partition and routing in relay-enhanced orthogonal-frequency-division-multiple-accessing cellular networks

引用

IET COMMUNICATIONS 2012年第16期6卷 2613-2620页

作者： Wang, J. Ma, Z. Lv, Z. Sheng, Y. Xiang, W. China Unicom Res Inst Network Technol Res Ctr Beijing 100048 Peoples R China Univ So Queensland Fac Engn & Surveying Toowoomba Qld 4350 Australia

Unlike conventional cellular networks where the evolved Node B (eNB) performs centralised scheduling, future relay-enhanced cellular (REC) networks allow relay nodes (RNs) to schedule users independently. This decentralised nature of the REC networks brings about challenges to maintain fairness. In this study, we formulate the generalised proportional fair (GPF) resource allocation problem, where resource partition and routing are included as part of the overall radio resource management aiming to provide fairness across all users served by the eNB and its subordinate RNs. Although the traditional proportional fair scheduling algorithm is executed independently at the eNB and each RN to maintain local fairness, we propose efficient resource partition and routing algorithms to maintain global fairness by optimising the GPF objective for the whole relay-enhanced cell. Through system level simulations, the proposed algorithms are evaluated and compared with both non-relaying and relaying systems with benchmark resource partition and routing algorithms. The simulation results show that the proposed algorithms outperform the existing algorithms in providing a better trade-off between system throughput and fairness performance.

关键词： cellular radio Communication network design, planning and routing orthogonal-frequency-division-multiple-access telecommunication network routing radio resource management routing algorithms relay-enhanced cellular networks OFDMA Modulation and coding methods Mobile radio systems nonrelaying systems GPF mobility management (mobile radio) generalised proportional fair resource allocation problem OFDM modulation eNB Multiple access communication evolved node B resource allocation Network management proportional fair scheduling algorithm resource partition RN relay nodes frequency division multiple access REC networks local fairness

来源：评论

学校读者我要写书评

暂无评论

A Vascular-Network-Based Nonuniform Hierarchical Fault-Tolerant routing Algorithm for Wireless Sensor Networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2012年第11期8卷 1-14页

作者： Li, Hongbing Gao, Peng Xiong, Qingyu Shi, Weiren Chen, Qiang Chongqing Univ Sch Automat Chongqing 400030 Peoples R China Chongqing Three Gorges Univ Sch Comp Sci & Engn Chongqing 404100 Peoples R China Chongqing Univ Sch Software Engn Chongqing 400030 Peoples R China

Fault tolerance is the key technology in wireless sensor networks which attracts many research interests. Aiming at the issue that the nodes' failures affect the network's stability and service quality, a vascular-network-based fault-tolerant routing algorithm is presented by nonuniform hierarchical clustering. According to the distribution characteristics of the vascular network and inspirations to the fault tolerance for wireless sensor networks, a mathematical model and network topology are, respectively, established. It applies the improved particle swarm optimization (IPSO) to the nonuniform hierarchical clustering, and multipaths are established between the neighbor hierarchical nodes based on the best-worst ant system (BWAS). It introduces the normalized values of the pheromone generated by the ants as the selection probabilities of transmitting paths to establish the hierarchical routing. Theoretical analysis and simulations show that the algorithm has higher packet receiving rates, lower average transmission delay, and balanced energy consumption. It has the good performance in fault tolerance and stability of data transmitting, and it avoids the hot issue in energy consumption and achieves the network load balance.

关键词： FAULT-tolerant computing routing algorithms WIRELESS sensor networks QUALITY of service ELECTRIC network topology PARTICLE swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Design of multi-path data routing algorithm based on network reliability

引用

COMPUTERS & ELECTRICAL ENGINEERING 2012年第6期38卷 1433-1443页

作者： Dasgupta, Mou Biswas, G. P. Indian Sch Mines Dept Comp Sci & Engn Dhanbad 826004 Bihar India

Data routing through an interconnected network is important and this paper addresses the design of a multi-path data routing algorithm based on network reliability. Generally, multiple routes for a given source-terminal pair exist in a data network and the best possible route based on network metrics like hop-count, delay, traffic, queue, etc. is selected by a routing algorithm. Since network reliability incorporates all these metrics, the routing decision based on reliability seems to be the best possible option and a distributed routing algorithm based on the source-terminal (s-t) path reliability has been proposed in this work. Each node in the proposed routing generates an adjacency matrix of a network graph by periodically exchanging connection information with the adjacent nodes and selects multiple routes based on reliability of the paths. We propose an implementation of a two-path routing algorithm that instead of one includes two next-hop nodes in each node's routing table. An example is given for further illustration of the proposed algorithm. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： SYSTEMS design routing algorithms COMPUTER networks RELIABILITY (Engineering) INFORMATION theory TIME delay systems DATA analysis DECISION making

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Jamming-Resilient Multipath routing

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2012年第6期9卷 852-864页

作者： Mustafa, Hossen Zhang, Xin Liu, Zhenhua Xu, Wenyuan Perrig, Adrian Univ S Carolina Dept Comp Sci & Engn Swearingen Engn Ctr Columbia SC 29208 USA Google Pittsburgh PA 15206 USA Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

Jamming attacks are especially harmful to the reliability of wireless communication, as they can effectively disrupt communication between any node pairs. Existing jamming defenses primarily focus on repairing connectivity between adjacent nodes. In this paper, we address jamming at the network level and focus on restoring the end-to-end data delivery through multipath routing. As long as all paths do not fail concurrently, the end-to-end path availability is maintained. Prior work in multipath selection improves routing availability by choosing node-disjoint paths or link-disjoint paths. However, through our experiments on jamming effects using MicaZ nodes, we show that disjointness is insufficient for selecting fault-independent paths. Thus, we address multipath selection based on the knowledge of a path's availability history. Using Availability History Vectors (AHVs) of paths, we present a centralized AHV-based algorithm to select fault-independent paths, and a distributed AHV-based routing protocol built on top of a classic routing algorithm in ad hoc networks. Our extensive simulation results validate that both AHV-based algorithms are effective in overcoming the jamming impact by maximizing the end-to-end availability of the selected paths.

关键词： Wireless networks routing algorithms jamming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：