S. Indira Gandhi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
S. Indira Gandhi has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Vaidehi Vijayakumar
Mother Teresa Women’s University, Kodaikanal, India
3 shared publications - Arputharaj Kannan
Department of Information Science and Technology, College of Engineering Guindy, Anna University, Chennai, India
2 shared publications - K. Kulothungan
Department of Information Science and Technology, CEG campus, Anna University, Chennai, India
2 shared publications - K. Thangaramya
Department of Information Science and Technology, CEG campus, Anna University, Chennai, India
2 shared publications - Munuswamy Selvi
School of Computer Science and Engineering, Vellore Institute of Technology, Vellore, India
2 shared publications - Sripathi Venkata Naga Santhosh Kumar
School of Computer Science Engineering and Information Systems, Vellore Institute of Technology, Vellore, India
2 shared publications
Latest Publications
- RetractionOpen Access
- 7 August 2024
- Published by Springer Nature in Soft Computing
- Vol. 28 (S1) , 111
Retraction Note: Intelligent fuzzy rule-based approach with outlier detection for secured routing in WSN
- 7 August 2024
- Published by Springer Nature in Soft Computing
- Vol. 28 (S1) , 111
RetractionOpen AccessRetraction Note: Intelligent fuzzy rule-based approach with outlier detection for secured routing in WSN
- 18 February 2022
- Published by Springer Nature in Wireless Personal Communications
- Vol. 125 (1) , 619-635
A Cross Layered Routing Approach for Civil AANET
- 18 February 2022
- Published by Springer Nature in Wireless Personal Communications
- Vol. 125 (1) , 619-635
A Cross Layered Routing Approach for Civil AANET
- 30 January 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (15) , 7401-7422
Toward in-flight Wi-Fi: a neuro-fuzzy based routing approach for Civil Aeronautical Ad hoc Network
- 30 January 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (15) , 7401-7422
Toward in-flight Wi-Fi: a neuro-fuzzy based routing approach for Civil Aeronautical Ad hoc Network
- 26 August 2021
- Published by Springer Nature in Wireless Personal Communications
- Vol. 121 (4) , 3451-3472
An Enhanced Framework for Traffic Load Balancing and QoS Provisioning in SDN
- 26 August 2021
- Published by Springer Nature in Wireless Personal Communications
- Vol. 121 (4) , 3451-3472
An Enhanced Framework for Traffic Load Balancing and QoS Provisioning in SDN
- Retracted
- 23 April 2020
- Published by Springer Nature in Soft Computing
- Vol. 24 (21) , 16483-16497
RETRACTED ARTICLE: Intelligent fuzzy rule-based approach with outlier detection for secured routing in WSN
- 23 April 2020
- Published by Springer Nature in Soft Computing
- Vol. 24 (21) , 16483-16497
RetractedRETRACTED ARTICLE: Intelligent fuzzy rule-based approach with outlier detection for secured routing in WSN
- 21 June 2018
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 78 (2) , 1375-1397
Video stitching using interacting multiple model based feature tracking
- 21 June 2018
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 78 (2) , 1375-1397
Video stitching using interacting multiple model based feature tracking
- 1 January 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 438-443
Dynamic Online Routing in Optical WDM Networks
We try to simulate a new approach to constraint based path selection for dynamic routing in optical networks based on WDM. We are mainly concentrating on shared path protection because it is resource efficient due to the fact that backup paths can share wavelength links when their corresponding working paths are mutually diverse. Considering restoration, our work includes proposal of an online routing algorithm based on link potential value (LPV) to achieve better resource utilization with reduced computational complexity. The main objective is to distribute the traffic evenly across the network in order to reduce the amount of recovery requests under multiple failure scenario. We also arrived recovery time in case of link failure.
- 1 January 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 438-443
Dynamic Online Routing in Optical WDM Networks
We try to simulate a new approach to constraint based path selection for dynamic routing in optical networks based on WDM. We are mainly concentrating on shared path protection because it is resource efficient due to the fact that backup paths can share wavelength links when their corresponding working paths are mutually diverse. Considering restoration, our work includes proposal of an online routing algorithm based on link potential value (LPV) to achieve better resource utilization with reduced computational complexity. The main objective is to distribute the traffic evenly across the network in order to reduce the amount of recovery requests under multiple failure scenario. We also arrived recovery time in case of link failure.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 244-249
Performance Analysis of Modified DORA for Constraint Based WDM Networks
Wave length division multiplexing has emerged as a promising technology for backbone networks. The optical layer based on WDM technology provides optical routing services to the upper layers. We consider large optical networks in which nodes employ wavelength-routing switches and wavelength converters which enable the establishment of wavelength-division multiplexed channels called light paths, between node pairs. We propose a algorithm called modified DORA which solves the routing and wavelength assignment of light paths in such networks. We studied the performance of proposed algorithm for a standard NSFNET for 10 nodes and 15 links and analyzed the blocking probability for various cases. We studied the dynamic routing algorithm. We modified the algorithm to suit for WDM networks. We compare it with the exhaust routing in terms of blocking probability, channel utilization and complexity
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 244-249
Performance Analysis of Modified DORA for Constraint Based WDM Networks
Wave length division multiplexing has emerged as a promising technology for backbone networks. The optical layer based on WDM technology provides optical routing services to the upper layers. We consider large optical networks in which nodes employ wavelength-routing switches and wavelength converters which enable the establishment of wavelength-division multiplexed channels called light paths, between node pairs. We propose a algorithm called modified DORA which solves the routing and wavelength assignment of light paths in such networks. We studied the performance of proposed algorithm for a standard NSFNET for 10 nodes and 15 links and analyzed the blocking probability for various cases. We studied the dynamic routing algorithm. We modified the algorithm to suit for WDM networks. We compare it with the exhaust routing in terms of blocking probability, channel utilization and complexity
- 15 February 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 408-412
Performance Analysis for Constraint Based WDM Networks using Modified DWP Algorithm
In this paper a new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks based on Wavelength Division Multiplexing (WDM) is proposed. The Distributed discovery wavelength path selection algorithm (DWP) proposed in the past takes longer time to select a path even though it is able to solve some conflicting constraint imposed by electronic regenerators. In this work the DWP algorithm has been refined and Modified DWP (MDWP) has been proposed. The proposed algorithm takes a lesser amount of time to select a path and also preserves the advantage of overcoming the conflicting constraints imposed by electronic regenerators. The effectiveness of the proposed approach has been verified through analytical and simulated results for a well known 21 node ARPANET and the approach is shown to effectively accommodate multiple constraints and results reveal that MDWP algorithm converges quickly compared to the DWP algorithm and also provide lesser blocking probability.
- 15 February 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 408-412
Performance Analysis for Constraint Based WDM Networks using Modified DWP Algorithm
In this paper a new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks based on Wavelength Division Multiplexing (WDM) is proposed. The Distributed discovery wavelength path selection algorithm (DWP) proposed in the past takes longer time to select a path even though it is able to solve some conflicting constraint imposed by electronic regenerators. In this work the DWP algorithm has been refined and Modified DWP (MDWP) has been proposed. The proposed algorithm takes a lesser amount of time to select a path and also preserves the advantage of overcoming the conflicting constraints imposed by electronic regenerators. The effectiveness of the proposed approach has been verified through analytical and simulated results for a well known 21 node ARPANET and the approach is shown to effectively accommodate multiple constraints and results reveal that MDWP algorithm converges quickly compared to the DWP algorithm and also provide lesser blocking probability.