Search For:

Displaying 1-50 out of 64 total
An Algorithm for Privacy-Preserving Quantitative Association Rules Mining
Found in: Dependable, Autonomic and Secure Computing, IEEE International Symposium on
By Weiwei Jing, Liusheng Huang, Yonglong Luo, Weijiang Xu, Yifei Yao
Issue Date:October 2006
pp. 315-324
When Data mining occurs on distributed data, privacy of parties becomes great concerns. This paper considers the problem of mining quantitative association rules without revealing the private information of parties who compute jointly and share distributed...
 
Accuracy-Aware Interference Modeling and Measurement in Wireless Sensor Networks
Found in: Distributed Computing Systems, International Conference on
By Jun Huang, Shucheng Liu, Guoliang Xing, Hongwei Zhang, Jianping Wang, Liusheng Huang
Issue Date:June 2011
pp. 172-181
Wireless Sensor Networks (WSNs) are increasingly available for mission-critical applications such as emergency management and health care. To meet the stringent requirements on communication performance, it is crucial to understand the complex wireless int...
 
Passive interference measurement in Wireless Sensor Networks
Found in: Network Protocols, IEEE International Conference on
By Shucheng Liu, Guoliang Xing, Hongwei Zhang, Jianping Wang, Jun Huang, Mo Sha, Liusheng Huang
Issue Date:October 2010
pp. 52-61
Interference modeling is crucial for the performance of numerous WSN protocols such as congestion control, link/channel scheduling, and reliable routing. In particular, understanding and mitigating interference becomes increasingly important for Wireless S...
 
Joint power allocation and relay assignment for max-min fairness in cooperative networks
Found in: Computers and Communications, IEEE Symposium on
By Hongli Xu, Liusheng Huang, Gang Wang, Gang Liu, He Huang
Issue Date:June 2010
pp. 123-126
Cooperative communication is shown to be a promising technology to enhance the capacity of wireless transmission without additional equipments. Under this communication paradigm, both relay selection and power allocation significantly affect the overall sy...
 
Achieving Handoff Optimization and Throughput Efficiency in Vehicular Networks
Found in: 2013 Ninth International Conference on Mobile Ad-hoc and Sensor Networks (MSN)
By Quan Sun,Liusheng Huang,Hongli Xu
Issue Date:December 2013
pp. 147-152
As users drive through the vehicular networks with high speed, they frequently associate with different access points in succession to maintain connectivity. Without careful designed association control policy, it may lead to large number of handoffs and i...
 
Coalitional Game for Community-Based Autonomous Web Services Cooperation
Found in: IEEE Transactions on Services Computing
By An Liu,Qing Li,Liusheng Huang,Shi Ying,Mingjun Xiao
Issue Date:July 2013
pp. 387-399
Web services (WSs) can cooperate with each other to provide more valuable WSs. Current approaches for WS cooperation have typically assumed that WSs are always willing to participate in some form of cooperation, and have undermined the fact that WSs are au...
 
Shapley Value Based Impression Propagation for Reputation Management in Web Service Composition
Found in: 2012 IEEE 19th International Conference on Web Services (ICWS)
By An Liu,Qing Li,Liusheng Huang,Shiting Wen
Issue Date:June 2012
pp. 58-65
Reputation is useful for establishing trust between Web service (WS) providers and WS consumers. In the context of WS composition, a challenging issue of reputation management is to propagate a user's impression of a composite WS (i.e., the user's feedback...
 
A Stable Joint Routing and Spectrum Scheduling Scheme for Cognitive Radio Ad Hoc Networks
Found in: Mobile Ad-hoc and Sensor Networks, International Conference on
By Henan Zhao,Liusheng Huang,Yindong Zhang,Hongli Xu
Issue Date:December 2011
pp. 323-329
In CRAHNs (Cognitive Radio Ad Hoc Networks), cognitive users coexist with primary users who have priority in accessing a set of licensed bands. Cognitive users can use those bands only when the primary users don't occupied them. And also, these occupied ba...
 
