Informatics Publishing Limited

E. Mohanraj ¹, K. Duraiswamy ²

Affiliations
1 Department of Computer Science and Engineering, K. S. Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN
2 K. S. Rangasamy College of Technology, Tiruchengode, Tamilnadu

Abstract

To provide an efficient QoS routing communication in MANET in a secure way, we implement an enhancing security and QoS routing in MANET by adapting optimization technique of Ant Colony Optimization with Fairness Index and the security of MANET for data communication is achieved by using Group Key management with self assessment key. This stimulates us to consider both security and QoS routing together in ad hoc scenario for both routing and message/data communication. To improve the secure data communication in MANET, we present a routing based data security using group key management based on self assessment key. The nodes in the network will creates its own key (self assessment key) based on the group which has maintains its unique key before it has been joined into the network for data communication security to recover the node reputation on receiving the data or sending the data to and from other mobile nodes. An experimental evaluation is done to estimate the performance of the proposed enhancing security and QoS routing using group self assessment key [ESQR] in MANET in terms of energy, throughput, and network lifetime.

Keywords

MANET, Security, QoS Routing, Group Self Assessment Key, Fairness Index, Data Communication.

Full Text

     

p. Sivakumar ¹, K. Duraiswamy ²

Affiliations
1 Manakula Vinayagar Institute of Technology, Pondicherry, IN
2 K. S. Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN

Abstract

Mobile ad hoc network (MANET) is a collection of wireless mobile nodes or routers dynamically forming a temporary network without the use of any existing infrastructure or centralized administration and it has to face many challenges in real time multimedia communication. The quality of service (QoS) Constraints such as bandwidth and delay make the routing of MANET for real time traffic is a tedious task. This paper proposes to develop a QoS routing discovery protocol for real time traffic in mobile ad hoc network. This technique involves construction of bandwidth and delay aware paths between a source-destination pair. Initially the bandwidth availability and expected delay are estimated for each path and the source selects the best path with maximum bandwidth and minimal delay. We use the NS2 simulator on Linux operating system to showsthe performance based on the throughput, packet delivery ratio and average end-to-end delay metrics.

Keywords

Mobile Ad Hoc Network, Quality of Service, Real Time Traffic, Routing Discovery Protocol, Source-Destination Pair.

Full Text

     

V. Thilagavathe ¹, K. Duraiswamy ²

Affiliations
1 Institute of Road and Transport Technology, Erode, Tamilnadu, IN
2 Department of CSE, K.S.Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN

Abstract

Mobile ad hoc network (MANET) is a collection of wireless nodes and they communicate using radio devices without any pre-existing infrastructure. A major issue in MANET route selection is node mobility disrupting link reliability. It consequences the dynamic generation of the less reliable paths in adhoc routing protocols. In order to address this problem, the link availability prediction technique is used to find the reliable link which in turn finds the reliable path. This paper aims to study about the existing link availability prediction techniques to predict the link availability in MANET.

Keywords

Link Availability, Mobile Adhoc Network, Node Mobility, Routing, Stability.

Full Text

     

A. Suresh ¹, K. Duraiswamy ¹

Affiliations
1 Department of MCA in K.S.Rangasamy College of Technology, Tiruchengode, IN

Abstract

High speed satellite networks are emerging fast in the communication domain. Bandwidth Delay Products (BDP) plays an important role in the design of a congestion control algorithm for the effective usage of network resources. Bandwidth delay products (BDPs) are referred as the maximum amount of unacknowledged data that allowed in flight at any moment in the network. TCP is originally designed for a general wired network. In case of BDP, packet losses rarely occur. TCP can no longer guarantee good bandwidth utilization.

