PowerNap: An Energy Efficient MAC Layer for Random Routing in Wireless Sensor Networks

Abstract
Idle-listening is the biggest challenge for energy efficiency and longevity of multihop wireless sensor network (WSN) deployments. While existing coordinated sleep/wakeup scheduling protocols eliminate idle-listening for simple traffic patterns, they are unsuitable to handle the complex traffic patterns of the random routing protocols. We present a novel coordinated sleep/wakeup protocol POWERNAP , which avoids the overhead of distributing complex, large sleep/wakeup scheduling information to the nodes. POWERNAP piggybacks onto the relayed data packets the seed of the pseudo-random generator that encodes the scheduling information, and enables any recipient/snooper to calculate its sleep/wakeup schedule from this seed. In essence, POWERNAP trades off doing extra computation in order to avoid expensive control packet transmissions.

An Abuse-Free Fair Contract-Signing Protocol Based on the RSA Signature

Abstract
Afair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a fair way, so that either each of them obtains the others signature, or neither party does. Based on the RSA signature scheme, a new digital contract signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property abuse-freeness. That is, if the protocol

is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contractsigning protocol based on the RSA signature, and show that it is both secure and efficient.

On demand Temporary Route Recovery for Frequent Link Failures in Adhoc Networks
Abstract
Adhoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of existing network infrastructure or centralized administration. Each node acts as a router by itself and forwards all the packets which it receives. There is a frequent link failure in adhoc Networks, which causes packet to be lost or packets doubt to reach destination. In this scenario a different mechanism and a scheme is proposed and implemented to make the important time critical data like real time or voice data to reach the destination without any loss. The mechanism used is a special propagation which propagates a unique kind of route discovery for real time application scenario to send the time critical data safely. The scheme used is temporary path between the nodes during link failure. The important node then forwards the buffered packets to the destination without any loss which is on-demand based on type of information a node forwards. Special buffer is allocated for the nodes marked important during special propagation.

A Secure and Power Efficient Routing Scheme for Ad Hoc Networks

ABSTRACT A recent trend in Ad Hoc network routing is the reactive on demand philosophy where routes are established only when required. Security and Power efficiency are the major concerns in this field. This paper is an effort to combine these factors of security and power to achieve more reliable routing. Most of the protocols in this category are either incorporating security features or considering power factor. In the study no existing protocol is merging the two factors to see results. The ad hoc environment is accessible to both legitimate network users and malicious attackers. The ad hoc environment has the constraint of power factor. The proposed scheme is intended to incorporate both factors on existing protocols. The study will help in making protocol more robust against attacks and implementing power factor to achieve stable routing in routing protocols

Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems

Abstract
Although anonymizing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many systems try to mask the identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based: peers have to pre-construct an anonymous path before transmission. The overhead of maintaining and updating such paths is significantly high. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymity protocol for decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of lower overhead by mainly using the symmetric cryptographic algorithm. We conduct comprehensive

trace-driven simulations to evaluate the effectiveness and efficiency of this design, and compare it with previous approaches. We also introduce some early experiences on RR implementations.

Fuzzy Keyword Search over Encrypted Data in Cloud Computing

Abstract
As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. For the protection of data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a very challenging task. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords and selectively retrieve files of interest, these techniques support only exact keyword search. That is, there is no tolerance of minor typos and format inconsistencies which, on the other hand, are typical user searching behavior and happen very frequently. This significant drawback makes existing techniques unsuitable in Cloud Computing as it greatly affects system usability, rendering user searching experiences very frustrating and system efficacy very low. In this paper, for the first time we formalize and solve the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy. Fuzzy keyword search greatly enhances system usability by returning the matching files when users searching inputs exactly match the predefined keywords or the closest possible matching files based on keyword similarity semantics, when exact match fails. In our solution, we exploit edit distance to quantify keywords similarity and develop an advanced technique on constructing fuzzy keyword sets, which greatly reduces the storage and representation overheads. Through rigorous security analysis, we show that our proposed solution is secure and privacy-preserving, while correctly realizing the goal of fuzzy keyword search.

Client-side Load Balancer using Cloud

ABSTRACT Web applications' traffic demand fluctuates widely and unpredictably. The common practice of provisioning a fixedcapacity would either result in unsatisfied customers (underprovision) or waste valuable capital investment (overprovision). By leveraging an infrastructure cloud's ondemand,pay-per-use capabilities, we finally can match the capacity with the demand in real time. This paper investigates how we can build a large-scale web server farm in the cloud. Our performance study shows that using existing cloud components and optimization techniques, we cannot achieve high scalability. Instead, we propose a client-side load balancing architecture, which can scale and handle failure on a milli-second time scale. We experimentally show that our architecture achieves high throughput in a cloud environment while meeting QoS requirements.