Routing in Wireless Ad Hoc and Sensor Networks

View Sample PDF

Author(s): Milos Stojmenovic (University of Ottawa, Canada)
Copyright: 2011
Pages: 15
Source title: Handbook of Research on Mobility and Computing: Evolving Technologies and Ubiquitous Impacts
Source Author(s)/Editor(s): Maria Manuela Cruz-Cunha (Polytechnic Institute of Cavado and Ave, Portugal)and Fernando Moreira (Portucalense University, Portugal)
DOI: 10.4018/978-1-60960-042-6.ch002

Keywords: Information Science Reference / Media & Communications / Mobile and Wireless Computing / Multimedia Technology

Purchase

View Routing in Wireless Ad Hoc and Sensor Networks on the publisher's website for pricing and purchasing information.

Abstract

Routing is the process of finding a path from a source node to a destination node. Since each node has a limited transmission range, the message is normally forwarded by other nodes in an ad hoc or sensor network. Therefore routes normally consist of several hops. Proposed routing schemes can be divided into topological and position based, depending on the availability of geographic location for nodes. Topological routing may be proactive or reactive. Position based routing consists of greedy approaches applied when a neighbor closer to the destination (than the node currently holding the packet) exists, and recovery schemes otherwise. In order to preserve bandwidth and power which are critical resources in ad hoc and sensor networks, localized approaches are proposed, where each node acts based solely on the location of itself, its neighbors, and the destination. There are various measures of optimality which lead to various schemes which optimize hop count, power, network lifetime, delay, or other metrics. A uniform solution based on ratio of cost and progress is described here

The IRMA Community

Research IRM

Routing in Wireless Ad Hoc and Sensor Networks

Purchase

Abstract

Related Content

IRMA Sponsors