Cooperative optimal pricing for stochastic access control in heterogeneous wireless networks
Found in: IEEE International Performance Computing and Communications Conference
By Haoran Zhang,Liusheng Huang,Hongli Xu
Issue Date:November 2011
pp. 1-6
As Radio Access Technology (RAT) being greatly developed nowadays, Call Admission Control (CAC) is also evolving to provide inter-network connectivity since mobile terminals are able to access multiple networks. In this paper, we propose a pricing-based re...
 
Reputation-Driven Recommendation of Services with Uncertain QoS
Found in: Asia-Pacific Conference on Services Computing. 2006 IEEE
By An Liu, Qing Li, Liusheng Huang, Shiting Wen, Chaogang Tang, Mingjun Xiao
Issue Date:December 2010
pp. 115-122
Service recommendation in a Web of services with uncertain QoS is a challenging problem. In this paper, we propose a reputation-based service recommendation framework. We formally define a service reputation model that analyzes the relations between uncert...
 
Relation of PPAtMP and scalar product protocol and their applications
Found in: Computers and Communications, IEEE Symposium on
By Youwen Zhu, Liusheng Huang, Wei Yang
Issue Date:June 2010
pp. 184-189
Scalar product protocol and privacy preserving add to multiply protocol (PPAtMP) are two significant basic secure multiparty computation protocols. In this paper, we claim that the two protocols are equivalent to each other and we can achieve one based on ...
 
Interference-Aware Relay Assignment for Cooperative Networks
Found in: Communication Networks and Services Research, Annual Conference on
By Hongli Xu, Liusheng Huang, Wang Gang, Tao Xu, Yindong Zhang
Issue Date:May 2010
pp. 124-129
Recently, cooperative communication is shown to be a promising approach to improve the transmission’s bandwidth without additional antennas on each node. Under this communication paradigm, the selection of relay nodes significantly affects the network thro...
 
Privacy Preserving Density-Based Outlier Detection
Found in: Communications and Mobile Computing, International Conference on
By Zaisheng Dai, Liusheng Huang, Youwen Zhu, Wei Yang
Issue Date:April 2010
pp. 80-85
Outlier detection can find its tremendous applications in areas such as intrusion detection, fraud detection, and image processing. Among many outlier detection algorithms, LOF is a very important density-based algorithm in which one critical step is to fi...
 
Anycast Routing in Probabilistically Contacted Delay Tolerant Networks
Found in: Communications and Mobile Computing, International Conference on
By Mingjun Xiao, Liusheng Huang, An Liu, Weican Chen
Issue Date:April 2010
pp. 442-446
Delay tolerant networks (DTNs) experience frequent and long lasting network disconnection due to various reasons such as mobility, sleep scheduling, etc. Anycast routing is an important and challenging problem in DTNs. In this paper, we study the single-co...
 
Spanner-Aware Relay Node Placement in Wireless Ad Hoc Sensor Networks
Found in: Mobile Ad-hoc and Sensor Networks, International Conference on
By Hongli Xu, Liusheng Huang, Gang Wang, Yindong Zhang
Issue Date:December 2009
pp. 180-186
Relay node placement is an important issue because it greatly affects the performance of wireless ad hoc sensor networks. The pervious works mainly pay attentions on placing the minimum number of relay nodes to connect all the sensor nodes. But we find tha...
 
A Storage Node Placement Algorithm in Wireless Sensor Networks
Found in: Frontier of Computer Science and Technology, Japan-China Joint Workshop on
By Yang Wang, Xiong Fu, Liusheng Huang
Issue Date:December 2009
pp. 267-271
In most wireless sensor network applications a large amount of data has been continuously collected for future data query and analysis, so how to store them becomes one important challenge in such wireless sensor networks. Recently a kind of storage node h...
 
A Transmit Antenna Selection for MIMO Wireless Ad-Hoc Networks in Lossy Environment
Found in: Parallel and Distributed Systems, International Conference on
By Yindong Zhang, Liusheng Huang, Hongli Xu, Xueyong Xu
Issue Date:December 2009
pp. 728-733
Because of rapid channel attenuation in lossy environment, there is a severe packet drop loss problem in wireless ad hoc networks. Though MIMO (Multi-Input Multi-Output) technology can alleviate this effect greatly, it will result in higher transmission en...
 
