<p>Now a days mobile ad hoc networks MANETs play a vital role in tremendous communication applications. This networks require infrastructure less module in non- centralized application’s area. Low battery power is of great concern to sustain for a long time, thus researchers try to assist in this critical maintenance point. This work proposed an enhanced version of well-known compression technique LZW to reduce data communication and maintain battery life. Compressed-LZW is a technique to code data stream into further compact form by merging successive redundant compressed code, and achieved by padding the code stream with the displacement of the next similar code. Compressed-LZW outperform its successor in saving consumed energy as expressed in the implementation and results by generating less output codes.</p>

<p>Cloud computing has become a revolutionary computing model which provides an economical and flexible strategy for resource sharing and data management. Due to privacy concerns, sensitive data has to be encrypted before being uploaded to the cloud servers. Over the last few years, several keyword searchable encryption works have been described in the literature. However, existing works mostly focus on secure searching using keyword and only retrieve Boolean results that are not yet adequate. On the other hand, poor-resources of mobile networks play an important role on all applications area nowadays. Mobile nodes mostly act as information retrieval end which make it important to address this problem. In this paper, we present a secure keyword search scheme based on the Bloom filter(SKS-BF), which enhances the system’s usability by allowing ranking based on the relevance score of the search results and retrieves the top most relevant files instead of retrieving all the files. Further, the Bloom filter (BFs) can accelerate a search process involving a large number of keywords. Extensive experiments and network simulation confirm the efficiency of our proposed schemes.</p>

The success of distributed multimedia traffic presents many challenges to the network designer, certain bandwidth as well as bounds on delay, loss probability and jitter in order to maintain reception quality are issues of Constraint Base Routing (CBR). Flow routing requires deterministic path coordination in comparison with data routing. This paper presents a new technique for best CBR-rout path computation using genetic algorithm. Available bandwidth, delay jitter, and path availability are the fitness function, the genetic algorithm try to optimize. Source routed packets were established to hold the complete elected path in packet header. All studies made on NS2 simulator, where SARBE approach for rapid on-line estimation of available bandwidth shows performance optimization on OSPF algorithm for multimedia streaming applications.