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
Palanisamy, V.
- A Two-Way Trust Assurance of Aggregator Node for Ensuring Data Reliability in Wireless Sensor Networks
Authors
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
Source
Wireless Communication, Vol 3, No 15 (2011), Pagination: 1075-1083Abstract
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.
- Genetic Algorithm Based Clustering and Routing Optimization in Mobile Ad Hoc Networks
Authors
1 Department of Computer Science and Engineering, Alagappa University, Karaikudi, Tamil Nadu, IN
Source
Wireless Communication, Vol 3, No 9 (2011), Pagination: 624-629Abstract
Ad hoc networks are wireless, infrastructure less, multi-hop and dynamic network, established by a collection of mobile nodes which provide envisioned features and applications to the modern communication technologies and services. In ad hoc networks clustering technique nodes are formed together and arranged in a group. Due to the dynamic topology of ad hoc network the cluster head (CH) election and route optimization are considering as the complicated processes [1] [2]. In this paper, we used the genetic algorithm (GA) for the CH election and route optimization in mobile ad hoc networks. For this optimization technique we have chosen some parameters such as degree difference, battery power, degree of mobility and sum of the distance of a node of mobile ad hoc networks[7][12]. Simulation results are conducted to evaluate theproposed approach average number of clusters in various environments and its route construction to find, the shortest and a very good path between the source to destination in ad hoc networks.
Keywords
Mobile Ad Hoc Networks, Clustering, GA, CBRP, WCA.- An Investigation of Clustering Algorithms in Wireless Sensor Networks for Energy Minimization
Authors
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
Source
Wireless Communication, Vol 3, No 5 (2011), Pagination: 345-353Abstract
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.- Cluster-Based Multi-Source Multicast Routing Protocol in Mobile Ad hoc Networks using Network Simulator
Authors
1 Department of Computer Science and Engineering, Alagappa University, Karaikudi, Tamil Nadu, IN
2 Department of Computer Science and Engineering, Alagappa University, Karaikudi,Tamil Nadu, IN
Source
Wireless Communication, Vol 2, No 10 (2010), Pagination: 342-348Abstract
Mobile ad hoc networks (MANETs) also called ad hoc networks is a type of wireless network which organized without any physical medium. In this network nodes are moving dynamically without any centralized infrastructure and each node behaving as a self-organizing and self-configuring node i.e. acts as a router. Routing is an essential component of communication networks, which defines act of moving information from source(s) node to destination node(s) in an inter network. Multicast is a type of routing scheme used to send the data packets from the source to multiple destination. Multicasting can support a variety of applications and services. Most existing multicast routing protocols have only one source in a multicast group, as a resulting point of view cluster based multi-source multicasting has been developed to send different kinds of applications in the multicast environment. The proposed routing algorithm is implemented by the network simulator and its packet delivery ratio, control overhead and forwarding efficiency results are drawn by the network animator.Keywords
Mobile Ad hoc Network, Multicasting, Multi-Source Multicasting, Clustering, NS2.- Design and Study of Scanning Technique Based Security Algorithm and It's Applicability in Wireless Communication
Authors
1 Department of Electronics and Communication Engineering, Sri Venkateswara College of Engineering, Sriperumbudur-602108, IN
2 Department of Electronics, Madras Institute of Technology, Chrompet, Chennai-44, IN
3 School of Electrical Sciences, VIT University, Vellore, IN
4 Department of Computer Science and Engineering, Alagappa University, Karaikudi, IN
Source
Wireless Communication, Vol 1, No 3 (2009), Pagination: 142-147Abstract
In today's modern world, wireless technologies have become increasingly popular in our everyday business and personal lives. Personal digital assistants (PDA) allow individuals to access calendars, e-mail, phone number lists, address and the Internet. Some Vendors even provide global positioning system (GPS) capabilities that can pinpoint the location of the device anywhere in the world. In the coming years wireless technologies promise to offer even more features and functions for the future generation. An increasing number of government agencies, businesses, and home users are using, wireless technologies in their environments. An important point here is agencies should be aware of the security risks associated with wireless technologies. Agencies need to develop strategies that will mitigate risks as they integrate wireless technologies into their computing environments. This paper discusses a simple TV scanning technique based on MISO system for wireless communication technologies, outlines the associated antenna design, and offers good resistance to the vulnerabilities in the channel.