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
04 Mar 2007
TL;DR: POSANT as mentioned in this paper is a reactive routing algorithm for mobile ad hoc networks which combines the idea of ant colony optimization with information about the position of nodes and has a shorter route establishment time while using a smaller number of control messages than other ant colony routing algorithms.
Abstract: Availability of cheap positioning instruments like GPS receivers makes it possible for routing algorithms to use the position of nodes in an ad hoc mobile network. Regular position based routing algorithms fail to find a route from a source to a destination in some cases when the network contains nodes with irregular transmission ranges or they find a route that is much longer than the shortest path. On the other hand, routing algorithms based on ant colony optimization find routing paths that are close to the shortest paths even if the nodes in the network have different transmission ranges. The drawback of these algorithms is the large number of messages that needs to be sent or the long delay before the routes are established. In this paper we propose POSANT, a reactive routing algorithm for mobile ad hoc networks which combines the idea of ant colony optimization with information about the position of nodes. Our simulations show that POSANT has a shorter route establishment time while using a smaller number of control messages than other ant colony routing algorithms.
62 citations
10 Oct 2008
TL;DR: The overhead of location authentication is investigated under various scenarios through network simulation and results show that although the presence of malicious nodes increases the routing path length, a data delivery rate of larger than 80% is sustained even if 40% of the nodes are malicious.
Abstract: We propose to secure location aware services over vehicular ad hoc networks (VANET) with our geographical secure path routing protocol (GSPR). GSPR is an infrastructure free geographic routing protocol, which is resilient to disruptions caused by malicious or faulty nodes. Geographic locations of anonymous nodes are authenticated in order to provide location authentication and location privacy simultaneously. Our protocol also authenticates the routing paths taken by individual messages. This paper presents the design of the GSPR secure geographic routing protocol. The overhead of location authentication is investigated under various scenarios through network simulation. Results show that although the presence of malicious nodes increases the routing path length, a data delivery rate of larger than 80% is sustained even if 40% of the nodes are malicious.
62 citations
TL;DR: Given a network with a predefined routing, the effects of faulty components on the routing is studied and the number of routes along which a message must travel between any two non-faulty nodes is analyzed.
Abstract: We model a communication network as a graph in which a processor is a node and a communication link is an edge. A routing for such a network is a fixed path, or route, between each pair of nodes. Given a network with a predefined routing, we study the effects of faulty components on the routing. Of particular interest is the number of routes along which a message must travel between any two non-faulty nodes. This problem is analyzed for specific families of graphs and for classes of routings. We also give some bounds for general versions of the problem. Finally, we conclude with one of the most important contributions of this paper, a list of interesting and apparently difficult open problems.
62 citations
TL;DR: Performance analysis and simulation results show that TSSRM can improve the security and effectiveness of WSN.
Abstract: Aiming at the serious impact of the typical network attacks caused by the limited energy and the poor deployment environment of wireless sensor network (WSN) on data transmission, a trust sensing-based secure routing mechanism (TSSRM) with the lightweight characteristics and the ability to resist many common attacks simultaneously is proposed in this paper, at the same time the security route selection algorithm is also optimized by taking trust degree and QoS metrics into account. Performance analysis and simulation results show that TSSRM can improve the security and effectiveness of WSN.
62 citations
TL;DR: A methodology to design fault-tolerant routing algorithms for regular direct interconnection networks that supports fully adaptive routing, does not degrade performance in the absence of faults, and supports a reasonably large number of faults without significantly degrading performance.
Abstract: In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade performance in the absence of faults, and supports a reasonably large number of faults without significantly degrading performance. The methodology is mainly based on the selection of an intermediate node (if needed) for each source-destination pair. Packets are adaptively routed to the intermediate node and, at this node, without being ejected, they are adaptively forwarded to their destinations. In order to allow deadlock-free minimal adaptive routing, the methodology requires only one additional virtual channel (for a total of three), even for tori. Evaluation results for a 4 x 4 x 4 torus network show that the methodology is 5-fault tolerant. Indeed, for up to 14 link failures, the percentage of fault combinations supported is higher than 99.96%. Additionally, network throughput degrades by less than 10% when injecting three random link faults without disabling any node. In contrast, a mechanism similar to the one proposed in the BlueGene/L, that disables some network planes, would strongly degrade network throughput by 79%.
62 citations