Information-directed routing in ad hoc sensor networks
Authors:
- Feng ZhaoFZFeng Zhao
- D. PetrovicDPD. Petrovic
- 4 April 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 23 (4) , 851-861
Abstract
In a sensor network, data routing is tightly coupled to the needs of a sensing task, and hence the application semantics. This paper introduces the novel idea of information-directed routing, in which routing is formulated as a joint optimization of data transport and information aggregation. The routing objective is to minimize communication cost, while maximizing information gain, differing from routing considerations for more general ad hoc networks. The paper uses the concrete problem of locating and tracking possibly moving signal sources as an example of information generation process, and considers two common information extraction patterns in a sensor network: routing a user query from an arbitrary entry node to the vicinity of signal sources and back, or to a prespecified exit node, maximizing information accumulated along the path. We derive information constraints from realistic signal models, and present several routing algorithms that find near-optimal solutions for the joint optimization problem. Simulation results have demonstrated that information-directed routing is a significant improvement over a previously reported greedy algorithm, as measured by sensing quality such as localization and tracking accuracy and communication quality such as success rate in routing around sensor holes.Keywords
This publication has 14 references indexed in Scilit:
- Collaborative In-Network Processing for Target TrackingEURASIP Journal on Advances in Signal Processing, 2003
- Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor NetworksThe International Journal of High Performance Computing Applications, 2002
- Elements of Information Theory2001
- Directed diffusion2000
- Ad-hoc on-demand distance vector routing1999
- Geocasting in mobile ad hoc networks: location-based multicast algorithms1999
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computersACM SIGCOMM Computer Communication Review, 1994
- On-line steiner trees in the Euclidean planeDiscrete & Computational Geometry, 1993
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991
- Real-time heuristic searchArtificial Intelligence, 1990