Informatics Publishing Limited

N. Chitradevi ¹, V. Palanisamy ², K. Baskaran ³, D. Aswini ⁴

Affiliations
1 IT Department, Kumaraguru College of Technology, Coimbatore - 641 049, IN
2 INFO Institute of Engineering, Coimbatore - 641 007, IN
3 CSE Department, Government College of Technology, Coimbatore - 641 013, IN
4 Kumaraguru College of Technology, Coimbatore-641 049, IN

Abstract

Wireless Sensor Networks (WSNs) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, and to cooperatively pass their data through the network to a base station. Data Fusion/Aggregation can effectively reduce the volume of data transmission in the network, reduce the energy consumption to extend network lifetime and improve bandwidth utilization, as a result, it can overcome the restriction of energy and bandwidth. Moreover since a sensor is typically placed in locations that are accessible to malicious attackers, information assurance of the data fusion process is very important. In order to improve the performance in terms of assurance, overhead and delay, we proposed a novel trust based direct voting mechanism [1]. Our work employs trust metric to poll the witness nodes for in the process of data fusion assurance. In this paper we extended the work of [1] in terms of bottom-up approach where the child node can select the node (parent) to forward the data. Generally, a hierarchical data collection scheme is used by the sensors to report data to the base station, it is difficult to precisely identify and eliminate a compromised node in such a data collecting hierarchy. Most security schemes for sensor networks focuses on developing mechanism for nodes located higher in the hierarchy to monitor those located at lower levels. We propose a complementary mechanism with which the nodes at lower levels can monitor their parents in the hierarchy to identify the behavior, based on that child will select the parent node to forward the data. Every node maintains a reputation (trust) value of its parent and updates this at the end of every data reporting cycle. We propose a novel combination of statistical testing techniques and reinforcement learning schemes to manage the reputation of a parent node. In this paper baye’s theorem is used to evaluate the trust of nodes. The performance of proposed approach is evaluated and compared with previous approaches and found that our approach has a lower overhead than the previous approaches in terms of delay and energy consumption.

Keywords

Wireless Sensor Networks, Data Fusion Assurance, Power-Efficient, Voting Mechanism, Witness Node, Bottom-Up Approach, Reputation.

Full Text

     

N. Chitradevi ¹, V. Palanisamy ², K. Baskaran ³, S. Prabeela ⁴

Affiliations
1 Department of Information Technology, Kumaraguru College of Technology, Coimbatore, Tamil Nadu, IN
2 Department of Electronics and Communication Engineering, INFO Institute of Engineering, Coimbatore, Tamil Nadu, IN
3 Department of Computer Science and Engineering, Government College of Technology, Coimbatore, Tamil Nadu, IN
4 Department of Computer Science and Engineering, Kumaraguru College of Technology, Coimbatore, Tamil Nadu, IN

Abstract

Wireless sensor networks allow distributed sensing and forwarding of data co-operatively during energy efficient operations. Sensor nodes in this network are small and inexpensive, so that they can be produced and deployed in large numbers, and so their resources in terms of energy, memory, computational speed and bandwidth are severely constrained. The information processing algorithms in wireless sensor networks must also use reduced computing power of the sensor networks Critical resource limitations like power constraints demands energy efficient data gathering schemes. Data aggregation, eliminating data redundancy is an efficient data gathering scheme. Cluster analysis, primitive exploration with little or no prior knowledge is an efficient data aggregation scheme. By sending the sink clustered data instead of practical ones, the algorithm can greatly reduce the size and the time of data communication, and further save the energy of the nodes in the network and prolong the system lifetime. This paper provides a more detailed look at some of the existing data clustering algorithms used in wireless sensor networks.

Keywords

Clustering, Clustering Algorithm, Energy Minimization, Unsupervised Technique, Wireless Sensor Network.

Full Text

     

R. Deepa ¹, K. Baskaran ²

Affiliations
1 Amrita Vishwa Vidhyapeetham, Ettimadai, Coimbatore, TN, IN
2 Government College of Technology, Coimbatore, T.N., IN

Abstract

This paper deals with the efficient transmission of JPEG compressed images over Multiple Input Multiple Output (MIMO) systems using spatial multiplexing. By exploiting the spatial multiplexing using multiple antennas, data-rate, reliability, and throughput can be improved. The JPEG compressed image is divided into different quality layer and the antenna path with highest Signal to Interference Noise Ratio (SINR) is selected to transmit the different layers of image. Depending upon the SINR of various paths, the best antenna is selected to transmit the most important feature using a simple unequal power allocation scheme. The performance is evaluated by V-BLAST Zero-Forcing (ZF) receivers. The proposed scheme provides significant image quality improvement and less distortion compared to known schemes.

Keywords

MIMO, Jpeg Compression, Sub-Optimum Receivers.

Full Text

     

K. Baskaran ¹, P. Sivasankar ¹, S. V. Manikanthan ¹

Affiliations
1 Department of ECE, Dr. Pauls Engineering College, IN

