Titlebook: Wireless Algorithms, Systems, and Applications; 5th International Co Gopal Pandurangan,V. S. Anil Kumar,Yingshu Li Conference proceedings 2

鳴叫大步走

書目名稱Wireless Algorithms, Systems, and Applications影響因子(影響力)




書目名稱Wireless Algorithms, Systems, and Applications影響因子(影響力)學(xué)科排名




書目名稱Wireless Algorithms, Systems, and Applications網(wǎng)絡(luò)公開(kāi)度




書目名稱Wireless Algorithms, Systems, and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Wireless Algorithms, Systems, and Applications被引頻次




書目名稱Wireless Algorithms, Systems, and Applications被引頻次學(xué)科排名




書目名稱Wireless Algorithms, Systems, and Applications年度引用




書目名稱Wireless Algorithms, Systems, and Applications年度引用學(xué)科排名




書目名稱Wireless Algorithms, Systems, and Applications讀者反饋




書目名稱Wireless Algorithms, Systems, and Applications讀者反饋學(xué)科排名

滑動(dòng)

https://doi.org/10.1007/978-3-642-14654-1ad-hoc networks; algorithms; approximation; authentication; cluster computing; communication; compressed s

凝視

草率女

LINES

placebo

Spartan

Irremediable

Anterior

Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diametn particular, the CDS computed by the first algorithm has constant ratios 9 and 3 for its size and diameter, respectively. And that of the second algorithm has constant ratios 5?+?ln 10 and 2. Both theoretical analysis and simulation show out the performance of the algorithms.

ATP861

Minimum CDS in Multihop Wireless Networks with Disparate Communication Rangesent a greedy approximation algorithm for computing a Minimum CDS in multihop wireless networks with disparate communications ranges and prove that its approximation ratio is better than the best one known in the literature. Our analysis utilizes a tighter relation between the independence number and the connected domination number.