Learn More
—Event matching is a critical component of large-scale content-based publish/subscribe systems. However, most existing methods suffer from a dramatic performance degradation when the system scales up. In this paper, we present TAMA (TAble MAtch), a highly efficient content-based event matching and forwarding engine. We consider range-based attribute(More)
—The adoption of portable wireless devices is rapidly rising. The demand for efficient communication protocols amongst these devices is pressing. In this paper, we present a content-based publish-subscribe system, called B-SUB (Bloom-filter-based pub-SUB system), for the networks formed by human-carried wireless devices, which are called human networks(More)
The buzz-word big-data refers to the large-scale distributed data processing applications that operate on exceptionally large amounts of data. Google's MapReduce and Apache's Hadoop, its open-source implementation, are the defacto software systems for big-data applications. An observation of the MapReduce framework is that the framework generates a large(More)
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communication. In this paper, we present a new scheduling method called virtual backbone scheduling (VBS). VBS employs heterogeneous scheduling, where backbone nodes work with duty-cycling(More)
—Content-based publish/subscribe overlay is gaining popularity in large-scale content distribution applications for its flexibility and anonymity. Since such overlays are built on top of diverse infrastructures, minimizing the cost of using network resources in the overlays is challenging. In this paper, we tackle the problem using a combinatorial(More)
—Position-based routing protocols use location information to refine the traditional packet flooding method in mobile ad hoc networks. They mainly focus on densely and evenly distributed network scenarios, but their performances degrade quickly as networks become sparse. To overcome these shortcomings, we introduce the network density concept in the routing(More)
—This paper studies the sleep scheduling problem for large scale wireless sensor networks (WSNs), which have hundreds to thousands of sensors. Sensors are extremely sensitive to energy consumption because they are powered by batteries. In this paper, we propose stochastic sleep scheduling, a generic duty-cycling scheduling method based on stochastic theory.(More)
—The wide use of mobile devices gives rise to many novel network applications, which require an efficient communication substrate. These networks, which are comprised solely of human-carried mobile devices, are called human networks (HUNETs). In this paper, we present ZigZag, a content-based publish/subscribe (CBPS) architecture for HUNETs. We deem that(More)