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

A multi-hop protocol using advanced multi-hop dijkstras algorithm and tree based remote vector for wireless sensor network

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2021年第6期14卷 6877-6895页

作者： Hariharan, U. Rajkumar, K. Akilan, T. Ponmalar, A. Chandigarh Univ Apex Inst Technol Dept Comp Sci & Engn Mohali Punjab India Jain Univ Deemed Univ Fac Engn & Technol Dept Comp Sci & Engn Bengaluru Karnataka India Galgotias Coll Engn & Technol Dept Comp Sci & Engn Greater Noida Uttar Pradesh India Sri Sai Ram Inst Technol Dept Informat Technol Chennai Tamil Nadu India

Saving energy is primary challenge in wireless sensor network (WSN) to prolong network lifetime within coverage area is key to attain it. Previously different methods have been proposed for this energy efficiency purpose, namely centralized immune-Voronoi deployment algorithm (CIVA) and fixed parameter tractable (FPT) approximation algorithm. These methods showed drawback of creating energy hole problem with increased network coverage and routing problem. In order to overcome these issues, this paper presented an Energy Efficient Cluster Based Routing (EECBR) model. This proposed model utilized energy and distance as parameters and made an optimized Cluster Head (CH) selection using Grey Wolf Optimization algorithm. EECBR performs advanced Multihop dijkstras algorithm for intra cluster routing and it replaced Base Station (BS) by linking clusters using router node, using Advanced Multi-hop dijkstras algorithm and Tree based Remote Vector approach. This model was evaluated and compared with previous protocols;simulation results show that EECBR model outperforms previous ones. It improved network lifetime by 13% with the help of optimal CH selection based clustering and combined routing techniques. Thus, proposed EECBR model outperforms in the field of energy efficient routing protocol design.

关键词： Wireless sensor network (WSN) Grey Wolf Optimization (GWO) Intra-cluster routing Base station (BS) Cluster head (CH) dijkstras algorithm

来源：评论

学校读者我要写书评

暂无评论

Enhancing Connectivity in Rural Areas: Secure Spectrum Access in 6G Networks Using Advanced Encryption and Spectrum Sensing Techniques

引用

IT PROFESSIONAL 2024年第4期26卷 22-28页

作者： Deepanramkumar, P. Sharmila, A. Helen Radhakrishnan, Niranchana Sudheer, Devulapalli Devasia, Jeethu V. Reddy, Ch. Pradeep Yenduri, Gokul Jaisankar, N. VIT AP Univ Sch Comp Sci & Engn Amaravati 522237 Andhra Prades India Alliance Univ Bangalore 562106 India Vellore Inst Technol Sch Comp Sci & Engn Vellore 632014 Tamil Nadu India

The advancement of 6G cognitive radio networks aims to reduce latency in rural and remote areas. Very few studies have been conducted on this technology. Therefore, this study utilizes massive multiple-input, multiple-output (MIMO) technology for secure data transmission at 6G base stations. Blockchain technology authenticates IDs and maintains secure records for network users, with decentralization achieved through the chimp optimization algorithm. The availability of the spectrum is monitored using the Q-learning hidden sparse variate logistic regression model, and the channel-state information is predicted using the quasi-Newton iterative unscented Kalman filter algorithm. Additionally, beamforming is enhanced through cooperative strategies. Secure routing is facilitated by the golden eagle optimization-hyper elliptic curve cryptography algorithm, where data are routed according to paths determined by the Dijkstra algorithm. The MIMO-6G-cognitive radio-based Internet-of-Things framework performs better compared to existing methods.

关键词： Rural Areas 6 G Networks Spectrum Access Spectrum Sensing Connectivity In Rural Areas Communication Network Internet Of Things Data Transmission Base Station Internet Of Things Devices Cooperative Strategy dijkstras algorithm Network Routing Massive Multiple Input Multiple Output Cognitive Radio Data Transmission Rate Unscented Kalman Filter Golden Eagle Secure Data Transmission 6 G Communication Encryption Time Encryption And Decryption Key Generation El Gamal Artificial Neural Network Resource Consumption Security Vulnerabilities Encryption Key Security Level Encryption System

来源：评论

学校读者我要写书评

暂无评论

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps 65

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps

引用

65th Symposium on Foundations of Computer Science

作者： Haeupler, Bernhard Hladik, Richard Rozhon, Vaclav Tarjan, Robert E. Tetek, Jakub Swiss Fed Inst Technol Zurich Switzerland Univ Sofia INSAIT Sofia Bulgaria Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9798331516758;9798331516741

