Chenna Reddy P - Academia.edu (original) (raw)

Papers by Chenna Reddy P

International Journal of Computer Networks and Applications, 2021

5G mobile users consume a large amount of video content. Providing high-quality video to mobile u... more 5G mobile users consume a large amount of video content. Providing high-quality video to mobile users via a single path is a challenging task. It takes much time to transmit the video. In this paper, we proposed dynamic path selection-based video transmission is proposed for a 5G multi-RAT network. In our proposed system has four consecutive processes, which are discussed as follows: (1) Optimal access point selection which is done by Red Deer Algorithm (RDA) that selects optimal access point by considering data rate, Signal to Inference Noise Ratio (SINR) and Received Signal Strength Indicator(RSSI) to achieve better Quality of Experience (QoE). (2) Adaptive Video Encoding, for this purpose, we useH.265 encoding algorithm, which encodes the video packets in order to reduce transmission time and bandwidth consumption, here bit rate is adaptively controlled using the SARSA reinforcement algorithm, by considering the network environment factors (bit error rate, attenuation, bandwidth, throughput, and SNR) and user preference factors (high/low quality and processing speed). In this stage, the SWARA decision-making algorithm is used to select optimal QP parameters for each video packet, which considers three parameters: distortion, previous QP value, and CSI, which improves the quality of the video. (3). Dynamic path selection is made using the Deng-based Type 2 Fuzzy algorithm (Deng-T2F), which selects the optimal path between source and destination based on the following parameters: the number of hops, link stability, and buffer size increases high throughput and reduce transmission delay. (4). Adaptive Buffer Management is proposed for reducing latency during video transmission. The Adaptive Pre-order Deficit Round Robin (ADPDRR) algorithm is used to evaluate the parameters of layer information, deadline, packet size, and arrival time to reduce packet loss and packet waiting time during video transmission. The proposed APDRR algorithm maintains three queues based on the packet priority, and then the prioritized packets are transmitted adaptively to reduce the packet waiting time. Finally, simulation is conducted using an NS-3.26 network simulator that evaluates the performance based on the following metrics:

International Journal of Computer Applications, 2013

Today's large demand for internet applications requires data to be transmitted in a safe and secu... more Today's large demand for internet applications requires data to be transmitted in a safe and secure manner. Data transmission in public communication system insecure because of interception and improper manipulation by eavesdropper. So the solution for this problem is Steganography, Steganography is the art of hiding one medium of information into another medium. There are many approaches for hiding textual information in multimedia file such as image, audio and video. Hiding textual information in multimedia file provides the most effective way to guard privacy. Key aspect of embedding text in multimedia file is that, after embedding text in multimedia file the size of the multimedia file remains same. The existing system can't provide more security and message length is restricted to few characters only. The proposed technique alters the data of lower bit in a cover object to embed textual information. The main goal of this paper is to embed textual information into multimedia file and the text message is encrypted before embedding to get advantage of cryptography.

International Journal of Electrical and Computer Engineering (IJECE), 2018

Data privacy in the mobile ad-hoc network is a problem due to wireless medium, frequent node move... more Data privacy in the mobile ad-hoc network is a problem due to wireless medium, frequent node movement and lack of any centralized infrastructure support. In such case, it is very important to build a reliable and secure network and achieve high throughput in MANET. The reliability and security of a network depend on whether the network remains linked to different failures and malicious activities, which is the fundamental issue that needs to be focused when designing a secure routing protocol in MANET. This paper proposes an effective privacy mechanism to handle data security through a novel secure session key exchange model, which provides the node data privacy and network stability for a longer period of time and prevents abnormal behavior changes due to malicious behavior and different type of attacks in the network. The simulation results show improvement in throughput with nominal overhead and end-to-end delay in different malicious conditions against existing protocols.

In the recent times many accessible congestion control procedures have no capability to different... more In the recent times many accessible congestion control procedures have no capability to differentiate involving two major problems like packet loss by link crash and packet loss by congestion due to buffer overflow. Consequently these resolutions effect in form of wastage of possessions because they target only on the packet drop by link crash that has the unnecessary importance. Consumption of energy and possessions in order to make the basis node attendance regarding the congestion occurring in routing path is the supplementary drawback in most of the available models. This method of intent mainly on regulating the outlet load at the basis node stage is the boundary to the present available models. It is by now aware that as a motive of link crumple and congestion packet loss in the network routing largely occurs. Hence in our earlier research we proposed routing strategy called Ordered congestion control using cross layer support in Manets in short OCC [19]. In this article we refined the OCC to gain the ability of energy conservation in congestion discovery. In this effort we attempt to limit the role of MAC layer to detect link failure and developed a new strategy to detect the congestion at a relay node level and path level. In this new congestion detection approach we consider the channel loading, packet loss and buffer utilization as parameters to detect the congestion state. These parameters together we referred as congestion detection activity parameter set in short C-daps. The produced tentative results illustrate energy efficiency over OCC [19].

International Journal of Advanced Computer Science and Applications, 2012

