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

14th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)

作者： Fernandez-Fernandez, Adriana Cervello-Pastor, Cristina Ochoa-Aday, Leonardo Univ Politecn Catalunya UPC Dept Network Engn Esteve Terradas 7 Castelldefels 08860 Spain

ISBN: (纸本)9783319401591;9783319401584

In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale software-defined networks (SDN) with multiple domains. The solution proposed, called DEAR (distributed energy-aware routing), tackles the problem of minimizing the number of links that can be used to satisfy a given traffic demand under performance constraints such as control traffic delay and link utilization.

关键词： distributed routing algorithm SDN Energy-aware routing

来源：评论

学校读者我要写书评

暂无评论

Adaptive routing Mechanism for LEO Satellite Network Based on Control Domain Partition

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING

引用

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING 2025年第1期9卷 70-82页

作者： Zhang, Puning Xian, Ziyun Liao, Mingjun Huang, Haiyun Yang, Junyan Chongqing Univ Posts & Telecommun Sch Commun & Informat Engn Adv Network & Intelligent Connect Technol Key Lab Chongqing Educ Commiss China Chongqing 400065 Peoples R China Chongqing Univ Posts & Telecommun Chongqing Key Lab Ubiquitous Sensing & Networking Chongqing 400065 Peoples R China

Low Earth Orbit (LEO) satellite network has the characteristics of low delay, low propagation loss, high bandwidth, and seamless coverage, which is the cornerstone of space-air-ground integrated network. However, the complex topology and time-varying link state of LEO lead to extremely unstable data routing. Existing routing research faces the challenges of large link information update delay, high routing table storage, and query overhead, which seriously affect satellite data transmission, onboard computing, and storage efficiency. To address the above issues, an adaptive routing mechanism based on control domain partition is proposed, considering the dynamic time-varying characteristics of LEO satellite constellation topology and inter-satellite link. Specifically, a non-dominated sorting-based control domain partition architecture is designed to manage the satellite domain for reducing control delay and improving link information update efficiency. Then a distributed routing method for control domain division is proposed to sense the link status of adjacent control domains rather than the entire satellite network, so as to alleviate the problems of high storage and query complexity and slow update of link information. Furthermore, a link situation aware routing decision-making method is devised to accurately perceive the link situation and achieve optimal path decision-making. The simulation results demonstrate that the proposed mechanism respectively improves the network performance by about 12%, 22%, and 14% in terms of end-to-end average delay, packet loss rate, and throughput.

关键词： LEO satellite network distributed routing algorithm control domain partition deep Q network LEO satellite network distributed routing algorithm control domain partition deep Q network

来源：评论

学校读者我要写书评

暂无评论

distributed routing and self-balancing algorithm for Medical IoNT

引用

SIMULATION MODELLING PRACTICE AND THEORY 2023年 129卷

作者： Gulec, Omer Pamukkale Univ Dept Management Informat Syst Denizli Turkiye

Continuity of data flow from the body to the medical devices takes an important role in order to follow the results of the patients in real-time. The nano-sensors that undertake these tasks consume energy during the processes and become offline when they run out of energy. This causes disconnection of the nodes and interruption of the data flow. Therefore, the network connection should be provided by the remaining nodes. In this paper, a novel distributed routing and self-balancing Wireless Nano-Sensor Networks (WNSNs) algorithm for Medical Internet of Nano-Things (MIoNT)-based healthcare applications, namely SECAMENT, is proposed. The backbone of the network is built by clustering the nodes and selecting cluster heads (CHs) iteratively. For balancing the network, SECAMENT binds the nodes whose CHs become offline to the nearest available clusters or selects new CHs amongst them. According to the simulation results, SECAMENT provides connectivity of WNSNs up to 46.548% and longer network uptime up to 44.963% on average compared to a clustering-based distributed routing and coordinate algorithm for WNSNs and unbalanced networks in MIoNT healthcare applications.

关键词： Internet of nano -things Wireless nano -sensor networks distributed routing algorithm Healthcare Self balancing networks

来源：评论

学校读者我要写书评

暂无评论

On the Communication Complexity of distributed Name-Independent routing Schemes 1

引用

27th International Symposium on distributed Computing (DISC)

作者： Gavoille, Cyril Glacet, Christian Hanusse, Nicolas Ilcinkas, David Univ Bordeaux LaBRI Bordeaux France INRIA Bordeaux Sud Ouest LaBRI Bordeaux France CNRS LaBRI Bordeaux France

ISBN: (数字)9783642415272

ISBN: (纸本)9783642415272;9783642415265

