scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: It is shown that the proposed scheme can significantly reduce the data traffic and improve the network lifetime and a distributed gradient algorithm designed accordingly can converge to the optimal value efficiently under all network configurations.
Abstract: An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data aggregation and routing. We adopt a model to integrate data aggregation with the underlying routing scheme and present a smoothing approximation function for the optimization problem. The necessary and sufficient conditions for achieving the optimality are derived and a distributed gradient algorithm is designed accordingly. We show that the proposed scheme can significantly reduce the data traffic and improve the network lifetime. The distributed algorithm can converge to the optimal value efficiently under all network configurations.

177 citations

Journal ArticleDOI
TL;DR: An open source routing solver, C-BGP, is presented that eases the investigation of changes in the routing or topology of large networks and illustrates how to build a model of an ISP on a real transit network and apply the model on two "what-if" scenarios.
Abstract: Today, the complexity of ISPs' networks make it difficult to investigate the implications of internal or external changes on the distribution of traffic across their network. In this article we explain the complexity of building models of large ISPs' networks. We describe the various aspects important to understanding the routing inside an AS. We present an open source routing solver, C-BGP, that eases the investigation of changes in the routing or topology of large networks. We illustrate how to build a model of an ISP on a real transit network and apply the model on two "what-if" scenarios. The first scenario studies the impact of chances in the Internet connectivity of a transit network. The second investigates the impact of failures in its internal topology.

177 citations

Journal ArticleDOI
TL;DR: This work proposes detection mechanisms that are capable of recognizing nodes cheating about their location in position beacons and successfully discloses nodes disseminating false positions and thereby widely prevents attacks using position cheating.
Abstract: Intervehicle communication is regarded as one of the major applications of mobile ad hoc networks (MANETs). Compared to MANETs, these so-called vehicular ad hoc networks (VANETs) have special requirements in terms of node mobility and position-dependent applications, which are well met by geographic routing protocols. Functional research on geographic routing has already reached a considerable level, whereas security aspects have been vastly neglected so far. Since position dissemination is crucial for geographic routing, forged position information has severe impact regarding both performance and security. In this work, we first analyze the problems that may arise from falsified position data. Then, in order to lessen these problems, we propose detection mechanisms that are capable of recognizing nodes cheating about their location in position beacons. In contrast to other position verification approaches, our solution does not rely on special hardware or dedicated infrastructure. Evaluation based on simulations shows that our position verification system successfully discloses nodes disseminating false positions and thereby widely prevents attacks using position cheating

176 citations

Journal ArticleDOI
TL;DR: The proposed energy aware routing algorithm is based on a clever strategy of cluster head (CH) selection, residual energy of the CHs and the intra-cluster distance for cluster formation and achieves constant message and linear time complexity.

176 citations

Journal ArticleDOI
TL;DR: This proposed approach tries to account for link stability and for minimum drain rate energy consumption and a novel routing protocol called Link-stAbility and Energy aware Routing protocols (LAER) is proposed.
Abstract: Energy awareness for computation and protocol management is becoming a crucial factor in the design of protocols and algorithms. On the other hand, in order to support node mobility, scalable routing strategies have been designed and these protocols try to consider the path duration in order to respect some QoS constraints and to reduce the route discovery procedures. Often energy saving and path duration and stability can be two contrasting efforts and trying to satisfy both of them can be very difficult. In this paper, a novel routing strategy is proposed. This proposed approach tries to account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of the proposed solution a biobjective optimization formulation has been designed and a novel routing protocol called Link-stAbility and Energy aware Routing protocols (LAER) is proposed. This novel routing scheme has been compared with other three protocols: PERRA, GPSR, and E-GPSR. The protocol performance has been evaluated in terms of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average energy consumption.

175 citations


Network Information
Related Topics (5)
Wireless ad hoc network
49K papers, 1.1M citations
95% related
Wireless sensor network
142K papers, 2.4M citations
94% related
Network packet
159.7K papers, 2.2M citations
94% related
Wireless network
122.5K papers, 2.1M citations
94% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202330
202286
202133
202037
201952
201890