Speaker: Matt Coolbeth
Day:  Wednesday, 10/17/2007
Room: ITEB 336
Time: 2:00-3:00pm

Title: Dominating and Absorbent Sets for Wireless Ad-hoc Networks with
Different Transmission Ranges

Abstract:
 Much research has had its focus on efficient means of peer to peer
communication in wireless, ad-hoc networks.  These studies have frequently
used a unit disk graph model for wireless networks, and produced methods of
finding "connected dominating sets," which can be used  as communication
backbones to convey messages between nodes in wireless networks.  A unit
disk graph model for a network, however, operates under the assumption that
all nodes have the same transmission range, and, in scenarios where a
network contains nodes with various transmission powers, the same
procedures cannot produce a set of nodes that will perform effectively as a
communication backbone. 
  In networks as modeled by variable range disk graphs, this role can be
filled by a "strongly connected dominating and absorbent set."  I will
discuss procedures for finding just such a set, developed by Myung Ah Park,
James Willson, Chen Wang, My T. Tai, Weili Wu, and Andras Farago, and
presented in their recent paper. 

Reference:

A Dominating and Absorbent Set in a Wireless Ad-hoc Network with Different
Transmission Ranges 
Myung Ah Park (The University of Texas at Dallas) 
James Willson (The University of Texas at Dallas)
Chen Wang (Tsinghua University)
My Thai (University of Florida)
Weili Wu (The University of Texas at Dallas)
Andras Farago (The University of Texas at Dallas)