In the recent times many accessible congestion control procedures have no capability to different... more In the recent times many accessible congestion control procedures have no capability to differentiate involving two major problems like packet loss by link crash and packet loss by congestion. Consequently these resolutions effect in form of wastage of possessions because they target only on the packet drop by link crash that has a needless importance. Consumption of energy and possessions in order to make the basis node attentive regarding the congestion occurring in routing path is the supplementary drawback in most of the accessible procedures. This way of concentrating mainly on standardizing the outlet load at the basis node stage is the boundary to the present accessible procedures. It is already known that as a reason of link crash and congestion packet loss in the network routing largely occurs. In this article a new cross layer and path restoration procedure has been put forward. We also put forwarded two algorithms namely Path discovery Algorithm and congestion handling algorithm. In this approach of cross layer it comprises of 3 kinds of layers called network, MAC and transport layers. In this introduced approach the MAC and network layers have dynamic functionalities in identifying the congestion and standardization where the functionalities of network and transport layers are distinguished in bearing the congestion i.e. congestion endurance. The produced tentative results illustrate an enhanced management of congestion and its endurance by this approach.

The impacts of moving directions and speed of the nodes in mobile ad hoc networks leads link fail... more The impacts of moving directions and speed of the nodes in mobile ad hoc networks leads link failure very often. This route failures causes resource cost due to route rediscovery and multiple transmissions. Often the protocol used in mobile ad hoc routing mislead by assuming link failure as congestion state and then continues retransmissions of the dropped packets, which is severely effects by wasting energy resources. In this context, our earlier work proposed a cross layered routing topology in short OCC to improve the clogging recognition and managing policy. With the motivation gained from OCC, we further proposed an Energy Efficient Ordered Congestion Control routing topology (EOCC) for mobile ad hoc networks. The goal of EOCC is to advance communication performance of OCC with energy efficiency that used for packet transmission. Here in this paper we introduced a novel path restoration strategy to tolerate the congestion state at hop level node that participating in routing. The Proposed protocol is a cross layered and power conserved routing topology for congestion tolerance and control, which is an extension to our earlier cross layered and power conserved routing topology in short EOCC. The proposed protocol can be referred as Energy Efficient Ordered Congestion Tolerant and Control (EOCTC) Routing Topology. The experiment results emerged as an evidence for EOCTC performance and scalability. Better resource utilization, energy efficiency can be observed in data transmission and congestion tolerance achieved due to path restoration strategy and congestion control is effective.

i-manager's Journal on Software Engineering, 2010

Soft Computing, 2015

This paper presents an image watermarking technique which exploits the human visual system (HVS),... more This paper presents an image watermarking technique which exploits the human visual system (HVS), two artificial intelligence techniques [fuzzy inference system (FIS) and back propagation neural networks (BPNN)], and discrete cosine transform. The integration of FIS and BPNN results in a hybrid intelligence technique named neuro-fuzzy system, which combines the advantages of both the techniques. This system uses HVS model for calculating the weighing factor by giving the HVS parameters as inputs to the FIS and BPNN. The computed weighing value is used for embedding the watermark with maximum energy and imperceptibility. Compared to the existing methods, the proposed algorithm makes the watermark invisible and robust against numerous watermarking attacks including low-pass filtering, median filtering, rotation, JPEG compression, row–column copying, row–column blanking, image blurring, etc. Performance metrics used for comparison are peak signal-to-noise ratio and normalized cross correlation.

International Journal on Cybernetics & Informatics, 2015

Adhoc wireless multi-hop Networks (AHWMNs) are built with wireless nodes arranged in an adhoc man... more Adhoc wireless multi-hop Networks (AHWMNs) are built with wireless nodes arranged in an adhoc manner. Every node can forward packets and also acts as a source. AODV establishes a path to receiver when it is needed by the sender and is on the standardization process of Internet engineering task force. AntHocNetwhich is based on ants foraging behavior, includes reactive and proactive mechanisms. AntHocNet builds the path as per the requirement of source and maintains until the end of communication session. In this paper performance of AODV and AntHocNetare analyzed at different parameters like data rates, pause times, and speed. Metrics Packet delivery ratio, Loss rate, End to End delay, jitter, and throughput are evaluated at different simulation times. Simulation is performed using network simulator NS-2.34 and 802.11b is the MAC protocol.

Journal of Big Data, 2017

Big data has become popular for processing, storing and managing massive volumes of data. The clu... more Big data has become popular for processing, storing and managing massive volumes of data. The clustering of datasets has become a challenging issue in the field of big data analytics. The K-means algorithm is best suited for finding similarities between entities based on distance measures with small datasets. Existing clustering algorithms require scalable solutions to manage large datasets. This study presents two approaches to the clustering of large datasets using MapReduce. The first approach, K-Means Hadoop MapReduce (KM-HMR), focuses on the MapReduce implementation of standard K-means. The second approach enhances the quality of clusters to produce clusters with maximum intra-cluster and minimum inter-cluster distances for large datasets. The results of the proposed approaches show significant improvements in the efficiency of clustering in terms of execution times. Experiments conducted on standard K-means and proposed solutions show that the KM-I2C approach is both effective and efficient.

