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

An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks

COMPUTER COMMUNICATIONS 2005年第10期28卷 1193-1203页

作者： Boukerche, A El-Khatib, K Xu, L Korba, L Univ Ottawa PARADISE Res Labs SITE Ottawa ON Canada Natl Res Council Canada Ottawa ON Canada

An ad hoc wireless network is a temporary and dynamic environment where a group of mobile nodes with radio frequency transceivers communicate with each other without the intervention of any centralized administration or established infrastructure. Due to the limited transmission range of each mobile node, communication sessions between two nodes are usually established through a number of intermediate nodes, which are supposed to be willing to cooperate while forwarding the messages they receive to their destination. Unfortunately, some of these intermediate nodes might not be trustworthy and might be malicious, thereby forming a threat to the security and/or confidentiality of the exchanged data between the mobile nodes. While data encryption can protect the content exchanged between nodes, analysis of communication patterns may reveal valuable information about end users and their relationships. Using anonymous paths for communication provides security and privacy against traffic analysis. To establish these anonymous paths, in a traditional wired network, nodes build a global view of the network by exchanging routing information, whereas in an ad hoc wireless network, building this global view is not an option. In this paper, we propose a novel distributed routing protocol which guarantees security, anonymity and high reliability of the established route in a hostile environment, such as ad hoc wireless network, by encrypting routing packet header and abstaining from using unreliable intermediate node. The major objective of our protocol is to allow trustworthy intermediate nodes to participate in the path construction protocol without jeopardizing the anonymity of the communicating nodes. We describe our protocol, and provide its proof of correctness. (c) 2004 Published by Elsevier B.V.

关键词： wireless networks mobile ad hoc networks routing algorithms wireless security

来源：评论

学校读者我要写书评

暂无评论

An improved harmony search based energy-efficient routing algorithm for wireless sensor networks

引用

APPLIED SOFT COMPUTING 2016年 41卷 135-147页

作者： Zeng, Bing Dong, Yan Huazhong Univ Sci & Technol Sch Mech Sci & Engn State Key Lab Digital Mfg Equipment & Technol 1037 Luoyu Rd Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Elect & Informat Engn Dept 1037 Luoyu Rd Wuhan 430074 Peoples R China

Wireless sensor networks (WSNs) is one of the most important technologies in this century. As sensor nodes have limited energy resources, designing energy-efficient routing algorithms for WSNs has become the research focus. And because WSNs routing for maximizing the network lifetime is a NP-hard problem, many researchers try to optimize it with meta-heuristics. However, due to the uncertain variable number and strong constraints of WSNs routing problem, most meta-heuristics are inappropriate in designing routing algorithms for WSNs. This paper proposes an Improved Harmony Search Based Energy Efficient routing Algorithm (IHSBEER) for WSNs, which is based on harmony search (HS) algorithm (a meta-heuristic). To address the WSNs routing problem with HS algorithm, several key improvements have been put forward: First of all, the encoding of harmony memory has been improved based on the characteristics of routing in WSNs. Secondly, the improvisation of a new harmony has also been improved. We have introduced dynamic adaptation for the parameter HMCR to avoid the prematurity in early generations and strengthen its local search ability in late generations. Meanwhile, the adjustment process of HS algorithm has been discarded to make the proposed routing algorithm containing less parameters. Thirdly, an effective local search strategy is proposed to enhance the local search ability, so as to improve the convergence speed and the accuracy of routing algorithm. In addition, an objective function model that considers both the energy consumption and the length of path is developed. The detailed descriptions and performance test results of the proposed approach are included. The experimental results clearly show the advantages of the proposed routing algorithm for WSNs. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks routing algorithms Energy-efficient Meta-heuristic Harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic LSP routing in IP/MPLS over WDM networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2006年第12期24卷 45-55页

作者： Koo, Sunggy Sahin, Gokhan Subramaniam, Suresh Spirent Commun Calabasas CA 91302 USA Miami Univ Oxford OH 45056 USA George Washington Univ ECE Dept Washington DC 20052 USA

