Search For:

Displaying 1-23 out of 23 total
BloomCast: Efficient and Effective Full-Text Retrieval in Unstructured P2P Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Hanhua Chen,Hai Jin,Xucheng Luo,Yunhao Liu,Tao Gu,Kaiji Chen,Lionel M. Ni
Issue Date:February 2012
pp. 232-241
Efficient and effective full-text retrieval in unstructured peer-to-peer networks remains a challenge in the research community. First, it is difficult, if not impossible, for unstructured P2P systems to effectively locate items with guaranteed recall. Sec...
 
Optimizing Bloom Filter Settings in Peer-to-Peer Multikeyword Searching
Found in: IEEE Transactions on Knowledge and Data Engineering
By Hanhua Chen,Hai Jin,Lei Chen,Yunhao Liu,Lionel M. Ni
Issue Date:April 2012
pp. 692-706
Peer-to-Peer multikeyword searching requires distributed intersection/union operations across wide area networks, raising a large amount of traffic cost. Existing schemes commonly utilize Bloom Filters (BFs) encoding to effectively reduce the traffic cost ...
 
Quasi-Kautz Digraphs for Peer-to-Peer Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Deke Guo,Jie Wu,Yunhao Liu,Hai Jin,Hanhua Chen,Tao Chen
Issue Date:June 2011
pp. 1042-1055
We consider deterministic feasibility and time complexity of two fundamental tasks in distributed computing: consensus and mutual exclusion. Processes have different labels and communicate through a multiple access channel. The adversary wakes up some proc...
 
STAIRS: Towards Efficient Full-Text Filtering and Dissemination in a DHT Environment
Found in: Data Engineering, International Conference on
By Weixiong Rao, Ada Wai-Chee Fu, Lei Chen, Hanhua Chen
Issue Date:April 2009
pp. 198-209
Nowadays contents in Internet like weblogs, wikipedia and news sites become
 
Real-Time Strategy and Practice in Service Grid
Found in: Computer Software and Applications Conference, Annual International
By Hai Jin, Hanhua Chen, Jian Chen, Ping Kuang, Li Qi, Deqing Zou
Issue Date:September 2004
pp. 161-166
The emerging service grids bring together various distributed application-level services to a ?market? for clients to request and enable the integration of services across distributed, heterogeneous, dynamic virtual organizations. However, there are a numb...
 
Minimizing inter-server communications by exploiting self-similarity in online social networks
Found in: 2012 20th IEEE International Conference on Network Protocols (ICNP)
By Hanhua Chen, Hai Jin, Ning Jin, Tao Gu
Issue Date:October 2012
pp. 1-10
Efficiently operating on relevant data for users in large-scale online social network (OSN) systems is a challenging problem. Storage systems used by popular OSN systems often rely on key-value stores, where randomly partitioning the data of users among se...
 
Recognizing Multiuser Activities Using Wireless Body Sensor Networks
Found in: IEEE Transactions on Mobile Computing
By Tao Gu,Liang Wang,Hanhua Chen,Xianping Tao,Jian Lu
Issue Date:November 2011
pp. 1618-1631
The advances of wireless networking and sensor technology open up an interesting opportunity to infer human activities in a smart home environment. Existing work in this paradigm focuses mainly on recognizing activities of single user. In this work, we foc...
 
Real-Time Activity Recognition in Wireless Body Sensor Networks: From Simple Gestures to Complex Activities
Found in: Real-Time Computing Systems and Applications, International Workshop on
By Liang Wang, Tao Gu, Hanhua Chen, Xianping Tao, Jian Lu
Issue Date:August 2010
pp. 43-52
Real-time activity recognition using body sensor networks is an important and challenging task and it has many potential applications. In this paper, we propose a real time, hierarchical model to recognize both simple gestures and complex activities using ...
 
TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections
Found in: IEEE Transactions on Computers
By Hanhua Chen, Jun Yan, Hai Jin, Yunhao Liu, Lionel M. Ni
Issue Date:July 2010
pp. 969-980
Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy. Precomputing term-set-based index can significantly reduce the cost but needs expon...
 
BloomCast: Efficient Full-Text Retrieval over Unstructured P2Ps with Guaranteed Recall
Found in: Cluster Computing and the Grid, IEEE International Symposium on
By Hanhua Chen, Hai Jin, Xucheng Luo, Yunhao Liu, Lionel M. Ni
Issue Date:May 2009
pp. 52-59
Efficient and effective full-text retrieval in unstructured peer-to-peer networks remains a challenge in the research community. First, it is difficult, if not impossible, for unstructured P2P search protocols to effectively locate items with guaranteed re...
 
MDS: Efficient Multi-dimensional Query Processing in Data-Centric WSNs
Found in: Real-Time Systems Symposium, IEEE International
By Hanhua Chen, Mo Li, Hai Jin, Yunhao Liu, Lionel M. Ni
Issue Date:December 2008
pp. 355-364
Geographical hash table (GHT) has been widely used to provide energy efficiency for data-centric stor-age in wireless sensor networks. Such a mechanism, however, suffers from high communication cost when we apply multi-dimensional event search in the net-w...
 
