The locator/ID separation paradigm has been widely discussed to resolve the serious scalability issue that today's Internet is facing. Many researches have been carried on with this issue to alleviate the routing ...The locator/ID separation paradigm has been widely discussed to resolve the serious scalability issue that today's Internet is facing. Many researches have been carried on with this issue to alleviate the routing burden of the Default Free Zone (DFZ), improve the traffic engineering capabilities and support efficient mobility and multi-homing. However, in the locator/ID split networks, a third party is needed to store the identifier-to-locator pairs. How to map identifiers onto locators in a scalable and secure way is a really critical challenge. In this paper, we propose SS-MAP, a scalable and secure locator/ID mapping scheme for future Internet. First, SS-MAP uses a near-optimal DHT to map identifiers onto locators, which is able to achieve the maximal performance of the system with reasonable maintenance overhead relatively. Second, SS-MAP uses a decentralized admission control system to protect the DHT-based identifier-to-locator mapping from Sybil attacks, where a malicious mapping server creates numerous fake identities (called Sybil identifiers) to control a large fraction of the mapping system. This is the first work to discuss the Sybil attack problem in identifier-to-locator mapping mechanisms with the best knowledge of the authors. We evaluate the performance of the proposed approach in terms of scalability and security. The analysis and simulation results show that the scheme is scalable for large size networks and can resistant to Sybil attacks.展开更多
The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significan...The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.展开更多
基金supported in part by National Key Basic Research Program of China (973 program) under Grant No.2007CB307101,2007CB307106National Key Technology R&D Program under Grant No.2008BAH37B03+2 种基金Program of Introducing Talents of Discipline to Universities (111 Project) under Grant No. B08002National Natural Science Foundation of China under Grant No.60833002China Fundamental Research Funds for the Central Universities under Grant No.2009YJS016
文摘The locator/ID separation paradigm has been widely discussed to resolve the serious scalability issue that today's Internet is facing. Many researches have been carried on with this issue to alleviate the routing burden of the Default Free Zone (DFZ), improve the traffic engineering capabilities and support efficient mobility and multi-homing. However, in the locator/ID split networks, a third party is needed to store the identifier-to-locator pairs. How to map identifiers onto locators in a scalable and secure way is a really critical challenge. In this paper, we propose SS-MAP, a scalable and secure locator/ID mapping scheme for future Internet. First, SS-MAP uses a near-optimal DHT to map identifiers onto locators, which is able to achieve the maximal performance of the system with reasonable maintenance overhead relatively. Second, SS-MAP uses a decentralized admission control system to protect the DHT-based identifier-to-locator mapping from Sybil attacks, where a malicious mapping server creates numerous fake identities (called Sybil identifiers) to control a large fraction of the mapping system. This is the first work to discuss the Sybil attack problem in identifier-to-locator mapping mechanisms with the best knowledge of the authors. We evaluate the performance of the proposed approach in terms of scalability and security. The analysis and simulation results show that the scheme is scalable for large size networks and can resistant to Sybil attacks.
基金supported by the National Natural Science Foundation of China(62231020)the Youth Innovation Team of Shaanxi Universities。
文摘The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.
