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.
A simple scheme to implement dedicated path protection in Elastic Optical Networks is proposed and evaluated under dynamic traffic conditions. It consists in splitting the spectrum available in the network links in two bands used respectively for working and backup traffic. These bands are conveniently sized taking into account the network topology and the routing constraints. When the band dedicated...
This article is presented based on Zigbee technology node design and algorithm of vehicle tracking localization of research, the low rate of using the Zigbee technology, the characteristics of low power consumption, low price, studies the algorithm of vehicle orbit. In this paper, the DV - Hop algorithm is based on distance vector routing distributed localization algorithm is put forward. The algorithm...
As the next generation network architecture IMS has been widely accepted. Its good scalability, extensibility and manageability are appreciated for multimedia communications. However, some type of resource consuming services, such as video on demand and live video service often requires a lot of resources like bandwidth and streaming media server. But only relying on media server is difficult to meet...
Robust optimization is an emerging field in telecommunication network design which takes future traffic uncertainty into account. This yields optimal robust network designs which are optimal for all traffic realizations within a pre-defined set of uncertainty. In 2003, Bertsimas and Sim have introduced an adjustable uncertainty set for general optimization problems which preserves the computational...
In the design of mobile ad hoc networks, a challenging problem is how to route information reliably and efficiently from one node to another in moderate to high level of mobility. In this paper, we propose a new routing protocol, called link effective available time (LEAT) routing. First, we propose a method to find the link available time during an epoch by measuring the distances between the two...
Traditionally complex queries have been performed over unstructured P2P networks by means of flooding, which is inherently inefficient due to the large number of redundant messages generated. While Distributed Hash Tables (DHTs) can provide very efficient look-up operations, they traditionally do not provide any methods for complex queries. By exploiting the structure inherent in DHTs we can perform...
For the design of mobile ad hoc networks, particularly those consisting of low-cost devices, we propose a new routing algorithm, called ranging-based link availability routing (RBLAR). In order to reduce link breakages during data services, we propose a new link cost, i.e., the unavailability of a link. In order to reduce the cost and complexity of the implementation, we propose to use only ranging...
Application-level message routing mechanisms are crucial to the development of distributed applications and infrastructures that are flexible, adaptable, context-aware and mobile. This paper proposes to use the concept of magnetic fields borrowed from physics in order to enable a self-organizing message routing mechanism. First, a generic model of virtual magnetic fields is presented, then a distributed...
Based on the characteristics of DV-Distance, an improved scheme for the typical distributed localization algorithm in wireless sensor network is proposed. The main principle of the improved scheme is to introduce the hops between anchor nodes and unknown nodes to determine calibration value of the distance.Further more,a method of the new distance correction based on hops and Straight-line distance...
This paper presents analysis of a geometrical computation based localization mechanism for wireless sensor networks. Authors analyze its accuracy for parameters like number of reference nodes, number of communications and different power level. Multiple anchors are used to analyze the performance of algorithm in terms of mean square error (m.s.e) of localization and no. of communications required...
In this paper, a technique for detection of wormhole attacks based on distance verification is proposed for mobile ad hoc network (MANETs) applications. A node estimates its distances to a sender node based on the received signal strength (RSS) of received packets, and uses them to verify against the distances computed from the location information in the packets. The verification is formulated as...
The cooperation issue in the UWB medium access control (MAC) and routing layers is less investigated in the current literature. This is despite the large potential of cooperation for performance improvement in these layers. Moreover, UWB radio provides useful properties to the higher layers, such as immunity to multi path fading, less power consumption, and precise ranging and localization ability...
In this work point coverage, sink location and data routing problems are considered in an integrated way and two new mixed integer programming formulations are proposed. Since these models are computationally difficult to solve, a hierarchical solution procedure is proposed. In the top level, best sensor locations are sought by variable neighbourhood search. Given the sensor locations, a simpler formulation...
This paper proposes an adaptive clustering cache replacement scheme to improve the performance of Freenet peer-to-peer networks. Efficient data retrieval in peer-to-peer networks in general and in Freenet in particular is a challenging problem. We follow the approach of using the small-world behavior to model the data cache replacement in Freenet and propose an extension to it: an adaptive clustering...
It is generally recognized that the current routing scheme of Internet suffers from serious scalability problems. In this paper, we work with the abstract but 'Internet-like' network model consisting of an infinite-variance power-law random graph (IVPLRG) and adopt the idea of a routing scheme proposed by Carmi, Cohen and Dolev (C-C-D). The scheme fits very naturally to the spontaneously emerging...
There are lots of operations in the distribution center, of which the replenishment operation is an important one that can decrease the processing time seriously and bring considerable economic benefit if managed effectively. We consider the replenishment problem in which travel time and distance is measured according to rectilinear norm. An O(n) polynomial time algorithm to find the optimal replenishing...
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...
Link estimation is a basic element of routing in low-power wireless networks, and data-driven link estimation using unicast MAC feedback has been shown to outperform broadcast- beacon based link estimation. Nonetheless, little is known about the impact that different data-driven link estimation methods have on routing behaviors. To address this issue, we classify existing data- driven link estimation...
In this paper, we propose a novel proactive routing protocol, referred to as potential management based proactive routing (PMPR), for mobile ad hoc networks. Unlike other proactive routing protocols, PMPR performs request based routing recovery for proactive route maintenance. When a node has lost the routing information, it attempts a local route recovery by broadcasting a request message to neighbor...
Connectivity-based routing protocols provide an attractive option for point to point communication in wireless networks due to its potential for low routing overhead. However, when the entire hop-count vector is used to address each node, the communication and storage overhead in the packets are often so high that it is not feasible to implement existing connectivity- based routing protocols infeasible...
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.