新科学想法 文献管理 浏览文献

有附件Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

Rainbow 添加于 2010-5-21 15:43 | 1735 次阅读 | 0 个评论
  •  作 者

    Wu J, Cardei M, Dai F, Yang S
  •  摘 要

    We propose a notion of extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks whereby transmitting independent copies of a packet generates diversity and combats the effects of fading. We first show the NP-completeness of the minimum extended dominating set problem. Then, several heuristic algorithms, global and local, for constructing a small extended dominating set are proposed. These are non-trivial extensions of the existing algorithms for the regular dominating set problem. The application of the extended dominating set in efficient broadcasting is also discussed. The performance analysis includes an analytical study in terms of approximation ratio and a simulation study of the average size of the extended dominating set derived from the proposed algorithms.
  •  详细资料

    • 期卷页: 2005
  • 相关链接  URL 

  •  附 件

    PDF附件Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication 
管理选项: 导出文献

评论(0 人)

facelist doodle 涂鸦板

Copyright;  © 新科学想法 2016-2017   浙公网安备 33010202000686号   ( 浙ICP备09035230号-1 )