This paper describes a fuzzy routing algorithm integrated in a telematics transportation system designed for monitoring in real-time the transportation of hazardous materials. With regard to decision aspect, the fuzzy...
详细信息
ISBN:
(纸本)9783319662510;9783319662503
This paper describes a fuzzy routing algorithm integrated in a telematics transportation system designed for monitoring in real-time the transportation of hazardous materials. With regard to decision aspect, the fuzzy modelling and in particular the fuzzy routing techniques will be described in this work. The fuzzy path-finding is important for graphs of risk. The fuzzy technology exhibits solutions that often contributes to the decision making for the complex problems. Some orientations will also be discussed for the integration of real time intelligent systems capabilities.
The classic method to depict graphs is a node-link diagram where vertices (nodes) are associated with each object and edges (links) connect related objects. However, node-link diagrams quickly appear cluttered and unc...
详细信息
ISBN:
(纸本)9781467368797
The classic method to depict graphs is a node-link diagram where vertices (nodes) are associated with each object and edges (links) connect related objects. However, node-link diagrams quickly appear cluttered and unclear, even for moderately sized graphs. If the positions of the nodes are fixed then suitable link routing is the only option to reduce clutter. We present a novel link clustering and routing algorithm which respects (and if desired refines) user-defined clusters on links. If no clusters are defined a priori we cluster based on geometric criteria, that is, based on a well-separated pair decomposition (WSPD). We route link clusters individually on a sparse visibility spanner. To completely avoid ambiguity we draw each individual link and ensure that clustered links follow the same path in the routing graph. We prove that the clusters induced by the WSPD consist of compatible links according to common similarity measures as formalized by Holten and van Wijk [17]. The greedy sparsification of the visibility graph allows us to easily route around obstacles. Our experimental results are visually appealing and convey a sense of abstraction and order.
The well-separated pair decomposition (WSPD) of the complete Euclidean graph defined on points in R-2 (Callahan and Kosaraju [JACM, 42 (1): 67-90, 1995]) is a technique for partitioning the edges of the complete graph...
详细信息
ISBN:
(数字)9783319621272
ISBN:
(纸本)9783319621272;9783319621265
The well-separated pair decomposition (WSPD) of the complete Euclidean graph defined on points in R-2 (Callahan and Kosaraju [JACM, 42 (1): 67-90, 1995]) is a technique for partitioning the edges of the complete graph based on length into a linear number of sets. Among the many different applications of WSPDs, Callahan and Kosaraju proved that the sparse subgraph that results by selecting an arbitrary edge from each set (called WSPD-spanner) is a 1 + 8/(s - 4)-spanner, where s > 4 is the separation ratio used for partitioning the edges. Although competitive local-routing strategies exist for various spanners such as Yao-graphs, circle dot-graphs, and variants of Delaunay graphs, few local-routing strategies are known for any WSPD-spanner. Our main contribution is a local-routing algorithm with a near-optimal competitive routing ratio of 1 + O(1/s) on a WSPD-spanner. Specifically, we present a 2-local and a 1-local routing algorithm on a WSPD-spanner with competitive routing ratios of 1+ 6/(s - 2)+ 4/s and 1+ 6/(s - 2)+ 6/s + 4/(s(2) - 2s) + 8/s(2), respectively.
The effective localization of the right resources is a challenging issue at the current stage of development of P2P systems in presence of a high number of peers providing heterogeneous resource descriptions. In this ...
详细信息
ISBN:
(纸本)9783540768876
The effective localization of the right resources is a challenging issue at the current stage of development of P2P systems in presence of a high number of peers providing heterogeneous resource descriptions. In this paper, we present a novel approach based on lightweight communities to support routing-by-content in P2P systems. In particular, original contribution of the proposed approach regards i) the notion of lightweight community for supporting routing through self-configuring semantic overlays, and ii) the definition of a kit of semantics-based services for equipping a peer with routing-by-content functionalities based on peer ontologies and ontology matching techniques.
Successful integration of pervasive sensor networks in mission critical applications depends on the ability of these networks to cope with and reasonably perform under the worst-case scenarios. One of the key performa...
详细信息
ISBN:
(纸本)9780769527888
Successful integration of pervasive sensor networks in mission critical applications depends on the ability of these networks to cope with and reasonably perform under the worst-case scenarios. One of the key performance measures is the network's ability to route information from the source node to the intended destination. This paper introduces a general framework with which worst-case routing performance of sensor networks can be evaluated and compared. Ultimately, our method can either be used as a design optimization tool, or a decision making tool to select and price contending sensor network designs.
Since the nodes of wireless sensor networks are in the condition of a highly-limited and unreplenishable energy resource such as battery power, computation, and storage space, the energy efficiency is the most importa...
详细信息
ISBN:
(纸本)9781424442270
Since the nodes of wireless sensor networks are in the condition of a highly-limited and unreplenishable energy resource such as battery power, computation, and storage space, the energy efficiency is the most important key-point of the network routing designing In this paper, A novel routing algorithm which combines with hierarchical routing and geographical routing is proposed. Based on the hierarchical network architecture, the process of forwarding packets between the source nodes in the target region and the base station consists of two phases-inter-cluster routing and intra-cluster routing, a greedy algorithm is adopted in the process of the inter cluster routing and an multi-hop routing algorithm based on the forwarding restriction angle is designed for the intra-cluster routing. The analysis and simulation results show that our routing algorithm has better performance in terms of energy consumption and delay, it is suitable for the data transmission in a high-density wireless sensor network.
This paper proposes a fully distributed fault-tolerant routing methodology for tori and meshes. A dynamic fault-model is supported, enabling the network to remain fully operational at all times. Contrary to most previ...
详细信息
ISBN:
(纸本)9783540772194
This paper proposes a fully distributed fault-tolerant routing methodology for tori and meshes. A dynamic fault-model is supported, enabling the network to remain fully operational at all times. Contrary to most previous proposals that support a dynamic fault-model, the methodology is able to tolerate concave fault regions, thereby avoiding disabling healthy nodes in most practical scenarios. The methodology provides high network performance through the use of adaptive routing and provides graceful performance degradation in the presence of faults.
A routing algorithm is proposed to support multicast routing infrastructure for heterogeneous wireless/wired networks. The algorithm has two goals: (a) reduce the overall cost of the multicast tree, (b) reduce the lat...
详细信息
ISBN:
(纸本)0780365968
A routing algorithm is proposed to support multicast routing infrastructure for heterogeneous wireless/wired networks. The algorithm has two goals: (a) reduce the overall cost of the multicast tree, (b) reduce the latency for join and leave operations when mobile units hand-off from one cell to another. The algorithm LMM (Low-cost Mobile Multicast) reduces the delay during the hand-off process by precomputing the least-cost path to all neighboring cells. LMM is able to effectively support both static and mobile hosts.
This article focuses on routing messages along shortest paths in tree networks, using compact distributed data structures. We mainly prove that n-node trees support routing schemes with message headers, node addresses...
详细信息
ISBN:
(纸本)3540422870
This article focuses on routing messages along shortest paths in tree networks, using compact distributed data structures. We mainly prove that n-node trees support routing schemes with message headers, node addresses, and local memory space of size O(log n) bits, and such that every local routing decision is taken in constant time. This improves the best known routing scheme by a factor of O(log n) in term of both memory requirements and routing time. Our routing scheme requires headers and addresses of size slightly larger than log n, motivated by an inherent trade-off between address-size and memory space, i.e., any routing scheme with addresses on log n bits requires Omega(rootn) bits of local memory-space. This shows that a little variation of the address size, e.g., by an additive O(log n) bits factor, has a significant impact on the local memory space.
Mobile ad hoc networks are characterized by many small processors that work together to perform complex tasks with no outside help. These systems are rapidly deployable and can be used to create wireless sensor networ...
详细信息
ISBN:
(纸本)9781424423651
Mobile ad hoc networks are characterized by many small processors that work together to perform complex tasks with no outside help. These systems are rapidly deployable and can be used to create wireless sensor networks. The challenge ties in developing a protocol that allows the processors to automatically set up multi-hop communication paths among themselves. If the nodes are mobile then the network topology changes when nodes move out of wireless range and nodes may have to reestablish broken paths. The rational swarm protocol developed at the University of Virginia attempts to discover several paths between a source and destination by tracking the quality of each path to minimize the expensive need to perform route discovery when a path breaks. This thesis project deployed rational swarm onto a real system of small Sun SPOTs to serve as a proof of implementation. A graphical user interface allows a user to control and display the system to demonstrate its capabilities to a large audience.
暂无评论