Refine your search
Collections
Co-Authors
Journals
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
Paramasivan, B.
- A Study on Leakage Detection and Management of Underground Water Lines using Wireless Sensor Networks
Abstract Views :195 |
PDF Views:3
Authors
Affiliations
1 National Engineering College, Kovilpatti-628 503, Tamilnadu, IN
1 National Engineering College, Kovilpatti-628 503, Tamilnadu, IN
Source
Wireless Communication, Vol 4, No 14 (2012), Pagination: 827-831Abstract
This paper focuses on an application of wireless sensor networks for leakage detection in underground water pipes to overcome the problem of water dispersion in water distribution networks. Leakage prevention and breaks identification in water distribution networks are fundamental for an adequate use of natural resources. Nowadays, all over the world, water wasting along the distribution path reaches untenable percentages (up to 80 % in some regions). Since the pipes are buried within the terrain, typically only relevant breaks are considered for restorations: excavations are very expensive and consequently the costs to identify the position of the leakage or just the position of the pipe itself are too high. To address this problem, and simplify the leakage identification process, the authors have designed a wireless network system making use of mobile wireless sensors able to detect breaks and reveal unknown tracks and monitor the pressure spectrum of the fluid flowing in the pipe. The sensors transmit the acquired data from the terrain to the surface by use of a wireless connection. On the surface ground there are stations that receive the signal, process it, and communicate with a central unit where necessary intelligent signal processing techniques are used to detect leakage sources. Compared to other leakage detection solutions already available in the market (such as: Ground penetrating radar (GPR), pure acoustic techniques and tracer gases), the proposed technique appears very efficient and much more inexpensive.Keywords
Wireless Sensor Networks, Leakage Detection, Leakage Prevention, GPR, Acoustic Techniques, Tracer Gases.
- Performance Analysis of Beaconless Routing in Wireless Sensor Networks (WSNs)-Present and Future
Abstract Views :152 |
PDF Views:1
Authors
Affiliations
1 Department of Computer Science and Engineering from Manonmaniam Sundaranar University, Tirunelveli, IN
2 Anna University, Chennai, IN
3 Department of Computer Science and Engineering from Manonmanium Sundaranar University, Tirunelveli, IN
1 Department of Computer Science and Engineering from Manonmaniam Sundaranar University, Tirunelveli, IN
2 Anna University, Chennai, IN
3 Department of Computer Science and Engineering from Manonmanium Sundaranar University, Tirunelveli, IN
Source
Wireless Communication, Vol 3, No 5 (2011), Pagination: 335-344Abstract
A Wireless Sensor Network (WSN) is a spatially distributed wireless network with autonomous devices. Each sensor node is having the capability to communicate the information with each other directly or indirectly. Due to the desirable scalability and efficiency in the WSN, the packets should be routed to the destination efficiently with limited power usage. The nodes in the WSN are highly mobile and based on the dynamic scenarios in the routing path, the network topology change frequently. A node in the routing path should aware about the information regarding the nearest node. In traditional routing protocols, every node in the network exchanges periodic one-hop beacons. Beacons are short messages send periodically to indicate the neighbor nodes about their identification and position in the network. In real scenarios due to the dynamic and error-prone nature of wireless links these beacons can create several problems in the network. Due to node mobility, maintaining the neighbor information of the nodes in the network for the routing protocol is difficult. To overcome this, beaconless routing such as Energy-efficient Beaconless Geographic Routing (EBGR), Contention-Based Forwarding (CBF), Guaranteed Delivery Beaconless Forwarding (GDBF), Implicit Geographic Forwarding (IGF), Geographic Random Forwarding (GeRaF), Beacon-Less Routing (BLR) and Beacon-less Protocol (BOSS) are used. In this paper performance has been analyzed for the above said beaconless routing protocols and metrics are packet delivery ratio and latency with the beaconless routing protocols. Results are shows that EBGR and BOSS significantly outperform the other beaconless routing protocols with dynamic network topologies.Keywords
Beacons, Beacon-Less Routing, Beacon-Less Protocol, Contention-Based Forwarding, Energy-Efficient Beaconless Geographic Routing, Geographic Random Forwarding, Guaranteed Delivery Beaconless Forwarding, Implicit Geographic Forwarding.- A Survey on Congestion Control Protocols in Wireless Sensor Network (WSN)
Abstract Views :163 |
PDF Views:6
Authors
Affiliations
1 Department of Computer Science and Engineering from Manonmaniam Sundaranar University, Tirunelveli, IN
2 Anna University, Chennai, IN
1 Department of Computer Science and Engineering from Manonmaniam Sundaranar University, Tirunelveli, IN
2 Anna University, Chennai, IN
Source
Wireless Communication, Vol 3, No 5 (2011), Pagination: 363-370Abstract
Congestion is detrimental to Wireless sensor network (WSN) and it causes excessive energy consumption and packet drop. The event driven nature of WSN leads to a network load that cannot be predicted. As an outcome, congestion may transpire at sensors that obtain additional data than they can forward, which causes energy fritter, throughput diminution and packet loss. Every protocol possesses its own individuality and desires in terms of bandwidth, packet thrash, efficiency and sustainability of traffic. Still, attaining the desired throughput is a non trivial task as congestion is sure to come in a sensor network. Here it matters which protocol serves best to overcome congestion. In this paper, we weigh against the performance of various congestion control algorithms like FCCP, PCCP, PHTCCP and ACT. Under the simulations and study, the rate based FCCP provides better performance than the other existing approaches that alleviates throughput, packet loss, energy efficiency and fairness.Keywords
Adaptive Compression Based Congestion Control Technique (ACT), Congestion Control, Fairness Aware Congestion Control Protocol (FCCP), Priority-Based Congestion Control Protocol (PCCP), Prioritized Heterogeneous Traffic Oriented Congestion Control Protocol.- An Energy Efficient Routing Scheme using Connected Dominating Set for Wireless Sensor Networks
Abstract Views :158 |
PDF Views:5
Authors
Affiliations
1 National Engineering College, Kovilpatti-628 503, Tamilnadu, IN
2 National Engineering College, Kovilpatti-628 503, Tamilnadu, IN
1 National Engineering College, Kovilpatti-628 503, Tamilnadu, IN
2 National Engineering College, Kovilpatti-628 503, Tamilnadu, IN
Source
Wireless Communication, Vol 3, No 5 (2011), Pagination: 371-377Abstract
The biggest challenge for designers of Wireless Sensor Networks is the utilization of energy because the current generations of sensor nodes are battery powered and recharging of these is not possible and not cost effective either. There are many routing approaches available to improve the network’s energy efficiency and to provide better load balancing. In this paper we have proposed a new routing scheme named Connected Dominating Set based Routing (CDSR) for extending the lifetime of the wireless sensor network. Our CDSR algorithm has three phases: Cluster Formation phase, Cluster-Head Selection phase and Steady State phase. In the cluster formation phase, we use RSCDS, a centralized algorithm[11] to form clusters. The proposed protocol measures the energy level of all nodes after completion of each round in the network based on a threshold energy level. A highest energy level node will get elected as cluster head node to the subsequence rounds. According to changed cluster head node alternate route will be dynamically adapted. Hence most of the cluster members within the cluster share the role of cluster head. This mechanism provides better load balancing and minimizes individual nodes energy consumption. The simulation results shows that our protocol out performs the existing routing protocols in terms of network lifetime, number of clusters formed, average delay, data delivery ratio, routing overhead and mean energy consumption.Keywords
Cluster-Head, Dominating Set, Energy Efficiency, Wireless Sensor Network.- A Study and Design of Encryption Less Protocol using Quantum Bits for Secure Communication in Wireless Network
Abstract Views :148 |
PDF Views:3
Authors
Affiliations
1 National Engineering College, Kovilpatti.-628 503, Tamilnadu, IN
1 National Engineering College, Kovilpatti.-628 503, Tamilnadu, IN
Source
Networking and Communication Engineering, Vol 4, No 12 (2012), Pagination: 715-719Abstract
Today‟s wireless network has become one of the most important communication medium. However, providing secure communication for wireless network has become the challenging issues at present days. In present communication system, traditional cryptography was used for secure communication. It has more computational complexity and intruder may easily retrieve the encrypted messages. To overcome this complexity we aim to design a new protocol using quantum bits for enhancing the security. Quantum mechanics defines structure and behavior of quantum bits (i.e.) often called Qubits and it is thousand times faster than traditional one. A traditional computer system uses two bits 0 (or) 1. In quantum system uses Qubits that is normally represented mathematically by vectors such as |0>, |1> as two states, and four bases |H>, |V>, |R>, |L>. By this quantum cryptography method two parties may generate secret cryptographic key known as checkbits which are generated using static quantum channel. Two channels namely public and hidden channels are used to transfer data through secured mode without encryption. By using hidden channel concept in quantum mechanics, secure transmission of data without encryption can be done.Keywords
Quantum Mechanics, Quantum Bits, Check Bits, Public Channel, Hidden Channel.- A Survey on Cellular Automata with the Application in Pseudo Random Number Generation
Abstract Views :279 |
PDF Views:6
Authors
Affiliations
1 Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, IN
1 Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, IN
Source
Journal of Network and Information Security, Vol 5, No 2 (2017), Pagination: 12-22Abstract
The Cellular Automata (CA) were invented in the late 1940 by Stanislaw Ulam and John Von Neumann. CA are simple models of computation in which the components act together and exhibit complex behavior. Initially CA are represented as model of self-reproducing organisms. Later they are applied in various areas like Physics, biology and other applications. The self-reproducing behavior is then utilized to construct Universal Turing Machine. This Survey is about the applications of CA closer to Computer Science especially designing Pseudo Random Number Generator.Keywords
Cellular Automata, CA, Applications of CA , Pseudo Random Number Generator, PRNG, 1D CA Rules.References
- P. Sarkar, “A brief history of cellular automata,” ACM Computing Surveys (CSUR), vol. 32, pp 80-107, 2000.
- ALVY RAY SMITH III, “Cellular automata complexity trade-offs,” Information and Control, vol. 18, pp. 466-482, 1971.
- K. Sutner, “Classification of cellular automata,” Encyclopedia of Complexity and Systems Science, Part 2009.
- W. Li, and N. Packard, “The structure of the elementary cellular automata rule space,” Complex Systems, vol. 4, pp. 281-297, 1990.
- W. Li, N. H. Packarda, and C. Langton, “Transition phenomena in cellular automata rule space,” Physica D, vol. 45, pp. 77-94, 1990.
- Appendix of Theory and Applications of Cellular Automata, S. Wolfram, ed. (World Scientific, 1986).
- G. Braga, G. Cattaneo, P. Flocchini, and C. Q. Vogliotti, “Fundamental study: Pattern growth in Elementary Cellular Automata,” Theoretical Computer Science, vol. 145, pp. 1-26, 1995.
- E. Filiol, “A new statistical testing for symmetric ciphers and hash functions,” International Conference on Information and Communications Security, Springer Link 2002.
- K. Chakraborty, and D. R. Chowdhury, “CSHR: Selection of cryptographically suitable hybrid cellular automata rule,” International Conference on Cellular Automata for Research and Industry, ACRI, Springer, pp. 591-600, 2012.
- N. H. Packard, and S. Wolfram, “Two-dimensional cellular automata,” Journal of Statistical Physics, vol. 38, pp. 5-6, 1985.
- D. Eppstein, “Growth and decay in life-like cellular automata,” Game of Life Cellular Automata, Springer Link, 2010.
- A. Adamatzky, Game of Life Cellular Automata, Springer, 2010.
- H. Umeo, M. Hisaoka, and T. Sogabe, “A survey on optimum-time firing squad synchronization algorithms for one-dimensional cellular automata,” International Journal of Unconventional Computing, vol. 1, pp. 403-426.
- K. Culik II, and S. Dube, “An efficient solution of the firing mob problem,” Theoretical Computer Science, vol. 91, pp. 57-69, 1991.
- A. Beckers, and T. Worsch “A perimeter-time CA for the queen bee problem,” Parallel Computing, vol. 27, pp. 15-25, 2001.
- Katarzyna Zbiec, “The prisoner’s dilemma and the game of life,” Studies in Logic, Grammar and Rhetoric, vol. 19, pp. 95-100, 2003.
- N. Ganguly, B. K. Sikdar, A. Deutsch, G. Canright, and P. P. Chaudhuri “A survey on cellular automata,” 2003.
- V. Sharma, A. Dev, and S. Rai, “A comprehensive study of cellular automata”, International Journal of Advanced Research in Computer Science and Software Engineering, vol. 2, pp. 340-344, 2012.
- R. J. De Boer, and P. Hogeweg, “Growth and Recruitment in the Immune Network,” In A. F. Perelson and G. Weisbuch, editors, Theoretical and Experimental Insights into Immunology, vol. 66, pp. 223-247, 1992.
- F. Celada, and P. E. Seiden, “A computer model of cellular interactions in the immune system,” Immunology Today, vol. 13, pp. 56-62, 1992.
- B. K. Sikdar, and N. Ganguly, and P. P. Chaudhuri, “Fault diagnosis of VLSI circuits with cellular automata based pattern classifier,” IEEE transaction on Computer-Aided design of Integrated Circuits and systems, vol. 24, pp. 1115-1131, 2005.
- A. R. Khan, “VLSI architecture of a cellular automata machine,” Journal of Computer and Mathematics with applications, vol. 33, 79-94,1997.
- A. K. Das, “Additive cellular automata: Theory and application as a built-in self-test structure,” PhD thesis, I.I.T. Kharagpur, India, 1990.
- D. R. Chowdhury, S. Basu, I. S. Gupta, and P. Pal Chaudhuri, “Design of CAECC Cellular Automata based Error Correcting Code,” IEEE Transaction on Computers, vol. 43, pp. 759-764, 1994.
- S. Wolfran, “Origin of randomness in physical systems,” Physical Review Letter, vol. 55, p. 449, 1985.
- S. Wolfran , “Cellular automata as models of complexity,” Nature, vol. 311, pp. 419-424, 1984.
- H. Niesche, “Introduction to Cellular Automata - Seminar,” Organic Computing, SS2006, 2006.
- C. Burstedde, K. Klauck, A. Schadschneider, and J. Zittartz, “Simulation of pedestrian dynamics using a two-dimensional cellular automaton,” Physica A: Statistical Mechanics and Its Applications, vol. 295, pp 507-525, 2001.
- A. Kirchner, and A. Schadschneider, “Simulation of evacuation processes using a bionics-inspired cellular automaton model for pedestrian dynamics,” Physica A: Statistical Mechanics and Its Applications, vol. 312, pp. 260-276, 2002.
- M. Rickert, K. Nagel, and M. Schreckenberg, “Two lane traffic simulations using cellular automata,” Physica A: Statistical Mechanics and its Applications, vol. 231, pp. 534-550, 1996.
- H. Situngkir, “Exploring ancient architectural designs with cellular automata,” SSRN, 2010.
- S. Wolfram, “Theory and applications of cellular automata,” World Scientific, Singapore, 1986. ISBN 9971-50-124-4pbk.
- C. Fontaine, “Linear congruential generator,” Encyclopedia of Cryptography and Security, vol. 1, pp. 721-721, 2011.
- D. E. Knuth, The Art of Computer Programming: Semi Numerical Algorithms, vol. 2, Adison Wesley, 1981(Book).
- G. Marsaglia, & L. H. Tsay, “Matrices and structure of random number sequences,” Linear Algebra and Its Application, vol. 67, pp. 147-156, 1985.
- M. Sahithi, B. MuraliKrishna, M. Jyothi, K. Purnima, A. Jhansi Rani, N. Naga Sudha, “Implementation of random number generator using LFSR for high secured multi purpose applications,” International Journal of Computer Science and Information Technologies, vol. 3, pp. 3287-3290, 2012.
- S. Wolfram, “Random sequence generation by cellular automata,” Advances in Applied Mathematics, vol. 7, pp. 123-169, 1986.
- F. Seredynski, P. Bouvry, and A. Y. Zomaya “Cellular automata computations and secret key cryptography,” Parallel Computing, vol. 30, pp. 753-766, 2004.
- M. Szaban, F. Seredynski, and P. Bouvry, “Collective behavior of rules for cellular automata-based stream ciphers,” IEEE Conference on Evolutionary Computation, pp. 179-183, 2006.
- P. Ping, F. Xu, and X.-J. Wang, “Generating high-quality random numbers by next nearest-neighbor cellular automata,” Advanced material Research, vol. 765, pp. 1200-1204, 2013.
- P. D. Hortensius, R. D. Mcleod, W. Pries, D Michael Miller and Howard C. Card, “Cellular Automata- Based Pseudorandom Number Generators for Built-In self-Test,” IEEE transactions on Computer-Aided Design, vol. 8, pp 842-859,1989.
- M. Tomassini, M. Sipper, and M. Perrenoud, “On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata,” IEEE Transactions on Computers, vol. 49, pp. 1146-1151, 2000.
- S. U. Guan, and S. K. Tan, “Pseudorandom number generation with self-programmable cellular automata,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 23, pp. 1095-1101, 2004.
- S. Ghosh, A. Sengupta, D. Saha, and D. R. Chowdhury, “A scalable method for constructing non-linear cellular automata with period 2n - 1,” International Conference on Cellular Automata, pp. 65-79, 2014.
- C. J. Etherington, “An Anaysis of Cryptographically Significant Boolean Functions with High Correlation Immunity by Reconfigurable Computer,” 2010 Thesis.
- S.-U. Guan, and S. Zhang, “Pseudorandom number generation based on controllable cellular automata,” Future Generation Computer Systems, vol. 20, pp. 627-641, 2004.