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

Vehicular Delay Tolerant Network routing algorithm Based on Bayesian Network

IEEE ACCESS 2020年 8卷 18727-18740页

作者： Wu, Jiagao Guo, Yahang Zhou, Hongyu Shen, Lu Liu, Linfeng Nanjing Univ Posts & Telecommun Sch Comp Nanjing 210023 Peoples R China Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing 210023 Peoples R China

Delay Tolerant Networks (DTNs) are novel wireless mobile networks, which suffer from frequent disruption, high latency, and the lack of a complete path from source to destination. Vehicular Delay Tolerant Network (VDTN) is a special type of DTNs with vehicles as nodes. In VDTN, most nodes have specific movement patterns, however, traditional routing algorithms in DTNs do not take this characteristic into considerations very well. In this paper, a new routing algorithm based on Bayesian Network (BN) is proposed to construct the prediction model, which intends to predict the movement patterns of nodes in the real VDTN scenarios. Firstly, a comprehensive BN model is established, where more attributes of nodes are selected to improve the accuracy of the model prediction. Then, considering the complexity of the structure learning problem of BN, a novel structure learning algorithm, K2 algorithm based on Genetic algorithm (K2-GA), is proposed to search the optimal BN structure efficiently. At last, Junction Tree algorithm (JTA) is adopted in the inference of BN, which can accelerate the inference process through variable elimination and calculation sharing for large scale BN. The simulation results show that the proposed VDTN routing algorithm based on the BN model can improve the delivery ratio with a minor forwarding overhead.

关键词： Vehicular delay tolerant network routing algorithm Bayesian network genetic algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

routing algorithm for Wireless Sensor Network Based on GA-LEACH

Routing Algorithm for Wireless Sensor Network Based on GA-LE...

引用

作者： Liang Zhixun Fan Yuanyuan Yi Yunfei School of Data and Computer Science Hechi University

The problem of low energy consumption is currently a principal research issue in wireless sensor networks. By optimizing network topology and routing, the problem of excessive energy consumption is effectively solved, and the survival time of the entire network is effectively improved. Traditional Low Energy Adaptive Clustering Hierarchy(LEACH) and other algorithms are effective for sensor network topology control and network Optimization ***, these algorithm has the enigmas of equal probability cluster head selection and slow convergence speed. This paper combines the characteristics of GA algorithm with fast convergence speed and designs the GA-LEACH algorithm to solve these problems. First, LEACH clustering is performed by the Chameleon algorithm. And then adopt a genetic algorithm(GA) to select cluster heads. The simulation results show that the problem of unreasonable topological structure and slow algorithm convergence in wireless sensor networks caused by the selection of equal-probability cluster heads are effectively solved.

关键词： Wireless sensor network Low energy consumption algorithm Network topology control routing algorithm GA-LEACH algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on the routing algorithm of airport navigation lighting system based on mobile wireless ad hoc network

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2020年第4期20卷 1085-1096页

作者： Wu, Huazhu Guo, Wenyou Dalian Jiaotong Univ Fac Elect & Informat Engn Dept Automat Dalian Liaoning Peoples R China

Currently, the performance of the conventional airport navigation lighting system can't meet the functional requirements of an airport under combat readiness or emergency state. A new type of airport navigation lighting system in mobile wireless ad hoc network is proposed in this paper. The system consists of a monitoring center, a coordinator and a number of terminal nodes. It can be flexibly transferred, concealed in time, remotely controlled, quickly started and networked on demand. According to the functions and the distribution characteristics of the navigation luminaries in the airfields, the terminal nodes are grouped according to regions. The cluster heads are selected in each group according to the energy of nodes and the distribution distance between nodes. By comparing the advantages and the disadvantages between the Cluster-Tree protocol and the AODVjr protocol, an optimized routing algorithm is proposed. In order to reduce the number of hops of RREQ broadcast packets and prevent the invalid RREQ flooding, this algorithm adopts the neighbor table algorithm of ZigBee protocol and regional grouping method. The results of the simulations and the test of small-scale hardware show that this optimization algorithm can effectively reduce the number of routing hops, shorten the transmission delay, reduce the number of dead nodes and improve the success rate of data transmission.

关键词： Wireless ad hoc network ZigBee routing algorithm airport navigation lighting system

来源：评论

学校读者我要写书评

暂无评论

Coordinated planning of multi-area multi-energy systems by a novel routing algorithm based on random scenarios

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2021年 131卷 107028-107028页

作者： Zhou, Nan Xie, Da Gu, Chenghong Li, Guojie Zhang, Luqing Lou, Ziyang Chen, Yang Zhang, Yanchi Chen, Aikang Shanghai Jiao Tong Univ Elect Engn Dept Minist Educ Key Lab Control Power Transmiss & Convers Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Sch Environm Sci & Engn Shanghai 200240 Peoples R China Univ Bath Dept Elect & Elect Engn Bath Avon England Shanghai Dianji Univ Shanghai 201306 Peoples R China

