No abstract

This paper reports the studies related to scalability of network size on our newly proposed routing protocol, Genetic Zone Routing Protocol (GZRP) for Mobile Ad hoc Networks (MANETs). This protocol applies Genetic Algorithms (GA) to Zone Routing Protocol (ZRP) for finding a limited set of multiple alternative routes to the destinations, in order to provide load balancing and fault tolerance during node/link failure by using the routing database available with the border nodes. There are some scalability studies on ZRP based on various environmental factors like Packet Delivery Ratio (PDR), Total overhead and Delay by varying the mobility of the nodes in an ad hoc network. This paper produces the results of studies related scalability of a network with GZRP, by varying the number of nodes.

The existing reactive routing algorithms in Mobile Ad-hoc Networks (MANETs) generally send route request packet to all the neighbor nodes when it needs to find the destination. This greatly reduces the performance of network and consumes much of the bandwidth. The existing routing algorithms such as Ad-hoc On-demand Routing Algorithm (AODV) and Dynamic Source Routing (DSR) are suitable for networks with frequent changing topology. In this paper we propose a technique to reduce broadcasting by finding equivalence classes based on rough set concept among the neighbors of a source node. This protocol tries to establish a long term valid path from source node to destination node. This means the protocol is of more use full in several applications such as multimedia and video conferences.

No abstract

No abstract

No abstract

Confidentiality in third party services like cloud computing has become a major concern. IT industry and government organizations are very serious about security factor in cloud computing, because its usage has reached all the way from a common man having a mobile phone to large scale business enterprises. In this paper, we present security threats in social and business applications accessing the data stored in cloud computing scenario. Also, we critically discuss homomorphic encryption and CryptDB schemes which are applicable to protect data from malicious third party service environments (cloud computing) and also from insiders for these applications. We also present empirical results of partial homomorpic encryption algorithms over one lakh 10-digit numbers, using Linux virtual machine on VirtualBox, VMPlayer and KVM. The result for four algorithms (namely Paillier, ElGamal, RSA and Benaloh) as performed on the above four different platforms are computed to show their respective overhead values as compared to plain data operations. In case of Paillier Algorithm the overhead is 17, 15, 22 and 12 times for addition operation and 278, 399,518 and 346 times for multiplication operation respectively. Similarly, in case of Elgamal algorithm 1.72, 1.6, 11.7 and 8.9 times for multiplication operation; in case of RSA algorithm 1.79, 1.5, 3.48 and 1.5 times for multiplication operation and in case of Benaloh algorithm is 5.6, 5.36, 5.48 and 3.5 times for addition operation respectively. These performances clearly indicate that these algorithms are quite feasible enough to be used in context of social and business applications by third party service providers

No abstract