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

Fourth International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom2012)

作者： Sushil Kr. Trisal Ajay Koul Amit Bindal SMVD University School of Computer Science Katra J&K India MM University Department of Computer Science Mullana Haryana India

ISBN: (纸本)9781634396226

routing in VANET is a challenging task as the nodes remain highly mobile and there is frequent disconnection and reconnection of node links. Estimating link time to remain connected with the nodes is therefore an important task in VANETs as various routing algorithms can drastically degrade in performance due to change in link status. Various algorithms proposed earlier provide the link estimation but almost all are dependent on specialized GPS to locate position of nodes. Position based routing protocols are becoming popular due to advancement and availability of GPS devices but they can be less accurate as their accuracy is only up to 5 to 10 meters in outdoor environments. In addition, a GPS is not applicable in locations where no line of sight exists, e.g., in a tunnel. The other drawback of GPS is that it cannot locate a vehicle which is inside big campuses like universities and airports. In this paper we propose a mechanism that estimates the link stability time without making use of GPS. The routing decisions are taken based upon the link time and the direction of the nodes. Our simulation results prove the purpose of using this approach in VANETs.

关键词： Global position system (GPS) VANET (vehicular Ad hoc network) AODV (Ad hoc on Demand Distance Vector) DSR (Dynamic Source routing) V2V protocols Global Positioning Systems Ganglia topology Network routing OUTDOOR ENVIRONMENT routing algorithms line of sight routing protocols indium Dosage Form Not Applicable

来源：评论

学校读者我要写书评

暂无评论

Assessing District Heating Potential at Large Scale: Presentation and Application of a Spatially-Detailed Model to Optimally Match Heat Sources and Demands

SSRN

引用

SSRN 2024年

作者： Spirito, Giulia Dénarié, Alice Fattori, Fabrizio Muliere, Giuseppe Motta, Mario Persson, Urban Department of Energy Politecnico di Milano Milano20156 Italy Dipartimento di Scienze Teoriche e Applicate Università degli Studi dell'Insubria Varese21100 Italy School of Business Engineering and Science Halmstad University PO Box: 823 HalmstadS-301 18 Sweden

This paper presents a newly developed methodology aimed at assessing at national level the techno-economic potential of district heating (DH) based on renewables and excess heat sources. The novelty of the model lies in the use of an optimization approach to match heat demand and heat sources at large scale level, while keeping a high degree of spatial detail. Areas suitable for DH adoption are identified by minimizing heat delivery costs, and therefore by choosing the most economical technology between district heating and the alternative individual solution. The optimization approach, usually applicable at limited analytical scope because of the computational burden, is here adapted to large scale analysis through the introduction of novel methodological elements with which the network topology is simulated *** methodology applies to preliminarily identified maps of available heat sources and eligible heat demand, with the quantification of the latter including retrofitting and low connection rate scenarios. It then consists in two steps: connecting elements in a graph through triangulation and routing algorithms and optimizing connections to minimize the overall heat delivery costs, either by adopting district heating or individual heating systems. The whole methodology is based on open-source data and tools for broad applicability. The paper presents the elaborated methodology together with the application of the entire model to Italy. The outcome is a map of the potential district heating systems identified with significant spatial detail nationwide. A four-fold expansion is envisaged, covering 12% of the national heat demand with renewables- and excess heat- based district heating. © 2024, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Route Selection for Vehicular Store-Carry-Forward Networks and Misbehaviour Vehicles Analysis

Dynamic Route Selection for Vehicular Store-Carry-Forward Ne...

引用

IEEE Vehicular Technology Conference

作者： Hu Yuan Carsten Maple Kevin Ghirardello Cyber Security Centre Univ. of Warwick Coventry UK

ISBN: (纸本)9781538663592;9781538663585

In this paper, we present realistic urban simulation results for store-carry-forward (SCF) relay communications within a cellular network. We describe two dynamic routing algorithms, minimising outage and minimising data packet travel time, which feature enhancements to increase the routing flexibility. It is shown that these enhancements to increase flexibility in re-routing the data leads to a dramatic decrease in the outage probability while only increasing packet travel time slightly. A misbehaviour model is analysed in this paper, in which misbehaving vehicles fail to follow the rules of the SCF routing algorithms. There are various reasons for a rogue vehicle to fail to obey the routing algorithm, including an intention to modify the message before onward transmission. Misbehaviour is detected by considering expected traffic density distributions. A Hidden Markov Model (HMM) is used to detect misbehaviour based on how data is passed by vehicles. Results show that the probability that misbehaviour is detected is 87% using this approach.

