identify security challenges in cloudbased log management. We also try to reduce the overhead of communication in cloud environment using homomorphic encryption scheme
existing methods energy performance are very poor in terms of communication latency and communication overhead. We propose an energy aware end-to-end trust mechanism for IoT healthcare applications ... effectiveness of…
unduly large portion of the total CPU cycles. In the existing approach we face overhead issue of distributed dispatching of task to resource. In our proposed system our main goal ... efficiently schedule computation…
backup coordinator was employed to deal with the problem but it introduced more communication overheads. This paper addresses the problem of transaction blocking while reducing communication overheads using a simulation
time. Moreover, current master node election protocols in MANETs employ a notable wireless communication overhead which consumes a considerable amount of battery power. An Efficient algorithm to overcome battery power…
purposes of maintaining privacy of the individual participating sites, reducing computational complexity and minimizing communication overhead. The proposed method finds global frequent item sets in a distributed…
does not need to maintain the feedback from other CMs, which will reduce the communication overhead and eliminate the possibility of a Eaves Dropping attack by compromised CMs. A source
device networks beneath this sturdy person model and computes a bound on the communication overhead required for achieving a given level of location privacy. It proposes 2 techniques to produce ... location…
environments, where the compact nature of the components cannot support complex computations or high communication overhead. On the other hand, such components should support security applications such as message…
power or non-cryptographic which involves sending the test packet for detection which increases communication overhead as the energy required for transmission of the packet is far more than
cryptosystems and public-key cryptosystems. But it has the limitations of high computational and communication overhead in addition to lack of scalability and resilience to node compromise spells. The proposed
transmission also. The simulation results shows that the detection rate is high and the communication overhead is less compared with other existing algorithms
cube algorithms. In parallel systemsbalancing the load assigned to different processors and minimizing the communication overhead are the core problems for achieving high performance. In this paper we propose
some queries on the encrypted logs without breaching confidentiality or privacy. It reduces the communication overhead between a log monitor and the logging cloud to the most such that
mediator between cloud and end-users. An EIRQ scheme reduces the communication cost and communication overhead. Mask Matrix is used to filter out as what user really wants matched data
unknown node in this algorithm. The algorithm is simple, the nodes without increasing communication overhead during positioning and without hardware extension. Simulation results show that under circumstances of…
neighbors. Due to these procedures this method increases privacy in terms of latency and communication overhead. Through the Simulation and analysis, we exhibit that our proposed method is effective
protocol uses identity based cryptography to secure the reprogramming and also to reduce the communication overhead and storage requirements of each node. After analyzing this protocol, it is found that
paper introduces a SSO mechanism that uses Elliptic Curve Cryptography (ECC) to avoid the communication overheads as well as the workload of both the users and the service providers
environment woks on various metrics such as make span, time, average resource utilization rate, communication overhead, reliability, stability, fault tolerance
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.