The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The first comparison of the performance of name-based content routing protocols based on distance vectors and link-states is presented. The protocols used for this comparison are the Named-data Link State Routing (NLSR) protocol, which is the main representative of name-based content routing based on link states, and the Distance-based Content Routing (DCR) protocol, which is the first name-based...
We show that the forwarding strategies in the named data networking (NDN) architecture and the original content centric networking (CCN) architecture cannot ensure that Interests return the requested data objects when routing-table loops exist in a stable or dynamic network. We also show that no correct Interest forwarding strategy that allows Interest aggregation can be designed solely on the basis...
We present Multi-root Automatic Incremental Routing (MAIR), an efficient routing approach for mobile ad hoc networks (MANET). MAIR has a low routing stretch (ratio of selected path to shortest path length) and provides multiple paths to each destination. Every node is assigned multiple prefix labels with respect to multiple roots in the network. The roots are distributed in the network such that the...
This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified framework provides a parametric view of protocol performance, which in turn provides a deeper insight into protocol operations and reveals the compounding and interacting effects of protocol logic and network parameters. The...
We introduce the prefix routing over set elements (PROSE) protocol for scalable routing in MANETs based on the combined use of prefix labels and distributed hashing. In PROSE, nodes use neighbor-to-neighbor signaling to label themselves with prefix labels that provide implicit routing from any node to any network destination. Nodes implement a distributed hash table to store the mappings between node...
We present a mathematical framework for the performance evaluation of proactive and reactive routing protocols operating in mobile ad hoc networks (MANETs). The model captures the functionality of the routing protocols together with the characterization of the performance of the medium access control protocol (MAC). It reveals the interplay between the protocol functionality and network parameters,...
Multicast routing protocols based on shared trees employ one or more rendezvous points (usually called cores) for coordination. To address fault tolerance in case of core failure, multiple cores can be deployed. The location of cores is crucial for the performance of the protocol. In this context, the problem of finding the location for the cores is similar to the (k, r)-predominating set problem,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.