This paper proves that Dijkstra's shortest-path algorithm is universally optimal in both its running time and number of comparisons when combined with a sufficiently efficient heap data structure. Universal optimality is a powerful beyond-worst-case performance guarantee for graph algorithms that informally states that a single algorithm performs as well as possible for every single graph topology. We give the first application of this notion to any sequential algorithm. We design a new heap data structure with a workingset property guaranteeing that the heap takes advantage of locality in heap operations. Our heap matches the optimal (worst-case) bounds of Fibonacci heaps but also provides the beyond-worst-case guarantee that the cost of extracting the minimum element is merely logarithmic in the number of elements inserted after it instead of logarithmic in the number of all elements in the heap. This makes the extraction of recently added elements cheaper. We prove that our working-set property guarantees universal optimality for the problem of ordering vertices by their distance from the source vertex: The sequence of heap operations generated by any run of Dijkstra's algorithm on a fixed graph possesses enough locality that one can couple the number of comparisons performed by any heap with our working-set bound to the minimum number of comparisons required to solve the distance ordering problem on this graph for a worst-case choice of arc lengths.

关键词： beyond worst-case dijkstras algorithm shortest paths universal optimality

来源：评论

学校读者我要写书评

暂无评论

A Cable Harness Routing Method Based on the Expected Maximum Crosstalk

引用

IEEE TRANSACTIONS ON ELECTROMAGNETIC COMPATIBILITY 2022年第3期64卷 856-864页

作者： Jin, Qi Sheng, Weixing Gao, Cheng Han, Yubing Nanjing Univ Sci & Technol Sch Elect & Opt Engn Nanjing 210094 Peoples R China

With the increasing number of interconnected cables in electronic systems, the crosstalk between interconnected cables has played an important role in the intrasystem interference performance. However, the traditional routing method based on the shortest path cannot solve the problem of cable crosstalk. In this article, a novel cable harness routing method based on the expected maximum crosstalk is proposed. First, the closed-form expression for crosstalk based on the electrically small assumption is derived from the multiconductor transmission line (MTL) equation. According to this expression, the concept of maximum overlap length corresponding to the desired maximum crosstalk is developed. In addition, a conservative strategy is proposed to deal with higher frequency cable routing. The proposed routing method consists of the escape graph and the routing algorithm based on the maximum overlap length. A Dijkstra's algorithm variant with the maximum overlap length as the constraint condition is proposed. The proposed method is applied to two single-ended and differential signals cable harness routing cases and compared with the traditional method to show that the routing results of the proposed method would keep the crosstalk between cable harness branches below the expected maximum crosstalk.

关键词： Crosstalk Power cables Routing Coaxial cables Transmission line matrix methods Integrated circuit modeling Conductors Cable harness crosstalk differential signal dijkstras algorithm escape graph maximum overlap length multiconductor transmission line (MTL)

来源：评论

学校读者我要写书评

暂无评论

Heuristiky pro cesty v mapách

Heuristiky pro cesty v mapách

引用

作者： Kudláčková, Lada Charles University of Prague

The content of the thesis is a description of heuristic procedures, which are used to find the shortest paths in the graphs and verify their effec- tiveness on the actual data. It deals with heuristics for dijkstras algorithm, especially the A* algorithm, which uses a lower distance-to-target estimate. Heuristics are implemented and tested on the road network of the Czech Re- public. 1

关键词： shortest path searching dijkstras algorithm heuristics

来源：评论

学校读者我要写书评

暂无评论

Intuitive solution for Robot Maze Problem using Image Processing

Intuitive solution for Robot Maze Problem using Image Proces...

引用

IEEE Bombay Section Signature Conference (IBSSC)

作者： Advait Ambeskar Anup Bondre Varsha Turkar Hetal Gosavi Dept. of Electronics Engineering Vidyalankar Institute of Technology Mumbai India Dept. of Electronic and Telecommunication Engineering Don Bosco College of Engineering Goa India

ISBN: (纸本)9781538674765

Path finding is an important problem in robot design and automation that requires quick error-free solutions that rely on external environment. Automated mobile robotic systems employ various techniques to determine the path that the robot needs to follow to reach the destination to perform its function. Path finding problems can utilize various algorithms to solve the problem. Sensor data can be used as a reference to determine the path to be followed from the start point to the destination. However, this technique is highly localized and does not provide the ability to make decisions by taking global constraints or conditions into consideration. Image processing techniques are employed extensively to provide a solution based on global conditions. The proposed method involves use of image processing to process the acquired image of the maze from a mounted camera system. The processing steps are used to provide steps which the robot can follow to reach from its current position to the final position. This project implements a universal algorithm to allow the robot to maneuver autonomously.

关键词： Maze Image Processing Path finding Path Direction envelop algorithm dijkstras algorithm Mazes Image processing Robot Byways generalized algorithm robot design destination Current Position Automation

