- Wireless Communication
- Networking and Communication Engineering
- Digital Image Processing
- Artificial Intelligent Systems and Machine Learning
- Indian Journal of Science and Technology
- ICTACT Journal on Communication Technology
- International Journal of Advanced Networking and Applications
- Indian Welding Journal
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Shanmugam, A.
- Performance Analysis of IEEE802.16 OFDM Physical Layer under Different SUI Channels
Authors
1 Bannari Amman Institute of Technology, Sathyamangalam-638401, IN
2 Department of ECE, Bannari Amman Institute of Technology, Sathyamangalam-638401, IN
3 Bannari Amman Institute of Technology, Sathyamangalam - 638401, IN
Source
Wireless Communication, Vol 3, No 4 (2011), Pagination: 265-269Abstract
Wimax which represents world wide interoperability for microwave access is a major part of broad band wireless network having IEEE802.16 standard providing fixed and mobile platform for broadband internet access. The Wimax forum has adopted IEEE 802.16 OFDM PHY layer for the equipment manufacturer due to its robust performance in multipath environment. In this paper we investigate the simulation performance of IEEE 802.16 OFDM PHY layer. The Stanford University Interim (SUI) channel models are selected for the wireless channel in the simulation and we also investigate the estimation of channel at high frequencies with conventional Least Square (LS) and Minimum Mean Square (MMSE) estimation algorithms. Channel state information for OFDM systems based on pilot carrier is carried out through Matlab simulation. The performance of MIMO OFDM is evaluated on the basis of Bit Error Rate (BER) and Mean Square Error (MSE) level.
Keywords
Wimax, OFDM, Channel Model.- Scheduling in Computational Grid Using Improved Ant Colony Optimization Algorithm
Authors
1 Department of Information Technology, SNS College of Technology, Coimbatore, IN
2 Bannari Amman Institute of Technology, Sathyamangalam, Coimbatore, IN
Source
Networking and Communication Engineering, Vol 3, No 4 (2011), Pagination: 253-257Abstract
Grid Computing is the combination of computer resources from multiple administrative domains applied to achieve a goal, it is used to solve scientific, technical or business problem that requires a great number of processing cycles and needs large amounts of data. Grid computing is now being used in many applications that are beyond distribution and sharing resources. One primary issue associated with the efficient utilization of heterogeneous resources in a grid is grid scheduling. The distributed resources are useful only if the grid resources are scheduled. Grid scheduling involves mapping of tasks to resources which are available in grid environment. The main objective of the scheduling is to get the best optimal machine to each task, which makes scheduling a complex problem. Hence a new area of research is developed to obtain optimal solution. Using optimal scheduler results in high performance computing, where as poor schedulers provide contrast results. The scheduling in grid environment has to satisfy a number of constraints of different problems. Heuristic approach is mainly focusing area to solve the grid scheduling problem. In this paper, Efficient Ant colony optimization scheduling algorithm is proposed. The proposed scheduler allocates the best suitable resource to each task with minimal execution time. The experimental results are compared which shows that the algorithm produces better results when compared with the existing ant algorithm.Keywords
Grid Computing, Scheduling, Ant Colony Optimization, Heuristic Approach, NP-Hard.- SPIHT Image Compression Algorithm is Modified for Application to Large Images with Limited Processor Memory
Authors
1 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Satthyamangalam-638401, IN
2 Department of Computer Science Engineering, Bannari Amman Institute of Technology, Satthyamangalam-638401, IN
Source
Digital Image Processing, Vol 3, No 6 (2011), Pagination: 348-352Abstract
The SPIHT image compression algorithm is modified for application to large images with limited processor memory. The sub band decomposition coefficients are partitioned into small tree-preserving spatial blocks which are each independently coded using the SPIHT algorithm. The bit streams for each spatial block are assembled into a single final bit stream through one of two packetization schemes. The final bit stream can be embedded in fidelity with a small expense in rate. SPIHT encoding and decoding of the spatial blocks can be done in parallel for real-time video compression.Keywords
Decomposition, SPIHT Algorithm, Packetization, Sub-Bitstream.- A Novel Method for Visioned Robot as a Soccer Player
Authors
1 Bannari Amman Institute of Technology, Sathyamangalam, IN
Source
Artificial Intelligent Systems and Machine Learning, Vol 2, No 8 (2010), Pagination: 175-178Abstract
This paper introduces methods to recognize the objects in a football field, by the aid of vision. Robot football is a challenging task in the world of autonomous robots and related research areas. One of the main problems in this task is to determine the presence and the location of objects from the robot’s point of view. Our mobile robot needs to know where it is located, where the ball target object is and the distance between the robot and the ball. A webcam is mounted on the robot that captures the surrounding of the robot. The objects in the image are the light gray floor and a red ball. The image is then processed to identify the presence of a red ball. Based on the position of the ball the control commands are given to the robot. The direction in which the ball is present is found by calculating the angle between the robot and the ball. The robot then moves towards the ball and kicks it.Keywords
Robots, Computer Vision, Color Variation, Object Identification, Camera Calibration, Analysis of Robot Performance.- An Entertaining Robot:Pulsed Through Audio Analysis
Authors
1 Dept. of IT, Bannari Amman Institute of Technology, Sathyamangalam, IN
2 Department of Electrical and Electronics Engineering, Bannari Amman Institute of Technology, Sathyamangalam, IN
3 Bannari Amman Institute of Technology, Sathyamangalam, IN
Source
Artificial Intelligent Systems and Machine Learning, Vol 1, No 8 (2009), Pagination: 301-304Abstract
This paper focuses on Humanoid robots (androids), are becoming increasingly useful for two reasons: (a) they can perform in environments that have been engineered specifically for humans, and (b) they make it easier for humans to interact with computers. The core of this effort is to simulate humanoid robots, and in particular how to program their movements according to the musical audio as easily and as effectively as possible. Our technique mainly focus on extracting the features such as pitch, frequency values from the musical beats by analyzing a musical audio and synthesizing a motion for the virtual character where the character's movement synchronizes to the musical beats. Our method consists of a motion analysis, a music analysis, and a motion synthesis based on the extracted features. The beat feature can be possibly used in systems for understanding higher level properties of the song.Keywords
Androids, Interact, Humanoid Robots, Movements, Musical Audio, Motion, Virtual Character, Synchronize, Beats, Pitch, Frequency, Extraction.- An Integrated Harmony Search Method for Text Clustering using a Constraint based Approach
Authors
1 Sri Krishna College of Technology, Coimbatore - 641008, Tamil Nadu, IN
2 SNS College of Technology, Coimbatore - 641035, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 29 (2015), Pagination:Abstract
Background: An application get a global reach only if it is web based. Such types of applications are found existing in large. Storing and retrieval of information is always challenging task. Retrieving relevant data from high dimensional data is always very significant and complicated as well. Data mining plays a major role in the information retrieval process. Method: Grouping of data makes information retrieval easier. Clustering is one of the most important data mining techniques for grouping the data. Document clustering partitions the entire data into number of groups, where the data in each group should have large degree of resemblance. Findings: K-means algorithm is one of the most important portioning based algorithms which is easy to implement. Due to its time complexity, K-means can be hybridized with Harmony Search Method(HSM). HSM is a new meta-heuristic optimization method which imitates the music improvisation process. The various methodologies like Term Frequency-Inverse Document Frequency (TF-IDF), Coverage Factor (CF), Concept Factorization, Constrained based clustering have been applied on the same dataset to cluster the documents. A comparison has been made among all the above methodologies and an experimental result shows that constraint based clustering method has produced efficient clusters and it outperforms the other three methods. This constraint based clustering helps the input documents to be clustered in an effective way.Keywords
Concept Factorization, Constraint Based Clustering, Coverage Factor, Harmony Search Method- Design of Multiple Printed Dipole Antennas in Different Configuration for Wireless Communication Applications
Authors
1 Department of Information Technology, Bannari Amman Institute of Technology, IS
2 Bannari Amman Institute of Technology, IN
Source
ICTACT Journal on Communication Technology, Vol 3, No 3 (2012), Pagination: 567-571Abstract
A printed dipole antenna for wireless communication applications is designed and simulated using ADS software. This paper presents the simulated results of array of printed dipole antennas for different configuration which are used in the MIMO systems. The antenna is designed and characterized by measuring return loss, directivity, gain and radiation pattern. It also presents the channel capacity of MIMO system and single antenna system.Keywords
Printed Dipole, Dipole Configurations, Capacity, MIMO.- Coexistence of IEEE 802.15.4 with IEEE 802.11b
Authors
1 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, IN
Source
ICTACT Journal on Communication Technology, Vol 1, No 3 (2010), Pagination: 157-165Abstract
The recurrent collocation of IEEE 802.15.4 Wireless Sensor Networks (WSNs) and IEEE 802.11b Wireless Local Area Networks (WLANs) consequence in coexistence issues, as these networks share the same 2.4GHz Industrial, Scientific, and Medical (ISM) band. As a result, their performance may degrade. We have proposed a coexistence model of IEEE 802.15.4 and IEEE 802.11b networks, which attend to their coexistence behavior and explain their coexistence performance. The packet error rate (PER) of the IEEE 802.15.4 under the interference of the IEEE 802.11b is taken as a foremost performance measure , and is obtained from the bit error rate (BER). The signal to noise and interference ratio is used to calculate the BER. The minimum distance between IEEE 802.15.4 and IEEE 802.11b is observed from the PER. Throughput, average end-end delay and average jitter is used as performance measures to analyze the performance of IEEE802.15. The methodical results are validated for various topologies with and without mobility model using Qualnet 4.5 simulation.Keywords
Bit Error Rate, Coexistence, IEEE 802.11b, IEEE 802.15.4, Throughput, End-End Delay and Jitter.- Performance Analysis of DSR Routing Protocol under Energy Based Selfish Attack in Mobile Ad Hoc Networks
Authors
1 Bannari Amman Institute of Technology, Sathyamangalam, IN
Source
ICTACT Journal on Communication Technology, Vol 1, No 2 (2010), Pagination: 80-84Abstract
Mobile Ad hoc Networks (MANETs) rely on the cooperation of all participating nodes to provide the fundamental operations such as routing and data forwarding. However, due to the open structure and scarcely available battery-based energy, node misbehaviors may exist.[1]. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. This paper pointed out Energy based selfish nodes (EBSN) where these selfish nodes tend to use the network but do not cooperate, saving battery life for their own communications [2],[3]. We present a simulation study of the effects of Energy based selfish nodes (EBSN) on DSR routing protocol and its impact over network performance in terms of throughput and delay of a mobile ad hoc network where a defined percentage of nodes were misbehaving.Keywords
Cooperation, Selfish Nodes, Ad Hoc Network, Routing.- A Comparative Study on Dynamic Time Warping (DTW) and Arbitrary Selection Load Balancing (ASLB) Approaches to Heterogeneous P2P Networks
Authors
1 Department of Computer Applications, Bannari Amman Institute of Technology, Sathyamangalam – 638401, IN
2 Bannari Amman Institute of Technology, Sathyamangalam – 638401, IN
Source
International Journal of Advanced Networking and Applications, Vol 5, No 2 (2013), Pagination: 1904-1907Abstract
The World Wide Web is a vast network of documents that are linked together a set of protocols defining how the system work and transfer data. The explosion of data traffic on the World Wide Web (WWW), web servers are often experiencing overload from an increasing number of users accessing the servers at the same time. With increased popularity of web, there are a number of problems such as Servers overloaded, Internet Backbone congestion and Slow web services access, etc.,. To address the performance and scalability problems of web servers, more virtual servers and mirror servers were developed with many load balancing approaches. Among the many other approaches for efficient load balancing in distributed heterogeneous P2P networks, Dynamic Time Warping (DTW) approach and Arbitrary Selection Load Balancing (ASLB) approaches plays a vital role. This paper mainly focuses on comparative study of Dynamic Time Warping (DTW) and Arbitrary Selection Load Balancing (ASLB) approaches to Heterogeneous P2P Networks.Keywords
Dynamic Time Warping, Heterogeneous, Load Balancing, Peer to Peer Network, World Wide Web.- Process Stability Criterion for MIG Welding
Authors
1 Welding Research Institute, BHEL, Tiruchirapalli - 620 014, IN