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

Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies

作者： Yingbo Wang Jun Li Hui Li School of Computer and Information Engineering Henan University Kaifeng Henan China Office of Information Management Henan University Kaifeng Henan China School of Henan University Minsheng College Kaifeng Henan China

ISBN: (纸本)9781450387828

In the research of data center network structure, routing algorithm is one of the important research fields, it is mainly to find a suitable path to transfer data information from the source node to the destination node. In this paper, multicast routing algorithm is designed for three layers of graphite structure with optimal performance. Graphite structure will be closer to practical application due to its own advantages. But the author did not design its routing algorithm. In recent years, group communication is becoming more popular. Multicast is becoming more important in group communication in current data center network. This paper introduces the construction of the three-layer graphite structure and designs the multicast routing algorithm of the three-layer graphite structure.

关键词： Wireless data center network routing algorithm Graphite structure

来源：评论

学校读者我要写书评

暂无评论

FOCAN: A Fog-supported smart city network architecture for management of applications in the Internet of Everything environments

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2019年 132卷 274-283页

作者： Naranjo, Paola G. Vinueza Pooranian, Zahra Shojafar, Mohammad Conti, Mauro Buyya, Rajkumar Sapienza Univ Rome DIET I-00184 Rome Italy Univ Padua Dept Math I-35131 Padua Italy Univ Melbourne CLOUDS Sch Comp & Informat Syst Melbourne Vic 3010 Australia

Smart city vision brings emerging heterogeneous communication technologies such as Fog Computing (FC) together to substantially reduce the latency and energy consumption of Internet of Everything (IoE) devices running various applications. The key feature that distinguishes the FC paradigm for smart cities is that it spreads communication and computing resources over the wired/wireless access network (e.g., proximate access points and base stations) to provide resource augmentation (e.g., cyberforaging) for resource- and energy-limited wired/wireless (possibly mobile) things. Motivated by these considerations, this paper presents a Fog-supported smart city network architecture called Fog Computing Architecture Network (FOCAN), a multi-tier structure in which the applications are running on things that jointly compute, route, and communicate with one another through the smart city environment. FOCAN decreases latency and improves energy provisioning and the efficiency of services among things with different capabilities. In particular, three types of communications are defined between FOCAN devices - interprimary, primary, and secondary communication-to manage applications in a way that meets the quality of service standards for the Internet of Everything. One of the main advantages of the proposed architecture is that the devices can provide the services with low energy usage and in an efficient manner. Simulation results for a selected case study demonstrate the tremendous impact of the FOCAN energy efficient solution on the communication performance of various types of things in smart cities. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Smart city Internet of Everything (IoE) Fog computing routing algorithm Computing and communication

来源：评论

学校读者我要写书评

暂无评论

HSDC: A Highly Scalable Data Center Network Architecture for Greater Incremental Scalability

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2019年第5期30卷 1105-1119页

作者： Zhang, Zhen Deng, Yuhui Min, Geyong Xie, Junjie Yang, Laurence T. Zhou, Yongtao Jinan Univ Dept Comp Sci Guangzhou 510632 Guangdong Peoples R China Chinese Acad Sci Inst Comp Technol State Key Lab Comp Architecture Beijing 100190 Peoples R China Univ Exeter Coll Engn Math & Phys Sci Exeter EX4 4QF Devon England St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 2W5 Canada

As the volume of data keeps growing rapidly, more and more storage devices, servers and network devices are continuously added into data centers to store, manage and analyze the data. The industry experience indicates that, instead of a huge number of servers added at a time, the data center network also expands gradually by adding a small number of servers from time to time. As a result, how to achieve an incremental scalability is becoming a very important challenge in designing modern data center network architectures in order to maintain the topological properties unchanged when the size of data centers grows. In this paper, we propose a new type of data center network architecture named HSDC (High Scalability Data Center Network Architecture) based on the hypercube network. The HSDC is constructed by using m-port switches and 2-port servers. The fault-tolerant routing algorithm designed in this paper for HSDC can be executed on any vertex and is able to construct a path between any pair of vertices. In order to achieve an incremental scalability, we further propose three types of incomplete HSDC structures that allow gradually adding servers into the structures, while maintaining all the topological properties. The simulation experiments and performance results demonstrate that the throughput of HSDC is comparable to that of Fat-Tree, BCube and DCell. Furthermore, the analysis results indicate that HSDC strikes a good balance among diameter, bisection width, incremental scalability, cost and energy consumption in contrast to the state-of-the-art data center network architectures.

关键词： Data center interconnection network network topology hypercube incremental scalability routing algorithm

来源：评论

学校读者我要写书评

暂无评论

routing Technology in Wireless Sensor Network Based on Ant Colony Optimization algorithm

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第3期95卷 1911-1925页

