This paper tackles a critical issue emerging when planning the deployment of a wireless network in rural regions: the cost estimation. Wireless Networks have usually been presented as a cost-effective solution to bridge the digital divide between rural and urban regions. But this assertion is too general and does not give an insight about the real estimation of the deployment cost of such an infrastructure. Providing such a cost estimation framework may help to avoid underestimation or overestimation of required resources since the budget is almost always limited in rural regions. This work extends the Probabilistic Cost Model (PCM) that has been proposed. This model does not take into account the difference in the costs of unexpected events. To extend the PCMfirst, a list of unexpected events that can occur when deploying Wireless Networks has been established. This list is based on data from past projects and a set of unexpected events that can occur. Afterwards, the standard deviation and the average have been computed for each unexpected event. The Poisson process has been therefore used to predict the number of unexpected events that may occur during the network deployment. This approach led to the proposal of a model that gives an estimation of the total cost of contingencies, which takes into account the probability that the total cost of unexpected events does not exceed a given contingency. The evaluation of the proposed model on a given dataset provided a good accuracy in the prediction of the cost induced by unexpected events.

Cloud computing acts as rising evolution in Information Technology (IT), boosting the delivery of services and eye-catching returns to its tenants enrolled at low costs of per usage basis. Cloud computing means “everywhere” and provides enormous available resources via internet with ensured quality. With the numerous profits involved, it clears the viewpoint of various businesses to invest in cloud services for accomplishment of their needs in the cloud habitat. Cloud enables computing resources in a service oriented flair instead of burden with lags in traditional setup of unified architecture. With delivery of cloud services occur many obstacles in the cloud to work securely without downfall in its performance. Security has always emerged as a long handed concern with its progression which affects its virtuous implementation. We commence with aspect of security based on parameters named Confidentiality (C), Integrity (I) and Granular Access (GA) and then sent over a secure channel via Secure File Transfer Protocol (SFTP) for secure storage with Elliptic Curve Cryptography (ECC) encryption laid on data. Secure Hash Algorithm (SHA) is used for hash value generation maintaining integrity. The authentication mechanism of secure Graphical One Time Password (GOTPass) provides high end to end security for retrieval process and boost security appliance for data. Data is divided into three security levels as per Secure Quality Index (SQI) generated and storage is isolated to have different security aspects. It provides supplemental controlled security and data protection as associated with the file. User is responsive to pass all security mechanisms to gain access.

Knowledge processing is the prime area of information retrieval in the current era. However knowledge is subjected to the meaning of discretion in any natural language. Intelligent search in various Natural Languages is required in the huge repository of information available online. Language is the integral part for any form of communication but the language has to be meaningful. Semantics is a field of linguistics that deals with the meaning of the linguistic expressions through discovery of knowledge. In this research paper, the dictionary based approach for semantics is studied and implemented. The dictionary based proposal relies on the formalization of sentence across SVO (Subject-Verb-Object) format. Rule-based classifier helps to define the rules that are checked against the dictionary which contains sequence of Subject, Verbs and Object available in English Language. By looking at the accuracy measures, recall and precision the results obtained by the proposed approach is proven good.

Cloud computing is an emerging technology which provides unlimited access of versatile resources to users. The multifaceted and dynamic aspects of cloud computing require efficient and optimized techniques for resource provisioning and load balancing. Cloud monitoring is required identifying overutilized and underutilized of physical machines which hosting Virtual Machines (VMs). Load balancing is necessary for efficient and effective utilization of resources. Most of the authors have taken the objective to reduce the makespan for executing requests on multiple VMs. In this paper, a thorough review on scheduling and load balancing techniques has been done and different techniques have been analyzed on the basis of SLA Violations, CPU utilization, energy consumption and cost parameters.

Caching is a very important issue in distributed web system in order to reduce access latency and server load. A request is a hit if it is available in the cache and if not then it will fetch from the server in order to cache and serve the request. Researches have shown that generic algorithms of caching can increase hit rate up to 40−50%, but adding prefetching scheme can increase this rate to 20%. Prefetching is a technique to fetch documents before they are requested. This paper proposes a process model for prefetching named HitBand which will balance hit rate bandwidth in every scenario with the combination of “Roulette-wheel selection”. Roulette-wheel selection is a very popular selection based algorithm which selects objects according to their fitness. We have compared our HitBand with the generic algorithms of prefetching like prefetching by popularity, apl characteristic, good Fetch and lifetime. Generic algorithms did not take web object size into consideration and in limited bandwidth scenario object size has a big impact on bandwidth consumption. Though prefetching by lifetime algorithm shows little concern about bandwidth consumption by getting the object with changes happening less frequently but this compromises the hit rate. But our proposed HitBand not only considers bandwidth but also hit rate during prefetching. Performance evaluation of HitBand along with other algorithms is provided in our paper. We have tested our HitBand with the testing engine which is built using JavaScript and maintained under AngularJS framework. From the performance evaluation, our HitBand shows better results both in high and low bandwidth.

In this paper the results are evaluated on a conventional modulation system. Here the system of communication is presented by modeling and analysis and the results so calculated are presented. The approach made in this paper is solely based on initial description which includes a combinational approach of spatial diversity well represented by OSTBC (Orthogonal Space Time Block Codes) encoder and combiner. Next the system of OSTBC encoder and combiner are put together in a MIMO(Multiple Input Multiple Output) channel using Rayleigh and Rician channel coupled with white Gaussian channel. In modeling of such systems interleavers and encoders are also used that helps to identify the performance with simple model without these techniques. In overall system the methodical approach using Multiple Input Multiple Output antenna with the modulator, encoder and interleaver is analyzed and the resultant bit error rate has been identified. The simulation platform is MATLAB and SIMULINK in which communication block sets are used. Alamouti’s and 4x4 MIMO antennas are used and hence performance so evaluated is delivered. Best results are found when number of antennas increases using Interleaver and modulation or only with modulation techniques.