BCBharanidharan Chandrakasan

Bharanidharan Chandrakasan

*This is an algorithmically generated author record based on publicly available information.

Bharanidharan Chandrakasan has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Real-time face detection and local binary patterns histograms based face recognition on Raspberry Pi with OpenCV

    by Bharanidharan Chandrasekaran, D. Karunkuzhali, V. Kandasamy, M. Dillibabu, K. Rama Devi

    This paper presents a practical end-to-end paper demonstrating real-time face recognition using a Raspberry Pi and open source computer vision library (OpenCV) consisting of three main stages: training the recognizer, real-time recognition, and face detection and data gathering. The paper offers a comprehensive guide for enthusiasts venturing into computer vision and facial recognition. Employing the Haar Cascade classifier for accurate face detection and the local binary patterns histograms (LBPH) face recognizer for robust training and recognition, the paper ensures a thorough understanding of key concepts. The step-by-step process covers software installation, camera testing, face detection, data collection, training, and real time recognition. With a focus on the Raspberry Pi platform, this paper serves as an accessible entry point for exploring facial recognition technology. Readers will gain insights into practical implementation, making it an ideal resource for learners and hobbyists interested in delving into the exciting realm of computer vision.

  • Open Access

    Approximate Q-Learning-based (AQL) Network Slicing in Mobile Edge-Cloud environments for Delay-sensitive Services Using Markov Decision Process

    by Chandrakasan Bharanidharan, Subramanian Malathi, V Sathya, M Rajakumaran

    Network slicing in mobile edge-cloud environments has gained significant attention due to its ability to provide customized network services tailored to the specific requirements of different applications. However, ensuring efficient resource allocation and meeting the tough delay requirements of delay-sensitive services remain major challenges in network slicing. In this paper, we propose an Approximate Q-Learning-based (AQL) approach for network slicing in mobile edge-cloud systems, specifically targeting delay-sensitive services. The AQL approach utilizes Q-Learning, a reinforcement learning technique, to optimize resource allocation and decision-making in network slicing. By formulating the resource allocation problem as a Markov Decision Process (MDP), the proposed AQL model learns to make intelligent decisions on resource allocation to minimize delays and maximize resource utilization. The model takes into account various factors such as network congestion, service priority, and available resources to dynamically adapt the network slice configuration. To evaluate the performance of the AQL approach, we conducted extensive simulations comparing it with traditional resource allocation methods. The results demonstrate that the AQL-based network slicing approach effectively reduces delay and improves resource utilization, outperforming conventional methods. The approach also demonstrates its adaptability to dynamic network conditions and varying service requirements. Furthermore, we investigate the impact of different factors on the AQL model's performance, such as the number of network slices, resource availability, and service priority. Our analysis provides valuable insights into the optimal configuration and operation of network slicing for delay-sensitive services. Overall, this paper contributes to the field of network slicing in mobile edge-cloud systems by introducing an AQL-based approach that efficiently addresses the resource allocation challenges for delay-sensitive services. The proposed approach offers a flexible and intelligent solution that can be applied in real-world scenarios, enabling network operators to provide reliable and high-performance network services for a variety of delay-sensitive applications.

  • Open Access

    A Fault tolerant Multimedia Cloud Framework to guarantee Quality of Experience (QoE) in Live Streaming

    by Preetha Evangeline, Bharanidharan Chandrakasan, Vetri Selvan M, Anandhakumar Palanisamy

    The massive scale of Cloud computing has enabled the popularity of the internet and growth of multimedia streaming. Live streaming applications have greatly benefitted on deploying it in the cloud environment due to its abundant availability of resources and features that handle scalability with agility. Managing Device heterogeneity is critical and affects user experience drastically. Response time and bandwidth are other issues to be focused on. The streaming services involve both desktop users and mobile users. High-definition video applications are often challenging for mobile devices due to their limited processing capability and bandwidth-constrained network connection. Cloud computing environments are elastic in nature which balances the load according to the fluctuations in the network. It is also easy to re-commission the required services in case of failures. But downgrade of services is possible. The reasons for the downgrade of services are many however hardware failure is one of the chief causes and queue overflow during re-commissioning is another. Whatever the cause, the effect of downgrade is drastic on the customer. To meet up with the problem of resource allocation, bandwidth allocation and fault tolerance issues and at the same time to guarantee the desired level of Quality of Experience (QoE) to the end-users, an entire framework is proposed with novel algorithms for all the addressed issues. The resource allocation, performed at the cloud end needs to be dynamic. Our framework incorporates the proposed Guess Fit algorithm to provision virtual machines dynamically based on priority scores calculated using probabilities as a result of the combined Naïve Bayes algorithm with association rule mining. The scores also take into account the hit ratios and the penalty values. It is found to perform better than the existing Fit algorithms. On the client end, an efficient cluster bandwidth allocation algorithm (CBA algorithm) is proposed to share bandwidth resources among the fixed device and the mobile devices in a cluster. The framework also incorporates a switching table-based fault tolerance module. The switching table is entirely built based on AND-OR logic and help in desktop migration for uninterrupted streaming.

  • Open Access

    A Reliable Cloud Communication System Using Attribute-Based Cryptography

    by Bharanidharan Chandrakasan, Sathya V, Malathi Subramanian, Rajakumaran M

    Cloud communication systems are increasingly being used to store and exchange sensitive information. However, ensuring the confidentiality and integrity of data in the cloud remains a significant challenge. Attribute-based cryptography (ABC) has emerged as a promising solution for secure cloud communication. It allows data to be encrypted and accessed based on a set of user-defined attributes. This paper proposes a reliable cloud communication system that leverages attribute-based cryptography to provide secure and efficient data storage and retrieval. The proposed system employs a hybrid encryption scheme, combining symmetric and attribute-based encryption, to achieve both efficiency and security. Data is first encrypted using symmetric encryption, ensuring fast and secure transmission to the cloud. Then, the symmetric key is encrypted using attribute-based encryption, which enables fine-grained access control and allows only authorized users with specific attributes to decrypt the data. To enhance the reliability and availability of the system, data is replicated across multiple cloud servers using erasure coding. This redundancy ensures data durability and enables efficient data recovery in case of server failures or data corruption. Additionally, the system incorporates secure data deduplication techniques to optimize storage utilization and reduce network bandwidth consumption.