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: An efficient routing approach for delivering packets in complex networks that messages are distributed among the nodes according to the capabilities of the nodes in handling messages and key features in numerical results are explained by a mean field theory.

85 citations

Patent
11 Mar 1987
TL;DR: In this paper, the source, destination and identity of a segment-in-process (SIP) is provided to the host computer system by a client process, and the host defines a sequence of distributed routing units through which the SIP will move from its source to its destination.
Abstract: Segments-in-process (SIPs) of material are automatically routed through a material handling system by distributed routing units under the guidance of a host computer system. The material handling system comprises a network of intersecting material paths. A distributed routing unit is located at material path intersections. Information relating to the source, destination and identity of a SIP is provided to the host computer system by a client process. Typically the destination of the SIP is a process machine located on a material path. Upon receipt of the information from the client process, the host defines a sequence of distributed routing units through which the SIP will move from its source to its destination. Each distributed routing unit in the sequence is then provided with information which enables each unit to identify the SIP and to perform a task with respect thereto. The tasks are then sequentially performed such that the SIP is routed through the defined sequence to its destination. The SIP may be routed to its destination when the host computer system is off line.

84 citations

Journal ArticleDOI
TL;DR: This work investigates a network routing problem where a probabilistic local broadcast transmission model is used to determine routing, and presents three distributed algorithms which compute an optimal routing policy, discuss their convergence properties, and demonstrate their performance through simulation.
Abstract: We investigate a network routing problem where a probabilistic local broadcast transmission model is used to determine routing. We discuss this model's key features, and note that the local broadcast transmission model can be viewed as soft handoff for an ad-hoc network. We present results showing that an index policy is optimal for the routing problem. We extend the network model to allow for control of transmission type, and prove that the index nature of the optimal routing policy remains unchanged. We present three distributed algorithms which compute an optimal routing policy, discuss their convergence properties, and demonstrate their performance through simulation.

84 citations

Journal ArticleDOI
TL;DR: The new power and cost localized schemes are conceptually simpler than existing schemes, and have similar or somewhat better performance in the authors' experiments, and are shown to be competitive with globalized shortest weighted path based schemes.
Abstract: In this article we propose several new progress based, localized, power, and cost aware algorithms for routing in ad hoc wireless networks. These algorithms attempt to minimize the total power and/or cost needed to route a message from source to destination. In localized algorithms, each node makes routing decisions solely on the basis of location of itself, its neighbors and destination. The new algorithms are based on the notion of proportional progress. A node currently holding the packet will forward it to a neighbor, closer to destination than itself, which minimizes the ratio of power and/or cost to reach that neighbor, and the progress made, measured as the reduction in distance to destination, or projection along the line to destination. First, we propose Power Progress, Iterative Power Progress, Projection Power Progress, and Iterative Projection Power Progress algorithms, where the proportional progress is defined in terms of power measure. The power metrics are then replaced by cost or power-co...

84 citations

Patent
01 Dec 2011
TL;DR: In this article, a dynamic context-based routing operation for a telecommunications signaling network is described. But the work is limited to the case where the information in the internal representation may be modified to send a subset or a superset of the information contained in the first message.
Abstract: Methods, servers and systems for performing dynamic context based routing operations in a telecommunications signaling network in which a dynamic context based router may receive a first message encoding signaling information from a source component, decode the message into an internal representation, perform application level routing operations using contextual information derived from the internal representation to identify a destination component, encode signaling information contained in the internal representation into a second message, and send the second message to the identified destination component. Application level routing operations using contextual information may include generating keys based on the internal representation, transmitting the generated keys to an external resource, receiving supplementary information in response to the generated keys, and using the supplementary information to identify the destination component. The information in the internal representation may be modified to send a subset or a superset of the information contained in the first message.

84 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