3,018 research outputs found
A novel approach to quality-of-service provisioning in trusted relay Quantum Key Distribution networks
In recent years, noticeable progress has been made in the development of quantum equipment, reflected through the number of successful demonstrations of Quantum Key Distribution (QKD) technology. Although they showcase the great achievements of QKD, many practical difficulties still need to be resolved. Inspired by the significant similarity between mobile ad-hoc networks and QKD technology, we propose a novel quality of service (QoS) model including new metrics for determining the states of public and quantum channels as well as a comprehensive metric of the QKD link. We also propose a novel routing protocol to achieve high-level scalability and minimize consumption of cryptographic keys. Given the limited mobility of nodes in QKD networks, our routing protocol uses the geographical distance and calculated link states to determine the optimal route. It also benefits from a caching mechanism and detection of returning loops to provide effective forwarding while minimizing key consumption and achieving the desired utilization of network links. Simulation results are presented to demonstrate the validity and accuracy of the proposed solutions.Web of Science28118116
Hybrid routing in delay tolerant networks
This work addresses the integration of today\\u27s infrastructure-based networks with infrastructure-less networks. The resulting Hybrid Routing System allows for communication over both network types and can help to overcome cost, communication, and overload problems. Mobility aspect resulting from infrastructure-less networks are analyzed and analytical models developed. For development and deployment of the Hybrid Routing System an overlay-based framework is presented
Hybrid Routing in Delay Tolerant Networks
This work addresses the integration of today\u27s infrastructure-based networks with infrastructure-less networks. The resulting Hybrid Routing System allows for communication over both network types and can help to overcome cost, communication, and overload problems. Mobility aspect resulting from infrastructure-less networks are analyzed and analytical models developed. For development and deployment of the Hybrid Routing System an overlay-based framework is presented
The Critical Neighbourhood Range for Asymptotic Overlay Connectivity in Ad Hoc Networks
We first motivate the use of ad hoc overlays. In particular, we argue that overlay routing could play a role in the spreading of ad hoc networks. We then define a simple criterion for neighbourhood: two overlay nodes are neighbours if and only if there exists a path between them of at most R hops, and R is called the (overlay) neighbourhood range. A small R may result in a disconnected overlay, while an unnecessarily large R would generate extra control traffic. We are interested in the minimum R ensuring overlay connectivity, the so-called critical R. We study conditions on R to achieve asymptotic connectivity of the overlay almost surely, i.e. connectivity with probability 1 when the number of nodes in the underlying ad hoc network tends to infinity (so-called dense networks) or when the size of the field tends to infinity (socalled sparse networks), under the hypothesis that the underlying ad hoc network is itself asymptotically almost surely connected. For dense networks, we derive a necessary and sufficient condition on R, and for sparse networks we derive distinct necessary and sufficient conditions that are however asymptotically tight. These conditions, though asymptotic, shed some light on the relation linking the critical R to the number of nodes n, the field size the radio transmission range r and the overlay density D (i.e., the proportion of overlay nodes). These conditions can be considered as approximations when the number of nodes (resp. the field) is large enough. Since r is considered as a function of n or l , we are able to study the impact of topology control mechanisms, by showing how the shape of this function impacts the critical R.PAI MOTIO
A Reliability-based Framework for Multi-path Routing Analysis in Mobile Ad-Hoc Networks
Unlike traditional routing procedures that, at the best, single out a unique
route, multi-path routing protocols discover proactively several alternative
routes. It has been recognized that multi-path routing can be more efficient
than traditional one mainly for mobile ad hoc networks, where route failure
events are frequent. Most studies in the area of multi-path routing focus on
heuristic methods, and the performances of these strategies are commonly
evaluated by numerical simulations. The need of a theoretical analysis
motivates such a paper, which proposes to resort to the terminal-pair routing
reliability as performance metric. This metric allows one to assess the
performance gain due to the availability of route diversity. By resorting to
graph theory, we propose an analytical framework to evaluate the tolerance of
multi-path route discovery processes against route failures for mobile ad hoc
networks. Moreover, we derive a useful bound to easily estimate the performance
improvements achieved by multi-path routing with respect to any traditional
routing protocol. Finally, numerical simulation results show the effectiveness
of this performance analysis.Comment: To appear on IJCNDS: International Journal of Communication Networks
and Distributed System
- …