Indonesian Journal of Electrical Engineering and Computer Science, 2016

MANETs are self-organizing, infrastructure less ad-hoc networks with many challenges like low pow... more MANETs are self-organizing, infrastructure less ad-hoc networks with many challenges like low power, limited storage and limited processing devices. Among all the parameters that affect the network efficiency accuracy, scalability, and power consumption are main challenges in the routing of Mobile ad-hoc networks. The network lifetime is dependent on the power efficiency of the nodes in the network. The protocols have to provide the energy efficient route through intermediate nodes in the network. The trust based routing approach is one of the best mechanisms to establish an energy efficient route between source and destination. In this paper we first propose the family relationship based trust model and then propose a new energy efficient trust based routing protocol to reduce the routing overhead, delay and provides better packet delivery ratio that performs better than the existing routing protocols.

International Journal on Cybernetics & Informatics, 2015

AODV is an on-demand reactive protocol which is on the standardization process of Internet engine... more AODV is an on-demand reactive protocol which is on the standardization process of Internet engineering task force. This protocol initiates route discovery process when route is required to send packets from sender to receiver. AntHocNet depends on Ant Colony Optimization technique and is considered as hybrid routing protocol, which consists of reactive path setup and proactive path management. In ACO routing algorithm ants move between nest and the food source by laying pheromone trails to collect routing information. This paper does the performance comparison of protocols AODV and AntHocNet in static wireless networks. The performance is analyzed by metrics Packet Delivery Ratio, End-to-End Delay, Loss Rate, Throughput and Jitter. Routing protocols are evaluated by using User Datagram Protocol as transport protocol, Network Simulator (NS2.34) and by using 802.11 and 802.11b.

International Journal of Computer Theory and Engineering, 2011

In 4G networks admission control will need to deal with many heterogeneous networks and admit new... more In 4G networks admission control will need to deal with many heterogeneous networks and admit new sessions to a network that is most appropriate to supply the requested QoS. In order to avoid the degradation of the QoS of low priority sessions, in this paper we propose a QoS Based Adaptive Admission Controller (QAAC). The service request is classified into two types new or handoff and the traffic is classified as real-time and non real-time. Then depending on the traffic class and type of service, the request is finally classified into four categories and priorities are assigned for each category. The admission control algorithm manages the various service requests in their queues and adaptively schedules them as per their assigned priorities. The basic concept of the algorithm is to simultaneously provide transmission priority and space priority for the data flows of the same end-user. The algorithm tries to minimize the number of the sessions that are blocked due to insufficient resources in the target network. By simulation results, we show that our proposed technique yields better throughput with reduced delay. Index Terms-Wireless networks, 4G networks, QoS, QoS based adaptive admission controller (QAAC).

International Journal of Computer Science and Information Technology, 2013

We have many of anonymizing networks which provide users to access services of server anonymously... more We have many of anonymizing networks which provide users to access services of server anonymously. Anonymity has received increasing attention in the literature due to user awareness of their privacy. Nowadays, anonymity provides protection to users to enjoy network services without being traced. Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client's IP address from the server.. Web site administrators routinely rely on IPaddress blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser routes through an anonymizing network. As a result, administrators block all known exit nodes of anonymizing networks, denying anonymous access to misbehaving and behaving users alike. To address this problem Nymble is developed, a system in which servers can "blacklist" misbehaving users. We present extensions to nymble framework for anonymizing blacklisting schemes. First, we provide a mechanism to nymble manager to track blacklisting of user in multiple linking windows while preserving anonymity of the users. Some users always look to misbehave with servers; there major intention is to make the server down. The problem with nymble is nymble manager blacklist a user for one likability window (i.e. 1 day), on the other day again he can misbehave with same server or other server. He can continue it as his everyday activity as Nymble manager doesn't have any mechanism to identify such type of users while preserving anonymity. To address this problem, we present a method which can identify such users, while preserving anonymity and nymble manager with identified information can decide upon how much time to blacklist a misbehaving user. We also suggest some algorithms which are changed in comparison to existing nymble.

International Journal of Communication Networks and Distributed Systems, 2015

Grid computing is a conglomeration of computer resources which explores, exploits and shares vari... more Grid computing is a conglomeration of computer resources which explores, exploits and shares various virtual resources in order to enhance the capabilities of parallel CPU. The issue of the consumption of energy over the grid is pivotal during the workflow scheduling, which is generally estimated considering the criteria of usage of power per device, process or service. This paper postulates a framework called power estimator and reducer for multi-core architecture in grid (PERMA-G), which is a modified and revised version over its predecessor framework of PERMA developed by Rajasekhara Babu et al. (2013), capable of addressing the issues of estimating and reducing power in multi-core processors. PERMA-G proves versatile in estimating the consumption of power and the computation capabilities of various resources for multi-core processor environments based on grid. Through dynamic processes it extracts several complexities involved in the tasks and schedules of computation by a method of workflow leading to reduced power consumption, cost efficacy and contracted execution time in general.

International Journal of Computer Applications, 2012

