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

Efficient algorithms for routing and centralized scheduling for IEEE 802.16 mesh networks

Efficient algorithms for routing and centralized scheduling ...

International Conference on Scalable Computing and Communications- 8th International Conference on Embedded Computing, ScalCom-EmbeddedCom 2009

作者： Lo, Shou-Chih Ou, Lyu-Chen Department of Computer Science and Information Engineering National Dong Hwa University Hualien Taiwan

ISBN: (纸本)9780769538259

IEEE 802.16 systems provide broadband wireless access to subscriber stations (SSs). An 802.16 wireless system can operate in mesh mode, where SSs form a multihop network to the base station. The centralized scheduling mechanism defined in the standard provides contention-free and resource-guarantee transmission services in mesh mode. However, the corresponding algorithm to this scheduling service is quite primitive. In this paper, we propose routing and centralized scheduling algorithms that construct a routing tree from a given mesh topology and do an efficient channel minislot allocation, respectively. The simulation results show the superiority of our proposed algorithms over others. © 2009 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Universal algorithms for store-and-forward and wormhole routing 96

Universal algorithms for store-and-forward and wormhole rout...

引用

28th Annual ACM Symposium on Theory of Computing, STOC 1996

作者： Cypher, Robert Der Heide, Friedhelm Meyer Auf Scheideier, Christian Vöcking, Berthold Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States Department of Mathematics and Computer Science Heinz Nixdorf Institute University of Paderborn Paderborn33102 Germany

ISBN: (纸本)0897917855

In this paper we present routing algorithms that are universal in the sense that they route messages along arbitrary (simple) paths in arbitrary networks. The algorithms are analyzed in terms of the number of messages being routed, the maximum number of messages that must cross any edge in the network (edge congestion), the maximum number of edges that a message must cross (dilation), the buffer size, and the bandwidth of the links. We present two main results, both of which have applications to universal storeand-forward routing and universal wormhole routing. Our results yield significant performance improvements over all previously known universal routing algorithms for a wide range of parameters, and they even improve many time bounds for standard networks. In addition, we present adaptations of our main results for routing along shortest paths in arbitrary networks, and for routing in leveled networks, node-symmetric networks, edge-symmetric networks, expanders, butterflies, and meshes. © 1996 ACM.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast parallel algorithms for routing one-to-one assignments in benes networks

Fast parallel algorithms for routing one-to-one assignments ...

引用

1993 International Conference on Parallel Processing, ICPP 1993

作者： Lee, Ching-Yi Yavuz Oruc, A. Electrical Engineering Department Institute for Advanced Computer Studies University of Maryland College ParkMD20742-3025 United States

ISBN: (纸本)0849389836

This paper presents new results on routing unicast (one-to-one) assignments over Benes networks. Parallel routing algorithms with polylogarithmic routing times have been reported earlier [10,8], but these algorithms can only route permutation assignments unless unused inputs are assigned to dummy outputs. This restriction is removed in this paper by using techniques taht permit bypassing idle or unused inputs without any increase in the order of routing cost or routing time. routing cost or routing time. We realize our routing algorithm on two different topologies. The algorithm routes a unicast assignment involving O(k) pairs of inputs and outputs in O(log2 k+lgn) time if every pair of processors is interconnected by a direct link, and in O(lg4k + lg2 k lgn) time if the processors are interconnected by an extended shuffle-exchange network. The same algorithm can be pipelined to route a unicast assignments, each involving O(k) pairs of inputs and outputs, in O(lg2 k+ lg n+(α-1)lgk) time on the completely connected graph, and in O(lg3 k + lg k lg n + (α-l)(lg3 k + lg k lg n)) time on the extended shuffle-exchange graph. These yield an average routing time of O(lgn) in the first case, and O(lg3 k + lg k lgn) in the second case, for a ≥ lg n. These complexities indicate that the algorithm given in this paper is as fast as the algorithm given in [10] for unicast assignments, and with pipelining it is faster at least by a factor of O(lgn) on both topologies. Furthermore, for sparse assignments, i.e., when kn, it is the first algorithm which has an average routing time of O(lgn) on a topology with O(n) links. © 1993 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization of 2d virtual node coordinates in anchor-free localization algorithms for geographic routing in ad-hoc networks

