• Publications
  • Influence
Hierarchical attribute-based encryption for fine-grained access control in cloud storage services
This paper proposes a scheme to help enterprises to efficiently share confidential data on cloud servers by first combining the HIBE system and the ciphertext-policy attribute-based encryption (CP-ABE) system, and then making a performance-expressivity tradeoff.
DRBTS: Distributed Reputation-based Beacon Trust System
Wireless sensor networks (WSNs) have critical applications in diverse domains like environmental monitoring and military operations where accurate location of sensors is vital. One common method of
Robust Network Traffic Classification
The proposed RTC scheme has the capability of identifying the traffic of zero-day applications as well as accurately discriminating predefined application classes and is significantly better than four state-of-the-art methods.
LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks
  • Feng Li, Jie Wu
  • Computer Science
    6th Annual IEEE Communications Society Conference…
  • 22 June 2009
This work presents LocalCom, a community-based epidemic forwarding scheme that efficiently detects the community structure using limited local information and improves the forwarding efficiency based on theCommunity structure, to utilize the social network properties to facilitate packet forwarding.
The Dynamic Bloom Filters
This work proposes dynamic Bloom filters to represent dynamic sets, as well as static sets and design necessary item insertion, membership query, item deletion, and filter union algorithms.
On Maximizing the Lifetime of Wireless Sensor Networks Using Virtual Backbone Scheduling
This paper presents a novel sleep-scheduling technique called Virtual Backbone Scheduling (VBS), designed for WSNs has redundant sensor nodes, and proposes approximation algorithms based on the Schedule Transition Graph (STG) and Virtual Scheduling Graph (VSG).
Social feature-based multi-path routing in delay tolerant networks
This paper uses the internal social features of each node in the network to perform the routing process, and offers two special multi-path routing schemes: node-disjoint-based routing and delegation- based routing.
QoI-Aware Multitask-Oriented Dynamic Participant Selection With Budget Constraints
Real and extensive trace-based simulations show that the proposed dynamic participant selection strategy can achieve far better QoI satisfactions for all tasks than selecting participants randomly or through the reversed-auction-based approaches.
Theory and Network Applications of Dynamic Bloom Filters
This paper proves that DBF can control the false positive probability at a low level by adjusting the number of standard bloom filters used according to the actual size of current dynamic set, and presents multidimension dynamic bloom filters (MDDBF) to support concise representation and approximate membership queries of dynamic sets in multiple attribute dimensions.