Chandan Koner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chandan Koner has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Subrata Paul
Brainware University
4 shared publications - Anirban Mitra
Eastern International University
3 shared publications - Raj Kumar Samanta
Dr. B C Roy Engineering College
2 shared publications - Anup Kumar Das
Dr. B. C. Roy Engineering College/MCA/ECE
1 shared publication - Pronaya Bhattacharya
Amity University
1 shared publication - Pushan Kumar Dutta
Amity University
1 shared publication
Latest Publications
- 2 January 2026
- Published by Springer Nature
- p. 309-320
Localized Decision-Making in Dynamic Social Networks Using Neighborhood Volatility and Temporal Influence
- 2 January 2026
- Published by Springer Nature
- p. 309-320
Localized Decision-Making in Dynamic Social Networks Using Neighborhood Volatility and Temporal Influence
- Open Access
- 14 December 2025
- Published by Institute of Central Computation and Knowledge Inc. in Next-Generation Computing Systems and Technologies
- Vol. 1 (2) , 79-90
A Review on Privacy and Security in Dynamic Social Networks: Techniques, Challenges, and Future Directions
Owing to their dynamic user interactions, ever-changing structure, and real-time content changes, dynamic social networks pose significant privacy and security risks. The state of security and privacy-preserving techniques in these developing platforms is thoroughly examined in this study. We highlight the benefits and drawbacks of various approaches as we review recent studies on privacy-preserving tactics, security updates, and anonymisation methods. Important findings indicate that present approaches often fail in dynamic situations, even when they operate well in static network conditions. Beyond common problems, we also point out important security aspects influenced by hierarchical systems and community formation. While hierarchical positions like leaders and influencers are high-value targets for adversaries, communities can hasten the dissemination of false information or coordinated attacks while also promoting trust and connection. Important topics including scalability, privacy, information sharing, and identity and access management are also covered. The need for adaptable, scalable, and context-aware security solutions that can handle the complexity of dynamic social networks is emphasised in the paper's conclusion, which also outlines open issues and future research directions.
- 14 December 2025
- Published by Institute of Central Computation and Knowledge Inc. in Next-Generation Computing Systems and Technologies
- Vol. 1 (2) , 79-90
Open AccessA Review on Privacy and Security in Dynamic Social Networks: Techniques, Challenges, and Future Directions
Owing to their dynamic user interactions, ever-changing structure, and real-time content changes, dynamic social networks pose significant privacy and security risks. The state of security and privacy-preserving techniques in these developing platforms is thoroughly examined in this study. We highlight the benefits and drawbacks of various approaches as we review recent studies on privacy-preserving tactics, security updates, and anonymisation methods. Important findings indicate that present approaches often fail in dynamic situations, even when they operate well in static network conditions. Beyond common problems, we also point out important security aspects influenced by hierarchical systems and community formation. While hierarchical positions like leaders and influencers are high-value targets for adversaries, communities can hasten the dissemination of false information or coordinated attacks while also promoting trust and connection. Important topics including scalability, privacy, information sharing, and identity and access management are also covered. The need for adaptable, scalable, and context-aware security solutions that can handle the complexity of dynamic social networks is emphasised in the paper's conclusion, which also outlines open issues and future research directions.
- 8 October 2025
- Published by Springer Nature in The Review of Socionetwork Strategies
- Vol. 19 (2) , 325-362
Unravelling the Dynamics of Academic Collaboration: A Graph-Based Data-Driven Approach
- 8 October 2025
- Published by Springer Nature in The Review of Socionetwork Strategies
- Vol. 19 (2) , 325-362
Unravelling the Dynamics of Academic Collaboration: A Graph-Based Data-Driven Approach
- 12 May 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 34 (11)
Community-Driven Shortest Path Optimization Framework for Vaccine Delivery in Social Community Networks
The Shortest Path (SP) problem is applicable to a wide range of applications pertaining to knowledge propagation, weighted social networks, and others. Conventional shortest path algorithms, such as Dijkstra’s and Bellman–Ford’s, are ineffective in a weighted social network, or community-driven networks, where relationships and interactions are often dynamic, leading to continuously evolving network structures. Additionally, in such networks, the significance of specific nodes or communities may change over time, further complicating the task of identifying the shortest path. Motivated by the limitation, Clique Percolation and Monte Carlo-based Shortest Path (CP-MCBSP) framework has been proposed, applicable to vaccine delivery network model. The proposed CP-MCBSP algorithm integrates clique percolation and Monte Carlo techniques for identifying communities and shortest path computation. Clique sizes are adjusted for community exploration, and Monte Carlo simulations are used for the best route selection. The algorithm’s uniqueness stems from its combination of community-based knowledge and unpredictable assessments, which enables effective navigation in complex networks with overlapping communities. The optimal choice of paths determined by Monte Carlo improves durability in dynamic conditions in networks. In comparison to current shortest path algorithms, CP-MCBSP offers a 7.04% boost in computational efficiency, and a 5.28% reduction in approximation error. The integrated difficulties of community discovery and shortest possible route compositions were employed in road network datasets from California, San Francisco, and West Bengal. The findings show that the proposed technique outperforms previous strategies in this particular area.
- 12 May 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 34 (11)
Community-Driven Shortest Path Optimization Framework for Vaccine Delivery in Social Community Networks
The Shortest Path (SP) problem is applicable to a wide range of applications pertaining to knowledge propagation, weighted social networks, and others. Conventional shortest path algorithms, such as Dijkstra’s and Bellman–Ford’s, are ineffective in a weighted social network, or community-driven networks, where relationships and interactions are often dynamic, leading to continuously evolving network structures. Additionally, in such networks, the significance of specific nodes or communities may change over time, further complicating the task of identifying the shortest path. Motivated by the limitation, Clique Percolation and Monte Carlo-based Shortest Path (CP-MCBSP) framework has been proposed, applicable to vaccine delivery network model. The proposed CP-MCBSP algorithm integrates clique percolation and Monte Carlo techniques for identifying communities and shortest path computation. Clique sizes are adjusted for community exploration, and Monte Carlo simulations are used for the best route selection. The algorithm’s uniqueness stems from its combination of community-based knowledge and unpredictable assessments, which enables effective navigation in complex networks with overlapping communities. The optimal choice of paths determined by Monte Carlo improves durability in dynamic conditions in networks. In comparison to current shortest path algorithms, CP-MCBSP offers a 7.04% boost in computational efficiency, and a 5.28% reduction in approximation error. The integrated difficulties of community discovery and shortest possible route compositions were employed in road network datasets from California, San Francisco, and West Bengal. The findings show that the proposed technique outperforms previous strategies in this particular area.
- 23 July 2023
- Published by Springer Nature
- p. 243-254
Secure Encryption Using Bit Shuffling