On the Hardness of Devising Interval Routing Schemes

1997 ◽  
Vol 07 (01) ◽  
pp. 39-47 ◽  
Author(s):  
Michele Flammini
Keyword(s):  
Time Complexity ◽  
Compact Routing ◽  
Routing Schemes ◽  
Np Completeness ◽  
Routing Scheme ◽  
Np Complete ◽  
Interval Routing ◽  
General Networks

The k-Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation of the INMOS transputer router chips. In this paper we investigate the time complexity of devising a minimal space k-IRS and we prove that the problem of deciding whether there exists a 2-IRS for any network G is NP-complete. This is the first hardness result for k-IRS where k is constant and the graph underlying the network is unweighted. Moreover, the NP-completeness holds also for linear and strict 2-IRS.

scholarly journals Interval Routing Schemes for Circular-Arc Graphs

2017 ◽  
Vol 28 (01) ◽  
pp. 39-60
Author(s):  
Frank Gurski ◽  
Patrick Gwydion Poullie
Keyword(s):  
Shortest Path ◽  
Shortest Paths ◽  
Global Order ◽  
Circular Arc ◽  
Distributed Routing ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Interval Routing ◽  
Circular Arc Graphs ◽  
Open Question

Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively shortest paths. Since circular-arc graphs do not allow shortest path 1-interval routing schemes in general, the result implies that the class of circular-arc graphs has strict compactness 2, which was a hitherto open question. Additionally, we show that the constructed 2-interval routing scheme is a 1-interval routing scheme with at most one additional interval assigned at each vertex and we outline an algorithm to calculate the routing scheme for circular-arc graphs in 𝒪(n2) time, where n is the number of vertices.

scholarly journals Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Geographic Routing ◽  
Routing Algorithms ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Effective Manner

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.

scholarly journals Ordered interval routing schemes

2009 ◽  
Vol 7 (4) ◽  
pp. 363-376
Author(s):  
Mustaq Ahmed
Keyword(s):  
Routing Schemes ◽  
Interval Routing

scholarly journals Inter-UAV Routing Scheme Testbeds

Drones ◽  
2020 ◽  
Vol 5 (1) ◽  
pp. 2
Author(s):  
Georgios Amponis ◽  
Thomas Lagkas ◽  
Panagiotis Sarigiannidis ◽  
Vasileios Vitsas ◽  
Panagiotis Fouliras
Keyword(s):  
Signal To Noise Ratio ◽  
Real Life ◽  
Simulation Software ◽  
Propagation Models ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Related Information ◽  
Efficient Control ◽  
Communication Architectures ◽  
Scheme Evaluation

With the development of more advanced and efficient control algorithms and communication architectures, UAVs and networks thereof (swarms) now find applications in nearly all possible environments and scenarios. There exist numerous schemes which accommodate routing for such networks, many of which are specifically designed for distinct use-cases. Validation and evaluation of routing schemes is implemented for the most part using simulation software. This approach is however incapable of considering real-life noise, radio propagation models, channel bit error rate and signal-to-noise ratio. Most importantly, existing frameworks or simulation software cannot sense physical-layer related information regarding power consumption which an increasing number of routing protocols utilize as a metric. The work presented in this paper contributes to the analysis of already existing routing scheme evaluation frameworks and testbeds and proposes an efficient, universal and standardized hardware testbed. Additionally, three interface modes aimed at evaluation under different scenarios are provided.

scholarly journals DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING

2003 ◽  
Vol 13 (04) ◽  
pp. 705-720 ◽  
Author(s):  
JIE WU ◽  
LI SHENG
Keyword(s):  
Spanning Tree ◽  
Destination Node ◽  
Two Phase ◽  
Compact Routing ◽  
Routing Scheme ◽  
Routing Table ◽  
Irregular Networks ◽  
Two Phases ◽  
Outgoing Channel ◽  
Prefix Routing

We propose a deadlock-free routing scheme in irregular networks using prefix routing. Prefix routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular network is done through constructing a spanning tree. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel (shortcut) between two branches of the tree between two phases. We show that the proposed routing scheme is deadlock- and livelock-free. We also compare prefix routing with the existing up*/down* routing which has been widely used in irregular networks. Possible extensions are also discussed.

Sign in / Sign up

Export Citation Format

Share Document