Solutions proposed to provide reliable packet delivery in MANETs are non TCP variants and TCP variants. Non TCP variants focus on the modification of congestion control algorithms in the transport protocol. It requires complicated mathematical computation and incur excessive network overhead. Although relatively accurate congestion information obtained, it cannot retain the end-to-end semantics of a transport protocol.

 The work presented in this paper extends the Datagram Transport Protocol over Ad Hoc Networks (DTPA) for efficient adaptable MANETs in the changing network scenario. The extension is carried out by achieving fairness in the TCP flow of the MANET with adaptive Max-Min Fairness algorithm. The extended work incorporates a fixed size window based flow control algorithm and a cumulative bit vector based SACK (selective ACK) strategy. Simulation carried out guarantees reliable transmission and recovering packet losses. It improves the network performance in terms of throughput, round trip time, number of retransmissions, and IP queue size demonstrated by simulation conducted using NS2.

Keywords

MANET, DTPA, SACK, TCP and Bandwidth Delay Products (BDP).

Full Text

     

K. Prasanth ¹, K. Duraiswamy ²

Affiliations
1 Department of Information Technology, K.S. Rangasamy College of Technology, Tamilnadu, IN
2 K.S. Rangasamy College of Technology, Tamilnadu, IN

Abstract

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Potential Edge Node Based Greedy Routing), a greedy position based routing approach which uses potential score based strategy to forward packets to the node present in the edge of the transmission range of source/forwarding node as most suitable next hop. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results using ns 2.33 shows that routing overhead is reduced considerably compared to other routing techniques of VANET.

Keywords

Vehicular Ad hoc Networks, Greedy Position Based Routing, EBGR, Revival Mobility Model, Routing Overhead.

Full Text

     

A. Sabari ¹, K. Duraiswamy ²

Affiliations
1 K S. Rangasamy College of Technology, Tiruchengode – 637215, IN
2 K. S. Rangasamy College of Technology, Tiruchengode – 637 215, IN

Abstract

Mobile Ad Hoc Networks (MANET) is an infrastructureless network with a set of dynamic, mobile and self-organizing nodes. Several methods have been proposed as solutions to the challenges associated with MANETs inspired by the Ant Colony Optimization (ACO) algorithm. ACO is a nature inspired algorithm based on the foraging behavior of ants. Ants have been found to discover the shortest path from their nest to food over time using very adaptive means. Multicast provides an efficient way of dissemination of data from a sender to a group of receivers. One interesting research area in MANET is multicast routing. Due to the adaptive and dynamic nature, ant based multicast routing algorithms are gaining more importance in routing. This has led to development of many different ant based multicast routing protocols for MANETs. It is quite difficult to determine which protocols may perform best under frequent node mobility, varying number of nodes, dynamic topology, diverse link capacities, various group and packet size, limited practical bandwidth of the shared wireless channel and the battery power availability. Consequently, it becomes necessary for MANETs to have an efficient multicast routing based on ACO and a Quality of Service (QoS) mechanism. In this paper, we have provided an overview of a wide range of ant based multicast routing protocols proposed in the literature.

Keywords

Ant Colony Optimization, Mobile Ad Hoc Network, Swarm Intelligence.

Full Text

     

R. Nallusamy ¹, K. Duraiswamy ²

Affiliations
1 Computer Science and Engineering Department, KS Rangasamy College of Technology, Tiruchengode-637215, IN
2 KS Rangasamy College of Technology, Tiruchengode-637215, IN

Abstract

This paper proposes a new Genetic algorithm with shrink wrap algorithm based initial population selection for the dynamic shortest path routing. Shortest path routing is the basic problem for number of real life problems. Different shortest path optimization problems can be solved by using various approximation algorithms due its computational complexity. The routing in packet switched multi-hop networks can be described as a classical combinatorial optimization problem i.e. a shortest path routing problem in graphs. The proposed algorithm shows that the GA and shrink wrap algorithms are best candidates for the optimization of dynamic shortest path routing problems due to their fastness in computation comparing to other soft computing and met heuristics algorithms.

Keywords

Combinatorial Optimization, Dynamic Shortest Path Routing Problem, Genetic Algorithm, Shrink Wrap Algorithm.

Full Text

     

M. Latha ¹, K. Duraiswamy ²