Difficulty-Aware Hybrid Search in Peer-to-Peer Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni
Issue Date:January 2009
pp. 71-82
By combining an unstructured protocol with a DHT-based index, hybrid Peer-to-Peer (P2P) improves search efficiency in terms of query recall and response time. The key challenge in hybrid search is to estimate the number of peers that can answer a given que...
 
DHT-assisted probabilistic exhaustive search in unstructured P2P networks
Found in: Parallel and Distributed Processing Symposium, International
By Xucheng Luo, Zhiguang Qin, Jinsong Han, Hanhua Chen
Issue Date:April 2008
pp. 1-9
Existing replication strategies in unstructured P2P networks, such as square-root principle based replication, can effectively improve search efficiency. How to get optimal replication strategy, however, is not trivial. In this paper we show, through mathe...
 
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
Found in: Parallel Processing, International Conference on
By Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni
Issue Date:September 2007
pp. 6
By combining an unstructured protocol with a DHT-based global index, hybrid Peer-to-Peer (P2P) improves search efficiency in terms of query recall and response time. The key challenge in hybrid search is to estimate the number of peers that can answer a gi...
 
Identifying Community Structure in Semantic Peer-to-Peer Networks
Found in: Semantics, Knowledge and Grid, International Conference on
By Hanhua Chen, Hai Jin
Issue Date:November 2006
pp. 25
The research community has turned to create Semantic Overlay Networks for information retrieval in large scale peer-to-peer networks. Much research work in semantic overlay protocols and searching algorithms is done and their results indicate that semantic...
 
Peer-Tree: A Hybrid Peer-to-Peer Overlay for Service Discovery
Found in: Advanced Information Networking and Applications, International Conference on
By Jing Tie, Hai Jin, Shengli Li, Xuanhua Shi, Hanhua Chen, Xiaoming Ning
Issue Date:April 2006
pp. 999-1004
Efficient service discovery in dynamic, crossorganizational is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations to the problem. Tree topology of organizations is easily managed but the root i...
 
Boundary Chord: A Novel Peer-to-Peer Algorithm for Replica Location Mechanism in Grid Environment
Found in: Parallel Architectures, Algorithms, and Networks, International Symposium on
By Hai Jin, Chengwei Wang, Hanhua Chen
Issue Date:December 2005
pp. 262-267
The emerging grids need an efficient replica location mechanism. In the experience of developing 1 ChinaGrid Supporting Platform (CGSP), a grid middleware that builds a uniform platform supporting multiple grid-based applications, we meet a challenge of ut...
 
Semantic-Overlay-Driven Web Services Discovery
Found in: Semantics, Knowledge and Grid, International Conference on
By Hao Wu, Hai Jin, Hanhua Chen
Issue Date:November 2005
pp. 9
There are many common characteristics between Web Service (WS) and Peer-to-Peer (P2P) computing environment. Therefore, carrying out web service over P2P network can utilize the advantages of P2P to achieve the services integration and resource selfgovernm...
 
HRIC: Hybrid Resource Information Service Architecture Based on GMA
Found in: E-Business Engineering, IEEE International Conference on
By Hongbo Zou, Hai Jin, Zongfen Han, Xuanhua Shi, Hanhua Chen
Issue Date:October 2005
pp. 541-544
<p>Resource information service, as a key component of grid, is the basis of the resource allocation, resource performance evaluation and prediction. The validity of the resource information service directly influences the availability of the whole s...
 
Q-SAC: toward QoS optimized service automatic composition
Found in: Cluster Computing and the Grid, IEEE International Symposium on
By Hanhua Chen, Hai Jin, Xiaoming Ning, Zhipeng Lu
Issue Date:May 2005
pp. 623-630
The emerging service grids bring together various distributed services to a 'market' for clients to request and enable the integration of services across distributed, heterogeneous, and dynamic virtual organizations. In the experience of constructing and u...
 
Efficient multi-keyword search over p2p web
Found in: Proceeding of the 17th international conference on World Wide Web (WWW '08)
By Hai Jin, Hanhua Chen, Jiliang Wang, Lei Chen, Lionel M. Ni, Yunhao Liu
Issue Date:April 2008
pp. 1-7
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and useful in many real applications. Simply using the solution for single keyword s...
     
Efficient search for peer-to-peer information retrieval using semantic small world
Found in: Proceedings of the 15th international conference on World Wide Web (WWW '06)
By Hai Jin, Hanhua Chen, Xiaomin Ning
Issue Date:May 2006
pp. 1003-1004
This paper proposes a semantic overlay based on the small world phenomenon that facilitates efficient search for information retrieval in unstructured P2P systems. In the semantic overlay, each node maintains a number of short-range links which are semanti...
     
Efficient query routing for information retrieval in semantic overlays
Found in: Proceedings of the 2006 ACM symposium on Applied computing (SAC '06)
By Hai Jin, Hanhua Chen, Xiaomin Ning, Zuoning Yin
Issue Date:April 2006
pp. 1669-1673
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically similar peers form a semantic overlay network and a query can be routed or f...
     
 1