As an important Energy Internet technology, energy router (ER) can implement energy routing and information interconnection for the electrical grid within a certain geography range. However, multi-energy supply allocation between multi-energy routers (MERs) has to be resolved, which can connect isolated area networks and expand the scale of the energy Internet. In this paper, equipment capacity and network routing are planned for multiarea multi-energy system (MAMES), which integrates multiple MERs with a virtual multi-energy router (VMER). Firstly, based on the VMER, the concept of MAMES is proposed. Then, the correlation model of multienergy networks in VMER is constructed, based on MER energy transmission conversion extension model and hybrid power flow model. And the novel routing algorithm is proposed to determine the energy candidate set of the integrated energy networks. During planning, the random scenario generation based on Latin hypercube sampling (LHS) and scenario reduction based on k-means clustering are applied. Finally, the simulation shows that the planning method based on the routing algorithm can effectively obtain the capacity of energy equipment inside MERs and the routing layout between MERs in the MAMES. Proposed routing algorithm and operation scenarios reduction greatly improve the efficiency of planning. Correlated planning helps improve energy efficiency, environment protection, and economic benefits of MAMES.

关键词： Multi-energy router Virtual multi-energy router routing algorithm Multi-area multi-energy system MAMES planning

来源：评论

学校读者我要写书评

暂无评论

An Adaptive routing algorithm Based on Relation Tree in DTN

引用

SENSORS 2021年第23期21卷 7847-7847页

作者： Chen, Diyue Cui, Hongyan Welsch, Roy E. Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Beijing Lab Adv Informat Networks Beijing 100876 Peoples R China MIT Sloan Sch Management Cambridge MA 02139 USA MIT Ctr Stat & Data Sci Cambridge MA 02139 USA

It is found that nodes in Delay Tolerant Networks (DTN) exhibit stable social attributes similar to those of people. In this paper, an adaptive routing algorithm based on Relation Tree (AR-RT) for DTN is proposed. Each node constructs its own Relation Tree based on the historical encounter frequency, and will adopt different forwarding strategies based on the Relation Tree in the forwarding phase, so as to achieve more targeted forwarding. To further improve the scalability of the algorithm, the source node dynamically controls the initial maximum number of message copies according to its own cache occupancy, which enables the node to make negative feedback to network environment changes. Simulation results show that the AR-RT algorithm proposed in this paper has significant advantages over existing routing algorithms in terms of average delay, average hop count, and message delivery rate.

关键词： DTN routing algorithm relation tree adaptive

来源：评论

学校读者我要写书评

暂无评论

An energy-saving routing algorithm for opportunity networks based on asynchronous sleeping mode

引用

COMPUTERS & ELECTRICAL ENGINEERING 2021年 92卷 107088-107088页

作者： Zhou Chunyue Tian, Hui Dong, Yaocong Zhong, Baitong Beijing Jiaotong Univ Lab Commun Engn Beijing Peoples R China Griffith Univ Sch Informat & Commun Technol Nathan Qld Australia Hunan Elect Technol Vocat Coll Zhuzhou Hunan Peoples R China

The opportunistic network is based on the idea of "Store-Carry-Forward" between nodes which haven't complete communication links. It uses the encounter opportunity presented by node mobility to establish a route to realize communication. The traditional Epidemic algorithm uses the flooding mechanism which greatly increases the energy consumption of nodes, and it is often unable to supplement the energy of nodes at any time in the application environment of the opportunistic network. Therefore, this paper proposes an asynchronous sleep mechanism, which allows nodes to judge whether to enter the sleep state according to their own energy situation, real-time state and other information. It ensures that the nodes do not miss the possible communication opportunities by dynamically controlling the sleep time and wake-up time. The simulation results show that the proposed EASE algorithm can guarantee the network performance and greatly reduce the energy consumption of nodes compared with the classical opportunistic network routing algorithms.

关键词： Wireless sensor networks Opportunistic thoughts Opportunistic networks routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and simulation of self-organizing network routing algorithm based on Q-learning 21

Design and simulation of self-organizing network routing alg...

引用

21st Asia-Pacific Network Operations and Management Symposium (APNOMS)

作者： Dou, Yuejia Liu, Huilin Wei, Liangkang Chen, Shiyou Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol I0 Xitucheng Rd Beijing Peoples R China CASIC Gen Dept Network & Informat Beijing Peoples R China CASIC Network & Informat Dev Corp Ltd Beijing Peoples R China

ISBN: (纸本)9788995004388