Affiliations
1 Department of Computer Science, Sri Sarada College for Women, Salem-16, IN
2 K.S.R. College of Engineering, K.S.R. Kalvi Nagar, Tiruchengode, IN

Abstract

The Object-Oriented paradigm has become increasingly popular in recent years. Researchers agree that, although maintenance may turn out to be easier for Object-Oriented systems, it is unlikely that the maintenance burden will completely disappear.One approach to controlling software maintenance costs is the utilization of software metrics during the development phase, to help identify potential problem areas. Many new metrics have been proposed for Object-Oriented systems.

The purpose of this work is to apply three existing Object-Oriented design complexity metrics and, specifically, to assess their ability to predict maintenance time for the polymorphism process.This research reports the results of validating three metrics,Interaction Level (IL), Interface Size (IS), and Operation Argument Complexity (OAC).

This system is designed to estimate maintenance time for the software's that are developed by using java. A controlled experiment was conducted to investigate the effect of design complexity (as measured by the above metrics) on maintenance time. Each of the three metrics by itself was found to be useful in the experiment in predicting maintenance performance.

Keywords

Interface Size Interaction Level Maintenance Time, Operation Argument Complexity.

Full Text

     

M. Latha ¹, K. Duraiswamy ²

Affiliations
1 Department of Computer Science, Sri Sarada College for Women, Salem-16, IN
2 K.S.R College of Engineering, K.S.R Kalvi Nagar, Tiruchengode, IN

Abstract

The Object-Oriented paradigm has become increasingly popular in recent years. Researchers agree that, although maintenance may turn out to be easier for Object-Oriented systems, it is unlikely that the maintenance burden will completely disappear. One approach to controlling software maintenance costs is the utilization of software metrics during the development phase, to help identify potential problem areas. Many new metrics have been proposed for Object-Oriented systems.

The purpose of this work is to apply three existing Object-Oriented design complexity metrics and, specifically, to assess their ability to predict maintenance time for the inheritance process. This research reports the results of validating three metrics, Interaction Level (IL), Interface Size (IS), and Operation Argument Complexity (OAC).

This system is designed to estimate maintenance time for the software's that are developed by using java. A controlled experiment was conducted to investigate the effect of design complexity (as measured by the above metrics) on maintenance time. Each of the three metrics by itself was found to be useful in the experiment in predicting maintenance performance.

Keywords

Interface Size Interaction Level Maintenance Time, Operation Argument Complexity.

Full Text

     

P. M. Shanthi ¹, K. Duraiswamy ²

Affiliations
1 Department of MCA, K.S.Rangasamy College of Technology, Tiruchengode-637 215, IN
2 Department of Computer Science and Engineering, K.S.Rangasamy College of Technology, Tiruchengode-637 215, IN

Abstract

In this computerized world, software growth rate is increasing steadily. Some company‘s plays an important role in this growth by developing and releasing new software to lead a leading position in the software development process. In order to make the product to be used by most of the people, the company releases their product as free software. The free software is a open source software which can be downloaded and utilized by all kinds of user with free of cost. (i.e,) No cost for downloading the software. The open source software is the software that is developed without proper management. The quality and reliability of this software is not well designed. Since this software is an open source, the user is the only responsible person to solve all their problems faced in that software. The problem may arise while utilizing this software. Some of the problems faced by the user are they may not be aware of its purpose, performance, usefulness or there may occur some errors. Due to these problems, the user may get confused of whether use this software further or leave it and search for an alternate one. They may also search for an alternate if they not understand the errors occurred in this software. In such situation, the rate of people accessing this software becomes low. In order to help the users to manage the problems, we propose a fault tolerant technique in this paper. In this technique, the errors found in the open source software is automatically detected and reported. The fault tolerant is the technology that will tolerate the fault found in the software automatically and so the technology is termed as Automated Software. In this paper, we propose this fault tolerant technology in the open source software, to find the error rate automatically. Due to this automated technique, the rate of the people utilizing the software becomes more. The aim of the paper is to propose a strategy to determine the performance of the open source software by deducing the error found in that software. This aim has to be achieved by deriving an algorithm to open and read the software and also to determine the errors automatically. Thus this paper implements an effective methodology in order to make the open source software useful by means of an automated fault tolerant technique to deduct and report the error found in the software, and to decrease the problem rate and manual effort.

