|
[1]C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, in Proceedings of Special Interest Group on Data Communication (SIGCOMM), Aug. 1994 [2]S. Murth and J.J. Garcia, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and Application Journal - Special Issue on Routing in Mobile Communication Networks, Vol. 1, No. 2, pp. 183-197, Oct, 1996 [3]G. Pei, M. Gerla and T. W. Chen, “Fisheye State Routing in Mobile Ad Hoc Networks,” in Proceedings of Workshop on Wireless Networks and Mobile Computing (WNMC), April 2000, pp 71-78 [4]C. E. Perkins and E. M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” in Proceedings of Workshop on Mobile Computing Systems & Applications (WMCSA), Feb. 1999, pp. 90-100 [5]J. Broch, D.B. Johnson and D. A. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” Internet Draft of the IETF MANET Working Group, Dec. 1998 [6]V. D. Park, J. P. Macker and M.S. Corson, “Applicability of the Temporally-Ordered Routing Algorithm for Use in Mobile Tactical Networks,” in Proceeding of IEEE Military Communications Conference (MILCOM), Oct. 1998, pp. 426-430 [7]S.Y. Ni, Y.C. Tseng, Y.S Chen, J.P Sheu, “The broadcast storm problem in a mobile ad hoc network,” Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, 1999, pp. 151 - 162 [8]M. R. Pearlman and Z. J. Haas, “Determining the Optimal Configuration for the Zone Routing Protocol,” IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8, pp. 1395-1414, Aug. 1999 [9]M. Joa and I. T. Lu, “A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks,” IEEE Journal on Selected Areas in Communications, vol. 17, No. 8, pp.1415-1425, Aug. 1999 [10]S. Guha and S. Khuller, “Approximation algorithms for connected domination sets,” Tech. Rep. 3660, Univ. of Maryland Inst. For Adv. Computer Studies-Dept. of Computer Sci., 1996 [11]Yuanzhu P. Chen, Arthur L. Liestman, and Jiangchuan Liu, “Clustering Algorithms for Ad Hoc Wireless Networks,” in Ad Hoc and Sensor Networks, 2004 [12]Wei Lou and Jie Wu, “Efficient Broadcast with Forward Node Set in Clustered Mobile Ad Hoc Networks,” Proceedings of the 11th International Conference on Computer Communications and Networks, Oct. 2002, pp.398-403 [13]T. C. Hou and T. J. Tsai, "Adaptive clustering in a Hierarchical Ad Hoc Network," in Proceedings of ICS Workshop on Computer Networks, Internet and Multimedia, Dec. 1998, pp.3149-3155 [14]C. C. Chiang and M. Gerla, "Routing and Multicast in Multihop, Mobile Wireless Network," in Proceedings of IEEE International Conference on Universal Personal Communications (ICUPC), Oct. 1997, pp. 546-551 [15]M. Chatterjee, S. K. Sas and D. Turgut, "An On-Demand Weighted Clustering Algorithm (WCA) for Ad Hoc Networks," in Proceedings of IEEE Gobeeom 2000, Nov. 2000, pp.1697-1701 [16]J. Wu and H. Li, “A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks,” Special Issue on Wireless Networks in Telecommunication Systems Journal, Vol3, pp. 63-84, 2001 [17]Bevan Das and Vaduvur Bharghavan, “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets,” in IEEE International Conference on Communications, 1997 [18]J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” Proc. of the 3rd Int''l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication, pp7-14, 1999
[19]H. Lim and C. Kim, “Multicast tree construction and flooding in wireless ad hoc networks,” in Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, Aug. 2000, pp. 61-68 [20]Royer, E.M. Chai-Keong Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” in Personal Communications, IEEE [see also IEEE Wireless Communications, Apr 1999, pp. 46-55 [21]Fei Dai, Jie Wu, “Performance analysis of broadcast protocols in ad hoc networks based on self-pruning,” in Parallel and Distributed Systems, IEEE Transactions on, Nov 2004, pp. 1027- 1040 [22]Marco A. Spohn and J. J. Garcia-Luna-Aceves, “Enhanced dominant pruning applied to the route discovery process of on-demand routing protocols,” in Proceedings of the 12th IEEE international conference on computer communications and networks, Oct 2003, pp.497–502 [23]Marco A. Spohn and J. J. Garcia-Luna-Aceves, “Enhancing broadcast operations in ad hoc networks with two-hop connected dominating sets,” in Proceedings of the IEEE international conference on mobile ad-hoc and sensor systems, Oct 2004, pp. 543–545 [24]Marco A. Spohn and J. J. Garcia-Luna-Aceves, “Enhancing the route discovery process of on-demand routing in networks with directional antennas,” in Lecture notes in computer science, Jan 2004, pp. 1000–1011 [25]Marco A. Spohn and J. J. Garcia-Luna-Aceves, “Improving broadcast operations in adhoc networks using two-hop connected dominating sets,” in Proceedings of the IEEE global telecommunications conference workshops, Nov 2004 , pp. 147–152 [26]Marco A. Spohn and J. J, "Garcia-Luna-Aceves, “Improving the efficiency and reliability of the route discovery process in on-demand routing protocols,” in Proceedings of the IEEE wireless communications and networking conference, March 2005, pp. 2008–2013
|