http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
TDRHN : A Threshold Sensitive Dynamic Responsive Hybrid Network Protocol based on CTP
Xingming Sun,Chengju Xue,Baowei Wang 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.2
The protocols of Wireless Sensor Networks (WSNs) can be categorized into two classes: proactive network protocol like CTP and reactive network protocol like TEEN. The former periodically collects data, working well in the applications of collecting data persistently. However, it can’t dynamically alter the transmission frequency and the routing selecting strategy. The latter can react to the environment change, so it is widely used in the applications requiring nodes to be reactive to some emergencies. But it only works in reactive networks without collecting data under normal circumstance. We find that dynamically altering the transmission frequency and the routing selecting strategy according to the environment change is very effective and significant. For the reasons above, this paper presents TDRHN protocol. It periodically collects data in normal situation and can not only take faster transmission frequency but also alter the routing selecting strategy when it detects some emergencies. So TDRHN can effectively work in hybrid networks combining proactive networks and reactive networks. Finally, we evaluate TDRHN on the testbed with TelosB motes in real deployment. The concluded results of the experiments demonstrate that TDRHN has some particular advantages.
Xingming Sun,Yachao Hu,Baowei Wang,Jian Zhang,Tao Li 보안공학연구지원센터 2015 International Journal of Multimedia and Ubiquitous Vol.10 No.8
Localization systems have been identified as key issues in the development and operation of wireless sensor networks. The global positioning system (GPS) solves the problem about localization, but it is not suitable for wireless sensor networks. Due to range-free localization approaches requiring low equipped hardware and easy to implement, it is widely used in WSNs localization system. When the node communication radius increases, the accuracy of area-based localization is reduced. It is important to improve the localization accuracy in this situation. In this paper, to improve the accuracy of the node localization, we propose a new range-free localization using Voronoi diagrams based approximate point-in-triangulation test (APIT) algorithm. We compare our algorithm with APIT. Simulation results show that the VPIT improved the precision of localization by narrowing the node's geometry region.
Privacy-preserving Multi-keyword Ranked Search over Encrypted Cloud Data Supporting Dynamic Update
Xingming Sun,Lu Zhou,Zhangjie Fu,Jin Wang 보안공학연구지원센터 2014 International Journal of Security and Its Applicat Vol.8 No.6
With the development of cloud computing, the sensitive information of outsourced data is at risk of unauthorized accesses. To protect data privacy, the sensitive data should be encrypted by the data owner before outsourcing, which makes the traditional and efficient plaintext keyword search technique useless. Hence, it is an especially important thing to explore secure encrypted cloud data search service. Considering the huge number of outsourced data, there are three problems we are focused on to enable efficient search service: multi-keyword search, result relevance ranking and dynamic update. In this paper, we propose a practically efficient and flexible searchable encrypted scheme which supports both multi-keyword ranked search and dynamic update. To support multi-keyword search and result relevance ranking, we adopt Vector Space Model (VSM) to build the searchable index to achieve accurate search result. To improve search efficiency, we design a tree-based index structure which supports insertion and deletion update well without privacy leakage. We propose a secure search scheme to meet the privacy requirements in the threat model. Finally, experiments on real-world dataset are implemented to demonstrate the overall performance of the proposed scheme, which show our scheme is efficient.
ACTP : An Advanced Data Collection Protocol based on CTP
Xingming Sun,Lei Gao,Baowei Wang,Jian Zhang 보안공학연구지원센터 2016 International Journal of Future Generation Communi Vol.9 No.9
In wireless sensor networks, the main work of nodes is for data collection and transmission. CTP (Collected Tree Protocol) had been widely applied, and proved to be reliable, robust, efficient data collection protocol. Its independent with hardware and the data delivery rate is relatively high, but CTP also has some shortcomings: the protocol only relied on the ETX value of next hop node selection, there need other factors to consider. In the original CTP protocol, the energy consumption of a node with a better ETX value was too fast. It would cause the whole network time decreased quickly. Then, the node with better ETX value may have low package rate, and would affect the delivery rate of the whole networks. This paper was aimed at this two aspects of CTP, based on the original CTP, the probability of selection mechanism was introduced, proposed ACTP, lead the node load equilibrium and improved the delivery rate. Through the experimental data of TelosB nodes in real analysis, we had improved the whole network time and increased the number of successful packets delivery.
Efficient Keyword Search Scheme in Encrypted Cloud Computing Environment
Jiangang Shu,Xingming Sun,Lu Zhou,Jin Wang 보안공학연구지원센터 2014 International Journal of Grid and Distributed Comp Vol.7 No.5
With the increasing popularity of cloud computing, more and more sensitive or private information has been outsourced onto the cloud server. For protecting data privacy, sensitive data usually has to be encrypted before outsourcing, which makes traditional search techniques based on plaintext useless. In response to the search over encrypted data, searchable encryption is a good solution in Information Security. However, most of existing searchable encryption schemes only support exact keyword search. That means they don’t support searching for different variants of the query word, which is a significant drawback and greatly affects data usability and user experience. Recently, a fuzzy keyword search scheme proposed by some researchers aims at addressing the problems of minor typos and format inconsistence but couldn’t solve the problem above. In this paper, we formalize the problem of semantic keyword-based search over encrypted cloud data while preserving privacy. Semantic keyword-based search will greatly improves the user experience by returning all the documents containing semantically close keywords related to the query word. In our solution, we use the stemming algorithm to construct stem set, which reduces the dimension of index. And the symbol-based trie is also adopted in index construction to improve the search efficiency. Through rigorous privacy analysis and experiment on real dataset, our scheme is secure and efficient.