We present a distributed asynchronous algorithm that, for every undirected weighted n-node graph G, constructs name-independent routing tables for G. The size of each table is (O) over tilde(root n), whereas the length of any route is stretched by a factor of at most 7 w.r.t. the shortest path. At any step, the memory space of each node is (O) over tilde(root n). The algorithm terminates in time O(D), where D is the hop-diameter of G. In synchronous scenarios and with uniform weights, it consumes (O) over tilde(root n + n(3/2) min {D, root n}) messages, where m is the number of edges of G. In the realistic case of sparse networks of poly-logarithmic diameter, the communication complexity of our scheme, that is (O) over tilde (n(3/2)), improves by a factor of root n the communication complexity of any shortest-path routing scheme on the same family of networks. This factor is provable thanks to a new lower bound of independent interest.

关键词： distributed routing algorithm name-independent compact routing bounded stretch

来源：评论

学校读者我要写书评

暂无评论

Dynamic Secure routing Game in distributed Cognitive Radio Networks

Dynamic Secure Routing Game in Distributed Cognitive Radio N...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Zhu, Quanyan Song, Ju Bin Basar, Tamer Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA kyung Hee Univ Yongin South Korea

ISBN: (纸本)9781424492688

In this paper, we propose a dynamic secure routing game framework to effectively combat jamming attacks in distributed cognitive radio networks. We first propose a stochastic multi-stage zero-sum game framework based on the directional exploration of ad hoc on-demand distance vector (AODV) algorithms. The zero-sum game captures the conflicting goals between malicious attackers and honest nodes and considers packet error probability and delay as performance metrics. The game-theoretic routing protocol guarantees a performance level given by the value of the game. distributed Boltzmann-Gibbs learning is used for an on-line routing algorithm, in which the users do not have the knowledge of the attackers and the utility function. Instead, the users learn the payoffs based on their past observations. We use simulations to illustrate the proposed routing mechanism and compare the algorithm with fictitious-play learning. Unlike typical distributed routing algorithms such as AODV routing, the proposed secure routing algorithm supports a novel recovery of routing path failure against unknown attackers.

关键词： AODV routing path failure Delay Games Heuristic algorithms Jamming Peer to peer computing routing Security ad hoc networks ad hoc on-demand distance vector algorithm cognitive radio combat jamming attack distributed Boltzmann-Gibbs learning distributed cognitive radio network distributed routing algorithm dynamic secure routing game algorithm error statistics game theory game-theoretic routing protocol jamming malicious attacker online routing algorithm packet error probability packet radio networks performance metrics routing protocols stochastic multistage zero-sum game framework telecommunication security utility function

来源：评论

学校读者我要写书评

暂无评论

MPATH: a loop-free multipath routing algorithm

引用

MICROPROCESSORS AND MICROSYSTEMS 2000年第6期24卷 319-327页

作者： Vutukury, S Garcia-Luna-Aceves, JJ Univ Calif Santa Cruz Dept Comp Sci Santa Cruz CA 95064 USA Univ Calif Santa Cruz Dept Comp Engn Santa Cruz CA 95064 USA Sun Microsyst Inc Networking & Secur Ctr Palo Alto CA 94303 USA

We present a distributed routing algorithm for computing multiple paths between each source-destination pair in a computer network, such that the paths are loop-free at all times and are not necessarily of equal length. In this algorithm, routers exchange second-to-last hop on the shortest path to destinations in addition to shortest distances, which are used to prevent the well-know count-to-infinity problem. The safety and liveness properties of the algorithm are proved and its performance is analyzed. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： distributed routing algorithm count-to-infinity problem multiple paths

来源：评论

学校读者我要写书评

暂无评论

ON THE CNET - A REARRANGEABLY NONBLOCKING OPTICAL INTERCONNECTION NETWORK

引用

ELECTRONICS LETTERS 1989年第4期25卷 280-281页

作者： KAR, S SELVARAJAN, A Dept. of Electr. Commun. Eng. Indian Inst. of Sci. Bangalore India

A planar, circular, rearrangeable nonblocking optical switching architecture using N(N-1) Ti:LiNbO3 directional coupler switches is suggested. Various figures of merit such as the signal-to-crosstalk ratio (SXR), insertion loss and fault tolerance are presented. The outline for a distributed routing algorithm in O(N) time is given.

关键词： CNET LiNbO 3:Ti SXR crosstalk directional coupler switches distributed routing algorithm fault tolerance figures of merit insertion loss nonblocking optical interconnection network optical communication optical interconnections optical links optical switches optical switching architecture planar circular rearrangeable network signal-to-crosstalk ratio switching networks telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