关键词： hidden Markov models mobile radio relay networks (telecommunication) telecommunication network reliability telecommunication network routing telecommunication traffic Disruptive Behavior Hidden Markov models telecommunication network reliability telecommunication network routing Mobile radios telecommunication traffic Route choice vehicle routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Cross Layer routing in Transparent Optical Networks

Cross Layer Routing in Transparent Optical Networks

引用

Optical Fiber Communication - OFC 2007 Collocated National Fiber Optic Engineers Conference (OFC 2007), vol.5

作者： Christina (Tanya) Politi Chris Matrakidis Alexandros Stavdas Vasilis Anagnostopoulos Matthias Gunkel Department of Telecommunications Science and Technology University of Peloponnese Karaiskaki St Tripolis 22100 Greece School of Electrical and Computer Engineering NTUA 9 Heroon Polytechniou Street 15773 Zografou Athens Greece T-Systems Enterprise Services GmbH Deutsche-Telekom-Allee 7 D-64295 Darmstadt Germany

New algorithmically simplified WRA that incorporate physical layer criteria in the path establishment procedure are suggested and applied in the Deutsche-Telecom network. Their blocking performance superiority and phy... 详细信息

ISBN: (纸本)1557528306

关键词： Cross phase modulation Erbium doped fiber amplifiers Optical networks Q factor routing algorithms Single mode fibers Fiber optics and optical communications (060.0060) Networks (060.4250) Optical communications (060.4510)

来源：评论

学校读者我要写书评

暂无评论

RADAR: Risk-and-Delay Aware routing Algorithm in a Hybrid Wireless-Optical Broadband Access Network (WOBAN)

RADAR: Risk-and-Delay Aware Routing Algorithm in a Hybrid Wi...

引用

Optical Fiber Communication - OFC 2007 Collocated National Fiber Optic Engineers Conference (OFC 2007), vol.3

作者： Suman Sarkar Hong-Hsu Yen Sudhir Dixit Biswanath Mukherjee Department of Computer Science University of California Davis CA 95616 Department of Information Management Shih Hsin University Taiwan Nokia Research Center Burlington MA 01083

We propose "Risk-and-Delay Aware routing Algorithm" (RADAR) for WOBAN. RADAR minimizes packet delay in the wireless front end of WOBAN and reduces packet loss for multiple failure scenarios: gateway failure,... 详细信息

ISBN: (纸本)1557528306

关键词： Fiber networks Optical access networks Optical networks Passive optical networks Radar routing algorithms Fiber optics and optical communications (060.0060) Networks (060.4250)

来源：评论

学校读者我要写书评

暂无评论

Vehicle Route Planning using Dynamically Weighted Dijkstra’s Algorithm with Traffic Prediction

arXiv

引用

arXiv 2022年

作者： Udhan, Piyush Ganeshkar, Akhilesh Murugesan, Poobigan Permani, Abhishek Raj Sanjeeva, Sameep Deshpande, Parth Vehicle Engineering Department Jaguar Land Rover India Limited Bengaluru560 048 India

Traditional vehicle routing algorithms do not consider the changing nature of traffic. While implementations of Dijkstra’s algorithm with varying weights exist, the weights are often changed after the outcome of algorithm is executed, which may not always result in the optimal route being chosen. Hence, this paper proposes a novel vehicle routing algorithm that improves upon Dijkstra’s algorithm using a traffic prediction model based on the traffic flow in a road network. Here, Dijkstra’s algorithm is adapted to be dynamic and time dependent using traffic flow theory principles during the planning stage itself. The model provides predicted traffic parameters and travel time across each edge of the road network at every time instant, leading to better routing results. The dynamic algorithm proposed here predicts changes in traffic conditions at each time step of planning to give the optimal forward-looking path. The proposed algorithm is verified by comparing it with conventional Dijkstra’s algorithm on a graph with randomly simulated traffic, and is shown to predict the optimal route better with continuously changing traffic. © 2022, CC BY.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Quality of Service Aware Ant Colony Optimization routing Algorithm

Quality of Service Aware Ant Colony Optimization Routing Alg...

引用

IEEE Mediterranean Electrotechnical Conference

作者： Chris Saliba Reuben A. Farrugia Department of Communications and Computer Engineering University of Malta

ISBN: (纸本)9781424457939

