Competitive Routing in Hybrid Communication Networks

Jung, Daniel; Kolb, Christina; Scheideler, Christian; Sundermeier, Jannik

doi:10.1007/978-3-030-14094-6_2

Cited by 6 publications

(15 citation statements)

References 21 publications

(26 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our objective is to design a competitive routing algorithm for ad hoc networks, where the source s of a message knows the ID of the destination t, or in other words, (s, t) ∈ E. We call a routing strategy c-competitive, if the length of a path obtained by the strategy has length at most c times the length of an optimal path for a constant c. The authors in [13] have shown that any online routing algorithm that only has local knowledge about the network cannot be c-competitive. Based on these results, the authors in [10] proposed a strategy that makes use of a Hybrid Communication Network to obtain information about location and shapes of holes. They have proven that in case the convex hulls of radio holes do not intersect, their approach finds c-competitive paths in the ad hoc network.…”

Section: Objectivementioning

confidence: 99%

“…To do so, we replace the computation of convex hulls of holes by the computation of bounding boxes. In addition to [10], we also propose a strategy for intersecting bounding boxes.…”

Section: Objectivementioning

confidence: 99%

“…Note that we do not consider source or destination nodes inside of bounding boxes in this work. Nevertheless, these can be efficiently handled by a straightforward extension of the protocols presented in this paper by the routing algorithm of [10] for the case that at the source, the target or both nodes lie inside of a hole abstraction. We also consider intersecting bounding boxes.…”

Section: Our Contributionsmentioning

confidence: 99%

“…To combine local and global routing strategies, where the goal is to use only few global knowledge, Hybrid Communication Networks have been introduced [10]. Hybrid Communication Networks have also been proposed in different contexts.…”

Section: Related Workmentioning

confidence: 99%

“…The approach we extend in this work makes use of global information as well [10]. The global information is gathered via a Hybrid Communication Network.…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks

Castenow

Kolb

Scheideler

2019

Structural Information and Communication Complexity

Self Cite

View full text Add to dashboard Cite

In this work, we present a new approach for competitive geometric routing in wireless ad hoc networks. In general, it is well-known that any online routing strategy performs very poor in the worst case. The main difficulty are uncovered regions within the wireless ad hoc network, which we denote as radio holes. Complex shapes of radio holes, for example zig-zag-shapes, make local geometric routing even more difficult, i.e., forwarded messages in direction to the destination might get stuck in a dead end or are routed along very long detours, when there is no knowledge about the ad hoc network. To obtain knowledge about the position and shape of radio holes, we make use of a hybrid network approach. This approach assumes that we can not just make use of the ad hoc network but also of some cellular infrastructure, which is used to gather knowledge about the underlying ad hoc network. Communication via the cellular infrastructure incurs costs as cell phone providers are involved. Therefore, we use the cellular infrastructure only to compute routing paths in the ad hoc network. The actual data transmission takes place in the ad hoc network. In order to find good routing paths we aim at computing an abstraction of the ad hoc network in which radio holes are abstracted by bounding boxes. The advantage of bounding boxes as hole abstraction is that we only have to consider a constant number of nodes per hole. We prove that bounding boxes are a suitable hole abstraction that allows us to find c-competitive paths in the ad hoc network in case of non-intersecting bounding boxes. In case of intersecting bounding boxes, we show via simulations that our routing strategy significantly outperforms the so far best online routing strategies for wireless ad hoc networks. Finally, we also present a routing strategy that is c-competitive in case of pairwise intersecting bounding boxes.

show abstract

Section: Objectivementioning

confidence: 99%

“…To do so, we replace the computation of convex hulls of holes by the computation of bounding boxes. In addition to [10], we also propose a strategy for intersecting bounding boxes.…”

Section: Objectivementioning

confidence: 99%

Section: Our Contributionsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…The approach we extend in this work makes use of global information as well [10]. The global information is gathered via a Hybrid Communication Network.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks

Castenow

Kolb

Scheideler

2019

Structural Information and Communication Complexity

Self Cite

View full text Add to dashboard Cite

show abstract

Communication costs in a geometric communication network

Hajiaghaei Shanjani,

King

2023

Theoretical Computer Science

View full text Add to dashboard Cite

Shortest Paths in a Hybrid Network Model

Augustine¹,

Hinnenthal²,

Kühn³

et al. 2020

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms

Self Cite

View full text Add to dashboard Cite

We introduce a communication model for hybrid networks, where nodes have access to two different communication modes: a local mode where (like in traditional networks) communication is only possible between specific pairs of nodes, and a global mode where (like in overlay networks) communication between any pair of nodes is possible. This can be motivated, for instance, by wireless networks in which we combine direct device-to-device communication (e.g., using WiFi) with communication via a shared infrastructure (like base stations, the cellular network, or satellites).Typically, communication over short-range connections is cheaper and can be done at a much higher rate. Hence, we are focusing here on the LOCAL model (in which the nodes can exchange an unbounded amount of information in each round) for the local connections while for the global communication we assume the so-called node-capacitated clique model, where in each round every node can exchange only O(log n)-bit messages with just O(log n) other nodes. However, our model for hybrid networks is very general so that it can also capture many other scenarios, like the congested clique model.In order to explore the power of combining local and global communication, we study the complexity of computing shortest paths in the graph given by the local connections. We show that our model allows the development of algorithms that are significantly faster than what can be done by using either local or global communication only.We specifically show the following results. For the all-pairs shortest paths problem (APSP), we show that an exact solution can be computed in timeÕ n 2/3 1 and that approximate solutions can be computed in timeΘ √ n . For the single-source shortest paths problem (SSSP), we show that an exact solution can be computed in timeÕ √ SPD , where SPD denotes the shortest path diameter. We further show that a 1+o(1) -approximate solution can be computed in timeÕ n 1/3 . Additionally, we show that for every constant ε > 0, it is possible to compute an O(1)-approximate solution in timeÕ(n ε ).1 Note that theÕ(·)-notation hides factors that are polylogarithmic in n.Many existing communication networks exploit a combination of multiple communication modes to maximize cost-efficiency and throughput. As a prominent example, hybrid datacenter networks combine highspeed optical or wireless circuit switching technologies with traditional electronic packet switches to offer higher throughput at lower cost [14,21]. In the Internet, dynamic multipoint VPNs can be set up to connect different branches of an organization by combining leased lines (offering them quality-of-service guarantees for their mission-critical traffic) with standard, best-effort VPN connections (for their lower-priority traffic) [35]. Alternatively, an organization may also set up a so-called hybrid WAN by combining their own communication infrastructure with connections via the Internet [38]. Finally, the emerging 5G standard promises to allow smartphones to not only communicate via the ce...

show abstract

Competitive Routing in Hybrid Communication Networks

Cited by 6 publications

References 21 publications

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks

Communication costs in a geometric communication network

Shortest Paths in a Hybrid Network Model

Contact Info

Product

Resources

About