文件名称:Enabling-dynamic-data-and-mutual-trust
介绍说明－－下载内容均来自于网络，请自行研究使用
Ad hoc networks are new paradigm of networks offering unrestricted mobility without any underlying infrastructure. ROUTING is one of the most basic networking functions in mobile ad hoc networks. In partitioned networks, same addresses can exist between partitioned networks. Therefore, when several partitioned networks or independent networks merge into one network, potential address conflicts must be resolved. The address conflicts are detected through a DAD (Duplicate Address Detection) procedure. In reference 1, authors introduced three schemes: PDAD-RREQ Never- Sent (RNS), PDAD-RREP-Without-RREQ (RwR), and PDAD-2RREPs-on-RREQ (2RoR). These schemes can detect conflicts of a set of nodes but not all the duplicates and with a higher scope of false positives. This paper presents an adaptive version of PDAD.
-Ad hoc networks are new paradigm of networks offering unrestricted mobility without any underlying infrastructure. ROUTING is one of the most basic networking functions in mobile ad hoc networks. In partitioned networks, same addresses can exist between partitioned networks. Therefore, when several partitioned networks or independent networks merge into one network, potential address conflicts must be resolved. The address conflicts are detected through a DAD (Duplicate Address Detection) procedure. In reference 1, authors introduced three schemes: PDAD-RREQ Never- Sent (RNS), PDAD-RREP-Without-RREQ (RwR), and PDAD-2RREPs-on-RREQ (2RoR). These schemes can detect conflicts of a set of nodes but not all the duplicates and with a higher scope of false positives. This paper presents an adaptive version of PDAD.
-Ad hoc networks are new paradigm of networks offering unrestricted mobility without any underlying infrastructure. ROUTING is one of the most basic networking functions in mobile ad hoc networks. In partitioned networks, same addresses can exist between partitioned networks. Therefore, when several partitioned networks or independent networks merge into one network, potential address conflicts must be resolved. The address conflicts are detected through a DAD (Duplicate Address Detection) procedure. In reference 1, authors introduced three schemes: PDAD-RREQ Never- Sent (RNS), PDAD-RREP-Without-RREQ (RwR), and PDAD-2RREPs-on-RREQ (2RoR). These schemes can detect conflicts of a set of nodes but not all the duplicates and with a higher scope of false positives. This paper presents an adaptive version of PDAD.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Enabling dynamic data and mutual trust.avi