Self Reconfigurable Clustering (Re-Clustering) mechanism is very useful and emerging technique wh... more Self Reconfigurable Clustering (Re-Clustering) mechanism is very useful and emerging technique whenever the cluster head failure occurs in the network due to limited battery power, low radio transmission range, minimum memory speed. The energy compulsion of each sensor node directly affects the scalability, efficiency and lifetime of a sensor network. In heterogeneous wireless sensor network, each node is having different amount of energy. This paper mainly focuses on Reclustering in heterogeneous wireless sensor network for maintain the load balance and data aggregation .The proposed protocol mainly focus on the key parameters of the sensor nodes which are prolong the network lifetime such as average residual energy of the each cluster head in order to increase the network lifetime, energy dissipation of the sensor nodes.

International Journal of Computer Applications, 2012

Adhoc wireless multi-hop networks (AHWMNs) are communication networks that consist of wireless no... more Adhoc wireless multi-hop networks (AHWMNs) are communication networks that consist of wireless nodes, placed together in an ad hoc manner, i.e. with minimal prior planning. All nodes in the network have routing capabilities and forward data packets for other nodes in multi-hop fashion. AHWMNs pose substantially different challenges to routing protocols than more traditional wired networks. AHWMN routing protocols are classified as topology-based, positionbased. Topology-based routing protocols use the information about the links that exist in the network to perform packet forwarding. Position based routing is a routing principle that relies on geographic information. Position-based routing algorithms require information about the physical position of the participating node. Commonly, each node determines its own position through the use of Global Positioning System (GPS). Decisions made based on destination position and position of forwarding nodes neighbours. A location service is used by the sender of packet to determine the position of the destination and to include it in the packet destination address. The Greedy Perimeter Stateless Routing Protocol is a novel routing protocol for wireless datagram networks. Greedy perimeter stateless routing is based on greedy packet forwarding to forward packets to nodes that always progressively closer to the destination in each step using local information. Thus, each node forwards the message to the neighbours that are most suitable from a local point of view. Greedy forwarding can lead into a dead end, way there is no neighbour closer to the destination. The algorithm recovers by routing around the perimeter of the region by keeping state only about the local topology; GPSR scales better in perrouter state than shortest path and ad hoc routing protocols as the number of network destination increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. In this paper performance of GPSR with the Ad hoc On demand distance Vector (AODV) routing protocol and Dynamic Source Routing (DSR) protocol is compared.

International Journal of Computer Applications, 2012

The amount of traffic generated by RTAs has increased substantially over the years. RTA will face... more The amount of traffic generated by RTAs has increased substantially over the years. RTA will face congestion where there is any form of bottleneck restricting traffic. This will result in packet loss or delayed traffic which is unacceptable for RTAs. Therefore it is desirable for RTAs to implement congestion control mechanism to improve the stability of networks. TCP Friendly Rate Control (TFRC) is a congestion control algorithm that provides a smooth transmission rate for RTAs. TFRC is a congestion control mechanism for unicast flows operating in a best effort internet environment. It is reasonably fair when competing for bandwidth with TCP flows in congested network, but has a much lower variation of throughput over time compared with TCP. In this work we use NS2, the network simulator for simulation of TFRC. TFRC is simulated in different environments, limitations are identified and modifications are proposed.

Biomedical Signal Processing and Control

Abstract The importance of digital images in the field of health care made major impact in the re... more Abstract The importance of digital images in the field of health care made major impact in the recent years. There is need for protecting the medical images from unauthorized usage and watermarking serves well in this situations. Digital medical Image watermarking is the procedure of protecting the medical image content by inserting the watermark into it. The major objective of the image watermarking technique is to develop an algorithm with high imperceptibility. To achieve this, this paper proposed the image watermarking algorithm in wavelet transformation (IDWT) using the singular value decomposition (SVD) and particle swarm optimization (PSO). The improved DWT is applied to the medical image to retrieve the invariant wavelet domain. The watermark is inserted in to the selected region by modifying the values of the coefficients in the image using threshold function. The scaling factors are optimized using the PSO algorithm. The performance of the proposed model is evaluated using the existing schemes similar to the properties of the proposed model. The normalized coefficient (NC) and Peak Signal to Noise Ratio (PSNR) is considered to evaluate the similarity between the medical image and watermarked medical image. The proposed algorithm showed improved performance in terms of imperceptibility and robustness.

Communications in Computer and Information Science, 2016

Achieving security is a key aspect for any computer system. Many modern technologies have been ap... more Achieving security is a key aspect for any computer system. Many modern technologies have been applied to achieve the required security. Cryptography provides a primary way to achieve best security. A recent trend shows that many of the cryptographic algorithms are modified with new functionalities to provide better security in all aspects. One major research branch of Cryptography is Public key cryptography. In this paper, one of the popular public key cryptography algorithms, RSA with arithmetic functions are reviewed and analyzed. This paper mainly focused on the use of Carmichael function instead of Euler totient function applied on RSA algorithm. Results have shown that use of Carmichael function results in smaller value for decryption key. This leads to reduced decryption time of RSA algorithm.

