Wireless Internet White Papers
Power-Conserving Routing of Ad Hoc Mobile Wireless Networks Based on Entropy-Constrained Algorithms
Overview This paper presents an approach to power-conserving routing of ad hoc mobile wireless networks. This approach relies on entropy-constrained routing algorithms, which were developed by utilizing the information-theoretic concept of the entropy to gradually reduce the uncertainty associated with route discovery through a deterministic annealing process. Entropy-constrained routing algorithms were tested using a single performance metric related to the distance between the nodes and to the power consumption associated with packet transmission. This paper also expands the versatility of entropy-constrained routing algorithms by making them capable of discovering routes based on multiple performance metrics. In this study, the second performance metric employed for route discovery relied on the power availability in the nodes of the network.
| Publisher | Reed Elsevier | File Format | |
|---|---|---|---|
| Date Published | May 2004 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 4 out of 9 users found this white paper useful
White Paper RSS
Download
Register
