论文信息 - Extensions in Mobile Ad Hoc Routing Using Variable Precision Rough Sets

Extensions in Mobile Ad Hoc Routing Using Variable Precision Rough Sets

Mobile ad hoc networks are formed dynamically without any infrastructure and each node in the network is responsible for routing information. Rough set theory is a mathematical tool to deal with vagueness and uncertainty. Variable precision rough sets (VPRS) is a generalization of rough sets that allows for a controlled degree of misclassification. This paper proposes extensions in mobile ad hoc routing using VPRS. The performance of the proposed mobile ad hoc routing protocol is compared with that of an existing routing protocol.

[1] Charles E. Perkins,et al. Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[2] Kevin R. Fall,et al. The NS Manual (Formerly NS Notes and Documentation , 2002 .

[3] Andrzej Skowron,et al. Rough Sets: A Tutorial , 1998 .

[4] David A. Maltz,et al. Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[5] Nick Cercone,et al. Applying Knowledge Discovery to Predict Water-Supply Consumption , 1997, IEEE Expert.

[6] Wojciech Ziarko,et al. Variable Precision Rough Set Model , 1993, J. Comput. Syst. Sci..

[7] Arul Siromoney,et al. Mobile Ad Hoc Routing Using Rough Set Theory , 2006, 2006 International Conference on Hybrid Information Technology.

[8] Janusz Zalewski,et al. Rough sets: Theoretical aspects of reasoning about data , 1996 .

[9] David A. Maltz,et al. DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[10] R. S. Milton,et al. Probability Measures for Prediction in Multi-table Infomation Systems , 2005, PReMI.