1 K-clustering in Wireless Ad Hoc Networks Fernandess and Malkhi Hebrew University of Jerusalem Presented by: Ashish Deopura.
Algorithms for Ad Hoc Networks Roger Wattenhofer MedHocNet 2005 alg hoc net 2005.
Ad Hoc and Sensor Networks – Roger Wattenhofer –10/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Clustering Chapter 10 TexPoint fonts used in EMF.
Connected Dominating Sets. Motivation for Constructing CDS.
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL.
Efficient Backbone Construction Methods in MANETs Using Directional Antennas 1 Shuhui Yang, 1 Jie Wu, 2 Fei Dai 1 Department of Computer Science and Engineering.
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks
Connected Dominating Sets in Wireless Networks My T. Thai Dept of Comp & Info Sci & Engineering University of Florida June 20, 2006.
K-clustering in Wireless Ad Hoc Networks
