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

Energy-efficient and delay-aware distributed routing with cooperative transmission for Internet of Things

JOURNAL OF PARALLEL AND distributed COMPUTING 2018年第Part1期118卷 46-56页

作者： Wen, Shaojie Huang, Chuanhe Chen, Xi Ma, Jianhua Xiong, Naixue Li, Zongpeng Wuhan Univ State Key Lab Software Engn Comp Sch Wuhan Hubei Peoples R China Collaborat Innovat Ctr Geospatial Technol Wuhan Hubei Peoples R China Hosei Univ Sch comp & Informat Sci Tokyo Japan Colorado Tech Univ Sch Comp Sci Colorado Springs CO USA

As an important part of IoT, Flying ad hoc networks (FANETs) can provide communication services for different devices in IoT and cyber-enabled applications. However, mobility of unmanned aerial vehicle (UAV) in FANETs results in wireless link unpredictability and increases the complexity of routing algorithms in these applications, especially for real-time routing. In this work, we propose an adaptive distributed routing method with cooperative transmission to effectively solve the problem presented above, in which the transmitters only use local information to transmit packets with help from their cooperative nodes. We formulate a corresponding mathematical optimization problem, in which the objective is to maximize network utility, while keeping end-to-end delay below a prescribed threshold. To support variations in network characteristics and channel states, we estimate the single-hop delay at relay node for each transmission, and use the dual decomposition method to transform the centralized problem into a distributed problem which allows the relay nodes to use only the local channel information and estimated delays to route the packets. Simulation results show that the proposed routing method can improve network performance in terms of energy efficiency, throughput and end-to-end delay. (C) 2017 Elsevier Inc. All rights reserved.

关键词： IoT and cyber-enabled applications distributed routing Cooperative transmission Delay constraint

来源：评论

学校读者我要写书评

暂无评论

Throughput Optimality and Overload Behavior of Dynamical Flow Networks Under Monotone distributed routing

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2015年第1期2卷 57-67页

作者： Como, Giacomo Lovisari, Enrico Savla, Ketan Lund Univ Dept Automat Control SE-22100 Lund Sweden CNRS GIPSA Lab F-38000 Grenoble France Univ So Calif Sonny Astani Dept Civil & Environm Engn Los Angeles CA 90089 USA

This paper investigates the throughput behavior of single-commodity dynamical flow networks governed by monotone distributed routing policies. The networks are modeled as systems of ordinary differential equations based on mass conversation laws on directed graphs with limited flow capacities on the links and constant external inflows at certain origin nodes. Under monotonicity assumptions on the routing policies, it is proven that, if the external inflow at the origin nodes does not violate any cut capacity constraints, then there exists a globally asymptotically stable equilibrium, and the network achieves maximal throughput. On the contrary, should such a constraint be violated, the network overload behavior is characterized. In particular, it is established that there exists a cut with respect to which the flow densities on every link grow linearly over time (respectively, reach their respective limits simultaneously) in the case where the buffer capacities are infinite (respectively, finite).

关键词： distributed routing dynamical flow networks monotone dynamical systems resilience throughput transportation networks

来源：评论

学校读者我要写书评

暂无评论

A distributed routing method for multiple AGVs for motion delay disturbances

A distributed routing method for multiple AGVs for motion de...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Morinaka, S Nishi, T Konishi, M Imai, J Okayama Univ Dept Elect & Elect Engn Okayama 7008530 Japan

ISBN: (纸本)0780389123

In this paper, we propose a distributed routing method for multiple mobile robots under uncertain motion delays. The feature of the proposed method is that each AGV subsystem creates the routing to minimize the sum of the transportation time and the penalty for collision avoidance constraints taking into account motion delay disturbances for other AGVs. The computational results show that the total transportation time obtained by the proposed method is shorter than that of the conventional method under various type of motion delay disturbances.

关键词： Automated Guided Vehicles distributed routing motion delay disturbances rescheduling

来源：评论

学校读者我要写书评

暂无评论

Attacks in distributed routing Protocols in PCNs 7

Attacks in Distributed Routing Protocols in PCNs

引用

7th IEEE International Conference on Blockchain (IEEE Blockchain)

作者： Sharma, Neeraj Kapoor, Kalpesh Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati India Indian Inst Technol Guwahati Dept Math Gauhati India

