Geographic routing

About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.

Traffic-aware routing in wireless networks

Abstract: The routing of traffic in wireless networks is performed in accordance with a routing metric. The routing metric can reflect the effects of future self-traffic of a forthcoming communication flow. In a described implementation, a routing decision is made for a forthcoming communication flow that is to propagate over multiple nodes of a multi-hop wireless network. The routing decision is based on at least one predicted effect on the wireless network from self-traffic of the forthcoming communication flow.

Direction order priority routing of packets between nodes in a networked system

Abstract: A method of routing messages within an n-dimensional network topology. Two directions are associated with each dimension in the n-dimensional network, for a total of 2n directions. A direction order is assigned which prioritizes the order in which a packet is routed across the 2n possible directions. Such an approach provides deadlock-free, fault tolerant wormhole routing in networks without wrap-around channels. For networks with wrap-around channels, the above method of wormhole routing is enhanced by placing a first direction from each of the n dimensions within a first group of directions. The second direction from each dimension is placed within a second group of directions. A packet to be routed from a source node to a destination node is routed in all relevant directions in the first group of directions in any order before being routed in the second group of directions. If, while traveling in a direction within the first group of directions, the packet is routed across a wrap-around channel, all further routing in that direction must be completed before moving in another direction. Routing then proceeds, if necessary, in the other directions of that first group of directions. Likewise, if, while traveling in a direction within the second group of directions, the packet is routed across a wrap-around channel, all further routing in that direction must be completed before moving in another of the second group of directions. A free hop mechanism is also taught for increase flexibility.

Impact of sensing coverage on greedy geographic routing algorithms

Abstract: Greedy geographic routing is an attractive localized routing scheme for wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may fail due to routing voids on random network topologies. We study greedy geographic routing in an important class of wireless sensor networks (e.g., surveillance or object tracking systems) that provide sensing coverage over a geographic area. Our analysis and simulation results demonstrate that an existing geographic routing algorithm, greedy forwarding (GF), can successfully find short routing paths based on local states in sensing-covered networks. In particular, we derive theoretical upper bounds on the network dilation of sensing-covered networks under GF. We also propose a new greedy geographic routing algorithm called Bounded Voronoi Greedy Forwarding (BVGF) that achieves path dilation lower than 4.62 in sensing-covered networks as long as the communication range is at least twice the sensing range. Furthermore, we extend GF and BVGF to achieve provable performance bounds in terms of total number of transmissions and reliability in lossy networks.

Errata to “Multicast Routing and Distance-Adaptive Spectrum Allocation in Elastic Optical Networks With Shared Protection”

Abstract: We consider an elastic all-optical network, where each node is multicast-capable and does not support spectrum conversion. In such a network, for a given set of static multicast demands, we consider distance-adaptive spectrum resource allocation, and aim to optimize multicast routing, modulation, and spectrum assignment with shared protection in a way that minimizes the required spectrum resources for accommodating all multicast sessions. In our design, we provision each multicast demand by a light-tree where spectrum resources are allocated in all links included in the tree. We protect each light-tree from any single link failure in both directions by having a backup path that is link-disjoint to the path from the source to each destination on the primary tree. We reserve spectrum resources in the links that are not in the primary tree but in the backup paths between all source-destination pairs. The reserved spectrum resources can be shared to protect multiple light-trees as long as they do not fail simultaneously. For such a problem, we provide a mixed integer linear programming formulation. We also develop a scalable heuristic algorithm with an attribute that enables it to improve the quality of the results at the cost of longer running times. Numerical results for small problems show that the heuristic algorithm performs close to the optimum. In addition, we use a Markov chain simulation of the network to evaluate the performance of our proposed algorithm in terms of blocking probability in a dynamic environment, which demonstrates a significant improvement over straightforward approaches.

Separable routing: a scheme for state-dependent routing of circuit switched telephone traffic

Abstract: Separable routing is the first of a number of routing schemes for circuit switched telephone traffic invented at Bellcore. These routing schemes are state dependent, in the sense that, for each call attempt, a routing decision is made on the basis of the state of the network (defined in terms of the numbers of busy and idle trunks in the various trunk groups at the moment of the call attempt). In this paper, we describe separable routing and its mathematical background. Simulation results we have presented elsewhere show that the family of state-dependent routing schemes, of which separable routing is a member, is very attractive in terms of blocking rate, built-in network management features, and behavior in the presence of traffic forecast error.