banner

Computer Science and Engineering - Faculty Publication

Name of the Staff: Dr.D Loganathen

Name of the Journal: Research Inventy: International Journal of Engineering and Science

Tittle of the journal:

Performance Analysis of Enhanced DSDV Protocol for Efficient Routing In Wireless Ad Hoc Networks

Year of Publication: 2013

Abstract–An ad hoc wireless network is a collection of mobile nodes establishing an instant network without any fixed topology. Furthermore, each node acts as both router and host concurrently, and can travel out or link up in the network freely. In such a network, designing of routing protocol is a significant and important issue and therefore, new challenges are there in ad hoc routing protocols scheme. Hence traditional routing algorithms are unsuitable for betterment of ad hoc networks. Recent research emphases on the different types of routing protocols for enhancement and compared these protocols with existing metrics of network. Since network energy is an important parameter to improve the network lifetime. In this paper, presents the multicost parameters based DSDV (MPB-DSDV) routing protocol to enhance the energy efficient of ad hoc networks. The modification adapted in DSDV makes it a more suitable routing protocol and simulate the result of the help of the performance metrics like End to End Delay, Packet Delivery Ratio, Routing Overhead and Throughput of wireless ad hoc networks. The proposed multicost parameters based DSDV algorithm can lead to energy consumption, improving the network performance than regular DSDV routing protocol.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: Dr.D Loganathen

Name of the Journal: European Journal of Scientific Research

Tittle of the journal:

Multicost Energy-Interference Algorithm for Effective Transmission in Wireless Ad hoc Networks

Year of Publication: 2012

An ad hoc wireless network is a collection of independent movable nodes that communicate with each other over wireless links without any fixed infrastructure and static network topology. A variety of routing protocols and algorithm with varying network settings are analyzed to link between the nodes and communicate packets to their destinations. Most of these algorithms are singlecost, in the logic that they consign a scalar cost parameter to every link and compute the path that has minimum cost. Although multicost routing, a vector of cost parameters is consigned to each link and the cost vector of a path is well-defined based on the cost vectors of the links that embrace it. The cost parameters are hop count, total interference, node link delay, residual energy of a node and the node transmission power. Multi cost parameters are combined in different optimization function with respect to various routing algorithm. This paper accesses the multicost

SUM/MIN Energy-Interference algorithm with adjustable transmission power can lead to decrease the interference, energy consumption and improves the overall network performance.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: Dr.D Loganathen

Name of the Journal: IRACST – International Journal of Computer Networks and Wireless Communications

 

Tittle of the journal:

Modified AODV Routing Protocol with Multicost Parameters for Effective Communication in Wireless Ad hoc Networks

Year of Publication: 2012

Abstract—A Wireless ad hoc network is a collection of wireless mobile nodes that dynamically form a network connection temporarily without any support of static infrastructure. Caused by mobility of nodes, routing take a vital role in transmission and numerous routing protocols are available like proactive, reactive and hybrid. The protocol presents the mechanism which reduces

route loops and confirms trustworthy message exchange. The Adhoc On Demand Distance Vector (AODV) routing algorithm is a reactive routing protocol designed for ad hoc mobile nodes. Hop

count, total interference, node link delay, residual energy of a node and the node transmission power are the cost parameters assigned for link and path of the ad hoc networks. These parameters are combined in different optimization function with respect to various routing algorithm for selecting the optimal path. This paper accesses the modified AODV Routing Protocol with multicost parameters to acquire dynamic network performance metrics like Packet Delivery Ratio and Throughput of wireless ad hoc networks.

 

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: Dr.D Loganathen

Name of the Journal: Archives Des Sciences

Tittle of the journal:

Energy Efficient Transmission through Multicast ZRP in Wireless Ad hoc Networks with Multicost Parameters

Year of Publication: 2013

Abstract-Wireless Ad Hoc network is the group of independent traveling nodes that can connect to each other via wireless communication of radio waves. Ad hoc has no static networking frame and fully distributed nodes. It can act as an intermediate node to hand on packets to their destinations from source in limited radio range. Several evaluated protocols and algorithms are there to make ad hoc network as reliable. This paper influences the algorithm is established on multicost methodology and choose an optimal energy efficient group of nodes with optimal energy efficient multicast ZRP algorithm. The multicost parameters like node residual energy, node link delay, nodes transmission power and group of nodes concealed in the network for transmit a packet are taken into the account for routing algorithm. This non polynomial complexity algorithm is optimal which can optimize a few wanted function of the total power consumed by the multicasting assignment. The simulation results indicate that the projected algorithms perform well regard to assumed with variable node transmission powers concerning with optimal energy consumption. And compared the simulation works with average node residual energy, multicast success ratio, depleted energy reserves, jitter and throughput of the network. In addition to the result shows the near optimal (NOEMMZRP) algorithm achieves compared with optimal (OEMMZRP) algorithms by considerably lower computation cost and consuming lesser amount of energy consumption for communication as well as effectively multicasting higher packets to destination nodes in evacuation model.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: Dr.D Loganathen

