1 K-clustering in Wireless Ad Hoc Networks Fernandess and Malkhi Hebrew University of Jerusalem Presented by: Ashish Deopura.
1 Increasing the Performance of MANETs Throughput and QoS Performance Enhancing Mechanisms for Unicast and Group Communication in Proactive Mobile Ad Hoc.
Topic: Routing and Aggregation An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks (Li,Peng,Chu-
1 OSPF and MANET WG meetings, IETF64 OSPF MANET Design Team outbrief November, 2005 Tom Henderson {[email protected]} Design team members:
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks ACM Wireless Networks Journal, 2002 BENJIE CHEN,
Algorithms for Ad Hoc Networks Roger Wattenhofer MedHocNet 2005 alg hoc net 2005.
1 A Distributed and Efficient Flooding Scheme Using 1- Hop Information in Mobile Ad Hoc Networks Department of Computer Science and Information Engineering.
Ad Hoc and Sensor Networks – Roger Wattenhofer –10/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Clustering Chapter 10 TexPoint fonts used in EMF.
1 On Multiple Point Coverage in Wireless Sensor Networks Shuhui Yangy, Fei Daiz, Mihaela Cardeiy, and Jie Wuy Department of Computer Science and Engineering.
1 The Geodesic Broadcast Scheme for Wireless Ad Hoc Networks Dimitrios Katsaros, Ph.D. Yannis Manolopoulos, prof. @ Dept. Informatics Aristotle University,
Presented by : Joseph Gunawan. To get the optimal transmission radius for broadcasting using the energy as minimal as possible while it still guarantees.
+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.