We consider an IP/MPLS over WDM network, in which label switched routers (LSRs) in the IP/MPLS layer are interconnected through optical cross-connects (OXCs) in the optical core network (WDM layer) providing an end-to-end wavelength routing capability. In this paper, we study a dynamic label switched path (LSP) routing problem for the three different network models of the IP/MPLS over WDM network, namely, Overlay, Augmented, and Peer models. For the overlay model, we propose two algorithms: ECF_OVLY and MLH_OVLY. In ECF_OVLY, a network always tries to use existing capacity first, whereas in MLH_OVLY, a network finds a path with the minimum number of logical hops for an LSP request. We also propose, for the augmented model, two simple and efficient dynamic LSP provisioning algorithms, called MCPI_AUG and DCPI_AUG, utilizing different type/amount of summarized capacity information from the WDM layer, namely Minimum CaPacity Information (MCPI) and Detailed CaPacity Information (DCPI). We compare the proposed algorithms with the existing algorithms available for the overlay [1] and peer [2], [3] models. The algorithms are compared and evaluated using two key performance measures: LSP blocking probability and network (lightpath) utilization. Simulation results show that at low loads with a limited number of ports available in the network, DCPI_AUG achieves an order of magnitude better blocking performance than the algorithm in [2] and outperforms the one in [3] by more than three times. It also achieves higher network utilization than the one in [2] by more than 10 % and the one in [3] by 2-7 % depending on the traffic load. Considering the small amount of information that is exchanged between the layers in the augmented model, these results suggest that the augmented model can be a practically good compromise between the overlay and peer models.

关键词： optical networks IP-over-WDM GMPLS peer model overlay model augmented model routing algorithms blocking probability utilization port-limited network

来源：评论

学校读者我要写书评

暂无评论

CHARACTERISTICS, routing ALGORITHM, AND OPTICAL IMPLEMENTATION OF 2-DIMENSIONAL PERFECT-SHUFFLE NETWORKS

引用

APPLIED OPTICS 1993年第35期32卷 7210-7216页

作者： WU, YM LIU, LR WANG, ZJ The authors are with the Academia Sinica Shanghai Institute of Optics and Fine Mechanics P.O. Box 800-216 Shanghai 201800 China.

One-dimensional perfect-shuffle networks are extended to two-dimensional perfect-shuffle networks, and this extension is analyzed by means of the finite-state model. The routing algorithm presented is based on quaternary numbers for 4 x 4 switches, and its extension to k x k switches is briefly discussed. In order to take full advantage of the three-dimensional interconnection capability and two-dimensional space-bandwidth product of free-space optics, we map one-dimensional perfect-shuffle networks into two-dimensional perfect-shuffle networks, with both having 4 x 4 switching elements. Finally we compare the permutation capability of two-dimensional perfect-shuffle networks with one-dimensional perfect-shuffle networks.

关键词： Fast Fourier transforms Free space optics Lens arrays Optical networks Parallel processing routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimal adaptive routing on the mesh with bounded queue size

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1996年第2期34卷 154-170页

作者： Chinn, DD Leighton, T Tompa, M MIT COMP SCI LAB CAMBRIDGE MA 02139 USA

An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters, Such algorithms potentially avoid network bottlenecks by routing packets around ''hot spots.'' Minimal adaptive routing algorithms have the additional advantage that the path each packet takes is a shortest one. For a large class of minimal adaptive routing algorithms, we present an Omega(n(2)/k(2)) bound on the worst case time to route a static permutation of packets on an n x n mesh or torus with nodes that can hold up to k greater than or equal to 1 packets each, This is the first nontrivial lower bound on adaptive routing algorithms, The argument extends to more general routing problems, such as the h-h routing problem, It also extends to a large class dimension order routing algorithms, yielding an Omega(n(2)/k) time bound. To complement these lower bounds, we present two upper bounds, One is an O(n(2)/k + n) time dimension order routing algorithm that matches the lower bound, The other is the first instance of a minimal adaptive routing algorithm that achieves O(n) time with constant sized queues per node, We point out why the latter algorithm is outside the model of our lower bounds. (C) 1996 Academic Press, Inc.

关键词： Parallel Lower bound Packet routing algorithms Greater than or equal to distributed adaptive routing algorithm Parallel Lines Self tuning

来源：评论