Keywords

Automated Software, Computerized world, Deduce Error, Download, Effective Methodology, Error Rate, Error Report, Fault Tolerant, Free Software, Open Source Software.

Full Text

     

M. Latha ¹, K. Duraiswamy ²

Affiliations
1 Sri College for Women, IN
2 K.S.R. College of Engineering & Tech, IN

Abstract

The Object-Oriented paradigm has become increasingly popular in recent years. Researchers agree that, although maintenance may turn out to be easier for Object-Oriented systems, it is unlikely that the maintenance burden will completely disappear. One approach to controlling software maintenance costs is the utilization of software metrics during the development phase, to help identify potential problem areas. Many new metrics have been proposed for Object-Oriented systems. The purpose of this work is to apply three existing Object-Oriented design complexity metrics and, specifically, to assess their ability to predict maintenance time for the reverse engineering process. This research reports the results of validating three metrics, Interaction Level (IL), Interface Size (IS), and Operation Argument Complexity (OAC). This system is designed to estimate maintenance time for the softwares that are developed by using java. A controlled experiment was conducted to investigate the effect of design complexity (as measured by the above metrics) on maintenance time. Each of the three metrics by itself was found to be useful in the experiment in predicting maintenance performance.

Keywords

Interaction Level, Interface Size, Maintenance Time, Operation Argument Complexity.

Full Text

     

S. Vijayaragavan ¹, K. Duraiswamy ²

Affiliations
1 Rajiv Gandhi College of Engineering and Technology, Kirumambakkam, Pondicherry, IN
2 K.S. Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN

Abstract

Mobile ad hoc networks (MANETs) are characterized by dynamic topology, limited channel bandwidth and limited power at the nodes. Because of these characteristics, paths connecting to the source nodes with destinations may very unstable and go down at any time, making communication over ad hoc networks difficult. Multicasting is intended for group-oriented computing. Multicast generally needs a tree construction that connects all the members of the multicast group as well as the nodes where data packets are duplicate. In this paper, we compared the multicast multipath routing protocols. The MAODV (Multicast Ad hoc On-demand Distance Vector) routing protocol shows a smooth performance in light load ad hoc networks. However, as degraded quickly. Multipath routing allows building and use of multiple paths for routing between source and destination pair. It exploits the resource redundancy and diversity in the underlying network to provide benefits such as fault tolerance, load balancing, bandwidth aggregation, and improvement in QoS metrics such as delay. Multiple Tree- MAODV (MT-MAODV) routing protocol consists mainly of constructing two disjoint trees. Only when the two links are broken, the source nodes restart to find new routes. So it decreases the number of routing discovery and reduces routing overhead. The MT-MAODV preferably ensure the network performance in heavy load ad hoc networks.

Keywords

Multicast, Multipath, VCR, Mobile Adhoc Network.

Full Text

     

T. Thillaikkarasi ¹, A. Jagadeesan ², K. Duraiswamy ³

Affiliations
1 Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam-638 401, Tamil Nadu, IN
2 Bannari Amman Institute of Technology Sathyamangalam-638 401, Tamil Nadu, IN
3 K.S.R. College of Technology, Tiruchengode, Tamil Nadu, IN

Abstract

