參考文獻 |
[1] Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu, “The Broadcast
Storm Problem in a Mobile Ad Hoc Network,” in Proceedings of the fifth annual
ACM/IEEE international conference on Mobile computing and networking, August
1999, pp. 151—162.
[2] A. Sen and J.M. Capone, “Scheduling In Packet Radio Networks - A New Approach,”
in Proceedings of Global Telecommunications Conference, 1999, pp. 650—654.
[3] Imrich Chlamtac and Shay Kutten, “Tree-based broadcasting in multihop radio net-works,”
IEEE Transaction on Computers, pp. 1209—1225, October 1987.
[4] Wei Peng and Xi-Cheng Lu, “On the reduction of broadcast redundancy in mobile ad
hoc networks,” in Proceedings of Mobile and Ad Hoc Networking and Computing,
2000, pp. 129—130.
[5] Rajiv Ramaswami and Keshab K. Parhi, “Distributed scheduling of broadcasts in a
radio network,” in INFOCOM, 1989, vol. 2, pp. 497—504.
[6] Stefano Basagni, Danilo Bruschi, and Imrich Chlamtac, “A mobility-transparent de-terministic
broadcast mechanism for ad hoc networks,” IEEE/ACM Transactions on
Networking, vol. 7, pp. 799—807, December 1999.
[7] Chungki Lee, James E. Burns, and Mostafa H. Ammar, “Improved randomized broad-cast
protocols in multi-hop radio netwroks,” in Proceedings of International Confer-ence
on Network Protocols, October 1993, pp. 234—241.
[8] Mark L. Huson and Arunabha Sen, “Broadcast scheduling algorithms for radio net-works,”
in IEEE Military Communications Conference, July 1995, pp. 647—651.
[9] S. Ramanathan and E.L. Lloyd, “Scheduling algorithms for multihop radio networks,”
IEEE/ACM Transactions on Networking, vol. 1, pp. 166 —177, April 1993.
[10] I. Chlamtac and A. Farago, “Making transmission schedules immune to topology
changes in multi-hop packet radio networks,” IEEE/ACM Transactions on Network-ing,
vol. 2, pp. 23 —29, February 1994.
[11] Ji-Her Ju and V.O.K. Li, “An optimal topology-transparent scheduling method in
multihop packet radio networks,” IEEE/ACM Transactions on Networking, vol. 6, pp.
298 —306, June 1998.
[12] B. Hajek and G. Sasaki, “Link scheduling in polynomial time,” IEEE Transactions
on Information Theory, vol. 34, pp. 910 —917, September 1988.
[13] L. Tassiulas and A. Ephremides, “Jointly optimal routing and scheduling in packet
ratio networks,” IEEE Transactions on Information Theory, vol. 8, pp. 165 —168,
January 1992.
[14] A. Ephremides and T.V. Truong, “Scheduling broadcasts in multihop radio networks,”
IEEE Transactions on Communications, vol. 38, pp. 456 —460, April 1990.
[15] A. Sen and M.L. Huson, “A new model for scheduling packet radio networks,” in
Proceedings of Fifteenth Annual Joint Conference of the IEEE Computer Societies,
1996, vol. 3, pp. 1116 —1124.
[16] J. Sucec and I. Marsic, “An efficient distributed network-wide broadcast algorithm
for mobile ad hoc networks,” http:// citeseer.nj.nec.com/312658.html.
[17] Thomas H. Cormen and Charles E. Leisersion abd Ronald L. Rivest, Introduction To
Algorithms, The MIT Press and McGraw-Hill Book Company, 1 edition, 1990. |