Minimum-Energy Mobile Wireless Networks Revisited
| dc.creator | Li, Erran L. | |
| dc.creator | Halpern, Joseph Y. | |
| dc.date | 2002-09-05 | |
| dc.date.accessioned | 2026-07-07T03:18:52Z | |
| dc.date.available | 2026-07-07T03:18:52Z | |
| dc.description | We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair $(u,v)$ of nodes connected in the original network, there is a minimum-energy path between $u$ and $v$ in the subnetwork (where a minimum-energy path is one that allows messages to be transmitted with a minimum use of energy). The network computed by our protocol is in general a subnetwork of the one computed by the protocol given in [13]. Moreover, our protocol is computationally simpler. We demonstrate the performance improvements obtained by using the subnetwork computed by our protocol through simulation. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0209013 | |
| dc.identifier | http://arxiv.org/abs/cs/0209013 | |
| dc.identifier | IEEE ICC, 2001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31290 | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | C.2.1 | |
| dc.title | Minimum-Energy Mobile Wireless Networks Revisited | |
| dc.type | text |