来源：评论

学校读者我要写书评

暂无评论

Systém pro vyhledávání a aktualizace jízdních řádů

Systém pro vyhledávání a aktualizace jízdních řádů

引用

作者： Havel, Filip Charles University of Prague

Most of the people who use public transportation have specific areas of interests which can be used to cut down the transport network to several smaller parts. It is reasonable to assume that these people will want to be informed in case a change occurs in the restricted part of transport network they are interested in. For this reason, we created an application which informs its users about the changes in public transportation that concern them. We assume that for users, the most important area of interest are the connections between individual stations, which is why this thesis mainly focuses on the possibility of search for connection in timetables. In addition to this search, we also deal with the applications adaptability and we have implemented examples of expansions for various result outputs, user interfaces and data sources. To improve general user experience, we have developed a mobile application that communicates with the main application and displays updated timetables according to the users area of interest. 1

关键词： timetable time-dependent graph dijkstras algorithm

来源：评论

学校读者我要写书评

暂无评论

Modelling of Reconfigurable Antenna using Graph Techniques 13

Modelling of Reconfigurable Antenna using Graph Techniques

引用

13th International Conference on Electronics, Computer and Computation (ICECCO)

作者： Galadima, Ahmadu A. Ugweje, Okechukwu C. Koyunlu, Gokhan Adeshina, Steve Nile Univ Nigeria Dept Elect & Elect Engn Abuja Nigeria

ISBN: (纸本)9781538625019

The analysis of reconfigurable antennas using graph techniques is presented in this paper. Since reconfigurable antennas can be viewed as group of self-organized components, graph theory rules were used to establish the relationships between the possible topologies and some corresponding electromagnetic property of the antenna such as frequency of operation, polarization and impedance. Reconfigurable antennas were classified into groups based on mechanism that alter their configurations. Optimization algorithms such as dijkstras and Bellman-Ford were applied to determine the solution for the shortest path problem. The two algorithms were compared and results show that Bellman-Ford algorithm performed better for graph with less than 100 vertices.

关键词： Bellman-Ford algorithm dijkstras algorithm graph modelling graph theory Reconfigurable antenna

来源：评论

学校读者我要写书评

暂无评论

Application of the Dijkstra’s algorithm in the Pedestrian Flow Problem

Application of the Dijkstra’s Algorithm in the Pedestrian F...

引用

作者： Petrášová, Tereza Charles University of Prague

The purpose of this work is to study the pedestrian flow equations as the coupled system formed by the eikonal equation and the first order hyperbolic system with the source term. The hyperbolic system consists of the continuity equation and the equations of motion of a compressible inviscid fluid. To specify the outer volume forces in the latter equation it is assumed that the pedestrians try to move in a desired direction with a desired velocity, which are dependent on the density in their surroundings. The desired direction is obtained as the gradient of the solution of the eikonal equation. We show that the solution of the eikonal equation has the meaning of the time needed to pass the fastest path to the exit. We suggest avoiding solving the eikonal equation by using the graph theory, where as the graph we use the underlying triangulation. The norm of each edge in the graph is density-dependent and has the dimension of time. This is together with the use of the modified dijkstras algorithm the novelty of the work. Numerical results of the two approaches are presented. Powered by TCPDF (***)

关键词： pedestrian flow equations eikonal equation dijkstras algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal relay selection for transmission rate maximisation in multi-hop wireless networks

引用

ELECTRONICS LETTERS 2015年第12期51卷 949-950页

作者： Li, Xiaohua SUNY Binghamton Dept Elect & Comp Engn Binghamton NY 13902 USA

A fundamental problem for wireless networks is how to select relays from all available network nodes to realise the optimal multi-hop relaying between a source node and a destination node. Mutual interference among wireless nodes makes this problem challenging. A surprising result of the reported work is that interference-free multi-hop relaying can be achieved in full-duplex decode-and-forward relaying. The broadcast nature of wireless transmissions can be exploited without suffering from mutual interference. Then, an efficient relay selection algorithm is developed that finds the optimal hop count and all the relays to maximise the source-destination multi-hop transmission rate. The complexity of the algorithm is O(N-2) only, where N is the number of available network nodes or network size. Interestingly, this wireless network algorithm is similar to the well-known Dijkstra's algorithm of wired networks. Simulations are conducted to demonstrate its optimality and efficiency.

关键词： broadcast communication computational complexity decode and forward communication interference (signal) radio networks relay networks (telecommunication) wireless mesh networks dijkstras algorithm available network nodes broadcast nature destination node full-duplex decode and forward relaying interference-free multi-hop relaying multi-hop wireless transmission rate maximisation networks mutual interference optimal hop count optimal relay selection efficiency source node wired networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：