Directed complete bipartite graph decompositions: Indirect constructions

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Edge-decompositions of the complete λ-fold directed graph over(K, ⇒)n into (uniform) directed complete bipartite subgraphs over(K, ⇒)a, b form a model for wireless communication in sensor networks. Each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication requires that the sender be transmitting, the destination listening, and no other node near the receiver transmitting. We represent nodes of the network as the vertices of over(K, ⇒)n, and time slots for communication as blocks of the graph decomposition. A block with out-vertices A and in-vertices B corresponds to a slot in which the nodes in A are transmitting, those in B are receiving, and all others are asleep. Thus, such a decomposition of λ over(K, ⇒)n guarantees that every ordered pair of nodes in the associated network can communicate in λ time slots. Additional constraints are needed to minimize interference by a third node. Some recursive constructions for these graph decompositions are established, with particular emphasis on properties minimizing interference.

Original languageEnglish (US)
Pages (from-to)367-374
Number of pages8
JournalDiscrete Mathematics
Volume308
Issue number2-3
DOIs
StatePublished - Feb 6 2008

Fingerprint

Graph Decomposition
Complete Bipartite Graph
Decomposition
Vertex of a graph
Communication
Directed graphs
Interference
Sensor networks
Decompose
Ordered pair
Wireless Communication
Directed Graph
Sensor Networks
Subgraph
Fold
Receiver
Minimise

Keywords

  • Coverings
  • Graph decompositions
  • Graph designs
  • Packings

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Directed complete bipartite graph decompositions : Indirect constructions. / Dukes, Peter J.; Colbourn, Charles; Syrotiuk, Violet.

In: Discrete Mathematics, Vol. 308, No. 2-3, 06.02.2008, p. 367-374.

Research output: Contribution to journalArticle

@article{a1070842a4fe41689a60d4eea59ea41f,
title = "Directed complete bipartite graph decompositions: Indirect constructions",
abstract = "Edge-decompositions of the complete λ-fold directed graph over(K, ⇒)n into (uniform) directed complete bipartite subgraphs over(K, ⇒)a, b form a model for wireless communication in sensor networks. Each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication requires that the sender be transmitting, the destination listening, and no other node near the receiver transmitting. We represent nodes of the network as the vertices of over(K, ⇒)n, and time slots for communication as blocks of the graph decomposition. A block with out-vertices A and in-vertices B corresponds to a slot in which the nodes in A are transmitting, those in B are receiving, and all others are asleep. Thus, such a decomposition of λ over(K, ⇒)n guarantees that every ordered pair of nodes in the associated network can communicate in λ time slots. Additional constraints are needed to minimize interference by a third node. Some recursive constructions for these graph decompositions are established, with particular emphasis on properties minimizing interference.",
keywords = "Coverings, Graph decompositions, Graph designs, Packings",
author = "Dukes, {Peter J.} and Charles Colbourn and Violet Syrotiuk",
year = "2008",
month = "2",
day = "6",
doi = "10.1016/j.disc.2006.11.050",
language = "English (US)",
volume = "308",
pages = "367--374",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2-3",

}

TY - JOUR

T1 - Directed complete bipartite graph decompositions

T2 - Indirect constructions

AU - Dukes, Peter J.

AU - Colbourn, Charles

AU - Syrotiuk, Violet

PY - 2008/2/6

Y1 - 2008/2/6

N2 - Edge-decompositions of the complete λ-fold directed graph over(K, ⇒)n into (uniform) directed complete bipartite subgraphs over(K, ⇒)a, b form a model for wireless communication in sensor networks. Each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication requires that the sender be transmitting, the destination listening, and no other node near the receiver transmitting. We represent nodes of the network as the vertices of over(K, ⇒)n, and time slots for communication as blocks of the graph decomposition. A block with out-vertices A and in-vertices B corresponds to a slot in which the nodes in A are transmitting, those in B are receiving, and all others are asleep. Thus, such a decomposition of λ over(K, ⇒)n guarantees that every ordered pair of nodes in the associated network can communicate in λ time slots. Additional constraints are needed to minimize interference by a third node. Some recursive constructions for these graph decompositions are established, with particular emphasis on properties minimizing interference.

AB - Edge-decompositions of the complete λ-fold directed graph over(K, ⇒)n into (uniform) directed complete bipartite subgraphs over(K, ⇒)a, b form a model for wireless communication in sensor networks. Each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication requires that the sender be transmitting, the destination listening, and no other node near the receiver transmitting. We represent nodes of the network as the vertices of over(K, ⇒)n, and time slots for communication as blocks of the graph decomposition. A block with out-vertices A and in-vertices B corresponds to a slot in which the nodes in A are transmitting, those in B are receiving, and all others are asleep. Thus, such a decomposition of λ over(K, ⇒)n guarantees that every ordered pair of nodes in the associated network can communicate in λ time slots. Additional constraints are needed to minimize interference by a third node. Some recursive constructions for these graph decompositions are established, with particular emphasis on properties minimizing interference.

KW - Coverings

KW - Graph decompositions

KW - Graph designs

KW - Packings

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

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

U2 - 10.1016/j.disc.2006.11.050

DO - 10.1016/j.disc.2006.11.050

M3 - Article

AN - SCOPUS:36248970733

VL - 308

SP - 367

EP - 374

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2-3

ER -