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.
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries play an important role in service discovery, and in recent years a number of DHT-based range query schemes have been proposed. However, most of them suffer from high query delay and high processing cost. This paper presents...
The monitoring system in coal mine has special requirements for data query. Analysis shows that routing in the system should have four features: data-centric routing, supporting query of geographic position, low delay and high reliability of data transmission, robustness of topology. A mobile agent based routing algorithm with mobile sink and a dynamical weight metric which is derived from its current...
Anycast communication is a new Internet service defined in IPv6, and it can make a host communication with the one ldquonearestrdquo member in a group of servers. The anycast routing problem with multiple QoS constrained is known to be NP-complete problem and we can't get satisfying results when using the precise method in polynomial time. In this paper, a QoS anycast routing algorithm based on ant...
Mobile ad hoc networks have a highly dynamic topology due to terminal mobility. Ad hoc routing protocols can cope with this mobility as they search for an alternative route when a currently-in-use path breaks. Despite of their ability to recover from path failures, the time elapsed until the route is reestablished deteriorates network performance. MANET routing protocols can detect link breakages...
The main contribution of this article is to propose a collaborative and distributed cache mechanism tailored for ad hoc networks. Each node's cache is partitioned into a shared area and a private area. The proposed collaborative cache is formed by each node's shared area, which is used to store contents relevant to the group, while the private area is used to store information relevant to its owner...
In recent years application-level networking (e.g. overlay networks, P2P networks) has become key enabling architecture for supporting distributed services on the Internet. We consider overlays to have delay and cost requirements and thus there exists an optimal distribution of the overlay traffic (the service engineering problem) across multi-domain underlay networks such that these requirements...
Low latency data delivery is an important requirement for achieving effective monitoring through wireless sensor networks. When sensor nodes employ duty cycling, sending a message along the shortest path, however, does not necessarily result in minimum delay. In this paper we firstly study the lowest latency path problem, i.e., the characteristics of path with mini delay that connect a source node...
In this paper we study a dynamic vehicle routing problem in which there are multiple vehicles and multiple classes of demands. Demands of each class arrive in the environment randomly over time and require a random amount of on-site service that is characteristic of the class. To service a demand, one of the vehicles must travel to the demand location and remain there for the required on-site service...
This paper shows packet delivery rate can be improved by adopting learning-based hybrid routing strategies when a wired network suffers from severe link disruption. The dynamics of the link disruptions complicate the routing problem; successful and stable routing operations of conventional routing approaches are hindered as the level of disruption increases. The target is to develop a robust and efficient...
This paper envisions an urban scenario where people carry radio devices that can be dynamically networked, by exploiting human contact opportunities, to create unplanned, improvised and localized wireless connectivity, which has been recently called pocket switched networks (PSN).The paper focuses on the radio device (pocket mobility trace recorder, or PMTR) we have on purposely designed and developed...
This paper presents a novel multi-copy routing protocol for disruption-tolerant networks whose objective is to minimize energy expended on communication. The protocol is designed for disaster-response applications, where power and infrastructure resources are disrupted. Unlike other delay-tolerant networks, energy is a vital resource in post-disaster scenarios to ensure availability of (disruption-tolerant)...
We propose new strategies in core selection methods and core-based tree (CBT) construction based on new methods of computing delay variation. As a result, we propose an algorithm, which guarantees that the delay from the source to any destination does not exceed a real-time constraint. Furthermore, we address the problem of satisfying the delay variation constraint under cost minimization. We present...
Several geographic routing protocols using location information have already been proposed for ad hoc networks to improve performance of ad hoc routing protocols, such as Location-Aided Routing (LAR) protocols. Through using location information, LAR protocols restrict the search for a new route to a smaller Request Zone of the ad hoc network. This results in a significant reduction in the number...
Optical Burst Switching (OBS) has been proposed to increase the resource utilization achieved by Optical Circuit Switching (OCS), which is impaired by its coarse granularity. A crucial step toward OBS maturity deals with the feature of lossless guaranteed transfers. No contention resolution mechanism, even combined with efficient pro-active mechanisms has been able to provide such a guarantee so far...
Multicast communication is an efficient method of data transmission and distribution among a group, especially when network resources are inadequate and needs to be shared. Fair share of network resources, such as, bandwidth, is desirable in such cases. Although there has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group, construction...
This paper presents a novel Markovian jump model for developing routing algorithms in mobile networks that encounter variable number of nodes as well as changing number of destinations. The changes in the number of active destination nodes are represented by singular switching systems where a unified Hinfin decentralized routing control is proposed and implemented. The resulting optimization problem...
We describe a novel geometric localized routing (GLR) protocol in disruption (delay) tolerant network (DTN). Although DTNs do not guarantee the connectivity of the network all the time, geometric location information still could be used to make routing decisions in a store and forward way. Geometric planar spanners, especially local Delaunay triangulation can also be used in DTN to provide a good...
In Transactional Memory (TM), contention management is the process of selecting which transaction should be aborted when a data access conflict arises. In this paper, the performance of published contention managers (CMs) is re-investigated using complex benchmarks recently published in the literature. Our results redefine the CM performance hierarchy. Greedy and Priority are found to give the best...
We present a multiple-metric approach in order to improve routing in wireless mesh networks (WMNs). It is based on the proactive optimized link state routing (OLSR) protocol to deal with applications with high quality of service (QoS) demands. Since routing with multiple metrics is an NP-complete problem, we use the analytic hierarchy process (AHP) and pruning techniques to perform such routing. The...
This paper proposes Habit, an efficient multi-layered approach to content dissemination in Delay Tolerant Networks (DTN) that leverages information about nodes' colocation (physical layer) and their social network (application layer). More precisely, the regularity of users' colocation is learned based on historical colocation observations; also, the users' social network (or `network of interest')...
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.