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影响因子(影响力)学科排名




书目名称Wireless Algorithms, Systems, and Applications网络公开度




书目名称Wireless Algorithms, Systems, and Applications网络公开度学科排名




书目名称Wireless Algorithms, Systems, and Applications被引频次




书目名称Wireless Algorithms, Systems, and Applications被引频次学科排名




书目名称Wireless Algorithms, Systems, and Applications年度引用




书目名称Wireless Algorithms, Systems, and Applications年度引用学科排名




书目名称Wireless Algorithms, Systems, and Applications读者反馈




书目名称Wireless Algorithms, Systems, and Applications读者反馈学科排名

滑动

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.