International Journal of Computer Networks and Applications, 2021

5G mobile users consume a large amount of video content. Providing high-quality video to mobile u... more 5G mobile users consume a large amount of video content. Providing high-quality video to mobile users via a single path is a challenging task. It takes much time to transmit the video. In this paper, we proposed dynamic path selection-based video transmission is proposed for a 5G multi-RAT network. In our proposed system has four consecutive processes, which are discussed as follows: (1) Optimal access point selection which is done by Red Deer Algorithm (RDA) that selects optimal access point by considering data rate, Signal to Inference Noise Ratio (SINR) and Received Signal Strength Indicator(RSSI) to achieve better Quality of Experience (QoE). (2) Adaptive Video Encoding, for this purpose, we useH.265 encoding algorithm, which encodes the video packets in order to reduce transmission time and bandwidth consumption, here bit rate is adaptively controlled using the SARSA reinforcement algorithm, by considering the network environment factors (bit error rate, attenuation, bandwidth, throughput, and SNR) and user preference factors (high/low quality and processing speed). In this stage, the SWARA decision-making algorithm is used to select optimal QP parameters for each video packet, which considers three parameters: distortion, previous QP value, and CSI, which improves the quality of the video. (3). Dynamic path selection is made using the Deng-based Type 2 Fuzzy algorithm (Deng-T2F), which selects the optimal path between source and destination based on the following parameters: the number of hops, link stability, and buffer size increases high throughput and reduce transmission delay. (4). Adaptive Buffer Management is proposed for reducing latency during video transmission. The Adaptive Pre-order Deficit Round Robin (ADPDRR) algorithm is used to evaluate the parameters of layer information, deadline, packet size, and arrival time to reduce packet loss and packet waiting time during video transmission. The proposed APDRR algorithm maintains three queues based on the packet priority, and then the prioritized packets are transmitted adaptively to reduce the packet waiting time. Finally, simulation is conducted using an NS-3.26 network simulator that evaluates the performance based on the following metrics:

International Journal of Computer Applications, 2013

Today's large demand for internet applications requires data to be transmitted in a safe and secu... more Today's large demand for internet applications requires data to be transmitted in a safe and secure manner. Data transmission in public communication system insecure because of interception and improper manipulation by eavesdropper. So the solution for this problem is Steganography, Steganography is the art of hiding one medium of information into another medium. There are many approaches for hiding textual information in multimedia file such as image, audio and video. Hiding textual information in multimedia file provides the most effective way to guard privacy. Key aspect of embedding text in multimedia file is that, after embedding text in multimedia file the size of the multimedia file remains same. The existing system can't provide more security and message length is restricted to few characters only. The proposed technique alters the data of lower bit in a cover object to embed textual information. The main goal of this paper is to embed textual information into multimedia file and the text message is encrypted before embedding to get advantage of cryptography.

International Journal of Electrical and Computer Engineering (IJECE), 2018

Data privacy in the mobile ad-hoc network is a problem due to wireless medium, frequent node move... more Data privacy in the mobile ad-hoc network is a problem due to wireless medium, frequent node movement and lack of any centralized infrastructure support. In such case, it is very important to build a reliable and secure network and achieve high throughput in MANET. The reliability and security of a network depend on whether the network remains linked to different failures and malicious activities, which is the fundamental issue that needs to be focused when designing a secure routing protocol in MANET. This paper proposes an effective privacy mechanism to handle data security through a novel secure session key exchange model, which provides the node data privacy and network stability for a longer period of time and prevents abnormal behavior changes due to malicious behavior and different type of attacks in the network. The simulation results show improvement in throughput with nominal overhead and end-to-end delay in different malicious conditions against existing protocols.

In the recent times many accessible congestion control procedures have no capability to different... more In the recent times many accessible congestion control procedures have no capability to differentiate involving two major problems like packet loss by link crash and packet loss by congestion due to buffer overflow. Consequently these resolutions effect in form of wastage of possessions because they target only on the packet drop by link crash that has the unnecessary importance. Consumption of energy and possessions in order to make the basis node attendance regarding the congestion occurring in routing path is the supplementary drawback in most of the available models. This method of intent mainly on regulating the outlet load at the basis node stage is the boundary to the present available models. It is by now aware that as a motive of link crumple and congestion packet loss in the network routing largely occurs. Hence in our earlier research we proposed routing strategy called Ordered congestion control using cross layer support in Manets in short OCC [19]. In this article we refined the OCC to gain the ability of energy conservation in congestion discovery. In this effort we attempt to limit the role of MAC layer to detect link failure and developed a new strategy to detect the congestion at a relay node level and path level. In this new congestion detection approach we consider the channel loading, packet loss and buffer utilization as parameters to detect the congestion state. These parameters together we referred as congestion detection activity parameter set in short C-daps. The produced tentative results illustrate energy efficiency over OCC [19].

International Journal of Advanced Computer Science and Applications, 2012

