Topology-transparent schedules for energy limited ad hoc networks

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

4 Scopus citations

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
DOIs
StatePublished - Oct 31 2006
Event4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006 - Pisa, Italy
Duration: Mar 13 2006Mar 17 2006

Publication series

NameProceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Volume2006

Other

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

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Topology-transparent schedules for energy limited ad hoc networks'. Together they form a unique fingerprint.

  • 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 (pp. 85-90). [1598944] (Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006; Vol. 2006). https://doi.org/10.1109/PERCOMW.2006.132