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.
This paper presented a fast fasten control algorithm (2FCA) in wireless sensor networks for information processing and transmitting. Using anycast technology, 2FCA can fast fasten broken routing path, which will decrease failure delay and increase packets' success rate. In the algorithm, it restricts participant nodes to save scarce energy and bandwidth resource, and then prolongs network's lifetime...
Considering a video/audio server deployed on the gateway node of a wireless mesh network, a large amount of clients distributed on various mesh routers may wish to receive multimedia streams from the server simultaneously. A multicast tree would be a suitable mechanism to deliver subscribed streams to all the destinations. For multi-radio and multi-channel wireless networks, however, it is better...
The main challenge in DTNs is how to deal with path uncertainty in achieving a reliable routing scheme. All Erasure coding based routing algorithms make the assumption that the underlying path probabilities are known previously and remain constant, which is unpractical. On the other hand, the overall behavior of path probability tends to be stable with the increasing number of paths, which can be...
The separation between edge and core addresses has been proposed to address the scalability problem of the Internet routing system. One main challenge is to design an efficient mapping mechanism for the two address spaces. The layer structure is attractive because of its scalability and simple index mechanism, while existing layered mapping system lacks a clear structure study and faces serious deployment...
This paper considers the problem of constructing minimum-delay multicast trees for message dissemination in overlay networks in which nodal delays for processing messages are taken into account in addition to communication delays. The objective is to find a multicast tree to deliver a message from a source to multiple destinations in minimum delay time. This paper introduces a new delay measure called...
We analyze the dynamics of two mobility datasets in DTN (Delay Tolerant Network), collected from different sources, including one university campus WLAN and two conferences WLANs. We find that the temporal network density of DTN changes with time and approximate varies periodically. We study how the cyclic temporal network density affects information diffusion. The results show that average reachability...
We address the problem of routing for multi-radio multi-channel wireless mesh networks, and propose a novel routing metric, named DARM. Compared with the prior routing metrics focus on the network throughput, DARM aims to minimize the end-to-end delay, which is a significant requirement for multimedia applications. Our routing metric captures the effects of variation in link loss-ratio, the length...
Aiming at the current structured P2P system's locality of physical location and accessing resources, in the context of P4P technology, this paper takes the Pastry and P4P-Pastry algorithms as foundation, proposes a enhanced P4P routing algorithm, in which peers performed clustering to the same resources and the proximity of physical location of nodes. When routing, the node routes to the nodes which...
Delay tolerant networks (DTNs) are envisioned to provide promising applications and services. One critical issue in DTNs is efficiently forwarding the messages within the delay requirements while avoiding the cost associated with blind flooding. To guide the forwarding process, nodes can evaluate their relationships with each other, in terms of ``closeness'', which summarizes both temporal and spacial...
In this paper, we extend unicast admission control based on path segment measurement technique to multicast environment. The proposed scheme does not impose any requirements on the network routers other than the ability to prioritize the packets. We develop an edge probing mechanism that measures a segment of the network path instead of measuring the full path. With path segment probing, we show that...
Aiming at the current structured P2P system's locality of physical location and accessing resources, in the context of P4P technology, this paper takes the Pastry algorithm as a foundation, proposes a P4P routing algorithm, in which peers performed clustering to the same resources and the proximity of physical location of nodes. When routing, the node routes to the nodes which are physical adjacent...
With the development of the space technology, the low performance of the on-board computing becomes a bottleneck of the satellite networks. To solve this problem, we proposed a new QoS routing scheme for LEO satellite networks based on ground station in this paper. This routing scheme is off-line and based on prediction. The most computing task of the routing scheme will be implemented on the ground...
Media-Independent Pre-Authentication (MPA) is used as a secure handover optimization scheme working over any link layer. With MPA, a mobile node (the MN) can establish a security association with a candidate target network (CTN), obtain an IP address and other parameters from the CTN, and complete the binding update of any mobility management protocol with the new care-of address (nCoA) before performing...
In deflection based Data Vortex switching fabric networks, packets may experience additional delays that are dependent on the network operation conditions such as resource redundancy conditions, traffic loads and network sizes. Even though physical latency might still be acceptable, packets in the tail of the delay distribution may have suffered from excessive noise accumulation due to excessive number...
In this paper, we propose a novel application problem in wireless sensor networks. It is the real-time data forwarding for mobile target tracking problem. It mainly focuses on routing the sensing data from multiple sources to multiple sinks with the consideration both of energy conservation and latency limitation. This problem is proved to be NP-complete. We propose three different heuristic methods...
In the MPLS-based mobile IPv6 network, when mobile node performs handover, it needs to rebuild label switching path, which impacts the handover delay and causes packets loss. Reused parts of the path overcome the above reasons, which propose a cross-router (CR) algorithm. It modifies the label information base (LIB), that is, increases two fields: the mobile node address and the time counter. When...
Tolerant network (DTN) is a kind of network with high latency and frequent disconnection. To guarantee the success of delivering a message to the destination and to make time cost as low as possible, routers in this kind of network (DTN) need to multicopy the message and store it longer than routers in other kinds of network. This paper focuses on the relation and reciprocity between routing and buffer...
This paper provides parameter setting and 2-D local stability conditions for TCP/RED networks. In general, a network cannot avoid congestions due to the limit of network capacity. The RED scheme is one of the representative AQM that was proposed to avoid and alleviate network congestions. However, the issue of network stability with many TCP subscribers needs to be considered when setting the RED...
Wireless multimedia sensor networks are widely used in the information acquiring and processing. Potential applications of multimedia sensor networks span a wide spectrum from military to industrial, from commercial to environmental monitoring. These applications may demand high bandwidth and are extremely delay-sensitive. Multipath routing is one of appropriate solutions for multimedia data transmitting...
K highest label path algorithm (KHLP) is presented for MPLS-TE. The algorithm first uses generalization of highest-label pre-flow-push algorithm to calculate K-shortest paths, then chooses the LSP in terms of the link criticality and the residual bandwidth, combines K value to give different links weight, further combines offline with online routing to reduce the computational complexity, simultaneously...
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.