作者： Zheng Enxing Liu Ranran Jiangsu Univ Technol Sch Elect & Informat Engn Inst Bioinformat & Med Engn Changzhou 213001 Jiangsu Peoples R China Jiangsu Univ Technol Sch Automot & Traff Engn Changzhou 213001 Jiangsu Peoples R China

With rapid development of wireless communication, sensor, micro power system and electronic technology, the research on wireless sensor network has attracted more and more attention. The work proposed routing algorithm in wireless sensor network based on ant colony optimization by analyzing routing protocol and utilizing advanced idea. Ant colony optimization algorithm has advantages in implementing local work, supporting multiple paths and integrating link quality into pheromone formation. In routing selection, the work calculated probability that node is selected as the next hop according to pheromone concentration on the path. With characteristics including self-organization, dynamic and multipath, ant colony optimization algorithm is suitable for routing in wireless sensor network. With low routing cost, good adaptability and multipath, the algorithm balanced energy consumption to prolong network lifetime. In terms of simulation and experiments, ant colony algorithm was proved to be suitable for finding optimal routing in wireless sensor network, thus achieving design goal of routing algorithm.

关键词： Wireless sensor network routing algorithm Ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2018年第3期14卷

作者： Wang, Hezhe Feng, Guangsheng Wang, Huiqiang Lv, Hongwu Zhou, Renjie Harbin Engn Univ Coll Comp Sci & Technol Harbin 150001 Heilongjiang Peoples R China Hangzhou Dianzi Univ Key Lab Complex Syst Modeling & Simulat Minist Educ Hangzhou Zhejiang Peoples R China

Delay/disruption tolerant network is a novel network architecture, which is mainly used to provide interoperability for many challenging networks such as wireless sensor network, ad hoc networks, and satellite networks. Delay/disruption tolerant network has extremely limited network resources, and there is typically no complete path between the source and destination. To increase the message delivery reliability, several multiple copy routing algorithms have been used. However, only a few can be applied efficiently when there is a resource constraint. In this article, a delay/disruption tolerant network routing and buffer management algorithm based on weight (RABP) is proposed. This algorithm estimates the message delay and hop count to the destination node in order to construct a weight function of the delay and hop count. A node with the least weight value will be selected as the relay node, and the algorithm implements buffer management based on the weight of the message carried by the node, for efficiently utilizing the limited network resources. Simulation results show that the RABP algorithm outperforms the Epidemic, Prophet, and Spray and wait routing algorithms in terms of the message delivery ratio, average delay, network overhead, and average hop count.

关键词： delay disruption tolerant network wireless sensor network routing algorithm buffer management weight function

来源：评论

学校读者我要写书评

暂无评论

Wide-sense nonblocking and blocking converting-space-converting switching node architecture under XsVarSLOT algorithm

引用

OPTICAL SWITCHING AND NETWORKING 2020年 37卷 100557-100557页

作者： Abdulsahib, Mustafa Kabacinski, Wojciech Poznan Univ Tech Fac Comp & Telecommun Polanka 3 PL-60965 Poznan Poland

In this study, we evaluate the operation of the Converting-Space-Converting switching fabric architecture. The investigated switching fabric is suitable for all kinds of slot-operating switches, no matters the slots are wavelengths, time, or others. The switching fabric is evaluated in terms of the number of slots in the interstage links and the blocking probability. In the evaluation process, we used the proposed class of routing algorithms based on the functional decomposition of slots into subsets. The routing algorithm decomposes the slots in the interstage links into X subsets. The number of slots in each subset is evaluated by simulation, in order to obtain a blocking probability at the value of about 10(-8), and analytically, in case the blocking probability is reduced to 0. The proposed algorithm can reduce the required number of slots in the interstage links by almost 84% in the nonblocking switching fabrics. However;when the blocking is acceptable, the proposed routing algorithm can also reduce this number of slots, but only when the values of blocking probability are very low.

关键词： Wide-sense nonblocking Switching networks Optical switching Time-division switching routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Cluster head selection for Wireless Sensor Network: A Simulated Comparison 10

Energy Efficient Cluster head selection for Wireless Sensor ...

引用

IEEE 10th Control and System Graduate Research Colloquium (ICSGRC)

作者： Jain, Kusum Lata Mohapatra, Smarnika Manipal Univ Jaipur Sch Comp & Informat Technol Jaipur Rajasthan India Rajasthan Tech Univ MAIET Dept Comp Sci & Engn Jaipur Rajasthan India

ISBN: (纸本)9781728107554

Clustering is used as key technique for load sharing in Wireless Sensor Networks for energy efficiency in resource scare network. A good selection of the cluster head support in longitivity network. Many of the cluster based algorithm were proposed for WSN and shows that it prolong network lifetime significantly. In this paper a comparison study of Cluster Head selection is presented that is supported by simulation results on MATLAB.

