Routing in ad-hoc networks using minimum connected dominating sets

IEEE International Conference on Communications

Volumn 1, Issue , 1997, Pages 376-380

  Das, Bevan ^a   Bharghavan, Vaduvur ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS;

MINIMUM CONNECTED DOMINATING SETS (MCDS);

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0030689578     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)