Name of the Journal :Journal of Computer Science

Tittle of the journal:

Multicost Routing Approach in Wireless Ad hoc Networks

Year of Publication: 2012

Abstract: Problem statement: A Wireless ad hoc network is a collection of autonomous movable nodes that communicate with each other over wireless links without any static infrastructure. In these networks there is no fixed topology because of the mobility of nodes, interference, multipath

propagation and path loss. A variety of routing protocols and algorithm with varying network settings are analyzed to link between the nodes and communicate packets to their destinations. Most of these algorithms are single cost, in the logic that they consign a scalar cost parameter to every link and compute the path that has minimum cost. Although multicost routing, a vector of cost parameters is consigned to each link and the cost vector of a path is well-defined based on the cost vectors of the links that embrace it. Adjustable transmission power control of the nodes with multi cost routing algorithm can support optimizeto acquire the reduced interference and improve the ad hoc network performance. Approach: The link and path of the wireless network is consigned with several cost parameters. Hop count, total interference, node link delay, residual energy of a node and the node transmission power are the cost parameters assigned for link and path of the ad hoc networks. Multicost parameters are combined in different optimization function with respect to various routing algorithm. Results: Simulation and optimization shows multicost SUM/MIN Energy-Interference algorithm with variable transmission power can lead to decrease the interference and improves the overall network performance. Conclusion: The function optimized for wireless ad hoc networks that the Multicost SUM/MIN Energy-Interference algorithm achieves improved performance over than the single cost algorithm.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: Dr.D Loganathen

Name of the Journal: International Journal of Engineering Science and Technology (IJEST)

 

Tittle of the journal:

Enhanced DSR Protocol with Multicost Algorithm in Wireless Ad hoc Networks

Year of Publication: 2012

Abstract: A Wireless ad hoc network is a collection of wireless mobile nodes that dynamically form a network connection temporarily without any support of static infrastructure. The dynamics of an ad hoc network are a challenge to protocol design because mobility of nodes leads to unstable routing, and consequently flows encounter fluctuations in resource availability on various paths during the lifetime of a session. There are several routing protocols like DSDV, AODV, DSR, OLSR, Etc… which have been proposed for providing communication among all the nodes in the network. This paper presents the comparison performance of DSR protocol with enhanced DSR protocol which is combined with the multicost algorithm in DSR. In the modified approach of DSR to enhance the performance of Packet Delivery Ratio and throughput of the wireless ad hoc networks.

 

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: Dr.D Loganathen

Name of the Journal: International Journal of Information Technology & Computer Sciences Perspectives © Pezzottaite Journals

 

Tittle of the journal:

Multicost Parameters Based AODV Routing Protocol for Effective Transmission in Wireless Ad Hoc Networks

Year of Publication: 2013

 

Wireless ad hoc network is a collection of wireless mobile nodes that dynamically form a network connection temporarily without any support of static infrastructure. Affected by mobility of nodes, routing protocols are taking a vital role in wireless transmission. There are mainly three types of routing protocols in ad hoc networks which are proactive, reactive and hybrid. The protocol presents the mechanism which reduces route loops and confirms trustworthy message exchange. The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a reactive routing protocol designed for ad hoc mobile nodes. Since the network is compatible with the conventional, modify the routing protocol with allowed parameters. Hop count, total interference, node link delay, residual energy of a node and the node transmission power are the cost parameters assigned for link and path of the ad hoc networks. These parameters are combined in different optimization function with respect to AODV for selecting the optimal path. This paper accesses the regular AODV and Multicost Parameters Based AODV (MPB-AODV) Routing Protocol to acquire dynamic network performance metrics like Packet Delivery Ratio and Throughput of wireless ad hoc networks

------------------------------------------------------------------------------------------------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------

Name of the Staff: R SUNDER

Journal Name: International journal of Computer Applications

Tittle of the Paper:  High Capacity Data Embedding in Images by Pixel Triplets Matching

 

Year of Publication: 2013

Abstract:

 In this paper a data hiding method based on pixel pair matching (PPM) is presented. Pixel pair matching uses a pair of pixel intensity values as reference coordinates and searches the coordinate neighborhood according to the given message digit. The searched coordinate which encodes the message digit is put in place of the pixel pair. Exploiting modification direction (EMD), Diamond Encoding (DE) and Adaptive Pixel Pair Matching (APPM) are recently proposed methods based on PPM. Among these Adaptive Pixel Pair Matching provides the highest capacity of embedding with a given distortion. This paper presents an extension of the method to higher dimensional coordinate system and in particular with Pixel Triplet Matching (PTM). The experiments showed that PTM achieves higher capacity while being computationally feasible. The method is also resistant to simple steganalysis with adjacent HCF-COM.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: R SUNDER

Journal Name: International journal of Computer Applications