ISBN: (纸本)9798350351606;9798350351590

Blockchain transactions can be made more scalable using Payment Channel Networks (PCNs), which do not require significant modifications to the distributed ledger algorithm. On the other hand, an onion protocol for anonymity and a locking mechanism to prevent race conditions are needed when routing a payment via several channels in a PCN. This method can be abused by adversaries to launch wormhole attacks. Prior research concentrated on source routing, which is unlikely to continue to be an effective routing strategy as these networks expand. We investigate the impact of attacks in PCNs that employ local knowledge-based routing algorithms. In these scenarios, malicious nodes can steal the benefits of interacting nodes by exchanging confidential information among themselves. We have analyzed the impact of wormhole attacks in the Swift algorithm, Speedy Murmurs, and Silent Whispers. Our experiments introduced an attack that uses a depth measure to arrange malicious nodes in various locations. We used attack gain, attack cost, and attack transaction ratio metrics to assess the attack's impact on routing algorithms. Our simulation-driven analysis demonstrates that placing a malicious node subsequent to a landmark node will raise the likelihood of an attack but at a higher cost. With high transaction volume, attack gain in Silent Whisper will decrease compared to Speedy Murmurs and Swift due to congestion. With 9.6% malicious nodes located at different locations, the average attack transaction ratio for all distributive routing algorithms is 41%.

关键词： Bitcoin distributed routing Lightning Network Payment channel Networks Wormhole attacks

来源：评论

学校读者我要写书评

暂无评论

Intelligent distributed routing under constraints and imprecise state information

Intelligent distributed routing under constraints and imprec...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Raju, GVS Univ Texas Dept Elect Engn San Antonio TX 78249 USA

ISBN: (纸本)0780385667

Due to mobility in wireless networks, the state information of all outgoing links (link delays, available resources and costs) of nodes is imprecise. Fuzzy logic has proven to be a powerful tool when dealing with imprecise information. The implemented distributed protocol incorporates fuzzy inference systems to guide the process of finding routes with sufficient resources to satisfy a certain delay and other requirements with least end-to-end cost in a dynamic network. Multi-path parallel search is used to increase the probability of finding a feasible path. When there are such multiple paths, the one with least cost is selected. Results show how this protocol can tolerate a high degree of information imprecision. Success ratios for delay-resource constrained routing reach values over 92%.

关键词： distributed routing fuzzy constraints imprecise state information

来源：评论

学校读者我要写书评

暂无评论

Introduction of Centralized and distributed routing Protocols

Introduction of Centralized and Distributed Routing Protocol...

引用

IEEE International Conference on Electronics, Communications and Control (ICECC)

作者： He Xin Beijing Univ Posts & Telecommun Int Sch Beijing 100088 Peoples R China

ISBN: (纸本)9781457703218

Current trends in network routing point to dynamic routing which provides flexible and efficient routing selections. The usage of dynamic routing protocols significantly promotes the rapid development of Internet. In reality, centralized routing and distributed routing techniques are critical methods to realize dynamic routing in modern communication network. In this paper, we mainly analyze the principles of centralized and distributed routing protocols respectively, including how they work, how they affect the network performance as well as advantages and disadvantages brought by these two approaches.

关键词： centralized routing distributed routing working principle network performance

来源：评论

学校读者我要写书评

暂无评论

ADRIN: An Adaptive and distributed routing Mechanism for Challenged IoT Networks 16

ADRIN: An Adaptive and Distributed Routing Mechanism for Cha...

引用

16th International Conference on COMmunication Systems and NETworkS, COMSNETS 2024

作者： Halder, Shayantan Roy, Satyaki Ghosh, Preetam Ghosh, Nirnay Iiest Department of Cst Shibpur India Uah Department of Math. Sc. AL United States Vcu Department of Cs VA United States

ISBN: (纸本)9798350383119

