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

Communication network equipped with optical fiber has been widely applied in the main 110kV/35 kV and above power grid in the electric industry. But the urban distribution network below 35kV has not developed into a sound pattern. Ad-hoc network featured with low power consumption, low operating cost, good fault tolerance and high reliability is now a new trend in the distribution communication. An improved routing protocol based on the AODV, which is named "LQ-AODV" is put forward for Ad-hoc network that is suitable for the urban distribution grid. By evaluating the quality of link, a qualitied routing is picked up by LQ-AODV as the communication path. In this way, the problem of defective real-time performance due to the deficiency of link evaluation is solved. This Ad-hoc network and LQ-AODV routing protocol has been tested in Huangshan Power Supply Company. It proves that it is an effective method in the distribution communication.

关键词： Ad-hoc Network Wireless Network Distribution Communication AODV routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Location-assistant content distribution scheme for emergency rescue

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2018年第9期14卷 1-14页

作者： Zhang, Guomin Song, Lihua Wang, Haitao Hu, Chao Wang, Na Army Engn Univ PLA Coll Command Control Engn Nanjing 210007 Jiangsu Peoples R China Army Engn Univ PLA Teaching & Res Support Ctr Nanjing Jiangsu Peoples R China Army Engn Univ PLA Coll Commun Engn Nanjing Jiangsu Peoples R China

In order to optimize the timeliness and pertinence of message delivery in emergency rescue scenarios and improve the service performance of emergency communications network, we propose a location-assistant content distribution scheme based on delay tolerant network. First of all, considering that the movement patterns of rescue teams tend to follow a predetermined course of action, we design a location-based group mobility model. Due to the intermittent network connectivity and variety of emergency service, a content-classification-based publish/subscribe architecture and a GenericSpray routing algorithm based on the prediction of overlap opportunity in spatio-temporal positions are proposed. Furthermore, we also give a cache management strategy based on the content significance. Since locationassistant content distribution scheme can predict the overlap of activity between rescue teams through the course of action, not only can the number of copy forwarding and message delivery delays be significantly reduced but also the priority delivery of important messages can be ensured by message classification. Simulation experiments show that compared with the traditional delay tolerant network routing algorithm and the classic first-in-first-out caching strategy, location-assistant content distribution scheme improves the performance of message delivery rate, transmission delay, and control overhead significantly.

关键词： Emergency rescue delay tolerant network mobility model location aided content distribution routing algorithm cache management

来源：评论

学校读者我要写书评

暂无评论

The family of generalized variational network of cube-connected cycles

引用

THEORETICAL COMPUTER SCIENCE 2023年第1期944卷

作者： Li, Weifeng Lin, Longxin Zhang, Zhen Huang, Shuqiang Jinan Univ Coll Informat Sci & Technol 601 Huangpu Rd West Guangzhou 510632 Guangdong Peoples R China Jinan Univ Coll Cyber Secur 601 Huangpu Rd West Guangzhou 510632 Guangdong Peoples R China

The RV CCCr is a kind of variant network of cube-connected cycle (CCC) network, which is constructed by replacing each vertex in the hypercube with a circle of length 2r, and the hypercube is r-dimensional. The RV CCCr is regular and vertex-symmetric, which makes its topological properties easy to be analyzed. However, the length of the circle in RV CCCr is fixed to 2r which makes RV CCCr is inflexible. This paper proposes the family of generalized variational CCC networks, named RV CCC(r,k), where r is the dimension of the underlying hypercube and the length of each cycle in RV CCC(r, k) is k x r. Same to RV CCCr, the RV CCC(r, k) is also regular and vertex-symmetry. Since the length of each circle in RV CCC(r,k) is k x r, the RV CCC(r,k) is more suitable to construct any scale interconnection network than RV CCCr. After calculating the shortest internode distance between any two vertices in the RV CCC(r, k), we obtained the exact diameter of this network and the optimal routing algorithm was developed.(c) 2022 Elsevier B.V. All rights reserved.

关键词： Cube -connected cycles Variational network Shortest internode distance Diameter routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An algorithm for node-to-set disjoint paths problem in bi-rotator graphs

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2006年第2期E89D卷 647-653页

作者： Kaneko, K Tokyo Univ Agr & Technol Fac Engn Koganei Tokyo 1848588 Japan

An algorithm is described for solving the node-to-set disjoint paths problem in bi-rotator graphs, which are obtained by making each edge of a rotator graph bi-directional. The algorithm is of polynomial order of n for an n-bi-rotator graph. It is based on recursion and divided into three cases according to the distribution of destination nodes in the classes into which the nodes in a bi-rotator graph are categorized. We estimated that it obtains 2n - 3 disjoint paths with a time complexity of O(n(5)), that the sum of the path lengths is O(n(3)), and that the length of the maximum path is O(n(2)). Computer experiment showed that the average execution time was O(n(3.9)) and, the average sum of the path lengths was O(n(3.0)).

关键词： node-to-set disjoint paths problem bi-rotator graphs fault tolerance parallel computation routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Direct Approach of Path Planning Using Environmental Contours

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2021年第1期101卷 3-3页

作者： Yu, Hongjun Liang, Lihua Shi, Peng Jiang, Qing Harbin Engn Univ Coll Intelligent Syst Sci & Engn Harbin 150001 Peoples R China Univ Adelaide Sch Elect & Elect Engn Adelaide SA 5005 Australia