FACTS: A Framework for Fault-Tolerant Composition of Transactional Web Services
Found in: IEEE Transactions on Services Computing
By An Liu, Qing Li, Liusheng Huang, Mingjun Xiao
Publication Date: September 2009
pp. 46-59
Along with the standardization of Web services composition language and the widespread acceptance of composition technologies, Web services composition is becoming an efficient and cost-effective way to develop modern business applications. As Web services...
 
Consistent Message Ordering in Wireless Sensor and Actor Networks
Found in: Parallel and Distributed Processing with Applications, International Symposium on
By Yang Wang, Liusheng Huang, Hongli Xu, Gang Wang
Issue Date:August 2009
pp. 333-339
Wireless sensor and actor networks (WSANs) have attracted much attention in the recent years. In WSANs, sensor nodes are in charge of the sensing task, while the actor nodes take actions in response to the sensed phenomena or the detected event. In order t...
 
Location-Independent Topology Control and Implementation for Wireless Sensor Networks
Found in: Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
By Hongli Xu, Liusheng Huang, Gang Wang, Xueyong Xu, Leijie Qiu
Issue Date:May 2009
pp. 427-432
In the recent years, topology control problem has been deeply studied for wireless ad hoc and sensor networks. The previous methods often imply that each node knows its precise position information. However, this assumption is not always feasible for the p...
 
An Efficient Multi-secret Sharing Scheme with the Quasi-threshold Multipartite Access Structure
Found in: Networks Security, Wireless Communications and Trusted Computing, International Conference on
By Runhua Shi, Liusheng Huang, Wei Yang, Hong Zhong
Issue Date:April 2009
pp. 151-154
In real world, there are many important applications for the secret sharing with the quasi-threshold multipartite access structure. But there was still not a very efficient scheme proposed in the past. In this paper, we combine the multi-secret sharing and...
 
Privacy-Preserving Approximate Convex Hulls Protocol
Found in: Education Technology and Computer Science, International Workshop on
By Youwen Zhu, Liusheng Huang, Wei Yang, Dong Li, Lingjun Li, Yonglong Luo, Fan Dong
Issue Date:March 2009
pp. 208-214
Secure Multi-party Computation has been a research focus for more than two decades. The Convex Hulls problem is a special case of Secure Multi-party Computation. However, the precise convex hulls will certainly expose every vertex and even bring about unfa...
 
Steganalysis on Character Substitution Using Support Vector Machine
Found in: International Workshop on Knowledge Discovery and Data Mining
By Xinxin Zhao, Liusheng Huang, Lingjun Li, Wei Yang, Zhili Chen, Zhenshan Yu
Issue Date:January 2009
pp. 84-88
A new steganalysis method is proposed to detect the exists of hiddeninformation using character substitution in texts. This is done byutilizing Support Vector Machine (SVM) as a classifier to classifythe characteristic vector input into SVM. The most impor...
 
Three New Approaches to Privacy-preserving Add to Multiply Protocol and its Application
Found in: International Workshop on Knowledge Discovery and Data Mining
By Youwen Zhu, Liusheng Huang, Wei Yang, Dong Li, Yonglong Luo, Fan Dong
Issue Date:January 2009
pp. 554-558
Privacy-preserving Data Mining aims at securely extracting knowledge from two or more parties' private data. Secure Multi-party Computation is the paramount approach to it. In this paper, we study Privacy-preserving Add and Multiply Exchanging Technology a...
 
Privacy Preserving Attribute Reduction Based on Rough Set
Found in: International Workshop on Knowledge Discovery and Data Mining
By Zhengyou Zhou, Liusheng Huang, Ye Yun
Issue Date:January 2009
pp. 202-206
Attribute reduction, as a part of preprocesses, plays an important role in data mining. Privacy ought to be preserved while conducting attribute reduction on distributed data. However, to the best of our knowledge, there exists no algorithm about attribute...
 
