WLC07-6: Distributed Mobility Transparent Broadcast in Mobile Ad Hoc Networks
暂无分享,去创建一个
[1] D. Manjunath,et al. Gossiping in multihop radio networks , 1999, 1999 IEEE International Conference on Personal Wireless Communications (Cat. No.99TH8366).
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Joseph Y. Halpern,et al. Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[4] Jie Wu,et al. Mobility management and its applications in efficient broadcasting in mobile ad hoc networks , 2004, IEEE INFOCOM 2004.
[5] Arindam Kumar Das,et al. Minimum power broadcast trees for wireless networks: integer programming formulations , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[6] Tracy Camp,et al. A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..
[7] Yu-Chee Tseng,et al. The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.
[8] Kui Wu,et al. Reliable, distributed and energy-efficient broadcasting in multi-hop mobile ad hoc networks , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..
[9] Xiang-Yang Li,et al. Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[10] Arjan Durresi,et al. Optimal Flooding Protocol for Routing in Ad- hoc Networks , 2002 .
[11] Daejoong Kim. A Comparison of Flooding and Random Routing in Mobile Ad Hoc Networks , 2003 .
[12] Peng-Jun Wan,et al. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.