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

2016 First IEEE International Conference on Computer Communication and the Internet

作者： Bin Zeng Rui Wang Department of Management Engineering Naval University of Engineering Library of Training Department Naval University of Engineering

ISBN: (纸本)9781467385169

Distributed Hash Tables(DHTs)have emerged as the most popular scheme in the P2P network,which have drastically changed the way we share resources and gather *** order to solve the problem of search flexibility In DHT,an improved lookup and routing protocol based on Content Addressable Networks(CANs)is proposed,which not only preserves CANs’simplicity,but also achieves a resilient and efficient greedy DHT routing ***,a binary partition tree algorithm is designed to estimate the underlying network *** results shows that the proposed approach can gain better performance compared with the traditional CAN method.

关键词： distributed hash tables structured overlay network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Bstj 60: 4. April 1981: Blocking States in Connecting Networks Made of Square Switches Arranged in Stages. (Benes, V.E.)

引用

2016年

Bstj 60: 4. April 1981: Blocking States in Connecting Networks Made of Square Switches Arranged in Stages. (Benes, V.E.) by published by

关键词： (benes, april arranged bell system blocking busy busy pps connecting idle idle outlet idle path inner switch maximal network outlet outlet switch paths routing routing algorithm square switches switch switches switches arranged system technical

来源：评论

学校读者我要写书评

暂无评论

Multihop-Delivery-Quality-Based routing in DTNs

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2015年第3期64卷 1095-1104页

作者： Liang, Mingjiong Zhang, Zhiguo Liu, Cong Chen, Li Sun Yat Sen Univ Higher Educ Mega Ctr Sch Informat Sci & Technol Guangzhou 510006 Guangdong Peoples R China

In delay-tolerant networks (DTNs), stable end-to-end connections do not always exist. Messages are forwarded, assisted by the mobility of nodes, in a store-carry-forward paradigm. The mobility of nodes in most DTNs has a certain statistical regularity;thus, using historical information in DTNs to compute the delivery quality of nodes can help to select good forwarding nodes. This paper aims to establish a routing scheme based on multihop delivery quality, which is designed to reduce the energy consumption of message forwarding while maintaining a high delivery rate. We characterized the multihop delivery quality of each node with an expected delay and an expected probability, parameterized by the remaining hop count. Based on these two qualitymetrics, we developed two algorithms, namely, the delay-inferred forwarding (DIF) algorithm and the probability-inferred forwarding (PIF) algorithm. The basic idea of DIF and PIF is to find the optimal forwarding path by minimizing the expected delay and by maximizing the expected probability, respectively, in the hop graph that is defined in this paper. We performed extensive trace-driven simulations to compare our algorithm to other representative routing algorithms using several real traces. We observed the following: 1) Compared with the delegation algorithm, which uses one-hop delivery quality, both DIF and PIF significantly improve the message delivery rate, and they yield more improvements as the mobility of nodes becomes more regular;and 2) compared with the state-of-the-art optimal opportunistic forwarding (OOF) algorithm, which also uses a multihop delivery quality, DIF and PIF have significantly smaller forwarding overhead (with the maximum reduction in the number of forwarding being over 40%), whereas they are quite close to OOF in terms of both delivery rate and average delay.

关键词： Delay-tolerant networks (DTNs) expected delay expected probability multihop delivery quality routing algorithm

来源：评论

学校读者我要写书评

暂无评论

CONCOR: context-aware community-oriented routing for intermittently connected network

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2015年第1期2015卷 1页

作者： Johari, Rahul Gupta, Neelima Aneja, Sandhya Guru Gobind Singh Indraprastha Univ USICT Delhi 110078 India Univ Delhi Dept Comp Sci Delhi 110007 India Univ Delhi Inst Informat & Commun Delhi 110021 India