A Practical Solution for Privacy-Preserving Approximate Convex Hulls Problem
Found in: Communications and Mobile Computing, International Conference on
By Dong Li, Liusheng Huang, Wei Yang, Youwen Zhu, Yonglong Luo, Lingjun Li, Zhili Chen
Issue Date:January 2009
pp. 539-544
Convex Hulls Problem is a special case of Privacy-preserving Geometry problems in the inquiry of Secure Multi-Party Computation (SMC). It can be applied in military, commercial and many other fields. However, because of the definition's inherent defect, cu...
 
Linguistic Steganography Detection Based on Perplexity
Found in: MultiMedia and Information Technology, International Conference on
By Peng Meng, Liusheng Huang, Zhili Chen, Wei Yang, Dong Li
Issue Date:December 2008
pp. 217-220
Linguistic steganography is a technique for hiding information into text carriers. Most of the previous work on linguistic steganography was focused on steganography and there were few researches on steganalysis. Research on attacking methods against lingu...
 
A Practical Three-Dimensional Privacy-Preserving Approximate Convex Hulls Protocol
Found in: Frontier of Computer Science and Technology, Japan-China Joint Workshop on
By Dong Li, Liusheng Huang, Wei Yang, Youwen Zhu, Yonglong Luo, Zhili Chen, Lingjun Li, Yun Ye
Issue Date:December 2008
pp. 17-23
Convex Hulls Problem is a special case of Privacy-preserving Geometry Problem in the inquiry of Secure Multi-Party Computation. In the past, only in two-dimensional space privacy-preserving convex hulls have been investigated, and there is little focus in ...
 
Privacy-Preserving Practical Convex Hulls Protocol
Found in: Frontier of Computer Science and Technology, Japan-China Joint Workshop on
By Youwen Zhu, Liusheng Huang, Wei Yang, Zhili Chen, Lingjun Li, Zhenshan Yu, Yonglong Luo
Issue Date:December 2008
pp. 10-16
Secure Multi-party Computation has been a hot research topic of cryptograhy for about two decades, and the Convex Hulls problem is a special case of it. However, the precise convex hulls will certainly expose all vertexes and even bring about unfairness. T...
 
Detection of Synonym-Substitution Modified Articles Using Context Information
Found in: Future Generation Communication and Networking
By Zhenshan Yu, Liusheng Huang, Zhili Chen, Lingjun Li, Xinxin Zhao, Youwen Zhu
Issue Date:December 2008
pp. 134-139
Text steganography usually modifies the cover-text (where secrets are embedded) in some meaning-preserving ways to conceal secret messages, while steganalysis does the opposite - detects or extracts the secrets. A lot of work has been done on steganography...
 
Energy Efficient Topology Control Algorithms for Variant Rate Mobile Sensor Networks
Found in: Mobile Ad-hoc and Sensor Networks, International Conference on
By Jianbo Li, Liusheng Huang, Mingjun Xiao
Issue Date:December 2008
pp. 23-30
Although topology control has been extensively studied for stationary sensor networks, few theoretical results on topology control for mobile sensor networks (MSN) have been reported yet. In this paper, we propose two O(n3) time topology control algorithms...
 
A Tracking Range Based Ant-Colony Routing Protocol for Mobile Wireless
Found in: Mobile Ad-hoc and Sensor Networks, International Conference on
By Yan Luo, Yun Xu, Liusheng Huang, Hongli Xu
Issue Date:December 2008
pp. 116-121
Mobile wireless sensor network (M-WSN) is wireless sensor network without infrastructure, and includes mobile nodes. According to certain mobility models, mobile nodes move around in the network, and change their locations continually. Because the paths be...
 
Building Profit-Aware Service-Oriented Business Applications
Found in: Web Services, IEEE International Conference on
By An Liu, Qing Li, Liusheng Huang, Hai Liu
Issue Date:September 2008
pp. 489-496
Service composition is becoming a prevalent way to building service-oriented business applications (SOBAs). In an open service environment, the profit of composition (PoC) is a primary concern of building such applications. How to improve the PoC is a sign...
 