This paper describes the development of a Multiprocessor System-on-Chip (MPSoC) with a novel interconnect architecture incorporating memory allocation. It addresses the problem of mapping a process network with data dependent behavior and soft real time constraints onto the heterogeneous multiprocessor System on Chip (SoC) architectures and focuses on a memory allocation step which is based on an integer linear programming model. An application is modeled as Kahn Process Network (KPN) which makes the parallelism present in the application explicit. The main contribution of our work is an MILP based approach which can be used to map the KPN of streaming applications with data dependent behavior and interleaved computation and communication. Our solution minimizes hardware cost while taking into account the performance constraints. One of the salient features of our work is that it takes into account the additional overheads because of data communication conflicts. It permits to obtain an optimal distributed shared memory architecture minimizing the global cost to access the shared data in the application, and the memory cost. Our approach allows automatic generation of an architecture-level specification of the application.

Keywords

Application Specific Multiprocessors, Integer Linear Programming, Kahn Process Networks, System on Chip.

Full Text

     

R. Sasikala ¹, K. Duraiswamy ²

Affiliations
1 K. S. Rangasamy College of Technology, Tiruchengode–637 215, IN
2 K.S.Rangasamy College of Technology, Tiruchengode–637 215, IN

Abstract

Group communications require a reliable multicast protocol that guarantees safe data delivery in a reasonably short time. As these applications grow in use, scalability becomes an important issue. To support these applications, several multicast transport layer protocols have been proposed and implemented. These protocols may suffer from the length of the retransmission paths between source and receivers which yields very high cost for retransmissions. An approach to reduce latency of multicast transport layer protocol is to recover the lost packet locally by requesting local replier. This paper gives the solution that local replier can be selected dynamically based on the link properties such as Bandwidth Delay Product and reliability of link. We measured recovery latency for all loss cases, namely, source, receivers, and links. Results show that the recovery latency is decreased by 17.73% to 40.59%. This percentage of improvement increases linearly, when tree size increases. Also number of duplicate replies received by the receiver is zero when loss is at the receiver and link. This approach also reduces the routing overhead significantly.

Keywords

Proxy, Bandwidth Delay Product, Recovery Latency, Exposure.

Full Text

     

P. Meenakshi Devi ¹, M. Venkatesan ¹, K. Duraiswamy ¹

Affiliations
1 K. S. Rangasamy College of Technology, Tamil Nadu, IN

Abstract

In a cryptography based authentication watermarking, a message authentication code of the whole image is computed and the resulting code is inserted into the image itself. This paper proposes an efficient authentication watermarking scheme using integer wavelet transform. The already existing spatial domain technique is applied in wavelet domain. Embedding data in wavelet domain offers high degree of robustness against common image processing operations. The proposed scheme reduces the number of required prioritized sub-blocks to be half. To embed k-bits of secret data, the proposed scheme requires only k/2 sub blocks. The scheme is suitable for both small and large images. It detects any alteration while maintaining good visual quality.

Keywords

Authentication Watermarking, Integer Wavelet Transform, Pattern Matching, Lossless Quantization.

Full Text

     

A. Gnanabaskaran ¹, K. Duraiswamy ¹

Affiliations
1 K.S. Rangasamy College of Technology, Tiruchengode-637215, IN

Abstract

Clustering low dimensional spatial data for traffic risk analysis has been major issue due to sparsity of data points. Most of mthe clustering algorithm becomes inefficient if the required distance similarity measure is computed for low dimensional spatial space of high dimensional data with sparsity of data point along different dimensions. objective of this study were to contribute the complexity of projecting clusters for traffic risk analysis, (i) There is no support for minimizing the number of dimensions on spatial space in order to reduce the searching time (ii) Comparison of computation time of HARP, Proclus, Doc, FastDoc, SSPC algorithms. During the first phase the satellite captured still images for different dimensions network are enhanced and this images are given as input to second phase spatial attribute relevance analysis for detecting dense and sparse regions after detecting dense and sparse regions the algorithm employees pruning technique to reduce the search space by taking only dense traffic regions and eliminating sparse traffic region and during third phase K-means algorithm is employed to project the clusters on different spatial dimensions. As per the Results first we showed that various projecting clustering algorithm on spatial space becomes inefficient if the number of dimensions increases. The new scheme proposed reduces the spatial dimension space so that it reduces the computation time and finally the result is compared with HARP, Proclus, Doc, FastDoc, SSPC. The algorithms produces acceptable results when the average cluster dimensionality is greater then 10%. Hence as for as Conclusion the findings suggested the overhead reasonably minimized and using simulations, we investigated the efficiency of our schemes in supporting low dimensional spatial clustering for traffic risk analysis.

