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.
Geometry-based localization algorithms come to the forefront with its unique superiority. This paper proposes a Delaunay triangulation based localization scheme (DBLS), which takes use of received signal strength indicator(RSSI) from anchor nodes. Based on RSSI, the Delaunay area is generated. The unknown node determines which Delaunay area it belongs to and then record it down. After several iteration,...
The initial Named Data Networking (NDN) architecture design provided consumer mobility support automatically, taking advantage of NDN's stateful forwarding plane to return data to mobile consumers; at the same time, the support of data producer mobility was left unspecified. During the past few years, a number of NDN producer mobility support schemes have been proposed. This paper provides a clear...
In energy-harvesting wireless sensor networks, sensor nodes equipped with a harvesting device scavenge the valuable energy from ambient environments. In this paper, we consider the routing problem of jointly considering the distance, the remaining energy and energy-harvesting capability of sensor nodes with the objective to route the collected data toward the sink node by going through the high-density...
This paper presents Griffin, a scheme of geometric routing on flat names to conduct massive content distribution and retrieval. A tree-based metric space T is proposed according to the concept of hierarchical division of symbol space. In Griffin, the network topology is embedded into the T-space, and content names are mapped to the T-space. Content publication and retrieval are supported by geometric...
The explosive growth of online videos brings a great pressure on LTE mobile networks caused by huge mobile data traffics. Deploying caches at the evolved packet core (EPC) and radio access network (RAN) in LTE mobile networks can efficiently relieve this pressure by the way of reducing duplicate content transmissions. In this paper, we propose collaborative caching algorithms for the LTE mobile network...
It is of great significance for network operators and researchers to obtain accurate AS-level traceroute paths, for which mapping IP addresses to correct AS numbers is critical. Thus, there have been a lot of efforts to improve the original IP-to-AS mapping table, which was extracted from BGP routing tables. One of these efforts is called pair matching, which refines the original mapping table by...
A new routing method is proposed to reduce the peak far-end crosstalk voltage and the crosstalk induced timing jitter of parallel microstrip lines on printed circuit boards. The stub uniformly distributed along one of parallel double microstrip lines in the proposed routing method increase the mutual capacitance without much changing the mutual inductance between the aggressor and victim lines. This...
The advantage and weakness of mobile agent migration strategy have an important impact on user's task that the agent completes. The agent flooding mechanism is proposed to collect network status information duly, and a new kind of traveling agent is included into the mobile agent system to improve the real-time performance, and self-adaptation ant colony algorithm is used to search the path, and improves...
Wireless multimedia sensor networks (WMSNs) are expected to find wide applicability in target tracking in the near future. This paper proposes a dynamic capacity multi-path routing protocol (DCM), based on improved Ford-Fulkerson algorithm, to solve the problem of data transmission from anchor nodes to base station (BS). By adjusting the parameter of flow capacity in max-flow model, a multi-path routing...
Delay and Tolerant Networks (DTNs) have been proposed to address data communication challenges in network scenarios, where no instantaneous end-to-end path is guaranteed because of frequent and long duration network partitions. Typical protocols forward a message to multiple nodes to improve message delivery rate. However, a large number of replications of original messages consume a large amount...
The actual express delivery network problem is to find a minimum-time tour solution and obtain vehicle classes and frequencies of mail routes. In order to solve the actual problem, the vehicle routing problem with multiple vehicle classes and vehicle frequencies is presented and described, and simulation-based optimization model of the actual problem is developed. With respect to huge perturbation...
Multicast is widely applied for multimedia communications in Internet. The effective multicast routing is the key technology to the communications. The Qos of multi-constrained multicast routing problem deserves more attention. The objective function is to minimize the cost and meet multiple constraints to realize high Qos. The solutions' fitness is obtained by the concentration mechanism of immune...
This paper studies the traffic hot spots of mesh networks in the context of chip multiprocessors. To mitigate these effects, this paper describes a non-uniform fat-mesh extension to mesh networks, which are popular for chip multiprocessors. The fat-mesh is inspired by the fat-tree and dedicates additional links for connections with heavy traffic (e.g. near the center) with fewer links for lighter...
This paper proposes a novel Differentiated Domain Protection (DDP) algorithm to address survivability in multi-domain optical networks. In order to ensure the principle of transparent management in multi-optical domains, DDP abstracts the multi-domain optical networks to Virtual Topology Graph (VTG) to solve the inter-domain routing. In order to satisfy the survivable requirements of different domains,...
One of the goals of P2P file-sharing system is to provide reliable and convenient sharing mechanism for users, so the resources can be gotten more quickly. However, in traditional DHT network, the problem of mismatching between the P2P overlay network and the physical underlying network has not been taken into consideration, which greatly limits the performance in various search or routing techniques...
Cross-layer design has been proposed as a promising paradigm to tackle various problems of wireless communication systems. Recent research has led to a variety of protocols that rely on intensive interaction between different layers of the classical layered OSI protocol architecture. These protocols involve different layers and introduce new ideas how layers shall communicate and interact. In existing...
We present a thorough investigation of four issues with the destination set in IP-level topology measurement. (1) To evaluate the completeness of the destination set, we measured by brute force and found that a half of edges will be missed by the uniform random selection (URS) method which was adopted by well-known CAIDA' skitter. (2) Two potential reasons for edge missing, the short-term routing...
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.