Optimization of 2d virtual node coordinates in anchor-free l...

引用

2011 18th International Conference on Telecommunications, ICT 2011

作者： Radeke, Rico Turk, Stefan Lehnert, Ralf Department of Telecommunications Technische Universität Dresden Mommsenstrasse 13 Dresden 01069 Germany

ISBN: (纸本)9781457700248

Many localization algorithms require that at least some nodes in a network know their correct real position. Anchor-free localization algorithms manage to assign to all nodes virtual coordinates (VC) without knowledge of real location information. This is mostly done by node cooperation. These algorithms provide VCs for the usage of geographic routing in environments where real coordinate localization is impossible due to cost, time, energy, space or line of sight restrictions. This paper proposes improvements in generating VCs for wireless ad-hoc networks without location information. We present algorithms for improving the preparatory phase, which is used to obtain initial VCs as well as for the working phase, which adapts to network changes and node movement. Using simulations for different node densities and network sizes, we compare different approaches and show which algorithms outperform others. © 2011 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Joint Design of Conventional Public Transport Network and Mobility on Demand

引用

Transportation Research Procedia 2025年 86卷 104-112页

作者： Xiaoyi Wu Nisrine Mouhrim Andrea Araldo Yves Molenbruch Dominique Feillet Kris Braekers Department of Management Technical Univerisity of Denmark SAMOVAR Télécom SudParis Institut Polytechnique de Paris Vrije Universiteit Brussel Business Technology and Operations Mines Saint-Etienne Univ. Clermont Auvergne CNRS UMR 6158 LIMOS Centre CMP Hasselt University Faculty of Business Economics

Conventional Public Transport (PT) is based on fixed lines, running with routes and schedules determined a-priori. In low-demand areas, conventional PT is inefficient. Therein, Mobility on Demand (MoD) could serve users more efficiently and with an improved quality of service (QoS). The idea of integrating MoD into PT is therefore abundantly discussed by researchers and practitioners, mainly in the form of adding MoD on top of PT. Efficiency can be instead gained if also conventional PT lines are redesigned after integrating MoD in the first or last mile. In this paper we focus on this re-design problem. We devise a bilevel optimization problem where, given a certain initial design, the upper level determines stop selection and frequency settings, while the lower level routes a feet of MoD vehicles. We propose a solution method based on Particle Swarm Optimization (PSO) for the upper level, while we adopt Large Neighborhood Search (LNS) in the lower level. Our solution method is computationally efficient and we test it in simulations with up to 10k travel requests. Results show important operational cost savings obtained via appropriately reducing the conventional PT coverage after integrating MoD, while preserving QoS.

关键词： Ride-sharing Mobility-on-demand routing algorithms Public Transportation Multi-modal Routes Mobility as a Service (MaaS) Transport Network Design

来源：评论

学校读者我要写书评

暂无评论

On the Scalability and Coverage of LoRa Mesh for Monitoring Linear Infrastructure

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Chen, Yu Shi, Guo Sambo, Yusuf Onireti, Oluwakayode Imran, Muhammad University of Glasgow Control and Communications Research Group at the James Watt School of Engineering GlasgowG12 8QQ United Kingdom University of Strathclyde Department of Management Science Department of Electronic and Electrical Engineering GlasgowG4 0QU United Kingdom

This paper investigates the scalability and coverage of long range (LoRa) mesh networks deployed for monitoring linear infrastructure, such as railways and pipelines. Although the monitored infrastructure is linear, the network topology is a mesh. The study addresses the challenges posed by the scalability of such networks, considering constraints imposed by duty cycle regulations in license-free frequency bands, particularly within the European Union where a 1% duty cycle limitation exists. A deployment strategy is proposed to optimize the placement of LoRa mesh nodes along linear infrastructure. A comprehensive analysis of scalability and coverage yields their bounds, along with the condition necessary to achieve the upper bounds. To enhance scalability and coverage, a novel routing algorithm is proposed considering the number of hops and the received signal strength indicator. Additionally, a LoRa mesh simulator, LoRaMeshSim, is developed to validate the system analysis and evaluate the effectiveness of the proposed routing algorithm. The findings provide valuable insights into the practical deployment of LoRa mesh networks for monitoring linear infrastructure. © 2025 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

