The basic function of the Internet is to delivery data(what) to serve the needs of all applications. IP names the attachment points(where) to facilitate ubiquitous interconnectivity as the current way to deliver data....The basic function of the Internet is to delivery data(what) to serve the needs of all applications. IP names the attachment points(where) to facilitate ubiquitous interconnectivity as the current way to deliver data. The fundamental mismatch between data delivery and naming attachment points leads to a lot of challenges, e.g., mapping from data name to IP address, handling dynamics of underlying topology, scaling up the data distribution, and securing communication, etc. Informationcentric networking(ICN) is proposed to shift the focus of communication paradigm from where to what, by making the named data the first-class citizen in the network, The basic consensus of ICN is to name the data independent from its container(space dimension) and session(time dimension), which breaks the limitation of point-to-point IP semantic. It scales up data distribution by utilizing available resources, and facilitates communication to fit diverse connectivity and heterogeneous networks. However, there are only a few consensuses on the detailed design of ICN, and quite a few different ICN architectures are proposed. This paper reveals the rationales of ICN from the perspective of the Internet evolution, surveys different design choices, and discusses on two debatable topics in ICN, i.e.,self-certifying versus hierarchical names, and edge versus pervasive caching. We hope this survey helps clarify some mis-understandings on ICN and achieve more consensuses.展开更多
Massive information flows are gen- erated from interactive processing and visua- lizations. To efficiently support information transmission over the Interact, information cen- tric architecture has been recently propo...Massive information flows are gen- erated from interactive processing and visua- lizations. To efficiently support information transmission over the Interact, information cen- tric architecture has been recently proposed. In this paper, we consider an information centric architecture, called the data centric networking architecture to provide communication servi- ces to big data, where a service identifier is used to name the data objects. We propose dif- ferent approaches for the dissemination of data objects in a large-scale data centric network. In particular, we propose various approaches to link the data dissemination approach with the topology of the Internet. Further, we eva- luate the proposed approaches with respect to data delivery efficiency, round-trip time imp- rovement, and deployment cost. Based on the results obtained from this study, it can be sh- own that by disseminating data objects to small ISPs, the data delivery efficiency can be significantly improved within an acceptable deployment cost.展开更多
The intelligent vehicle network uses advanced information technology to establish an efficient integrated vehicle transport system, which has received great attention in industry and academia, lnternet of Vehicles （...The intelligent vehicle network uses advanced information technology to establish an efficient integrated vehicle transport system, which has received great attention in industry and academia, lnternet of Vehicles （loV） in an urban environment is operated in a wireless environment with high bit error rate and interference. In addition, the wireless link between vehicles is likely to be lost. All of this makes it an important challenge to provide reliable mobile routing in an urban traffic environment. In this paper, a reliable routing algorithm with network coding （RR_ NC） is proposed to solve the above problems. A routing node sequence is discovered in IoV from source to destination by multi-metric ant colony optimization algorithm （MACO）, and then clusters are formed around every node in the sequence. By adding linear encoding into the transmission of data between vehicle＇s clusters, the RR_NC provides much more reliable transmission and can recover the original message in the event of disorder and loss of message. Simulations are taken under different scenarios, and the results prove that this novel algorithm can deliver the information more reliably between vehicles in real-time with lower data loss and communication overhead.展开更多
In this letter,we first put forward a new basic problem to the famous vector perturbation(VP) precoding that whether the extended constellation of VP could transmit more information bits.Then,we propose an opportunist...In this letter,we first put forward a new basic problem to the famous vector perturbation(VP) precoding that whether the extended constellation of VP could transmit more information bits.Then,we propose an opportunistic vector perturbation(OVP) precoding with superposition signalling scheme,which is aimed at getting the performance of VP closer to capacity limit.The main idea is using subsequent recoverable data symbol vector to perturb currently transmitting data symbol vector opportunistically.Analysis and simulation results show that the proposed OVP can transmit more valid information bits than conventional VP at the same transmit power,modulation order and number of antennas.展开更多
Searchable encryption allows cloud users to outsource the massive encrypted data to the remote cloud and to search over the data without revealing the sensitive information. Many schemes have been proposed to support ...Searchable encryption allows cloud users to outsource the massive encrypted data to the remote cloud and to search over the data without revealing the sensitive information. Many schemes have been proposed to support the keyword search in a public cloud. However,they have some potential limitations. First,most of the existing schemes only consider the scenario with the single data owner. Second,they need secure channels to guarantee the secure transmission of secret keys from the data owner to data users. Third,in some schemes,the data owner should be online to help data users when data users intend to perform the search,which is inconvenient.In this paper,we propose a novel searchable scheme which supports the multi-owner keyword search without secure channels. More than that,our scheme is a non-interactive solution,in which all the users only need to communicate with the cloud server. Furthermore,the analysis proves that our scheme can guarantee the security even without secure channels. Unlike most existing public key encryption based searchable schemes,we evaluate the performance of our scheme,which shows that our scheme is practical.展开更多
基金supported by the National High-tech R&D Program("863"Program)of China(No.2013AA013505)the National Science Foundation of China(No.61472213)State Scholarship Fund from China Scholarship Council(No.201406210270)
文摘The basic function of the Internet is to delivery data(what) to serve the needs of all applications. IP names the attachment points(where) to facilitate ubiquitous interconnectivity as the current way to deliver data. The fundamental mismatch between data delivery and naming attachment points leads to a lot of challenges, e.g., mapping from data name to IP address, handling dynamics of underlying topology, scaling up the data distribution, and securing communication, etc. Informationcentric networking(ICN) is proposed to shift the focus of communication paradigm from where to what, by making the named data the first-class citizen in the network, The basic consensus of ICN is to name the data independent from its container(space dimension) and session(time dimension), which breaks the limitation of point-to-point IP semantic. It scales up data distribution by utilizing available resources, and facilitates communication to fit diverse connectivity and heterogeneous networks. However, there are only a few consensuses on the detailed design of ICN, and quite a few different ICN architectures are proposed. This paper reveals the rationales of ICN from the perspective of the Internet evolution, surveys different design choices, and discusses on two debatable topics in ICN, i.e.,self-certifying versus hierarchical names, and edge versus pervasive caching. We hope this survey helps clarify some mis-understandings on ICN and achieve more consensuses.
基金supported by the National Science and Technology Major Projects of the Ministry of Science and Technology of China under Grant No.2012ZX03005003the State Key Program of National Natural Science of China under Grant No.61232017+3 种基金the National Basic Research Program of China(973 Program)under Grant No.2013CB329101the National Natural Science Foundation of China under Grants No.61102049,No.61271202the Beijing Natural Science Foundation underGrants No.4132053,No.4122060the Scientific Research Foundation of the Returned Overseas Chinese Scholars of State Education Ministry under Grant No.W13C300010
文摘Massive information flows are gen- erated from interactive processing and visua- lizations. To efficiently support information transmission over the Interact, information cen- tric architecture has been recently proposed. In this paper, we consider an information centric architecture, called the data centric networking architecture to provide communication servi- ces to big data, where a service identifier is used to name the data objects. We propose dif- ferent approaches for the dissemination of data objects in a large-scale data centric network. In particular, we propose various approaches to link the data dissemination approach with the topology of the Internet. Further, we eva- luate the proposed approaches with respect to data delivery efficiency, round-trip time imp- rovement, and deployment cost. Based on the results obtained from this study, it can be sh- own that by disseminating data objects to small ISPs, the data delivery efficiency can be significantly improved within an acceptable deployment cost.
基金supported by the Science and Technology Development Fund(No.037/2015/A1),Macao SAR,China
文摘The intelligent vehicle network uses advanced information technology to establish an efficient integrated vehicle transport system, which has received great attention in industry and academia, lnternet of Vehicles （loV） in an urban environment is operated in a wireless environment with high bit error rate and interference. In addition, the wireless link between vehicles is likely to be lost. All of this makes it an important challenge to provide reliable mobile routing in an urban traffic environment. In this paper, a reliable routing algorithm with network coding （RR_ NC） is proposed to solve the above problems. A routing node sequence is discovered in IoV from source to destination by multi-metric ant colony optimization algorithm （MACO）, and then clusters are formed around every node in the sequence. By adding linear encoding into the transmission of data between vehicle＇s clusters, the RR_NC provides much more reliable transmission and can recover the original message in the event of disorder and loss of message. Simulations are taken under different scenarios, and the results prove that this novel algorithm can deliver the information more reliably between vehicles in real-time with lower data loss and communication overhead.
基金supported in part by Key Project of National Natural Science Foundation of China(61231008)National Natural Science Foundation of China (61301168,61271176)+1 种基金Natural Science Basic Research Plan in Shaanxi Province of China (2013JQ8001)Fundamental Research Funds for the Central Universities and the 111 Project(B08038)
文摘In this letter,we first put forward a new basic problem to the famous vector perturbation(VP) precoding that whether the extended constellation of VP could transmit more information bits.Then,we propose an opportunistic vector perturbation(OVP) precoding with superposition signalling scheme,which is aimed at getting the performance of VP closer to capacity limit.The main idea is using subsequent recoverable data symbol vector to perturb currently transmitting data symbol vector opportunistically.Analysis and simulation results show that the proposed OVP can transmit more valid information bits than conventional VP at the same transmit power,modulation order and number of antennas.
基金supported by Natural Science Foundation of China(No.61303264)
文摘Searchable encryption allows cloud users to outsource the massive encrypted data to the remote cloud and to search over the data without revealing the sensitive information. Many schemes have been proposed to support the keyword search in a public cloud. However,they have some potential limitations. First,most of the existing schemes only consider the scenario with the single data owner. Second,they need secure channels to guarantee the secure transmission of secret keys from the data owner to data users. Third,in some schemes,the data owner should be online to help data users when data users intend to perform the search,which is inconvenient.In this paper,we propose a novel searchable scheme which supports the multi-owner keyword search without secure channels. More than that,our scheme is a non-interactive solution,in which all the users only need to communicate with the cloud server. Furthermore,the analysis proves that our scheme can guarantee the security even without secure channels. Unlike most existing public key encryption based searchable schemes,we evaluate the performance of our scheme,which shows that our scheme is practical.
