On calculating power aware connected dominating setsfor efficient routing in ad hoc wireless networks
Algorithmic Foundations of Ad-hoc Networks Andrea W. Richa, Arizona State U. Rajmohan Rajaraman, Northeastern U. ETH Zurich, Summer Tutorial 2004 Andrea.
1 Island Network Analysis MSTs and Dominating sets By Aaron Desrochers.
Presented by : Joseph Gunawan. To get the optimal transmission radius for broadcasting using the energy as minimal as possible while it still guarantees.
Uniform distribution for a class of k-paradoxical oriented graphs Joint work with undergraduate students J. C. Schroeder and D. J. Pleshinger (Ohio Northern.
Distributed algorithm for efficient construction and maintenance of connected k-hop dominating sets in mobile ad hoc networks 1.
Uniform distribution for a class of k-paradoxical oriented graphs
Virtual Backbone
Networkx Reference
Tiny Networking
