Topic
Geographic routing
About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: An effective technique for preserving k-coverage and the reliability of data with logical fault tolerance is proposed and Simulation results show that the proposed method provides greater efficiency energy consumption.
Abstract: One of the major challenges in the area of wireless sensor networks is simultaneously reducing energy consumption and increasing network lifetime. Efficient routing algorithms have received considerable attention in previous studies for achieving the required efficiency, but these methods do not pay close attention to coverage, which is one of the most important Quality of Service parameters in wireless sensor networks. Suitable route selection for transferring information received from the environment to the sink plays crucial role in the network lifetime. The proposed method tries to select an efficient route for transferring the information. This paper reviews efficient routing algorithms for preserving k-coverage in a sensor network and then proposes an effective technique for preserving k-coverage and the reliability of data with logical fault tolerance. It is assumed that the network nodes are aware of their residual energy and that of their neighbors. Sensors are first categorized into two groups, coverage and communicative nodes, and some are then re-categorized as clustering and dynamic nodes. Simulation results show that the proposed method provides greater efficiency energy consumption.
63 citations
01 Nov 2009
TL;DR: This paper proposes an anonymous routing protocol with multiple routes called ARMR, which can satisfy all the required properties and has the flexibility of creating fake routes to confuse the adversaries, thus increasing the level of anonymity.
Abstract: A mobile ad hoc network consists of mobile nodes that communicate in an open wireless medium. Adversaries can launch analysis against the routing information embedded in the routing message and data packets to detect the traffic pattern of the communications, thereby obtaining sensitive information of the system, such as the identity of a critical node. In order to thwart such attacks, anonymous routing protocols are developed. For the purposes of security and robustness, an ideal anonymous routing protocol should hide the identities of the nodes in the route, in particular, those of the source and the destination. Multiple routes should be established to increase the difficulty of traffic analysis and to avoid broken paths due to node mobility. Existing schemes either make the unrealistic and undesired assumption that certain topological information about the network is known to the nodes, or cannot achieve all the properties described in the above. In this paper, we propose an anonymous routing protocol with multiple routes called ARMR, which can satisfy all the required properties. In addition, the protocol has the flexibility of creating fake routes to confuse the adversaries, thus increasing the level of anonymity. In terms of communication efficiency, extensive simulation is carried out. Compared with AODV and MASK, our ARMR protocol gives a higher route request success rate under all situations and the delay of our protocol is comparable to the best of these two protocols.
63 citations
TL;DR: Simulation results with MER show that accounting for location errors significantly improves the performance of geographic routing, and it is shown that in a mobile environment MER performs better than existing approaches.
63 citations
01 Jan 2009
TL;DR: A branch-and-price algorithm based on the set-partitioning formulation of the problem of simultaneously determining the location of facilities and the design of vehicle routes to serve customer demands under vehicle and facility capacity restrictions is described.
Abstract: We investigate the problem of simultaneously determining the location of facilities and the design of vehicle routes to serve customer demands under vehicle and facility capacity restrictions. We present a set-partitioning-based formulation of the problem and study the relationship between this formulation and the graph-based formulations that have been used in previous studies of this problem. We describe a branch-and-price algorithm based on the set-partitioning formulation and discuss computational experience with both exact and heuristic variants of this algorithm.
63 citations
08 Jan 2000
TL;DR: A new methodology to compute deadlock-free routing tables for NOWs is proposed, based on generating an underlying acyclic connected graph from the network graph and assigning a sequence number to each switch, which is used to remove cyclic dependencies.
Abstract: Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers Many NOWs are arranged as a switch-based network with irregular topology, which makes routing and deadlock avoidance quite complicated Current proposals use the up*/down* routing algorithm to remove cyclic dependencies between channels and avoid deadlock However, routing is considerably restricted and most messages must follow non-minimal paths, increasing latency and wasting resources In this paper, we propose a new methodology to compute deadlock-free routing tables for NOWs The methodology tries to minimize the limitations of the current proposals in order to improve network performance It is based on generating an underlying acyclic connected graph from the network graph and assigning a sequence number to each switch, which is used to remove cyclic dependencies Evaluation results show that the routing algorithm based on the new methodology increases throughput by a factor of up to 2 in large networks, also reducing latency significantly
63 citations