Geographic routing

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

An optimal data propagation algorithm for maximizing the lifespan of sensor networks

Abstract: We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing the energy among individual sensors and maximizing the message flow in the network are equivalent. We propose a distributed and adaptive data propagation algorithm for balancing the energy among sensors in the network. The mixed routing algorithm we propose allows each sensor node to either send a message to one of its immediate neighbors, or to send it directly to the base station, the decision being based on a potential function depending on its remaining energy. By considering a simple model of the network and using a linear programming description of the message flow, we prove the strong result that an energy-balanced mixed strategy beats every other possible routing strategy in terms of lifespan maximization. Moreover, we provide sufficient conditions for ensuring the dynamic stability of the algorithm. The algorithm is inspired by the gradient-based routing scheme but by allowing to send messages directly to the base station we improve considerably the lifespan of the network. As a matter of fact, we show experimentally that our algorithm is close to optimal and that it even beats the best centralized multi-hop routing strategy.

A power-efficient all-optical on-chip interconnect using wavelength-based oblivious routing

Abstract: We present an all-optical approach to constructing data networks on chip that combines the following key features: (1) Wavelength-based routing, where the route followed by a packet depends solely on the wavelength of its carrier signal, and not on information either contained in the packet or traveling along with it. (2) Oblivious routing, by which the wavelength (and thus the route) employed to connect a source-destination pair is invariant for that pair, and does not depend on ongoing transmissions by other nodes, thereby simplifying design and operation. And (3) passive optical wavelength routers, whose routing pattern is set at design time, which allows for area and power optimizations not generally available to solutions that use dynamic routing. Compared to prior proposals, our evaluation shows that our solution is significantly more power efficient at a similar level of performance.

Data center without structural bottlenecks

Abstract: A method of networking a plurality of servers together within a data center is disclosed. The method includes the step of addressing a data packet for delivery to a destination server by providing the destination server address as a flat address. The method further includes the steps of obtaining routing information required to route the packet to the destination server. This routing information may be obtained from a directory service servicing the plurality of servers. Once the routing information is obtained, the data packet may be routed to the destination server according to the flat address of the destination server and routing information obtained from the directory service.

Performance Study of Node-Disjoint Multipath Routing in Vehicular Ad Hoc Networks

Abstract: Many multipath routing schemes have recently been proposed to improve the performance of wireless networks. Multipath routing is supposed to reduce the end-to-end packet delay and increase the packet delivery ratio. Therefore, it can also improve the packet delivery ratio in vehicular ad hoc networks (VANETs) when the mobility of relaying vehicles is unknown. However, in wireless networks, multiple paths are exposed to mutual interference or path coupling, which impairs efficiency. The intriguing question is whether the node-disjoint multipath routing really helps. In this paper, we examine the performance of node-disjoint multipath routing in VANETs. Through extensive simulations, we explore the effect of mutual interference on the behavior of node-disjoint paths. It is shown that whether node-disjoint paths are able to improve performance, compared with the single path, is determined by path coupling and the source-destination distance. Results show that node-disjoint multipath routing can be applied to VANETs to substantially improve performance in terms of delay and packet delivery probability only if the node-disjoint paths are properly chosen.