A Statistical Attack on a Kind of Word-Shift Text-Steganography
Found in: Intelligent Information Hiding and Multimedia Signal Processing, International Conference on
By Lingjun Li, Liusheng Huang, Xinxin Zhao, Wei Yang, Zhili Chen
Issue Date:August 2008
pp. 1503-1507
Text-steganography plays an increasingly significant role in covert-communication on Internet. Compared with study on text-steganography, research on text-steganalysis is in its infancy. In this paper, we present a statistical analysis of a kind of word-sh...
 
QoS-Aware Scheduling of Web Services
Found in: Web-Age Information Management, International Conference on
By An Liu, Qing Li, Liusheng Huang, Mingjun Xiao, Hai Liu
Issue Date:July 2008
pp. 171-178
QoS-Aware web services composition has recently received much attention. While most work focused on service selection, we study QoS in another stage of the life cycle of composite services, namely, scheduling. An interesting problem is whether we can obtai...
 
A (t, n) Secret Sharing Scheme for Image Encryption
Found in: Image and Signal Processing, Congress on
By Runhua Shi, Hong Zhong, Liusheng Huang, Yonglong Luo
Issue Date:May 2008
pp. 3-6
This paper introduces a new (t, n) secret sharing scheme for image encryption. The proposed method encrypts the secret image into two images as the same size of the original image, which one is the public image (called the encrypted image) and another is t...
 
Unambiguous Measurements Based Quantum Cryptography
Found in: Computational Intelligence and Security Workshops, International Conference on
By Wei Yang, Liusheng Huang, Yonglong Luo
Issue Date:December 2007
pp. 753-756
A new quantum cryptography (quantum key distribution) scheme based on unambiguous measurements is presented, which is secure against any individual attack allowed by quantum physics. By carefully constructing the unambiguous measurements elements a higher ...
 
Quantum Oblivious Transfer Using Tripartite Entangled States
Found in: Future Generation Communication and Networking
By Wei Yang, Liusheng Huang, Yifei Yao, Zhili Chen
Issue Date:December 2007
pp. 464-468
Oblivious Transfer is an interesting cryptographic task in which one party Alice aims to transfer one of her two bits to the other party Bob, with the assurance that he can choose freely his bit, but is not able to obtain the two bits simultaneously. Bob o...
 
Quantum User Authentication with Nonentanglement-Based QKD Protocol
Found in: Convergence Information Technology, International Conference on
By Kan Yang,Liusheng Huang,Wei Yang
Issue Date:November 2007
pp. 1969-1973
In this paper, we propose a secure user authentication protocol with nonentanglement -based QKD on jammable public channels between two parties, Alice and Bob. First, via an arbitrator (Trent), the protocol provides both quantum authentication and quantum ...
 
Coverage-preserving Data Gathering in Wireless Sensor Networks
Found in: Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
By Hongli Xu, Liusheng Huang, Jumin Wu, Yang Wang
Issue Date:August 2007
pp. 14-19
The power is the most significant resource in wireless sensor nodes, so energy conservation is the most important factor in designing the protocol for sensor networks. In this paper, we study the problem of energy-efficient collection of the physical infor...
 
A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP
Found in: Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
By Ruanhua Shi, Hong Zhong, Liusheng Huang
Issue Date:August 2007
pp. 9-13
In this article, we propose a (t,n) threshold verifiable multi-secret sharing scheme, in which to reconstruct t secrets needs to solve t simultaneous equations. The analysis results show that our scheme is as easy as Yang's scheme [8] in the secret reconst...
 
An Efficient Implementation of File Sharing Systems on the Basis of WiMAX and Wi-Fi
Found in: IEEE International Conference on Mobile Adhoc and Sensor Systems Conference
By Jingyuan Li, Liusheng Huang, Weijia Jia, Mingjun Xiao, Peng Du
Issue Date:October 2006
pp. 819-824
This paper proposes an efficient algorithm for P2P file sharing systems based on WiMAX mesh mode and Wi-Fi technologies. Wireless networks in our system are hierarchically divided into three layers: Wi-Fi based wireless local area networks under a subscrib...
 