In the recent times many accessible congestion control procedures have no capability to different... more In the recent times many accessible congestion control procedures have no capability to differentiate involving two major problems like packet loss by link crash and packet loss by congestion. Consequently these resolutions effect in form of wastage of possessions because they target only on the packet drop by link crash that has a needless importance. Consumption of energy and possessions in order to make the basis node attentive regarding the congestion occurring in routing path is the supplementary drawback in most of the accessible procedures. This way of concentrating mainly on standardizing the outlet load at the basis node stage is the boundary to the present accessible procedures. It is already known that as a reason of link crash and congestion packet loss in the network routing largely occurs. In this article a new cross layer and path restoration procedure has been put forward. We also put forwarded two algorithms namely Path discovery Algorithm and congestion handling algorithm. In this approach of cross layer it comprises of 3 kinds of layers called network, MAC and transport layers. In this introduced approach the MAC and network layers have dynamic functionalities in identifying the congestion and standardization where the functionalities of network and transport layers are distinguished in bearing the congestion i.e. congestion endurance. The produced tentative results illustrate an enhanced management of congestion and its endurance by this approach.

The impacts of moving directions and speed of the nodes in mobile ad hoc networks leads link fail... more The impacts of moving directions and speed of the nodes in mobile ad hoc networks leads link failure very often. This route failures causes resource cost due to route rediscovery and multiple transmissions. Often the protocol used in mobile ad hoc routing mislead by assuming link failure as congestion state and then continues retransmissions of the dropped packets, which is severely effects by wasting energy resources. In this context, our earlier work proposed a cross layered routing topology in short OCC to improve the clogging recognition and managing policy. With the motivation gained from OCC, we further proposed an Energy Efficient Ordered Congestion Control routing topology (EOCC) for mobile ad hoc networks. The goal of EOCC is to advance communication performance of OCC with energy efficiency that used for packet transmission. Here in this paper we introduced a novel path restoration strategy to tolerate the congestion state at hop level node that participating in routing. The Proposed protocol is a cross layered and power conserved routing topology for congestion tolerance and control, which is an extension to our earlier cross layered and power conserved routing topology in short EOCC. The proposed protocol can be referred as Energy Efficient Ordered Congestion Tolerant and Control (EOCTC) Routing Topology. The experiment results emerged as an evidence for EOCTC performance and scalability. Better resource utilization, energy efficiency can be observed in data transmission and congestion tolerance achieved due to path restoration strategy and congestion control is effective.

i-manager's Journal on Software Engineering, 2010

Soft Computing, 2015

This paper presents an image watermarking technique which exploits the human visual system (HVS),... more This paper presents an image watermarking technique which exploits the human visual system (HVS), two artificial intelligence techniques [fuzzy inference system (FIS) and back propagation neural networks (BPNN)], and discrete cosine transform. The integration of FIS and BPNN results in a hybrid intelligence technique named neuro-fuzzy system, which combines the advantages of both the techniques. This system uses HVS model for calculating the weighing factor by giving the HVS parameters as inputs to the FIS and BPNN. The computed weighing value is used for embedding the watermark with maximum energy and imperceptibility. Compared to the existing methods, the proposed algorithm makes the watermark invisible and robust against numerous watermarking attacks including low-pass filtering, median filtering, rotation, JPEG compression, row–column copying, row–column blanking, image blurring, etc. Performance metrics used for comparison are peak signal-to-noise ratio and normalized cross correlation.

International Journal on Cybernetics & Informatics, 2015

Adhoc wireless multi-hop Networks (AHWMNs) are built with wireless nodes arranged in an adhoc man... more Adhoc wireless multi-hop Networks (AHWMNs) are built with wireless nodes arranged in an adhoc manner. Every node can forward packets and also acts as a source. AODV establishes a path to receiver when it is needed by the sender and is on the standardization process of Internet engineering task force. AntHocNetwhich is based on ants foraging behavior, includes reactive and proactive mechanisms. AntHocNet builds the path as per the requirement of source and maintains until the end of communication session. In this paper performance of AODV and AntHocNetare analyzed at different parameters like data rates, pause times, and speed. Metrics Packet delivery ratio, Loss rate, End to End delay, jitter, and throughput are evaluated at different simulation times. Simulation is performed using network simulator NS-2.34 and 802.11b is the MAC protocol.

Journal of Big Data, 2017

Big data has become popular for processing, storing and managing massive volumes of data. The clu... more Big data has become popular for processing, storing and managing massive volumes of data. The clustering of datasets has become a challenging issue in the field of big data analytics. The K-means algorithm is best suited for finding similarities between entities based on distance measures with small datasets. Existing clustering algorithms require scalable solutions to manage large datasets. This study presents two approaches to the clustering of large datasets using MapReduce. The first approach, K-Means Hadoop MapReduce (KM-HMR), focuses on the MapReduce implementation of standard K-means. The second approach enhances the quality of clusters to produce clusters with maximum intra-cluster and minimum inter-cluster distances for large datasets. The results of the proposed approaches show significant improvements in the efficiency of clustering in terms of execution times. Experiments conducted on standard K-means and proposed solutions show that the KM-I2C approach is both effective and efficient.