Abstract

A fault-tolerant distributed decision fusion in the presence of sensor faults via Collaborative Sensor Fault Detection (CSFD) was used traditionally. CSFD scheme is proposed in which the results of a homogeneity test are used to identify the faulty nodes within the network such that their quantized messages can be filtered out when estimating the parameter of interest. The scheme can identify the faulty nodes efficiently and improve the performance of the decision fusion significantly. It achieves very good performance at the expense of such extensive computations as exponent and multiplication/division in the detecting process. In many real-time WSN applications, the fusion center might be implemented in an ASIC and included in a stand-alone device. Therefore, a simple and efficient decision fusion scheme requiring lower hardware cost and power consumption is extremely desired. In this paper, we propose the Approximated Collaborative Sensor Fault Detection (ACSFD) scheme and its VLSI architecture. Sorting operation are required in ACSFD to find out four biggest faulty node indexes for subsequent usage for this purpose. we have implemented different sorting algorithm to evaluate the efficiency of the sorting network.

Keywords

Decision Fusion, Sensor Fault Detection, Sensor Networks, VLSI Architecture, Wireless Networks.

Full Text

     

V. Vanitha ¹, V. Palanisamy ², K. Baskaran ³

Affiliations
1 CSE Department, Kumaraguru College of Technology, Coimbatore, Tamilnadu, IN
2 Info Institute of Engineering, Coimbatore, Tamilnadu, IN
3 CSE Department, Govt. College of Technology, Coimbatore, Tamilnadu, IN

Abstract

In recent years, there has been a growing interest in service oriented architecture for wireless sensor networks which ease the programming and decouple the application development from the low level details of the nodes and networks. However, there are many fundamental problems that sensor networks research will have to address in order to realize the potential of service oriented wireless senor networks. Chief among them is power. Since the nodes in the wireless sensor networks are energy constraint appropriate routing protocol can drastically reduce the energy consumption and enhance the lifetime of the network. In this paper we propose Energy efficient Service driven Query Routing protocol (ESQR). ESQR routes the query based on the service requested. It makes use of hierarchical, distributed and unequal clustering protocol in which transmission range of the node changes dynamically based on the residual energy and the distance from the base station. Simulation results show that our approach is scalable, minimizes energy consumption, extends the network lifetime and reduces the query latency.

Keywords

Wireless Sensor Networks, Service Oriented Architecture, Query Routing, Hierarchical Routing.

Full Text

     

S. Vidhya ¹, K. Malarvizhi ², K. Baskaran ³, C. Udhaya Shankar ¹, P. Maithili ⁴

Affiliations
1 Department of Electrical and Electronics Engineering, Kumaraguru College of Technology, IN
2 Kumaraguru college of Technology, Coimbatore, IN
3 Government College of Technology, Coimbatore, IN
4 Department of Electrical and Electronics Engineering, Kumaraguru College of Technology, IN

Abstract

Multilevel inverter (MLI) is a new breed of power converter that is suited for high power applications. Multilevel inverter is an effective and practical solution for increasing power and reducing harmonics in ac waveforms. This paper focuses on the implementation of inverted sine PWM technique for asymmetric cascaded multilevel inverter with unequal DC sources. This technique combines the advantage of inverted sine PWM technique and asymmetric cascaded multilevel inverter with unequal DC sources. Performance evaluation of the proposed PWM strategy and inverter topology is done using MATLAB/SIMULINK for single phase asymmetric multilevel inverter.

Keywords

Asymmetric Multilevel Inverter, Multi-Carrier PWM, ISCPWM Technique, THD, Fundamental Output Voltage.

Full Text

     

J. Rangarajan ¹, K. Baskaran ²

Affiliations
1 Department of Electronics and Communication Engineering, Dr. Mahalingam College of Engineering and Technology, IN
2 Department of Computer Science and Engineering, Government College of Technology, Coimbatore, IN

Abstract

In mobile ad hoc network, nodes co-operatively form a network independent of any fixed base station infrastructure. Every node in a mobile ad-hoc network can function as a router and forwards the data packets to the other nodes. Multicasting plays an important role whenever group communications are required. Most of the existing multicast routing protocols in mobile ad hoc networks consider only one source in a multicast group and become inefficient when the protocol is extended to multi-source multicasting. In this paper, we propose a unicast forwarded multi-source multicast routing protocol, for ad hoc networks which is having more than one source in a group. Here, the sources of the group also act as a receiver for other sources in that group. The proposed routing method is a cluster based one and avoids the flooding or broadcasting of control packets to form routing structure. On executing source joining and receiver joining procedures, a complete path for multicast data transfer was established. As the join request control packets are forwarded only through cluster-heads and junction nodes, lower amount of control overhead is incurred. Simulation result shows that the proposed protocol maintains the delivery ratio with reduced control overhead and utilizes the bandwidth efficiently.

Keywords

Ad-Hoc Networks, Multicasting, PUMA, Packet Delivery Ratio, Control Overhead.

Full Text