Topic
Static routing
About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.
Papers published on a yearly basis
Papers
More filters
••
01 Jun 2009TL;DR: This paper has proposed an efficient solution, based on a genetic algorithm (GA), for scheduling the data gathering of relay nodes, which can significantly extend the lifetime of a relay node network.
Abstract: Higher power relay nodes can be used as cluster heads in two-tiered sensor networks to achieve improved network lifetime. The relay nodes may form a network among themselves to route data towards the base station. In this model, the lifetime of a network is determined mainly by the lifetimes of these relay nodes. An energy-aware communication strategy can greatly extend the lifetime of such networks. However, integer linear program (ILP) formulations for optimal, energy-aware routing quickly become computationally intractable and are not suitable for practical networks. In this paper, we have proposed an efficient solution, based on a genetic algorithm (GA), for scheduling the data gathering of relay nodes, which can significantly extend the lifetime of a relay node network. For smaller networks, where the global optimum can be determined, our GA based approach is always able to find the optimal solution. Furthermore, our algorithm can easily handle large networks, where it leads to significant improvements compared to traditional routing schemes.
182 citations
••
27 Oct 2003TL;DR: This paper examines the extent to which a path-independence assumption holds on the Internet by analyzing 14 days of data collected from 30 nodes in the RON testbed, and finds that the chances of losing two packets between the same hosts is nearly as high when those packets are sent through an intermediate node.
Abstract: Time-varying congestion on Internet paths and failures due to software, hardware, and configuration errors often disrupt packet delivery on the Internet.Many aproaches to avoiding these problems use multiple paths between two network locations. These approaches rely on a path-independence assumption in order to work well; i.e., they work best when the problems on different paths between two locations are uncorrelated in time.This paper examines the extent to which this assumption holds on the Internet by analyzing 14 days of data collected from 30 nodes in the RON testbed. We examine two problems that manifest themselves---congestion-triggered loss and path failures---and find that the chances of losing two packets between the same hosts is nearly as high when those packets are sent through an intermediate node (60%) as when they are sent back-to-back on the same path (70%). In so doing, we also compare two different ways of taking advantage of path redundancy proposed in the literature: mesh routing based on packet replication, and reactive routing based on adaptive path selection.
182 citations
••
TL;DR: Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs.
Abstract: In this paper, we propose an efficient Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm for WMSNs TPGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs It finds one shortest (near-shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near-shortest) node-disjoint routing paths TPGF supports three features: (1) hole-bypassing, (2) the shortest path transmission, and (3) multipath transmission, at the same time TPGF is a pure geographic greedy forwarding routing algorithm, which does not include the face routing, eg, right/left hand rules, and does not use planarization algorithms, eg, GG or RNG This point allows more links to be available for TPGF to explore more routing paths, and enables TPGF to be different from many existing geographic routing algorithms Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs
182 citations
••
TL;DR: GeoDTN+Nav is proposed, a hybrid geographic routing solution enhancing the standard greedy and recovery modes exploiting the vehicular mobility and on-board vehicular navigation systems to efficiently deliver packets even in partitioned networks by using delay tolerant forwarding in sparse networks.
Abstract: Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy algorithms to forward packets by selecting relays with the best progress towards the destination or use a recovery mode in case such solutions fail. These protocols could forward packets efficiently given that the underlying network is fully connected. However, the dynamic nature of vehicular network, such as vehicle density, traffic pattern, and radio obstacles could create unconnected networks partitions. To this end, we propose GeoDTN+Nav, a hybrid geographic routing solution enhancing the standard greedy and recovery modes exploiting the vehicular mobility and on-board vehicular navigation systems to efficiently deliver packets even in partitioned networks. GeoDTN+Nav outperforms standard geographic routing protocols such as GPSR and GPCR because it is able to estimate network partitions and then improves partitions reachability by using a store-carry-forward procedure when necessary. We propose a virtual navigation interface (VNI) to provide generalized route information to optimize such forwarding procedure. We finally evaluate the benefit of our approach first analytically and then with simulations. By using delay tolerant forwarding in sparse networks, GeoDTN+Nav greatly increases the packet delivery ratio of geographic routing protocols and provides comparable routing delay to benchmark DTN algorithms.
181 citations
••
30 Jun 2003TL;DR: A general algorithm is proposed, in which message is forwarded to exactly those neighbors, which may be best choices for a possible position of destination (using the appropriate criterion), in which memoryless and past traffic memorization variants of each scheme are proposed.
Abstract: A broad variety of location dependent services will become feasible in the near future due to the use of the Global Positioning System (GPS), which provides location information (latitude, longitude and possibly height) and global timing to mobile users. Routing is a problem of sending a message from a source to a destination. Geocasting is a problem of sending a message to all nodes located within a region (e.g. circle or square). Recently, several localized GPS based routing and geocasting protocols for a mobile ad hoc network were reported in literature. In directional (DIR) routing and geocasting methods, node A (the source or intermediate node) transmits a message m to all neighbors located between the two tangents from A to the region that could contain the destination. It was shown that memoryless directional methods might create loops in routing process. In two other proposed methods (proven to be loop-free), geographic distance (GEDIR) or most forward progress within radius (MFR) routing, node A forwards the message to its neighbor who is closest to destination, or has greatest progress towards destination (respectively). In this paper, we propose a general algorithm (based on a unified framework for both routing and geocasting problems), in which message is forwarded to exactly those neighbors, which may be best choices for a possible position of destination (using the appropriate criterion). We then propose and discuss new V-GEDIR and CH-MFR methods and define R-DIR, modified version of existing directional methods. In V-GEDIR method, these neighbors are determined by intersecting the Voronoi diagram of neighbors with the circle (or rectangle) of possible positions of destination, while the portion of the complex hull of neighboring node is analogously used in the CH-MFR method. Routing and geocasting algorithms differ only inside the circle/rectangle. We propose memoryless and past traffic memorization variants of each scheme. The proposed methods may be also used for the destination search phase allowing the application of different routing schemes after the exact destination of position is discovered. Memoryless V-GEDIR and CH-MFR algorithms are loop-free, and have smaller flooding rate (with similar success rate) compared to directional method. Simulations involving the proposed and some known algorithms are in progress and confirm our expectations.
181 citations