A. Damodaram
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
A. Damodaram has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Ch. Suresh Babu
Sree Vaanmayi Institute of Science & Technology
1 shared publicationD. Venkata Reddy
Mahatma Gandhi Institute of Technology, Hyderabad, Telangana, IN
1 shared publicationGanesh Davanam
Sree Vidyanikethan Engineering College (Autonomous), Tirupati, AP. India
1 shared publication- Garlapati Narayana
Associate Professor, Department of CSE (AIML), Chaitanya Bharathi Institute of Technology, Gandipet, Hyderabad, Telangana, India
1 shared publication K. Reddy Madhavi
Sree Vidyanikethan Engineering College (Autonomous)
1 shared publication- Krothapalli Sreenivasa Rao
ICFAI Foundation for Higher Education
1 shared publication
Latest Publications
- 14 November 2022
- Published by Springer Nature
- p. 81-94
Multi-layered Architecture to Monitor and Control the Energy Management in Smart Cities
- 14 November 2022
- Published by Springer Nature
- p. 81-94
Multi-layered Architecture to Monitor and Control the Energy Management in Smart Cities
- Open Access
- 28 April 2022
- Published by Springer Nature in Research Square
Optimization of End-to-end Supply Chain Costs to Maximize Revenue and Profits From Supply Chain Operations
Being aware that the supply chain costs claim a substantial share in the final product cost, organizations, in an effort to improve revenue and increase profitability, should minimize supply chain costs invariably. Besides other costs, supply chain costs vary from time to time depending on the sourcing, transportation, and inventory-related costs. Improving the operational efficiency of the supply chain has become the primary objective for increasing profitability from supply chain operations in present-day context. In reality, supply chain operations are complex with uncertainty predominantly influencing various costs associated with supply chains affecting return on investments and profitability. Supply chain cost optimization should enable the supply chain managers to ensure that the supply chain is ‘responsive’, ‘agile’, and ‘reinvented’ for present and future operations. Optimization of supply chain costs bestows improving operating efficiency that promotes improvements in revenue and increment in profits. The present article aims at considering various supply chains cost parameters such as total operating costs, profit, revenue, logistics costs, and information sharing costs for optimization of supply chain costs using multi-objective optimization. A generic three-stage supply chain model with usual entities like suppliers, manufacturers, and customer zones is assumed in the present article. A trade-off curve among the selected objective function sets and relevant constraints was developed and presented in the article. The trade-off curve provides the basis for decision-makers to better understand the supply chain optimization effect on the selected objective function set elements to make the present and future supply chains promote startling ‘profitability’ and increase revenue generation in operations.
- 28 April 2022
- Published by Springer Nature in Research Square
Open AccessOptimization of End-to-end Supply Chain Costs to Maximize Revenue and Profits From Supply Chain Operations
Being aware that the supply chain costs claim a substantial share in the final product cost, organizations, in an effort to improve revenue and increase profitability, should minimize supply chain costs invariably. Besides other costs, supply chain costs vary from time to time depending on the sourcing, transportation, and inventory-related costs. Improving the operational efficiency of the supply chain has become the primary objective for increasing profitability from supply chain operations in present-day context. In reality, supply chain operations are complex with uncertainty predominantly influencing various costs associated with supply chains affecting return on investments and profitability. Supply chain cost optimization should enable the supply chain managers to ensure that the supply chain is ‘responsive’, ‘agile’, and ‘reinvented’ for present and future operations. Optimization of supply chain costs bestows improving operating efficiency that promotes improvements in revenue and increment in profits. The present article aims at considering various supply chains cost parameters such as total operating costs, profit, revenue, logistics costs, and information sharing costs for optimization of supply chain costs using multi-objective optimization. A generic three-stage supply chain model with usual entities like suppliers, manufacturers, and customer zones is assumed in the present article. A trade-off curve among the selected objective function sets and relevant constraints was developed and presented in the article. The trade-off curve provides the basis for decision-makers to better understand the supply chain optimization effect on the selected objective function set elements to make the present and future supply chains promote startling ‘profitability’ and increase revenue generation in operations.
- 20 June 2017
- Published by Springer Nature
- p. 233-244
Intra and Inter Group Key Authentication for Secure Group Communication in MANET
- 20 June 2017
- Published by Springer Nature
- p. 233-244
Intra and Inter Group Key Authentication for Secure Group Communication in MANET
- 1 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6, 619-623
An Image Watermarking Scheme Using Threshold Based Secret Sharing
This paper recommends an idea for authenticating the actual ownership by embedding a share of the secret image invisibly into the host or the original image. Frequency domain Techniques such as DWT and SVD are used for embedding shares into the host image. In frequency domain, compared to the original image, the obtained watermarked image is less distorted which in turn creates an environment that makes the embedded share of secret image unavailable for any kind of misuse. The leftover share of secret image is used to prove the actual ownership. The observed end result of this technique is robust against various available image processing attacks.
- 1 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6, 619-623
An Image Watermarking Scheme Using Threshold Based Secret Sharing
This paper recommends an idea for authenticating the actual ownership by embedding a share of the secret image invisibly into the host or the original image. Frequency domain Techniques such as DWT and SVD are used for embedding shares into the host image. In frequency domain, compared to the original image, the obtained watermarked image is less distorted which in turn creates an environment that makes the embedded share of secret image unavailable for any kind of misuse. The leftover share of secret image is used to prove the actual ownership. The observed end result of this technique is robust against various available image processing attacks.
- 4 February 2016
- Published by Springer Nature
- p. 257-264
Hiding Sensitive Items Using Pearson’s Correlation Coefficient Weighing Mechanism
- 4 February 2016
- Published by Springer Nature
- p. 257-264
Hiding Sensitive Items Using Pearson’s Correlation Coefficient Weighing Mechanism
- 1 January 2013
- Published by Inderscience Publishers in International Journal of Networking and Virtual Organisations
- Vol. 13 (4) , 327
Location aware and energy efficient routing protocol for long distance MANETs
Mobile ad-hoc networks (MANETs) comprise a set of power-constrained mobile nodes. They enable multi-hop peer-to-peer routing without any requirement of predefined infrastructure for its deployment. The topology of MANETs change dynamically which necessitates development of efficient routing protocols for message packets that reduce energy consumption, congestion and propagation delays. Existing routing protocols such as BRAWN, AODV and DSDV improve the quality of service (QoS) in MANETs only when there are less number of hops and nodes close to each other. Determining an efficient route for packets considering the current location of nodes is a challenging task, especially when the distance between the nodes is too long in a MANET. In this paper, we present an efficient protocol to maintain higher QoS in MANETS. In addition to bandwidth and data rate, additional parameters namely queuing delay, distance and energy are incorporated in order to dynamically compute the paths for a specific communication with minimum delay. We provide a theoretical approach to determine multiple efficient paths and to rank them. We also use information of node position that is captured periodically for computing the latest direct distance between any two nodes. We illustrate the effectiveness of our proposed protocol with examples.
- 1 January 2013
- Published by Inderscience Publishers in International Journal of Networking and Virtual Organisations
- Vol. 13 (4) , 327
Location aware and energy efficient routing protocol for long distance MANETs
Mobile ad-hoc networks (MANETs) comprise a set of power-constrained mobile nodes. They enable multi-hop peer-to-peer routing without any requirement of predefined infrastructure for its deployment. The topology of MANETs change dynamically which necessitates development of efficient routing protocols for message packets that reduce energy consumption, congestion and propagation delays. Existing routing protocols such as BRAWN, AODV and DSDV improve the quality of service (QoS) in MANETs only when there are less number of hops and nodes close to each other. Determining an efficient route for packets considering the current location of nodes is a challenging task, especially when the distance between the nodes is too long in a MANET. In this paper, we present an efficient protocol to maintain higher QoS in MANETS. In addition to bandwidth and data rate, additional parameters namely queuing delay, distance and energy are incorporated in order to dynamically compute the paths for a specific communication with minimum delay. We provide a theoretical approach to determine multiple efficient paths and to rank them. We also use information of node position that is captured periodically for computing the latest direct distance between any two nodes. We illustrate the effectiveness of our proposed protocol with examples.
- 1 January 2012
- Published by Springer Nature
- p. 591-596
Combining Classification Algorithm with DOM Algorithm for Web Information Extraction – A Hybrid Approach
- 1 January 2012
- Published by Springer Nature
- p. 591-596
Combining Classification Algorithm with DOM Algorithm for Web Information Extraction – A Hybrid Approach
- Open Access
- 10 November 2010
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 10 (3) , 6-11
A Load Aware Routing Mechanism for Improving Energy Efficiency in Mobile Ad Hoc Networks
- 10 November 2010
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 10 (3) , 6-11
Open AccessA Load Aware Routing Mechanism for Improving Energy Efficiency in Mobile Ad Hoc Networks