关键词： Wireless Sensor Network Network Lifetime routing algorithm Clustering Cluster Head Selection MATLAB

来源：评论

学校读者我要写书评

暂无评论

Energy Consumption Balancing algorithms on Optimizing Dynamic Topology in Wsns 5

Energy Consumption Balancing Algorithms on Optimizing Dynami...

引用

5th International Conference on Fuzzy Systems and Data Mining (FSDM)

作者： Xing, Dongmei Nanchang Univ Dept Math Nanchang Jiangxi Peoples R China

ISBN: (纸本)9781643680194;9781643680187

Wireless Sensor networks (WSNs) are constructed of sensors with awareness and limited energy whose topologies are set up by the signals strength being emitted. In general, the signals transmitted are usually not in uniform distribution, which lead to the living sensors having unequal residual energies. The energy holes might be emerging in WSNs since of some sensors failure. We study static WSNs with two initial energy levels. Assume that the sensors acting as base stations will never be failure and the other sensor nodes have limited energy. Adjusting hierarchical topology, using relay nodes or the density of sensors, the emergence of the energy holes would be delayed vs reduced. The separateness between data collection and data processing is also considered to balance the energy dissipation of transmission. We propose three routing algorithms named Density_Sep, SecCluHead_Sep and Relay_Sep for improving cluster head (CH) selection in legacy SEP routing protocol in WSNs. Then we briefly explained that our algorithms could be completed in polynomial time. The simulation results obtained support that our algorithms are efficient in terms of network lifetime and balancing network energy consumption.

关键词： Sensor Dynamic Topology routing algorithm Density Relay Node

来源：评论

学校读者我要写书评

暂无评论

NWBBMP: a novel weight-based buffer management policy for DTN routing protocols

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2018年第5期11卷 917-923页

作者： Wang, Hezhe Wang, Huiqiang Feng, Guangsheng Lv, Hongwu Harbin Engn Univ Coll Comp Sci & Technol Harbin 150001 Heilongjiang Peoples R China

A delay-tolerant network (DTN) is a network with dynamic topology changes, network partitions and node mobility. Multi-copy routing protocols are usually adopted to overcome these characteristics. Although multi-copy routing protocols can improve the message delivery ratio and reduce the message propagation delay, they also easily exhaust the limited storage space of nodes, resulting in buffer overflows. The major task of buffer management is to determine which message will be discarded when buffer overflows happen. Determining the order of discarding messages will directly affect the performance of the network. In this paper, we propose a novel weight-based buffer management policy (NWBBMP) that divides messages in the node into a priority message queue, a high-weight message queue and a low-weight message queue. When a node receives a new message that causes a buffer overflow, the algorithm determines which queue's messages will be discarded according to whether the current node is the destination node of the new message. Simulation results show that our algorithm outperforms traditional buffer management algorithms in terms of delivery ratio, average delay and network overhead.

关键词： DTN Opportunistic networks routing algorithm Buffer management Message weight

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware routing for SWIPT in Multi-Hop Energy-Constrained Wireless Network

引用

IEEE ACCESS 2018年 6卷 17996-18008页

作者： He, Shiming Xie, Kun Chen, Weiwei Zhang, Dafang Wen, Jigang Changsha Univ Sci & Technol Sch Comp & Commun Engn Hunan Prov Engn Res Ctr Elect Transportat & Smart Hunan Prov Key Lab Intelligent Proc Big Data Tran Changsha 410114 Hunan Peoples R China Hunan Police Acad Hunan Prov Key Lab Network Invest Technol Changsha 410138 Hunan Peoples R China Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China Chinese Acad Sci Inst Comp Technol CAS Key Lab Network Data Sci & Technol Beijing 100190 Peoples R China

Simultaneous wireless information and power transfer (SWIPT) transmits information and powers wireless nodes with the same radio frequency signal. It can prolong the life time of the energy constrained wireless nodes. Current works of SWIPT focus on one-hop and two-hop wireless network. In order to verify the performance of SWIPT in multi-hop energy-constrained wireless network (MECWN) where the energy harvested by the receiver node can be as an energy compensation for data forwarding, this paper concurrently considers SWIPT and routing selection in MECWN. To reduce the energy consumption, we first formulate the information and energy allocation problem of link in a forwarding path, which is dependent on the next-hop node, and solve it by an iterative allocation algorithm. A novel routing metric evaluates the energy consumption of link transmitted with or without SWIPT. The energy-aware SWIPT routing algorithm allocates the information and energy of link with allocation algorithm during path finding process. To the best of our knowledge, this is the first solution that takes account of SWIPT and routing in MECWN. Our performance studies demonstrate that our proposed algorithms can effectively exploit those node resources whose energy are not enough and significantly decrease the energy consumption.

关键词： Simultaneous wireless information and power transfer multi-hop energy-constrained wireless network resource allocation routing algorithm network energy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：