A novel routing algorithm based on virtual topology snapshot in LEO satellite networks 17

A novel routing algorithm based on virtual topology snapshot...

引用

IEEE 17th International Conference on Computational Science and Engineering (CSE)

作者： Tan, Haichao Zhu, Lidong Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Peoples R China

ISBN: (纸本)9781479979813

Nowadays, communication technology is changing rapidly and satellite communication, as an important communication pattern, is playing a more and more important role. Due to lower system delay and lower power consumption in mobile terminal, LEO satellite communication will undoubtedly become an important development direction in satellite communication system in the future. In satellite communication networks, routing algorithms determine average delay and the average of traffic load thereby have significant influences on the performance of the system. In this paper, a novel routing algorithm based on virtual topology snapshot has been proposed and it inherits the advantage of lower delay in topology snapshot as well as solves the problems of poor robustness and adaptability. This algorithm has been proved more excellent performance than topology snapshot routing and distributed routing algorithm via simulation.

关键词： LEO satellite topology snapshot routing distributed routing algorithm

来源：评论

学校读者我要写书评

暂无评论

EEGRA: Energy Efficient Geographic routing algorithms for Wireless Sensor Network

EEGRA: Energy Efficient Geographic Routing Algorithms for Wi...

引用

12th International Symposium on Pervasive Systems, algorithms, and Networks (I-SPAN)

作者： Chen, Tseng-Yi Wei, Hsin-Wen Lee, Che-Rung Huang, Fu-Nan Hsu, Tsan-sheng Shih, Wei-Kuan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30043 Taiwan Tamkang Univ Dept Informat Management New Taipei Taiwan Natl Tsing Hua Univ Inst Informat Syst & Appl Hsinchu Taiwan Acad Sinica Inst Informat Sci Taipei Taiwan

ISBN: (纸本)9780769549309

Energy efficiency is critical in wireless sensor networks (WSN) for system reliability and deployment cost. The power consumption of the communication in multi-hop WSN is primarily decided by three factors: routing distance, signal interference, and computation cost of routing. Several routing algorithms designed for energy efficiency or interference avoidance had been proposed. However, they are either too complex to be useful in practices or specialized for certain WSN architectures. In this paper, we propose two energy efficient geographic routing algorithms (EEGRA) for wireless sensor networks, which are based on existing geographic routing algorithms and take all three factors into account. The first algorithm combines the interference into the routing cost function, and uses it in the routing decision. The second algorithm transforms the problem into a constrained optimization problem, and solves it by searching the optimal discretized interference level. We integrate four geographic routing algorithms: GOAFR+, Face routing, GPSR, and RandHT, to both EEGRA algorithms and compare them with three other routing methods in terms of power consumption and computation cost for the grid and irregular sensor topologies. The results of our experiments show both algorithms conserve sensor's routing energy 30% similar to 50% comparing to general geographic routing algorithms. In addition, the time complexity of EEGRA algorithms is similar to the geographic greedy routing methods, which is much faster than the optimal SINR-based algorithm.

关键词： Geographic routing Energy-efficiency Wireless sensor network SINR distributed routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Dynamic Convergecast Tree Generator for WSN-based Environmental Surveillance of Orchid Plantation

A Novel Dynamic Convergecast Tree Generator for WSN-based En...

引用

14th IEEE International Conference on High Performance Computing and Communications (HPCC) / IEEE 9th International Conference on Embedded Software and Systems (ICESS)

作者： Lai, Tzu-Yun Chen, Chia-Pang Liu, Jen-Hao Wang, Jiing-Yi Chuang, Cheng-Long Jiang, Joe-Air Natl Taiwan Univ Intel NTU Connected Context Comp Ctr Taipei 10617 Taiwan Natl Taiwan Univ Dept Bio Ind Mech Engn Taipei 10617 Taiwan

ISBN: (纸本)9780769547497

This paper proposes a dynamic convergecast tree generator for WSN-based environmental surveillance of orchid plantation. Such environmental surveillance requires reliably acquiring environmental parameters in a real time manner. The mobile benches in the orchid plantation create a problem of changing network topology. The mobility of the benches leads to uncertain factors, such as data transmission delay. In order to meet the requirements of the orchid plantation monitoring, the proposed generator uses a dynamic distributed routing design and a flexible process schedule-based MAC design. Based on the experimental results, the proposed generator we programmed with in the nodes can reliably collect environmental data with low data transmission delay. This proposed generator, therefore, can be applied to environmental surveillance that involves mobile sensor nodes and requires collecting data in short time intervals.

关键词： distributed routing algorithm schedule-based MAC flexible process schedule environmental surveillance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：