Indonesian Journal of Electrical Engineering and Computer Science, 2016

MANETs are self-organizing, infrastructure less ad-hoc networks with many challenges like low pow... more MANETs are self-organizing, infrastructure less ad-hoc networks with many challenges like low power, limited storage and limited processing devices. Among all the parameters that affect the network efficiency accuracy, scalability, and power consumption are main challenges in the routing of Mobile ad-hoc networks. The network lifetime is dependent on the power efficiency of the nodes in the network. The protocols have to provide the energy efficient route through intermediate nodes in the network. The trust based routing approach is one of the best mechanisms to establish an energy efficient route between source and destination. In this paper we first propose the family relationship based trust model and then propose a new energy efficient trust based routing protocol to reduce the routing overhead, delay and provides better packet delivery ratio that performs better than the existing routing protocols.

International Journal on Cybernetics & Informatics, 2015

AODV is an on-demand reactive protocol which is on the standardization process of Internet engine... more AODV is an on-demand reactive protocol which is on the standardization process of Internet engineering task force. This protocol initiates route discovery process when route is required to send packets from sender to receiver. AntHocNet depends on Ant Colony Optimization technique and is considered as hybrid routing protocol, which consists of reactive path setup and proactive path management. In ACO routing algorithm ants move between nest and the food source by laying pheromone trails to collect routing information. This paper does the performance comparison of protocols AODV and AntHocNet in static wireless networks. The performance is analyzed by metrics Packet Delivery Ratio, End-to-End Delay, Loss Rate, Throughput and Jitter. Routing protocols are evaluated by using User Datagram Protocol as transport protocol, Network Simulator (NS2.34) and by using 802.11 and 802.11b.

International Journal of Computer Theory and Engineering, 2011

In 4G networks admission control will need to deal with many heterogeneous networks and admit new... more In 4G networks admission control will need to deal with many heterogeneous networks and admit new sessions to a network that is most appropriate to supply the requested QoS. In order to avoid the degradation of the QoS of low priority sessions, in this paper we propose a QoS Based Adaptive Admission Controller (QAAC). The service request is classified into two types new or handoff and the traffic is classified as real-time and non real-time. Then depending on the traffic class and type of service, the request is finally classified into four categories and priorities are assigned for each category. The admission control algorithm manages the various service requests in their queues and adaptively schedules them as per their assigned priorities. The basic concept of the algorithm is to simultaneously provide transmission priority and space priority for the data flows of the same end-user. The algorithm tries to minimize the number of the sessions that are blocked due to insufficient resources in the target network. By simulation results, we show that our proposed technique yields better throughput with reduced delay. Index Terms-Wireless networks, 4G networks, QoS, QoS based adaptive admission controller (QAAC).

International Journal of Computer Science and Information Technology, 2013

We have many of anonymizing networks which provide users to access services of server anonymously... more We have many of anonymizing networks which provide users to access services of server anonymously. Anonymity has received increasing attention in the literature due to user awareness of their privacy. Nowadays, anonymity provides protection to users to enjoy network services without being traced. Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client's IP address from the server.. Web site administrators routinely rely on IPaddress blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser routes through an anonymizing network. As a result, administrators block all known exit nodes of anonymizing networks, denying anonymous access to misbehaving and behaving users alike. To address this problem Nymble is developed, a system in which servers can "blacklist" misbehaving users. We present extensions to nymble framework for anonymizing blacklisting schemes. First, we provide a mechanism to nymble manager to track blacklisting of user in multiple linking windows while preserving anonymity of the users. Some users always look to misbehave with servers; there major intention is to make the server down. The problem with nymble is nymble manager blacklist a user for one likability window (i.e. 1 day), on the other day again he can misbehave with same server or other server. He can continue it as his everyday activity as Nymble manager doesn't have any mechanism to identify such type of users while preserving anonymity. To address this problem, we present a method which can identify such users, while preserving anonymity and nymble manager with identified information can decide upon how much time to blacklist a misbehaving user. We also suggest some algorithms which are changed in comparison to existing nymble.

International Journal of Communication Networks and Distributed Systems, 2015

Grid computing is a conglomeration of computer resources which explores, exploits and shares vari... more Grid computing is a conglomeration of computer resources which explores, exploits and shares various virtual resources in order to enhance the capabilities of parallel CPU. The issue of the consumption of energy over the grid is pivotal during the workflow scheduling, which is generally estimated considering the criteria of usage of power per device, process or service. This paper postulates a framework called power estimator and reducer for multi-core architecture in grid (PERMA-G), which is a modified and revised version over its predecessor framework of PERMA developed by Rajasekhara Babu et al. (2013), capable of addressing the issues of estimating and reducing power in multi-core processors. PERMA-G proves versatile in estimating the consumption of power and the computation capabilities of various resources for multi-core processor environments based on grid. Through dynamic processes it extracts several complexities involved in the tasks and schedules of computation by a method of workflow leading to reduced power consumption, cost efficacy and contracted execution time in general.

International Journal of Computer Applications, 2012