学校读者我要写书评

暂无评论

A DISTRIBUTED routing ALGORITHM FOR MULTIHOP PACKET RADIO NETWORKS WITH UNIDIRECTIONAL AND BIDIRECTIONAL LINKS

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 1995年第3期44卷 579-585页

作者： POMALAZARAEZ, CA Department of Engineering Purdue University Fort Wayne IN USA

Multihop Packet Radio Networks require routing algorithms which are distributed in nature and which have the ability to timely detect changes in the network topology. These changes are mostly changes in connectivity caused by link or node failures and by the relative motion of the nodes. This paper describes and analyzes an adaptive decentralized routing algorithm for Packet Radio Networks. The network connectivity, as perceived by each node, is translated into a graph representation of the network, The proposed routing mechanism then uses a breadth-first search algorithm along the inbound links of such a graph, Unlike most of the algorithms found in the open literature the one proposed here can be used in networks having both uni- and bi-directional radio links, Examples are shown to illustrate the methodology.

关键词： graph theory network topology packet radio networks radio links telecommunication network routing adaptive decentralized routing algorithm bi-directional links breadth-first search algorithm graph representation inbound links link failures multihop packe Graph representations Packet radio networks Graph theory Network topology telecommunication network routing routing algorithms Radio links Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

A novel multicast routing algorithm and its application for protection against single-link and single-link/node failure scenarios in optical WDM mesh networks

引用

OPTICS EXPRESS 2011年第26期19卷 471-477页

作者： Constantinou, Costas K. Ellinas, Georgios Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus

A new heuristic algorithm called "Steiner Node Heuristic" (SNH) for solving the Steiner Tree problem in graphs and, consequently, for routing multicast calls in mesh optical WDM Networks, is presented. The new algorithm is used for the development of a new multicast protection technique which, as simulations show, outperforms the existing ones in terms of blocking probability and average cost, for both single-link and single-link/node failure scenarios. (C) 2011 Optical Society of America

关键词： algorithms Optical fibers Optical networks routing algorithms Video Wavelength division multiplexing

来源：评论

学校读者我要写书评

暂无评论

An Efficient routing Method for Range Queries in Skip Graph

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2020年第3期E103D卷 516-525页

作者： Banno, Ryohei Shudo, Kazuyuki Tokyo Inst Technol Tokyo 1528550 Japan

Skip Graph is a promising distributed data structure for large scale systems and known for its capability of range queries. Although several methods of routing range queries in Skip Graph have been proposed, they have inefficiencies such as a long path length or a large number of messages. In this paper, we propose a novel routing method for range queries named Split-Forward Broadcasting (SFB). SFB introduces a divide-and-conquer approach, enabling nodes to make full use of their routing tables to forward a range query. It brings about a shorter average path length than existing methods, as well as a smaller number of messages by avoiding duplicate transmission. We clarify the characteristics and effectiveness of SFB through both analytical and experimental comparisons. The results show that SFB can reduce the average path length roughly 30% or more compared with a state-of-the-art method.

关键词： Skip Graph overlay networks peer-to-peer networks routing algorithms distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient routing based on a genetic algorithm for satellite laser communication

引用

OPTICS EXPRESS 2023年第5期31卷 8682-8695页

作者： Jing, Yinji Yang, Zhenghao Zhao, Yongli Wang, Hua Wang, Wei Rahman, Sabidur Zhang, Jie Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China AT&T Labs Atlanta CA USA

Low earth orbit satellite laser communication has become an important part of communications due to its large capacity and low latency. The lifetime of the satellite mainly depends on the recharge and discharge cycles of the battery. The low earth orbit satellites frequently recharge under sunlight and discharge in the shadow, which leads satellites to age quickly. This paper studies the energy-efficient routing problem for satellite laser communication and builds the satellite ageing model. Based on the model, we propose an energy-efficient routing scheme based on the genetic algorithm. Compared with shortest path routing, the proposed method improves the satellite lifetime by about 300%, and the performances of the network are only slightly degraded, the blocking ratio increases by only 1.2%, and the service delay increases by 1.3 ms.(c) 2023 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

关键词： Genetic algorithms Laser communications Network topology Optical devices Optical networks routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：