Browsing by Author "Deshmukh, A.A."

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • No Thumbnail Available
    Item
    Green routing algorithm for wireless networks
    (2016) Deshmukh, A.A.; Jothish, M.; Chandrasekaran, K.
    With wireless devices gaining greater prevalence, there is a growing need for energy conservation for these devices. We propose a routing algorithm that reduces energy consumption at these mobile devices by modifying Optimized Link State Routing Protocol (OLSR). The protocol we propose is energy aware and reduces traffic to those nodes in the network that are low on battery life by using a modified Dijkstra�s algorithm. � Springer International Publishing Switzerland 2016.
  • No Thumbnail Available
    Item
    Green routing algorithm for wireless networks
    (Springer Science and Business Media Deutschland GmbH info@springer-sbm.com, 2016) Deshmukh, A.A.; Jothish, M.; Chandrasekaran, K.
    With wireless devices gaining greater prevalence, there is a growing need for energy conservation for these devices. We propose a routing algorithm that reduces energy consumption at these mobile devices by modifying Optimized Link State Routing Protocol (OLSR). The protocol we propose is energy aware and reduces traffic to those nodes in the network that are low on battery life by using a modified Dijkstra’s algorithm. © Springer International Publishing Switzerland 2016.
  • No Thumbnail Available
    Item
    Optimized cryptographic algorithm for embedded systems
    (2016) Deshmukh, A.A.; Jothish, M.; Chandrasekaran, K.
    Cryptographic hash algorithms have gained widespread popularity over its algorithmic complexity and the impossibility of recreation of the original input from the message digest. Embedded systems employ such algorithms for its security after substantial modifications in order to meet the hardware specifications due to the parsimonious capacity of such systems. Efficacious hashing algorithms lucidly adhere to all performance constraints and therein lies its popularity. We propose an optimization of the Secure Hashing Algorithm 1 (SHA-1) in memory requirements to suit the environment of an embedded system. We explore the idea of simplifying SHA-1's complicated set of steps to quicken its execution through loop reduction and lookup buffers stored in the main memory. � 2015 IEEE.
  • No Thumbnail Available
    Item
    Optimized cryptographic algorithm for embedded systems
    (Institute of Electrical and Electronics Engineers Inc., 2016) Deshmukh, A.A.; Jothish, M.; Chandrasekaran, K.
    Cryptographic hash algorithms have gained widespread popularity over its algorithmic complexity and the impossibility of recreation of the original input from the message digest. Embedded systems employ such algorithms for its security after substantial modifications in order to meet the hardware specifications due to the parsimonious capacity of such systems. Efficacious hashing algorithms lucidly adhere to all performance constraints and therein lies its popularity. We propose an optimization of the Secure Hashing Algorithm 1 (SHA-1) in memory requirements to suit the environment of an embedded system. We explore the idea of simplifying SHA-1's complicated set of steps to quicken its execution through loop reduction and lookup buffers stored in the main memory. © 2015 IEEE.