Delay-Tolerant Networks (DTNs) are characterized by time-varying and partially connected network topology. In such networks, mobility of node may be by virtue of its carrier. Social beings such as humans may act as a carrier of mobile nodes, and therefore mobility pattern of node follows a social-based movement model. Due to intermittent connectivity, end-to-end path between source and destination is rare and therefore message delivery is a challenge in such networks. In this paper, we present a new routing approach, context-aware community-oriented routing (CONCOR) that exploits the community and the context awareness of nodes, for efficient message delivery. Nodes with a common point of interest form a dynamic community. We have identified a set of node's attribute (context) and formulated a utility function to determine its capability to deliver a message. CONCOR is a multihop routing approach exploiting the nodes as message relays (store-carry-forward). Through simulation, we validated the effectiveness of node's attributes in estimation of message delivery probability. The simulations were done for our approach using the social movement-based data set on Opportunistic Network Environment (ONE) simulator. We compared our approach with dynamic social grouping (DSG)-based routing and context-aware routing(CAR) on three metrics viz. message delivery ratio, message traffic ratio and average message delay. We found that the results of our approach outperforms the DSG and CAR on all the three metrics.

关键词： Intermittent connectivity routing algorithm Context awareness DTN

来源：评论

学校读者我要写书评

暂无评论

DTN routing with Fixed Stations Based on the Geographic Grid Approach in an Urban Environment

引用

WIRELESS PERSONAL COMMUNICATIONS 2015年第4期82卷 2033-2049页

作者： Li, Wen-Zao Lin, Feng Zhou, Ji-Liu Wang, Yan Sichuan Univ Coll Elect & Informat Engn Chengdu 610065 Peoples R China Chengdu Univ Informat Technol Coll Commun Engn Chengdu 610065 Peoples R China Sichuan Univ Sch Comp Sci Chengdu 610065 Peoples R China

The various applications of Delay Tolerant Networking (DTNs) require a suitable routing protocol for urban environment. In general, the mobile node trajectory is associate with its social relations and regular life in urban areas, and existing DTN routing protocols cannot incorporate in urban environments. This study aims to improve the key targets, such as delivery ratio, latency and network overhead ratio, in urban environments by describing a routing algorithm based on Geographic Grid (GeoGrid). GeoGrid is suitable for a sensory data collection system in which a part of the mobile nodes generate data, and mobile relay nodes transport the data to a fixed sink station. Simulation experiments were carried out to verify the performance of the proposed GeoGrid under an urban scenario, and the results suggest that the GeoGrid outperforms both Epidemic and Prophet routing algorithms in successful delivery ratio, average delivery latency, and network overhead ratio.

关键词： Urban environment routing algorithm Geographic grid Fixed sink station Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant routing Method of NoC System Based on Clustering

Fault-Tolerant Routing Method of NoC System Based on Cluster...

引用

2016 8th IEEE International Conference on Communication Software and Networks(ICCSN 2016)

作者： Jia Minzheng Zhu Yunzhong Fu Fangfa Department of Information Engineering Beijing Polytechnic College Microelectronics Center Harbin Institute of Technology

Along with the development of semiconductor’s channel length that narrows toward the deep submicron and even nanometer,the design of SoC has become increasingly ***,how to achieve fault tolerance,aiming to avoid the impact process issues and improve reliability of system,has become the focus of the NoC *** paper presents a fault tolerance routing method on NoC system that can perfectly solve the problems *** low latency,this method based on the existing deterministic algorithms as well as adaptive algorithms and introduces a router clustering technology which supports task based mapping and *** NIRGAM simulator is utilized to achieve performance *** show that the proposed method has already achieved the goal that applications keep running on the system without the effect of unexpected faults in the ***,the performance of system does not decrease dramatically with the number of faults increasing on the chip.

关键词： network on chip clustering method routing algorithm fault tolerance

来源：评论

学校读者我要写书评

暂无评论

An Improved routing algorithm Based on the Peer Node Wireless Sensor Network

An Improved Routing Algorithm Based on the Peer Node Wireles...

引用

2011 3rd IEEE International Conference on Information Management and Engineering(ICIME 2011)

作者： Li Xueqiao, Wang Jing, Ji Xiaoyu School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zheng Zhou, China

This paper introduces an improved algorithm based on an event-driven wireless network for the node density and energy-limited network. According to the characteristics of the node density, node coverage must be overlapped. We use the algorithm to determine whether the node is redundant to a suspended state to save energy. And the remaining nodes in the network are to send information for the purpose. Based on the redundant nodes have more energy we choose them as cluster head nodes to prolong the network service life. Comparing the simulation results, the use of the proposed algorithm can indeed extend the network life with the same coverage.