routing Protocols for VANETs: An Approach based on Genetic algorithms

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2016年第2期10卷 542-558页

作者： Wille, Emilio C. G. Del Monego, Hermes I. Coutinho, Bruno V. Basilio, Giovanna G. Univ Tecnol Fed Parana CPGEI Ave Sete Setembro 3165 Curitiba Parana Brazil

Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source routing Protocol (DSR) and on the use of Genetic algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

关键词： VANETs Mobility Simulation routing algorithms AODV DSR Genetic algorithms Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

INTELLIGENT algorithms FOR routing SENSORY NETWORKS OPERATING IN EXPLOSION HAZARD ZONES

引用

MINING SCIENCE 2021年 28卷 103-115页

作者： Stankiewicz, K. Jagoda, J. Tonkins, M. KOMAG Inst Min Technol Gliwice Poland Univ Exeter Exeter Devon England

The article presents intelligent routing algorithms currently used in sensory networks, in terms of determining the possibility of their integration into systems working in potentially explosive atmospheres. Selected types of scribing algorithms were characterized. The analysis of simulation tests performed on selected types of scribing algorithms was carried out. The analysis of equipment solutions which can be used to build a network node operating in the conditions of methane and/or coal dust explosion hazard was carried out.

关键词： routing algorithms Internet of Things explosion-hazardous areas sensors network swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Fairness-aware resource partition and routing in relay-enhanced orthogonal-frequency-division-multiple-accessing cellular networks

引用

IET COMMUNICATIONS 2012年第16期6卷 2613-2620页

作者： Wang, J. Ma, Z. Lv, Z. Sheng, Y. Xiang, W. China Unicom Res Inst Network Technol Res Ctr Beijing 100048 Peoples R China Univ So Queensland Fac Engn & Surveying Toowoomba Qld 4350 Australia

Unlike conventional cellular networks where the evolved Node B (eNB) performs centralised scheduling, future relay-enhanced cellular (REC) networks allow relay nodes (RNs) to schedule users independently. This decentralised nature of the REC networks brings about challenges to maintain fairness. In this study, we formulate the generalised proportional fair (GPF) resource allocation problem, where resource partition and routing are included as part of the overall radio resource management aiming to provide fairness across all users served by the eNB and its subordinate RNs. Although the traditional proportional fair scheduling algorithm is executed independently at the eNB and each RN to maintain local fairness, we propose efficient resource partition and routing algorithms to maintain global fairness by optimising the GPF objective for the whole relay-enhanced cell. Through system level simulations, the proposed algorithms are evaluated and compared with both non-relaying and relaying systems with benchmark resource partition and routing algorithms. The simulation results show that the proposed algorithms outperform the existing algorithms in providing a better trade-off between system throughput and fairness performance.

关键词： cellular radio Communication network design, planning and routing orthogonal-frequency-division-multiple-access telecommunication network routing radio resource management routing algorithms relay-enhanced cellular networks OFDMA Modulation and coding methods Mobile radio systems nonrelaying systems GPF mobility management (mobile radio) generalised proportional fair resource allocation problem OFDM modulation eNB Multiple access communication evolved node B resource allocation Network management proportional fair scheduling algorithm resource partition RN relay nodes frequency division multiple access REC networks local fairness

来源：评论

学校读者我要写书评

暂无评论

algorithms for Constrained Multicast routing under Multi-tree Model

Algorithms for Constrained Multicast Routing under Multi-tre...

引用

第四届运筹学及其应用国际研讨会

作者： Xiao-Dong Hu Mu-Hong Zhang Institute of Applied Mathematics Academy of Mathematics and System Science Chinese Academy of Sciences

Multicast routing problem is usually treated as Steiner tree problem that asks for a tree of minimal cost that interconnects the source and destination *** this well-known model,multicast routing under multi-tree model is to find a set of trees rooted at the source node such that in each tree at most a fixed number of destination nodes are allowed to receive the data and every destination node must be designated in one of the trees to receive the *** cost of routing is the total costs of trees *** this paper we study how to construct a multicast routing of minimal cost under multi-tree *** propose two approximation algorithms for this NP-hard problem with guaranteed performance ratios.

关键词： Multicast routing algorithms network cost

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：