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
T3 - Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
SP - 6
EP - 11
BT - Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
PB - IEEE Computer Society
T2 - 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Y2 - 13 March 2006 through 17 March 2006
ER -