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
Posted Content
TL;DR: A new QoS algorithm for mobile ad hoc network has been proposed that combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.
Abstract: Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is established by a set of mobile nodes on a shared wireless channel. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination. When it comes to MANET, the complexity increases due to various characteristics like dynamic topology, time varying QoS requirements, limited resources and energy etc. QoS routing plays an important role for providing QoS in wireless ad hoc networks. The biggest challenge in this kind of networks is to find a path between the communication end points satisfying user’s QoS requirement. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. In this paper, a new QoS algorithm for mobile ad hoc network has been proposed. The proposed algorithm combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.

82 citations

Journal ArticleDOI
TL;DR: A Hop-by-Hop Dynamic Addressing Based (H2-DAB) routing protocol is proposed, where every node in the network will be assigned a routable address in a quick and efficient way without requiring an explicit configuration or any dimensional location information.

82 citations

Proceedings ArticleDOI
04 Nov 2010
TL;DR: In this paper, the authors consider the use of PLC in low and medium-voltage distribution grids to connect network nodes (e.g., meters, actuators, sensors) through multihop transmission.
Abstract: Smart Grid collectively refers to various visions of how energy generation, distribution, and consumption should be managed to overcome many of the shortcomings of today's electricity grids and to sustain our ever more electricity dependent societies. One important enabling component of Smart Grid will be a fine-grained and reliable communications infrastructure that links together the many elements of the grid. Since by definition all these elements are connected to power lines, power line communications (PLC) technology is a natural candidate to build parts of such an infrastructure. In this paper, we consider the use of PLC in low- and medium-voltage distribution grids to connect network nodes (e.g., meters, actuators, sensors) through multihop transmission. In particular, we address the problem of routing of unicast messages making use of the stationarity of nodes. To this end, we motivate and investigate the application of geographic routing protocols and gauge their performance with respect to energy consumption and transmission delay.

82 citations

Journal ArticleDOI
TL;DR: A generic description of real-time online information is provided based on three schemes using partial online information and one scheme with no online information, and the effectiveness of the heuristic algorithm is shown to be satisfactory over the tested random networks.
Abstract: Real-time information can enable travelers to adapt to changing traffic conditions and make better routing decisions in uncertain networks. In this paper, a generic description of real-time online information is provided based on three schemes using partial online information and one scheme with no online information. A theoretical analysis shows that more error-free information is always better than (or at least as good as) less information for optimal adaptive routing in flow-independent networks. A heuristic algorithm is designed for the optimal adaptive routing problem for all the four information schemes, based on a set of necessary conditions for optimality. The effectiveness of the heuristic algorithm is shown to be satisfactory over the tested random networks. This study is of interest for traveler information system evaluation and design.

82 citations

Patent
09 Nov 2005
TL;DR: In this paper, a method and apparatus for detecting malicious attacks is described, which may comprise obtaining routing information from a packet communicated via a network and maintaining a count of packets associated with a device associated with the routing information.
Abstract: A method and apparatus for detecting malicious attacks is described. The method may comprise obtaining routing information from a packet communicated via a network and maintaining a count of packets associated with a device associated with the routing information. For example, the routing information may a source or destination IP address, a port number, or any other routing information. The device may be classified as a potentially malicious device when the count exceeds a threshold. The count may be incremented when the TCP SYN flag is set and the TCP ACK flag is not set. An embodiment comprises obtaining a source hash of the source IP address and a destination hash of the destination IP address. Thereafter, the source hash and the destination hash may be mapped to multi stage filters. The device associated with the packet may then be selectively categorizing as a suspicious device.

82 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