Keywords

Data Mining, Clustering, Low Dimensions, Projected Clustering.

Full Text

     

B. Jayanthi ¹, K. Duraiswamy ²

Affiliations
1 P.G.Department of Computer Science, Kongu Arts and Science College, Erode, Tamilnadu, IN
2 K.S. Rangasamy College of Technology, Tiruchengode, Tamilnadu, IN

Abstract

In this paper an algorithm is proposed for mining frequent itemsets. This paper proposes a new framework to generate frequent Itemsets/Patterns. First, a partitioning technique is used to divide a transaction database TDB into n non-overlapping partitions. Second we use fp-graph model to discover frequent itemsets for each partition. Example illustrating the proposed approach is given. The characteristics of the algorithm are discussed.

Keywords

Data Mining, Frequent Patterns, Frequent Itemset, Partitioning Technique, FP-Graph, Association Rule.

Full Text

     

A. Jagadeesan ¹, T. Thillaikkarasi ¹, K. Duraiswamy ²

Affiliations
1 Bannari Amman Institute of Technology, Sathyamangalam-638401, Tamil Nadu, IN
2 K.S.R. College of Technology, Tiruchengode-637209, Tamil Nadu, IN

Abstract

Human users have a tough time remembering long cryptographic keys. Hence, researchers, for so long, have been examining ways to utilize biometric features of the user instead of a memorable password or passphrase, in an effort to generate strong and repeatable cryptographic keys. Our objective is to incorporate the volatility of the user's biometric features into the generated key, so as to make the key ungues sable to an attacker lacking significant knowledge of the user's biometrics. We go one step further trying to incorporate multiple biometric modalities into cryptographic key generation so as to provide better security. In this article, we propose an efficient approach based on multimodal biometrics (Iris and fingerprint) for generation of secure cryptographic key. The proposed approach is composed of three modules namely, 1) Feature extraction, 2) Multimodal biometric template generation and 3) Cryptographic key generation. Initially, the features, minutiae points and texture properties are extracted from the fingerprint and iris images respectively. Subsequently, the extracted features are fused together at the feature level to construct the multi-biometric template. Finally, a 256-bit secure cryptographic key is generated from the multi-biometric template. For experimentation, we have employed the fingerprint images obtained from publicly available sources and the iris images from CASIA Iris Database. The experimental results demonstrate the effectiveness of the proposed approach.

Keywords

Biometrics, Multimodal, Fingerprint, Minutiae Points, Iris, Rubber Sheet Model, Fusion, Segmentation, Cryptographic Key, Chinese Academy of Sciences Institute of Automation (CASIA) Iris Database.

Full Text

     

C. Karthikeyan ¹, K. Duraiswamy ²

Affiliations
1 K.S.R College of Engineering, Tamilnadu, IN
2 K.S. Rangasamy College of Technology, Tamilnadu, IN

Abstract

In recent years, cascaded multilevel inverters find more attention in the areas of distributed energy resources in order to connect batteries, micro turbines, fuel cells and solar cells so as to feed a load or the AC grid. In the multilevel inverters, harmonics has to be reduced effectively. Here, an efficient hybrid technique is proposed to reduce the harmonics by optimally selecting the switching angles for n-level cascaded multilevel inverters. The technique exploits neural network and genetic algorithm with adaptive mutation that determines the optimal switching angles not only with minimum total harmonic distortion but also with reduced computational time. As the genetic algorithm performance relies on the parameters such as population size, crossover rate, mutation rate and number of generations, the neural network determines the best parameters. By utilizing the obtained best parameters, the genetic algorithm determines the optimal switching angles for the cascaded multilevel inverter. As the genetic aalgorithm performs adaptive mutation, quick convergence tosolution is achieved and so the optimal switching angles are obtained in very less computational time. The implementation results show that the proposed hybrid as well as adaptive technique is effective in reducing the harmonics of the cascaded multilevel inverter.

