Topology-transparent schedules for energy limited ad hoc networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In an ad hoc network, each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication is effective only when the sender is transmitting, the destination is receiving, and no other nodes in proximity to the receiver are also transmitting. Our strategy makes no assumptions about knowledge of neighbours or of geographical position; it is topology-transparent. A general combinatorial model for topology-transparent scheduling that treats energy conservation is described. As in the two state (transmit and receive) case, the combinatorial requirements are met by a D cover-free family. Graph designs, where an arc from vertex x to y indicates an opportunity for x to transmit and y to receive, are proposed as a model for schedule construction. In order to achieve reasonable throughput while obtaining a dramatic reduction in energy consumption, we focus on Ka,a designs, where the number of nodes transmitting and receiving per slot is equal to a. Patterned on constructions for resolvable designs, we examine a computational search method to meet the required combinatorial conditions.

Original languageEnglish (US)
Title of host publicationProceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Pages85-90
Number of pages6
Volume2006
DOIs
StatePublished - 2006
Event4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 - Pisa, Italy
Duration: Mar 13 2006Mar 17 2006

Other

Other4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
CountryItaly
CityPisa
Period3/13/063/17/06

Fingerprint

Ad hoc networks
Topology
Energy conservation
Energy utilization
Scheduling
Throughput
Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Dukes, P. J., Colbourn, C., & Syrotiuk, V. (2006). Topology-transparent schedules for energy limited ad hoc networks. In Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 (Vol. 2006, pp. 85-90). [1598944] https://doi.org/10.1109/PERCOMW.2006.132

Topology-transparent schedules for energy limited ad hoc networks. / Dukes, Peter J.; Colbourn, Charles; Syrotiuk, Violet.

Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006. Vol. 2006 2006. p. 85-90 1598944.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dukes, PJ, Colbourn, C & Syrotiuk, V 2006, Topology-transparent schedules for energy limited ad hoc networks. in Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006. vol. 2006, 1598944, pp. 85-90, 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006, Pisa, Italy, 3/13/06. https://doi.org/10.1109/PERCOMW.2006.132
Dukes PJ, Colbourn C, Syrotiuk V. Topology-transparent schedules for energy limited ad hoc networks. In Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006. Vol. 2006. 2006. p. 85-90. 1598944 https://doi.org/10.1109/PERCOMW.2006.132
Dukes, Peter J. ; Colbourn, Charles ; Syrotiuk, Violet. / Topology-transparent schedules for energy limited ad hoc networks. Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006. Vol. 2006 2006. pp. 85-90
@inproceedings{002bc01860ff4c98a82def1fa1ed8c4a,
title = "Topology-transparent schedules for energy limited ad hoc networks",
abstract = "In an ad hoc network, each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication is effective only when the sender is transmitting, the destination is receiving, and no other nodes in proximity to the receiver are also transmitting. Our strategy makes no assumptions about knowledge of neighbours or of geographical position; it is topology-transparent. A general combinatorial model for topology-transparent scheduling that treats energy conservation is described. As in the two state (transmit and receive) case, the combinatorial requirements are met by a D cover-free family. Graph designs, where an arc from vertex x to y indicates an opportunity for x to transmit and y to receive, are proposed as a model for schedule construction. In order to achieve reasonable throughput while obtaining a dramatic reduction in energy consumption, we focus on Ka,a → designs, where the number of nodes transmitting and receiving per slot is equal to a. Patterned on constructions for resolvable designs, we examine a computational search method to meet the required combinatorial conditions.",
author = "Dukes, {Peter J.} and Charles Colbourn and Violet Syrotiuk",
year = "2006",
doi = "10.1109/PERCOMW.2006.132",
language = "English (US)",
isbn = "0769525202",
volume = "2006",
pages = "85--90",
booktitle = "Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006",

}

TY - GEN

T1 - Topology-transparent schedules for energy limited ad hoc networks

AU - Dukes, Peter J.

AU - Colbourn, Charles

AU - Syrotiuk, Violet

PY - 2006

Y1 - 2006

N2 - In an ad hoc network, each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication is effective only when the sender is transmitting, the destination is receiving, and no other nodes in proximity to the receiver are also transmitting. Our strategy makes no assumptions about knowledge of neighbours or of geographical position; it is topology-transparent. A general combinatorial model for topology-transparent scheduling that treats energy conservation is described. As in the two state (transmit and receive) case, the combinatorial requirements are met by a D cover-free family. Graph designs, where an arc from vertex x to y indicates an opportunity for x to transmit and y to receive, are proposed as a model for schedule construction. In order to achieve reasonable throughput while obtaining a dramatic reduction in energy consumption, we focus on Ka,a → designs, where the number of nodes transmitting and receiving per slot is equal to a. Patterned on constructions for resolvable designs, we examine a computational search method to meet the required combinatorial conditions.

AB - In an ad hoc network, each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication is effective only when the sender is transmitting, the destination is receiving, and no other nodes in proximity to the receiver are also transmitting. Our strategy makes no assumptions about knowledge of neighbours or of geographical position; it is topology-transparent. A general combinatorial model for topology-transparent scheduling that treats energy conservation is described. As in the two state (transmit and receive) case, the combinatorial requirements are met by a D cover-free family. Graph designs, where an arc from vertex x to y indicates an opportunity for x to transmit and y to receive, are proposed as a model for schedule construction. In order to achieve reasonable throughput while obtaining a dramatic reduction in energy consumption, we focus on Ka,a → designs, where the number of nodes transmitting and receiving per slot is equal to a. Patterned on constructions for resolvable designs, we examine a computational search method to meet the required combinatorial conditions.

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

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

U2 - 10.1109/PERCOMW.2006.132

DO - 10.1109/PERCOMW.2006.132

M3 - Conference contribution

AN - SCOPUS:33749598962

SN - 0769525202

SN - 9780769525204

VL - 2006

SP - 85

EP - 90

BT - Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006

ER -