Energy efficient online routing in wireless ad hoc networks

Hanan Shpungin

doi:10.1109/SAHCN.2011.5984949

Energy efficient online routing in wireless ad hoc networks

Hanan Shpungin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Abstract

In this paper we study the minimum total energy and maximum network lifetime routing problem in wireless ad hoc networks. We develop competitive online schemes for an infinite sequence of random routing requests with provable approximation factors in both measures. In addition, we produce fundamental bounds on the expected total energy consumption and network lifetime in the optimal offline solution. Our results are verified through simulations. In the course of our analysis we derive an interesting property of shortest path trees (SPT) for a random point process. We show that the maximum edge length of any SPT is asymptotically equal to the maximum edge length of a minimum spanning tree. This result is of self interest for the study of energy efficient routing as many heuristics rely on SPTs.

Original language	English
Title of host publication	2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011
Pages	64-72
Number of pages	9
DOIs	https://doi.org/10.1109/SAHCN.2011.5984949
State	Published - 20 Sep 2011
Externally published	Yes
Event	2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 - Salt Lake City, UT, United States Duration: 27 Jun 2011 → 30 Jun 2011

Publication series

Name	2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011

Conference

Conference	2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011
Country/Territory	United States
City	Salt Lake City, UT
Period	27/06/11 → 30/06/11

ASJC Scopus subject areas

Computer Networks and Communications
Communication

Access to Document

10.1109/SAHCN.2011.5984949

Cite this

Shpungin, H. (2011). Energy efficient online routing in wireless ad hoc networks. In 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 (pp. 64-72). Article 5984949 (2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011). https://doi.org/10.1109/SAHCN.2011.5984949

@inproceedings{91bdd7af56564259983b11ef7e10294c,

title = "Energy efficient online routing in wireless ad hoc networks",

abstract = "In this paper we study the minimum total energy and maximum network lifetime routing problem in wireless ad hoc networks. We develop competitive online schemes for an infinite sequence of random routing requests with provable approximation factors in both measures. In addition, we produce fundamental bounds on the expected total energy consumption and network lifetime in the optimal offline solution. Our results are verified through simulations. In the course of our analysis we derive an interesting property of shortest path trees (SPT) for a random point process. We show that the maximum edge length of any SPT is asymptotically equal to the maximum edge length of a minimum spanning tree. This result is of self interest for the study of energy efficient routing as many heuristics rely on SPTs.",

author = "Hanan Shpungin",

year = "2011",

month = sep,

day = "20",

doi = "10.1109/SAHCN.2011.5984949",

language = "English",

isbn = "9781457700934",

series = "2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011",

pages = "64--72",

booktitle = "2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011",

note = "2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 ; Conference date: 27-06-2011 Through 30-06-2011",

}

Shpungin, H 2011, Energy efficient online routing in wireless ad hoc networks. in 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011., 5984949, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011, pp. 64-72, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011, Salt Lake City, UT, United States, 27/06/11. https://doi.org/10.1109/SAHCN.2011.5984949

Energy efficient online routing in wireless ad hoc networks. / Shpungin, Hanan.
2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011. 2011. p. 64-72 5984949 (2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Energy efficient online routing in wireless ad hoc networks

AU - Shpungin, Hanan

PY - 2011/9/20

Y1 - 2011/9/20

N2 - In this paper we study the minimum total energy and maximum network lifetime routing problem in wireless ad hoc networks. We develop competitive online schemes for an infinite sequence of random routing requests with provable approximation factors in both measures. In addition, we produce fundamental bounds on the expected total energy consumption and network lifetime in the optimal offline solution. Our results are verified through simulations. In the course of our analysis we derive an interesting property of shortest path trees (SPT) for a random point process. We show that the maximum edge length of any SPT is asymptotically equal to the maximum edge length of a minimum spanning tree. This result is of self interest for the study of energy efficient routing as many heuristics rely on SPTs.

AB - In this paper we study the minimum total energy and maximum network lifetime routing problem in wireless ad hoc networks. We develop competitive online schemes for an infinite sequence of random routing requests with provable approximation factors in both measures. In addition, we produce fundamental bounds on the expected total energy consumption and network lifetime in the optimal offline solution. Our results are verified through simulations. In the course of our analysis we derive an interesting property of shortest path trees (SPT) for a random point process. We show that the maximum edge length of any SPT is asymptotically equal to the maximum edge length of a minimum spanning tree. This result is of self interest for the study of energy efficient routing as many heuristics rely on SPTs.

UR - http://www.scopus.com/inward/record.url?scp=80052820810&partnerID=8YFLogxK

U2 - 10.1109/SAHCN.2011.5984949

DO - 10.1109/SAHCN.2011.5984949

M3 - Conference contribution

AN - SCOPUS:80052820810

SN - 9781457700934

T3 - 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011

SP - 64

EP - 72

BT - 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011

T2 - 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011

Y2 - 27 June 2011 through 30 June 2011

ER -

Shpungin H. Energy efficient online routing in wireless ad hoc networks. In 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011. 2011. p. 64-72. 5984949. (2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011). doi: 10.1109/SAHCN.2011.5984949

Energy efficient online routing in wireless ad hoc networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this