Keywords

Cascaded Multilevel Inverter, Harmonics, Genetic Algorithm (GA), Artificial Neural Network (ANN), Total Harmonic Distortion (THD).

Full Text

     

R. Nallusamy ¹, K. Duraiswamy ²

Affiliations
1 Computer Science and Engineering Department, K.S. Rangasamy College of Technology, Tiruchengode-637215, IN
2 K.S. Rangasamy College of Technology, Tiruchengode-637215, IN

Abstract

This paper reviews the overview of the dynamic shortest path routing problem and the various neural networks to solve it. Different shortest path optimization problems can be solved by using various neural networks algorithms. The routing in packet switched multi-hop networks can be described as a classical combinatorial optimization problem i.e. a shortest path routing problem in graphs. The survey shows that the neural networks are the best candidates for the optimization of dynamic shortest path routing problems due to their fastness in computation comparing to other softcomputing and metaheuristics algorithms.

Keywords

Combinatorial Optimization, Dynamic Shortest Path Routing Problem, Neural Networks, Packet Switched Multi Hop Networks.

Full Text

     

T. Thillaikkarasi ¹, A. Jagadeesan ¹, K. Duraiswamy ²

Affiliations
1 Bannari Amman Institute of Technology, Tamil Nadu, IN
2 K.S.R.College of Technology, Tiruchengode, Tamil Nadu, IN

Abstract

This paper describes the development of a Multiprocessor System-on- Chip (MPSoC) with a novel interconnect architecture incorporating memory allocation. It addresses the problem of mapping a process network with data dependent behavior and soft real time constraints onto the heterogeneous multiprocessor System on Chip (SoC) architectures and focuses on a memory allocation step which is based on an integer linear programming model. An application is modeled as Kahn Process Network (KPN) which makes the parallelism present in the application explicit. The main contribution of our work is an MILP based approach which can be used to map the KPN of streaming applications with data dependent behavior and interleaved computation and communication. Our solution minimizes hardware cost while taking into account the performance constraints. One of the salient features of our work is that it takes into account the additional overheads because of data communication conflicts. It permits to obtain an optimal distributed shared memory architecture minimizing the global cost to access the shared data in the application, and the memory cost. Our approach allows automatic generation of an architecture-level specification of the application.

Keywords

Application Specific Multiprocessors, Integer Linear Programming, Kahn Process Networks, System on Chip, Memory Allocation.

Full Text

     

K. Prasanth ¹, K. Duraiswamy ², K. Jayasudha ³, C. Chandrasekar ⁴

Affiliations
1 Dept of IT, K.S.Rangasamy College of Technology, Tiruchengode (T.N), IN
2 Dept of CSE, K.S.Rangasamy College of Technology, Tiruchengode (T.N), IN
3 Dept of Computer Applications, K.S.R College of Engineering, Tiruchengode (T.N), IN
4 Periyar University, Salem (T.N), IN

Abstract

Vehicular Ad-hoc Networks (VANETs) have been recently attracting an increasing attention from both research and industry communities. VANETs are currently deployed on a large scale, research in this area is mostly simulation based. Mobility models or the movement patterns of nodes communicating wirelessly, play a vital role in determining the protocol performance in VANET. We still have a limited understanding of the required level of mobility details for modeling and simulating VANETs. Thus, it is essential to study and analyze various mobility models and their effect on VANET protocols. In this paper, we examine d different mobility models proposed in the recent research literature. We proposed Revival Mobility Model (RMM) and evaluate its effect on packet delivery in VANETs by ns-2 simulations.

Keywords

Vehicular Ad Hoc Networks, Mobility Modeling, Revival Mobility Model, Packet Delivery Ratio.

Full Text