关键词： wireless sensor network judgment of redundant nodes routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved QoS routing algorithm in Internet

An Improved QoS Routing Algorithm in Internet

引用

2011 3rd IEEE International Conference on Information Management and Engineering(ICIME 2011)

作者： Huang Hongbo Information Engineering Institute Yueyang Vocational Technical College Yueyang,Hunan Wang Yongzhi Computer Institute Hunan Institute of Science and Technology Yueyang,Hunan

An Efficient routing algorithm for Improving the QoS in Internet has been proposed and presented in this *** algorithm is a kind of Multi Constrained Path *** routing take place based on more than one link weight *** avoid the NP complete problem and to increase the computational efficiency some advancement are *** include the definition of Non Linear Path Length,where the sub paths may not be the shortest path,having 'k' no of shortest paths in a node instead of having only the shortest path,then removing the path dominancy for state space *** a last the concept look ahead is also included through which a predicted path to destination is *** work only implements the removal of path dominancy where the queue is updated by removing the dominated paths from the *** simulation is also showing the better performance of the system.

关键词： QoS routing algorithm Internet

来源：评论

学校读者我要写书评

暂无评论

Indoor Spatial Model and Accessibility Index for Emergency Evacuation of People with Disabilities

引用

JOURNAL OF COMPUTING IN CIVIL ENGINEERING 2016年第4期30卷 04015056-04015056页

作者： Hashemi, Mahdi Karimi, Hassan A. Univ Pittsburgh Sch Informat Sci Geoinformat Lab 135 North Bellefield Ave Pittsburgh PA 15260 USA

Although indoor emergency evacuation drills, simulations, and plans are addressed and well covered in literature, little attention is currently paid to the evacuation of people with disabilities (PWD). routing is a major process in all indoor emergency evacuations, simulations, and plans. Current indoor emergency evacuation routing algorithms find the shortest path or attempt to balance the traffic on exit doors. However, accessibility is more important than travel distance during the emergency evacuation of PWD. A spatial model, an accessibility index assigned to appropriate elements in the spatial model, and a way-finding technique are the major requirements of such routing. Existing spatial models of buildings are general purpose, fall short of efficiently and effectively handling emergency evacuations, and do not take into account the requirements of PWD. This paper proposes a spatial model for indoors which is specifically developed for the routing requirements of PWD during emergency evacuations. The accessibility index of an element in the spatial model represents the element's level of accessibility to PWD. Once the accessibility indexes for the elements of the spatial model are determined, an appropriate algorithm is applied to find the optimum exit route. The proposed spatial data model and egressibility measures are visualized for an 8-story building. The results showed that: (1)84% of stairways, 23% of doors, 2% of hallways, and the only ramp are inaccessible;(2)19% of the building is inegressible for PWD;(3)the cost of the most accessible egress route increases for the higher floors;and (4)if elevators stop working, all floors except the ground floor will become inegressible for PWD.

关键词： Indoor emergency evacuation Indoor spatial data model routing algorithm Graph Accessibility People with disabilities (PWD)

来源：评论

学校读者我要写书评

暂无评论

Advanced routing algorithm Based on Cycloid Model for P2P Network

Advanced Routing Algorithm Based on Cycloid Model for P2P Ne...

引用

2011 IEEE 3rd International Conference on Communication Software and Networks(2011第三届通信软件与网络国际会议 ICCSN2011)

作者： Zhang Jianzhe Department of Computer Science and Technology China University of Mining and Technology Xuzhou 221116China

Structured P2P network is a hot spot in recent researches. Structured P2P network routing problem is the most important. In this paper, due to the structure of Cycloid Model of P2P network routing algorithm in the cubical neighbor selection is too simple and low efficiency, we propose an improved *** using successive approximation technique and creating neighbor cycle routing table technology, improve routing efficiency and greatly reduce the average routing delay.

关键词： P2P Cycloid model cyclic neighbor cubical neighbor routing table routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：