Tittle of the Paper:

Block Mean Modulation: An Effective and Robust Image Steganographic Technique in the Spatial Domain

Year of Publication: 2013

Abstract:

 Image steganography is one of the emerging techniques for secret communication in the digital age. In order to have effective secret communication through image steganography, data hiding must be robust to image transformations and effective against analysis techniques. This paper proposes a novel spatial domain data hiding technique in which the secret message is embedded in the quantized mean of image blocks. The experimental results show that the message is preserved after applying common image modifications including jpeg compression, resizing and additive noise to some extent. The block size and quantization factor are optimized through trial and error. The mean of the intensity values in a block is the same as the DC coefficient of the DCT of the block. The effectiveness against common steganalysis methods is also established.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: R SUNDER

Journal Name: International Journal of Applied Engineering Research

Tittle of the Paper:

 A Novel Steganographic Method Based On Vector Quantization of Integer Lifting Wavelet Coefficients

Year of Publication: 2015

Abstract:

 This paper presents a novel method of embedding secret messages in the compressed integer wavelet coefficient domain. The image is divided into uniform sized blocks and transformed using multilevel integer wavelet transform which leaves a single DC coefficient and multiple AC coefficients. The DC coefficients are stored directly and the AC coefficients are compressed using Vector Quantization technique. The secret message bits are quantized and embedded in the least significant bits of the quantized compression error using optimal pixel adjustment process. The error blocks are compressed using adaptive arithmetic encoder. The message hiding capacity is close to 1 bit per pixel while the distortion is very low with a Peak Signal to Noise Ratio (PSNR) of above 30 decibel. The proposed method is compared with conventional steganographic techniques like vector quantization and side match vector quantization and it shows superior performance.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: R SUNDER

Journal Name: International Journal of Advance Research in Science and Engineering

Tittle of the Paper:

High capacity image steganography in the spatial domain using lehmer code

Year of Publication: 2015

Abstract:

Steganography is one of the modern techniques for covert communication through the internet. In addition to providing confidentiality, it also enables the communication of large amounts of data without raising suspicion. This paper presents a novel technique for image steganography using Lehmer code that provides high capacity and better performance. Lehmer code is a way of encoding each possible permutation of a sequence of n numbers. The pixel intensity values are perturbed such that the sorting order of the pixels within a neighbourhood encodes the message digit. If n is the number of pixels in the neighbourhood block then a message digit expressed in base n! could be hidden. This allows high capacity embedding. In order to prevent high distortions of image, only blocks with variance below a set threshold is used for embedding. Experimental results show that the technique promises embedding capacities higher than 2 bits per pixel with minimal distortion. This technique also exhibits significant resistance against common steganalysis methods.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: R SUNDER

Journal Name: International Journal of Advance Research in Science and Engineering

Tittle of the Paper:

A novel spread spectrum image steganography technique with low bit error rate

Year of Publication: 2015

Abstract:

            Spread spectrum image steganography offers high robustness as well as low detectability. The embedded images are statistically and visually indistinguishable from images corrupted by device noise and therefore it cannot be detected by steganalysis. However these methods involve approximate noise estimation algorithms and suffer from high bit error rates at the extraction stage. Hence they require the usage of high redundancy error correcting codes to compensate for the error, thereby drastically reducing the effective embedding capacity. This paper proposes a novel technique to reduce the error rates of extraction by preprocessing the cover images, hiding only a part of the discrete cosine transform coefficients of the message signal and employing a split bregman optimization based extraction stage. The split bregman method has been successfully employed in recovering random binary signal that has undergone the loss of transform coefficients. The bit error rates are reduced to an average of below 5% giving an effective payload of 0.8745 bits per pixel compared to an error rate of above 20% and 0.04 bits per pixel in existing spread spectrum image steganography method. The performance of the method and the effects of various parameters are analyzed using a database of 4000 images. The inability of standard steganalysis tools to distinguish the stego-images from noisy images is demonstrated. The proposed method offers practical and effective secret communication in combination with low redundancy error correcting codes.

------------------------------------------------------------------------------------------------------------------------------------------

Name of the Staff: R SUNDER

Journal Name: International Journal of Science and Research

Tittle of the Paper:

 Providing Security in Social Network with Privacy Preservation

Year of Publication: 2015

Abstract:

            Social network is one of the most important terms we hear these days. Due to its enormous growth, any individual can become a memberin any of these online social networking sites. Consequently, these websites gain huge profit just by providing a platform for the users to communicate. However, we have seen both merits and demerits of these online social networking sites. One of these is that they collect huge personal data and users take risks of trusting them. The collection of these data is made easy by using learning algorithms to predict more private data. This paper explains the possibility of various inference attacks by these private data. These attacks can be minimized by sanitization methods that are put forward in this paper. This paper also comes with the security features which are essential for an online social networking site.

------------------------------------------------------------------------------------------------------------------------------------------

 

 

 

News @ MET'S

View All