An Efficient Multiple-Precision Division Algorithm
Found in: Parallel and Distributed Computing Applications and Technologies, International Conference on
By Liusheng Huang, Hong Zhong, Hong Shen, Yonglong Luo
Issue Date:December 2005
pp. 971-974
In multiple-precision algorithms, the design and implementation of division is the most complicated. On the basis of some classical algorithms, this paper introduces an efficient improved algorithm. This algorithm omits the most majority of normalization o...
 
Energy-Efficient Data Gathering in Large Wireless Sensor Networks
Found in: Embedded Software and Systems, Second International Conference on
By KeZhong Lu, LiuSheng Huang, YingYu Wan, HongLi Xu
Issue Date:December 2005
pp. 327-331
In this paper, we investigate an energy-efficient data gathering scheme that prolongs the lifetime of battery-powered sensor nodes. We consider two points in our scheme: turning off some sensor nodes? radio components when they needn?t participate in data ...
 
Localized Algorithm for Coverage in Wireless Sensor Networks
Found in: Parallel and Distributed Computing Applications and Technologies, International Conference on
By Hongli Xu, Liusheng Huang, Yingyu Wan, Kezhong Lu
Issue Date:December 2005
pp. 750-754
Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage path for sensor networks. In this paper, we design a localized algor...
 
Optimal Record and Replay for Debugging of Nondeterministic MPI/PVM Programs
Found in: High-Performance Computing in the Asia-Pacific Region, International Conference on
By Qilong Zheng, Guoliang Chen, Liusheng Huang
Issue Date:May 2000
pp. 473
Record and Replay technique has been proved an effective solution to cyclic debugging of nondeterministic parallel program. Because of nondeterminism, a parallel program given the same inputs on successive runs can sometimes produces different results. In ...
 
On the Security of a Privacy-Preserving Product Calculation Scheme
Found in: IEEE Transactions on Dependable and Secure Computing
By Youwen Zhu,Zhiqiu Huang,Liusheng Huang,Tsuyoshi Takagi
Issue Date:August 2014
pp. 1
Recently, Jung and Li [1] propose a highly efficient privacy-preserving product calculation scheme without requiring secure communication channels. Then, they present secure approaches to solve several application problems using the product calculation pro...
 
Truthful Auction Mechanisms with Performance Guarantee in Secondary Spectrum Markets
Found in: IEEE Transactions on Mobile Computing
By He Huang,Yu-e Sun,Xiang-Yang Li,Shigang Chen,Mingjun Xiao,Liusheng Huang
Issue Date:August 2014
pp. 1
We study a spectrum auction problem where each request from new spectrum users has spatial, temporal, and spectral features. Our goal is to design truthful auction mechanisms that maximize either the overall social efficiency of new users (a.k.a buyers) or...
 
PPS: Privacy-Preserving Strategyproof Social-Efficient Spectrum Auction Mechanisms
Found in: IEEE Transactions on Parallel and Distributed Systems
By He Huang,Xiang-Yang Li,Yu-e Sun,Hongli Xu,Liusheng Huang
Issue Date:May 2014
pp. 1
Many spectrum auction mechanisms have been proposed for spectrum allocation problem, and unfortunately, few of them protect the bid privacy of bidders and achieve good social efficiency. In this paper, we propose PPS, a Privacy Preserving Strategyproof spe...
 
Community-Aware Opportunistic Routing in Mobile Social Networks
Found in: IEEE Transactions on Computers
By Mingjun Xiao,Jie Wu,Liusheng Huang
Issue Date:July 2014
pp. 1682-1695
Mobile social networks (MSNs) are a kind of delay tolerant network that consists of lots of mobile nodes with social characteristics. Recently, many social-aware algorithms have been proposed to address routing problems in MSNs. However, these algorithms t...
 
 1  2 Next >>