Roadmap is important in typical robotic applications and it is not a trivial task to obtain in unknown space. In this paper, we propose a novel approach to calculate the roadmap that is robust against noisy environmental contours and the movement of the robot. In order to obtain full visibility to space, we design a direct space partitioning approach to produce the roadmap. It uses readings from rangefinders to establish sequential polygons in time, and as the robot moves, intersections among polygons are iteratively obtained. After iterations of updates, we obtain a number of polygons with stable forms. Based on the connections among the polygons, we obtain a roadmap and propose a routing algorithm to calculate paths between points in space. Simulation examples are provided to demonstrate the performance of the proposed approach.

关键词： Space partitioning Roadmap routing algorithm Environmental contours

来源：评论

学校读者我要写书评

暂无评论

A data dissemination mechanism based on evaluating behavior for vehicular delay-tolerant networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2019年第7期15卷 1-12页

作者： Fan, Na Duan, Zongtao Zhu, Guangyuan Changan Univ Sch Informat Engn Xian 710064 Shaanxi Peoples R China

Vehicular delay-tolerant networks are widely used in intelligent transport application. Vehicle nodes exchange and share various information in vehicular delay-tolerant networks. However, current delay-tolerant network routing algorithms do not take into account the dynamic characteristic of traffic flow, and they do not effectively resist cyber attacks, such as black hole attack. To address this issue, we propose a data dissemination mechanism for vehicular delay-tolerant networks. In this mechanism, we develop a combined model to estimate the real-time traffic density. Simultaneously, we propose the metrics which include node interaction dispersion, node interaction freshness, node interaction participation, and node interaction contribution to evaluate behavior of nodes. Based on these metrics, a routing method is constructed. In this routing method, a relay node is selected by evaluating communication interaction behaviors among vehicle nodes. Considering the factors of traffic flow density and communication behaviors of vehicle nodes, a message forwarding strategy scheme is built for different traffic density scenarios. Extensive simulations show that the proposed mechanism exhibits superior performance over existing methods in forwarding traffic information and alleviates negative effects from black hole attacks.

关键词： Vehicular network delay tolerant networks data transmission routing algorithm dynamic traffic flow

来源：评论

学校读者我要写书评

暂无评论

Optimization analysis of node energy consumption in wireless sensor networks based on improved ant colony algorithm

引用

SUSTAINABLE ENERGY TECHNOLOGIES AND ASSESSMENTS 2024年 64卷

作者： Wang, Long Luo, Yiqun Yan, Hongyan Woosuk Univ Grad Sch Dept Energy Elect Engn Jincheon Gun 27841 Chungbuk Do South Korea Xiangnan Univ Coll Phys & Elect & Elect Engn Chenzhou 423000 Hunan Peoples R China Hebei Univ Engn Sch Water Conservancy & Hydroelect Power Handan 056038 Hebei Peoples R China

Wireless sensor network (WSN) originated from the traditional sensor system "Tropical Tree" sensor used in Vietnam War. "Tropical Tree" will automatically transmit the target information sensed by the detector to the server center through the wireless network, so as to monitor and direct the information. Aiming at the above phenomenon, this paper proposes an optimized Ant colony (ACO) algorithm based on the traditional ACO algorithm. By introducing the improved pseudo-random proportional rule to optimize the state transition formula, the phenomenon of premature stagnation of the algorithm is effectively avoided. For the research done, the details of different algorithms are described, including comparing the time of dead nodes after several rounds of simulation. When the number of rounds reaches 100, the data mining algorithm with the highest number of dead nodes is 284. Secondly, data mining algorithm, the number of nodes is 201. Finally, the method in this paper has 180 nodes. In WSN, node failures and low energy sometimes occur, which lead to topology changes and path failures. Ant colony algorithm has great advantages in solving dynamics. Even if one of the individuals can't work normally, other individuals can continue to work according to certain rules. It can be seen from the experimental results that the introduction of energy factor at the same time enables the ant colony algorithm to select the optimal path with shorter length and higher energy, thus prolonging the network life. The search speed will change as the search time changes. It increased by about 52 %.

关键词： ACO algorithm Wireless sensor Network energy routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A weighted and distributed algorithm for multi-hop localization

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2019年第7期15卷 1-17页

作者： Cota-Ruiz, Juan Gonzalez-Landaeta, Rafael David Diaz-Roman, Jose Mederos-Madrazo, Boris Sifuentes, Ernesto Autonomous Univ Ciudad Juarez UACJ Dept Comp & Elect Engn Juarez 32310 Chihuahua Mexico

Multi-hop wireless sensor networks are widely used in many location-dependent applications. Most applications assume the knowledge of geographic location of sensor nodes;however, in practical scenarios, the high accuracy on position estimates of sensor nodes is still a great challenge. In this research, we propose a hop-weighted scheme that can be useful in distance-based distributed multi-hop localization. The hop-weighted localization approach generates spatial locations around position estimates of unknown sensors and computes local functions that minimize distance errors among hop-weighted and static neighboring sensors. The iterative process of each unknown sensor to re-estimate its own location allows a significant reduction of initial position estimates. Simulations demonstrate that this weighted localization approach, when compared with other schemes, can be suitable to be used as a refinement stage to improve localization in both isotropic and anisotropic networks. Also, under rough initial position estimates, the proposed algorithm achieves root mean square error values less than the radio range of unknown sensors, in average, with only a few iterations.

关键词： Multi-hop localization weighted function wireless sensor network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：