Sciweavers

331 search results - page 20 / 67
» Approximation Algorithms for Connected Dominating Sets
Sort
View
ACMSE
2007
ACM
15 years 3 months ago
Minimizing broadcast latency in ad hoc wireless networks
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
Shankar M. Banik, Sridhar Radhakrishnan
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 9 months ago
Load Aware Broadcast in Mobile Ad Hoc Networks
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
Md. Tanvir Al Amin, Sukarna Barua, Sudip Vhaduri, ...
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
14 years 10 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
ADHOC
2010
126views more  ADHOC 2010»
14 years 12 months ago
Stable energy-aware topology management in ad hoc networks
Abstract-- The efficiency of a communication network depends not only on its control protocols, but also on the underlying network topology. We propose a distributed topology manag...
Lichun Bao, J. J. Garcia-Luna-Aceves
74
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...