Data and communication networks in disaster-hit areas are often crippled due to partial or complete outages of the networking infrastructures. In such challenging post-disaster scenarios, message sharing is indispensable for a timely recovery. Typically, it is done by building mobile ad-hoc networks by devices in possession of users. However, challenged networks are often constrained by intermittent connectivity, delay, and energy constraints, necessitating routing strategies that offer seamless communication in the face of node failure and mobility. In this paper, we present an adaptive and distributed routing mechanism termed ADRIN. It employs backtracking-based mobility tracing, inspired by the backward algorithm of Hidden Markov Models, to infer periodicity in mobility to determine stable routes and then constructs a spatiotemporal ad-hoc network to relay data in a multi-hop fashion to the base station. Preliminary experiments show that ADRIN approximates the underlying mobility distribution and performs data forwarding despite failures. © 2024 IEEE.

关键词： Challenged networks Disaster response distributed routing Internet of Things Mobile computing Periodicity

来源：评论

学校读者我要写书评

暂无评论

A Cloud Computing Perspective for distributed routing in Vehicular Environments

引用

ZTE Communications 2016年第3期14卷 36-44页

作者： Smitha Shivshankar Abbas Jamalipour The University of Sydney

Vehicular networks have been envisioned to provide us with numerous interesting services such as dissemination of real-time safety warnings and commercial advertisements via car-to-car communication. However, efficient routing is a research challenge due to the highly dynamic nature of these networks. Nevertheless, the availability of connections imposes additional constraint. Our earlier works in the area of efficient dissemination integrates the advantages of middleware operations with muhicast routing to de- sign a framework for distributed routing in vehicular networks. Cloud computing makes use of pools of physical computing resourc- es to meet the requirements of such highly dynamic networks. The proposed solution in this paper applies the principles of cloud computing to our existing framework. The routing protocol works at the network layer for the formation of clouds in specific geo- graphic regions. Simulation results present the effieiency of the model in terms of serviee discovery, download time and the queu- ing delay at the controller nodes.

关键词： cloud computing distributed routing vehicular networks

来源：评论

学校读者我要写书评

暂无评论

Throughput properties of a queueing network with distributed dynamic routing and flow control

引用

ADVANCES IN APPLIED PROBABILITY 1996年第1期28卷 285-307页

作者： Tassiulas, L Ephremides, A UNIV MARYLAND SYST RES INSTCOLLEGE PKMD 20742

A queueing network with arbitrary topology, state dependent routing and flow control is considered. Customers may enter the network at any queue and they are routed through it until they reach certain queues from which they may leave the system. The routing is based on local state information. The service rate of a server is controlled based on local state information as well. A distributed policy for routing and service rate control is identified that achieves maximum throughput. The policy can be implemented without knowledge of the arrival and service rates. The importance of flow control is demonstrated by showing that, in certain networks, if the servers cannot be forced to idle, then no maximum throughput policy exists when the arrival rates are not known. Also a model for el;change of state information among neighboring nodes is presented and the network is studied when the routing is based on delayed state information. A distributed policy is shown to achieve maximum throughput in the case of delayed state information. Finally, some implications for deterministic flow networks are discussed.

关键词： queueing network control distributed routing stability flow control

来源：评论

学校读者我要写书评

暂无评论

Scalable distributed multicast routing with multiple classes of QoS guarantee

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2004年第9期E87B卷 2682-2691页

作者： Hwang, RH Chang, BJ Hsiao, WC Hsu, JM Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi 62117 Taiwan Chaoyang Univ Technol Dept Comp Sci & Informat Engn Taichung Taiwan

This paper proposes dynamic distributed unicast and multicast routing algorithms for multiple classes of QoS guaranteed networks. Each link in such a network is assumed to be able to provide multiple classes of QoS guarantee by reserving various amounts of resource. A distributed unicast routing algorithm, DCSP (distributed Constrained Shortest Path), for finding a QoS constrained least cost path between each O-D (Originating-Destination) pair, is proposed first. Two class reduction schemes, the linear and logarithmic policies, are develpoed to prevent exponential growth of the number of end-to-end QoS classes. Based on DCSP, two distributed multicast routing algorithms, DCSPT (distributed Constrained Shortest Path Tree) and DTM (distributed Takahashi and Mutsuyama), are proposed to find QoS constrained minimum cost trees. Numerical results indicate that DCSP strongly outperforms previously proposed centralized algorithms and it works better with the linear class reduction method. For the multicast routing algorithms, the DCSPT with linear class reduction method yields the best performance of all multicast routing algorithms.

关键词： multiple classes of QoS multicast distributed routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：