This paper proposes an Authentication Interworking Protocol （AIP） based on IEEE 802.21 Medi Independent Handover （MIH） in the heterogeneous networks. The proposed AIP with the RSA-based proxy signature reduces han...This paper proposes an Authentication Interworking Protocol （AIP） based on IEEE 802.21 Medi Independent Handover （MIH） in the heterogeneous networks. The proposed AIP with the RSA-based proxy signature reduces handover delay time and communication message overhead when the mobile node moves between the heterogeneous networks. It defines new AlP Type Length Value （AlP TLV） in MIH frame format and uses the MIH Information Server （MIHIS） for issuing signature. The MIHIS can generate a signature on behalf of the AAA server and then the signature can he used by mobile node for a pre-authentication. For low handover delay, the proposed AIP performs pre-authentication processes with MIP protocol before layer 2 handover. Also, this paper analyses the performance of the handover and compares with the non-secure MIH.展开更多
Delay/disruption tolerant networking （DTN） is an approach to networking where intermittent connectivity exists： it is often afforded by a store and forward technique. Depending on the capability of intermediary nod...Delay/disruption tolerant networking （DTN） is an approach to networking where intermittent connectivity exists： it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live （TTL） and antipacket methods, in both redundancy and delivery success efficiency.展开更多
In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence...In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence of the number of isolated nodes and the probability of having no isolated nodes when the initial distribution of the random graph process is stationary distribution, derive the lower limit of the probability in which two arbitrary nodes are connected and the random graph is also connected, and prove that the random graph is almost everywhere connected when the number of nodes is sufficiently large.展开更多
基金supported by the Korea Science and Engineering Foundation(KOSEF)grant funded by the Korea government(MEST)(No.2010-0000100)the Ubiquitous Computing and Network(UCN)project,knowledge and economy frontier R&D program of the Ministry of Knowledge Economy(MKE)in Korea and a result of subproject10C2-C1-20S
文摘This paper proposes an Authentication Interworking Protocol （AIP） based on IEEE 802.21 Medi Independent Handover （MIH） in the heterogeneous networks. The proposed AIP with the RSA-based proxy signature reduces handover delay time and communication message overhead when the mobile node moves between the heterogeneous networks. It defines new AlP Type Length Value （AlP TLV） in MIH frame format and uses the MIH Information Server （MIHIS） for issuing signature. The MIHIS can generate a signature on behalf of the AAA server and then the signature can he used by mobile node for a pre-authentication. For low handover delay, the proposed AIP performs pre-authentication processes with MIP protocol before layer 2 handover. Also, this paper analyses the performance of the handover and compares with the non-secure MIH.
文摘Delay/disruption tolerant networking （DTN） is an approach to networking where intermittent connectivity exists： it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live （TTL） and antipacket methods, in both redundancy and delivery success efficiency.
基金supported by the National Natural Science Foundation of China(Nos.60872060,11101265)the Shanghai Natural Science Foundation of China(No.12ZR1421000)the Shanghai Education Commission Innovation Project Fund(Nos.12ZZ193,14YZ152,15ZZ099)
文摘In this paper, the continuous-time independent edge-Markovian random graph process model is constructed. The authors also define the interval isolated nodes of the random graph process, study the distribution sequence of the number of isolated nodes and the probability of having no isolated nodes when the initial distribution of the random graph process is stationary distribution, derive the lower limit of the probability in which two arbitrary nodes are connected and the random graph is also connected, and prove that the random graph is almost everywhere connected when the number of nodes is sufficiently large.