With the continuous advancement of computer network communication technology, traditional wired and wireless networks are limited by cables and base stations, and are not applicable in some application scenarios. Therefore, mobile wireless communication methods have attracted more and more attention. Due to its dynamic topology and self-organizing without center, the self-organizing network can form a mobile temporary multi-hop mobile communication network through multiple wireless communication devices, which can well meet the above requirements. At present, research on self-organizing networks mainly focuses on routing protocols. The main types are based on network topology information and location information. This paper designs a routing algorithm based on link reliability. The algorithm fully considers the self-organizing network link information, and models the node's sending and receiving work as a Markov decision process, and uses Q-learning to demodulate. This article used NS2 for network simulation and analysis and comparison of performance indicators with traditional routing algorithms.

关键词： routing algorithm self-organizing network Q-learning

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm Based on Link State Information for LEO Satellite Networks

A Routing Algorithm Based on Link State Information for LEO ...

引用

IEEE Global Communications Conference (GLOBECOM) on Advanced Technology for 5G Plus

作者： Zhang, Lu Yan, Feng Zhang, Yueyue Wu, Tao Zhu, Yaping Xia, Weiwei Shen, Lianfeng Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Shanghai Aerosp Elect Technol Inst Shanghai 201109 Peoples R China Jiangsu ZhongLi Elect Informat Sci Tech Co Ltd Changshu 215542 Jiangsu Peoples R China Tongji Univ Sch Software Engn Shanghai 201804 Peoples R China

ISBN: (纸本)9781728173078

Low earth orbit (LEO) satellite networks can provide global coverage, low-latency services to users. The satellite networks are multi-hop networks, and the dynamic characteristics of the networks bring great challenges to design efficient routing algorithms. In this paper, we proposed an improved routing algorithm based on inter-satellite link(ISL) state information and it is on-board autonomous control. The routing algorithm is divided into three phases, namely topology establishment phase, routing calculation phase and link failure response phase. Satellites make routing decisions for each hop based on the link state information with neighbor satellites and the network topology. The simulation results show that our routing algorithm has significant advantages in delivery ratio and end-to-end delay.

关键词： LEO satellite networks routing algorithm inter-satellite communication Multi-hop

来源：评论

学校读者我要写书评

暂无评论

QoS Sensitive routing algorithm with Link Quality Prediction in SDN-based Ad Hoc Networks 12

QoS Sensitive Routing Algorithm with Link Quality Prediction...

引用

12th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Jiang, Long Xia, Weiwei Zheng, Yunjun Yan, Feng Shen, Lianfeng Zhang, Yinong Yang, Xiaodong Southeast Univ Natl Mobile Commun Res Lab Nanjing Peoples R China Nanjing West Aware Co Ltd Nanjing Peoples R China Nanjing Zgmicro Co Ltd Nanjing Peoples R China

ISBN: (纸本)9781728172361

The mobility of the nodes may cause route failures frequently in the SDN-based ad hoc networks. Routes interruption causes the Quality of Service (QoS) of the users can't be satisfied, as well as leading the performance of the wireless mobile network to degrade. In this paper, a QoS sensitive routing algorithm with link quality prediction in SDN-based ad hoc network (QSRLQP) is proposed. The algorithm includes two parts, which is link quality prediction based on XGBoost (LQPXGB) and routes generation based on minimum cost tree (RGMCT). LQPXGB uses the interior point method to optimize the leaf node score of each decision tree to further predict the link quality. RGMCT uses the minimum cost tree method to get the best route, which can achieve the highest packet delivery ratio (PDR) with guaranteed delay. The simulation results show that, compared with existing routing algorithm, QSRLQP achieves a significant performance improvement in terms of PDR, throughput and end-to-end delay.

关键词： SDN-based ad hoc networks routing algorithm link quality prediction XGBoost minimum cost tree

来源：评论

学校读者我要写书评

暂无评论

Modeling and Simulation of Network-on-Chip routing algorithm Based on OPNET

Modeling and Simulation of Network-on-Chip Routing Algorithm...

引用

International Conference on Intelligent Computing and Human-Computer Interaction (ICHCI)

作者： Li, Fei Gao, Wanjia Chen, Liangchang Liu, Wenyi North Univ China Sch Instruments & Elect Taiyuan Shanxi Peoples R China

ISBN: (纸本)9781665423168

When a large amount of data floods into the network, the traditional routing algorithm of the Network-on-Chip will cause network congestion due to the selection of the same path, which will seriously affect the transmission and real-time performance of the data. Based on that, this paper proposes an efficient adaptive routing algorithm to avoid the situation. In this paper, the binary tree topology was improved. Then this paper uses OPNET simulation software to model the improved routing algorithm in three layers, and performs simulation experiments on the model. The evaluations show that the simulation results of the algorithm meet the expectations, and the algorithm can select the shortest path for the packets flooding into the network, which avoiding network congestion. The end-to-end delay is 48s less than the traditional routing algorithm, and the real-time performance is higher. This research can effectively avoid network congestion when there is a mass of data in the network.

关键词： Network-on-Chip routing algorithm topology OPNET end-to-end delay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：