The demand for Internet connectivity has grown exponentially in the past few years. Moreover, the advent of new services such as Voice over IP (VoIP), Video on Demand (VOD) and Videoconferencing applications have caused a sever increase in traffic, which makes it extremely hard to ensure an acceptable level of quality. This is mainly attributed to current routing strategies, such as Link State (LS) and Distance Vector (DV), which are not optimal in terms of Quality of Service (QoS). This paper presents a QoS-Aware routing strategy based on the Ant Colony Optimization (ACO) concept, where a set of artificial ants are used to determine the optimal path. The proposed method was compared to other state of the art ACO procedures and traditional routing schemes like LS and DV. Simulation results clearly demonstrate that the proposed scheme outperforms all the methods considered in this paper where throughput gains of 8% and a reduction in delay of 38% for time critical applications were achieved.

关键词： Quality of service Ant colony optimization Voice over Internet Protocol Network routing routing algorithms ADMINISTRATIVE CONSENT ORDER Throughput state of the art Traffic

来源：评论

学校读者我要写书评

暂无评论

An Iterative routing Algorithm for Energy Minimization in Coded Wireless Networks

An Iterative Routing Algorithm for Energy Minimization in Co...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

作者： Linyu Huang Chi Wan Sung Dept. of Electronic Engineering City University of Hong Kong China

ISBN: (纸本)9781457713460

Energy saving is important for many wireless devices. In a multi-hop wireless network with multiple sessions, XOR network coding can be applied to opposite traffic flows so as to reduce the number of packet transmissions, which in turn reduce transmission energy. Such a change in packet forwarding, however, impacts the design of traffic routing. Traditional routing algorithms, which typically aim at finding shortest paths between source and destination nodes, may no longer work well. In this paper, an iterative routing algorithm is proposed, which favors paths that can provide more pair-wise XOR network coding opportunities. Simulation results show that this algorithm integrates well with the XOR forwarding method and can reduce energy cost significantly when compared with traditional shortest-path routing, with and without network coding.

关键词： Wireless networks routing algorithms wireless device Network coding ENERGY MINIMISATION exclusive OR Packet Iterative Design flow Energy sources wireless multi-hop networks Packet transmission Energy transfer shortest path

来源：评论

学校读者我要写书评

暂无评论

Power saving route algorithm on underground Wireless Sensor Networks

Power saving route algorithm on underground Wireless Sensor ...

引用

2010 International Conference on Future Information Technology and Management Engineering, FITME 2010

作者： Qiao, Gangzhu Zeng, Jianchao College of Electrical and Information Engineering Lanzhou University of Technology Lanzhou Gansu China Division of System Simulation and Computer Application Taiyuan University of Science and Technology Taiyuan Shanxi China

ISBN: (纸本)9781424490882

The routing protocol which can meet the requirement of underground wireless sensor network had a decisive role on the monitoring quality and the survival time of network. By combining the beacon nodes chain deployment of tunnel Wireless Sensor Networks, the Minimum Energy Relay routing (DMERR) algorithm which is based on dynamic path loss parameter is proposed, this algorithm can save the energy of communication by obtain the exact path loss parameter of each place in roadways and calculation the optimum communication distance accurately. The simulation results show that this routing algorithm can meet the requirements of the underground linear wireless sensor networks and reduce the routing energy consumption effectively. © 2010 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Reinforcement Learning Approach for Evaluation of Disaster Relief

A Reinforcement Learning Approach for Evaluation of Disaster...

引用

International Conference on Cutting-edge Technologies in Engineering (ICon-CuTE)

作者： Gajanan Walunjkar Anne Koteswara Rao Computer Science and Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Chennai India

ISBN: (纸本)9781728100012

Ad hoc networks are considered more suitable for disaster scenarios due to infrastructure-less feature. Existing routing algorithms used on such mobile ad hoc networks are non-adaptive routing algorithms and based on shortest path algorithms. But shortest path may not give optimum path. If the network is heavy loaded with traffic, shortest path may not give better results. Various reinforcement algorithms are used to design such adaptive routing where the routing takes place based on the actual traffic present on a network. One of the reinforcement routing algorithms is Q routing and various variants of Q routing like CQ routing, CDRQ routing etc. In this paper, Q routing and CDRQ routing are implemented and compared using disaster area mobility model in disaster area scenario.

关键词： disasters learning (artificial intelligence) mobile ad hoc networks telecommunication computing telecommunication network routing telecommunication traffic Mobile ad hoc networks telecommunication computing telecommunication network routing telecommunication traffic Network routing Disaster relief routing algorithms disaster area Disasters shortest path Shortest path algorithms optimal path

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：