Self Reconfigurable Clustering (Re-Clustering) mechanism is very useful and emerging technique wh... more Self Reconfigurable Clustering (Re-Clustering) mechanism is very useful and emerging technique whenever the cluster head failure occurs in the network due to limited battery power, low radio transmission range, minimum memory speed. The energy compulsion of each sensor node directly affects the scalability, efficiency and lifetime of a sensor network. In heterogeneous wireless sensor network, each node is having different amount of energy. This paper mainly focuses on Reclustering in heterogeneous wireless sensor network for maintain the load balance and data aggregation .The proposed protocol mainly focus on the key parameters of the sensor nodes which are prolong the network lifetime such as average residual energy of the each cluster head in order to increase the network lifetime, energy dissipation of the sensor nodes.

International Journal of Computer Applications, 2012

Adhoc wireless multi-hop networks (AHWMNs) are communication networks that consist of wireless no... more Adhoc wireless multi-hop networks (AHWMNs) are communication networks that consist of wireless nodes, placed together in an ad hoc manner, i.e. with minimal prior planning. All nodes in the network have routing capabilities and forward data packets for other nodes in multi-hop fashion. AHWMNs pose substantially different challenges to routing protocols than more traditional wired networks. AHWMN routing protocols are classified as topology-based, positionbased. Topology-based routing protocols use the information about the links that exist in the network to perform packet forwarding. Position based routing is a routing principle that relies on geographic information. Position-based routing algorithms require information about the physical position of the participating node. Commonly, each node determines its own position through the use of Global Positioning System (GPS). Decisions made based on destination position and position of forwarding nodes neighbours. A location service is used by the sender of packet to determine the position of the destination and to include it in the packet destination address. The Greedy Perimeter Stateless Routing Protocol is a novel routing protocol for wireless datagram networks. Greedy perimeter stateless routing is based on greedy packet forwarding to forward packets to nodes that always progressively closer to the destination in each step using local information. Thus, each node forwards the message to the neighbours that are most suitable from a local point of view. Greedy forwarding can lead into a dead end, way there is no neighbour closer to the destination. The algorithm recovers by routing around the perimeter of the region by keeping state only about the local topology; GPSR scales better in perrouter state than shortest path and ad hoc routing protocols as the number of network destination increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. In this paper performance of GPSR with the Ad hoc On demand distance Vector (AODV) routing protocol and Dynamic Source Routing (DSR) protocol is compared.

International Journal of Computer Applications, 2012

The amount of traffic generated by RTAs has increased substantially over the years. RTA will face... more The amount of traffic generated by RTAs has increased substantially over the years. RTA will face congestion where there is any form of bottleneck restricting traffic. This will result in packet loss or delayed traffic which is unacceptable for RTAs. Therefore it is desirable for RTAs to implement congestion control mechanism to improve the stability of networks. TCP Friendly Rate Control (TFRC) is a congestion control algorithm that provides a smooth transmission rate for RTAs. TFRC is a congestion control mechanism for unicast flows operating in a best effort internet environment. It is reasonably fair when competing for bandwidth with TCP flows in congested network, but has a much lower variation of throughput over time compared with TCP. In this work we use NS2, the network simulator for simulation of TFRC. TFRC is simulated in different environments, limitations are identified and modifications are proposed.

Biomedical Signal Processing and Control

Abstract The importance of digital images in the field of health care made major impact in the re... more Abstract The importance of digital images in the field of health care made major impact in the recent years. There is need for protecting the medical images from unauthorized usage and watermarking serves well in this situations. Digital medical Image watermarking is the procedure of protecting the medical image content by inserting the watermark into it. The major objective of the image watermarking technique is to develop an algorithm with high imperceptibility. To achieve this, this paper proposed the image watermarking algorithm in wavelet transformation (IDWT) using the singular value decomposition (SVD) and particle swarm optimization (PSO). The improved DWT is applied to the medical image to retrieve the invariant wavelet domain. The watermark is inserted in to the selected region by modifying the values of the coefficients in the image using threshold function. The scaling factors are optimized using the PSO algorithm. The performance of the proposed model is evaluated using the existing schemes similar to the properties of the proposed model. The normalized coefficient (NC) and Peak Signal to Noise Ratio (PSNR) is considered to evaluate the similarity between the medical image and watermarked medical image. The proposed algorithm showed improved performance in terms of imperceptibility and robustness.

Communications in Computer and Information Science, 2016

Achieving security is a key aspect for any computer system. Many modern technologies have been ap... more Achieving security is a key aspect for any computer system. Many modern technologies have been applied to achieve the required security. Cryptography provides a primary way to achieve best security. A recent trend shows that many of the cryptographic algorithms are modified with new functionalities to provide better security in all aspects. One major research branch of Cryptography is Public key cryptography. In this paper, one of the popular public key cryptography algorithms, RSA with arithmetic functions are reviewed and analyzed. This paper mainly focused on the use of Carmichael function instead of Euler totient function applied on RSA algorithm. Results have shown that use of Carmichael function results in smaller value for decryption key. This leads to reduced decryption time of RSA algorithm.