An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks
暂无分享,去创建一个
[1] Michael Q. Rieck,et al. Distributed Routing Algorithms for Wireless Ad Hoc Networks using d-Hop Connected d-hop Dominating Sets , 2002 .
[2] Jie Wu,et al. A generic distributed broadcast scheme in ad hoc wireless networks , 2004, IEEE Transactions on Computers.
[3] Chong-Kwon Kim,et al. Flooding in wireless ad hoc networks , 2001, Comput. Commun..
[4] Jie Wu,et al. Performance analysis of broadcast protocols in ad hoc networks based on self-pruning , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).
[5] Mahtab Seddigh,et al. Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..
[6] Yu-Chee Tseng,et al. The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.
[7] Elena Pagani,et al. Providing reliable and fault tolerant broadcast delivery in mobile ad‐hoc networks , 1999, Mob. Networks Appl..
[8] Jie Wu,et al. On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks , 2002, IEEE Trans. Mob. Comput..
[9] Robert Tappan Morris,et al. Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.