Refine your search
Collections
Co-Authors
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
Srivatsa, S. K.
- Node numbering in a topological structure of interconnection network
Abstract Views :738 |
PDF Views:100
Authors
Affiliations
1 Dept. of Computer Science & Engg., Sathyabama University, IN
2 St. Joseph College of Engineering, Chennai, IN
1 Dept. of Computer Science & Engg., Sathyabama University, IN
2 St. Joseph College of Engineering, Chennai, IN
Source
Indian Journal of Science and Technology, Vol 2, No 11 (2009), Pagination: 37-40Abstract
The topological design of a computer communication network assigns the links and link capacities for connecting network nodes within several constraints, with a goal to achieve a specified performance at a minimal cost. A reasonable approach is to generate a potential network topology. This paper presents a spanning tree based method for systematic numbering of nodes in any communication network. When the nodes are numbered in a systematic manner the potential network topology generated will have lesser amount of perturbation before an acceptable network is found.Keywords
Topological Design, Computer, Link Deficit Algorithm, Wireless Network, Minimum Spanning TreeReferences
- Aho AV, Hopcroft JE and Ullman JD (1974) Design and analysis of computer algorithms. Addison – Wesley, Massachusett.
- Andrew S. Tanenbaum (1987) Computer networks, Prentice Hall, Englewood Cliffs
- Douglas B. West (2001) Introduction to graph theory. Pearson Education Inc., 2nd Ed
- Gerla M, Frank H and Eckl J (1974) A cut saturation algorithm for topological design of packet switched communication networks, Proc. NTC., pp. 1074-1085.
- Henzinger M, Rao S and Gabow H (2000) Computing vertex connectivity, new bounds from old techniques. J. Algorithms. 34 (2), 222-250.
- Junming Xu (2002) Topological structure and analysis of interconnection networks. Kluwer Academic Publ.
- Kamalesh VN and Srivatsa SK (2007) Numbering of nodes in computer communication networks: A brief review. Natl. Conf. on Adv. Network Technol. & Security Issues, FISAT, Cochin, Kerala, India, 8th to 10th August. pp: 278-282.
- Kamalesh VN and Srivatsa SK (2007) On topological design of computer communication network: A graph theoretical approach. GESTS: Techniques, December.
- Kamalesh VN and Srivatsa SK (2009a) On the design of minimum cost survivable network topologies. 15th Natl. Conf. on Commun., IIT Guwahati, India, 16- 18th Jan. pp: 394-397.
- Kamalesh VN and Srivatsa SK (2009b) Topological design of minimum cost survivable computer communication networks: Bipartite graph method. The Intl. J. Compu. Sci. Info. Security. 3 (July), 375-378.
- Latha S and Srivatsa SK (2007) Topological design of a k- connected network. WSEAS Transact. on Commun. 6 (4), 657-662.
- Lavia A and Manning EG (1975) Pertubation techniques for topological optimization of computer networks. Proc. Fourth Data Commun. Symp. pp: 4.16-4.23.
- Srivatsa SK and Seshaiah P (1995) On yopological design of a computer networks. Compu. Networks & ISDN Sys. 27, 567-569.
- Steiglitz K, Weiner P and Kleitman DJ (1969) The design of minimum cost survivable network. IEEE Trans. Circuit Theory. pp:455-460.
- Route Efficient on Demand Multicast Routing Protocol with Stability Link for MANETs
Abstract Views :433 |
PDF Views:135
Authors
Affiliations
1 Department of Master of Computer Applications, Panimalar Engineering College, Chennai -600123, IN
2 Department of Computer Science and Engineering, Sathyabama University, Chennai- 600119, IN
1 Department of Master of Computer Applications, Panimalar Engineering College, Chennai -600123, IN
2 Department of Computer Science and Engineering, Sathyabama University, Chennai- 600119, IN
Source
Indian Journal of Science and Technology, Vol 5, No 6 (2012), Pagination: 2866-2871Abstract
In recent years' mobile ad hoc networks (MANETs), a group oriented services has one of the primary application classes. It supports such services that use multicast routing. Therefore it is required to design stable and an efficient routing protocol for MANETs to support better packet delivery ratio, minimum delays and decreased overheads. In this paper, a multicast routing protocol based mesh networks that finds stable multicast path from source to receivers is proposed. In this model only the nodes that fulfill the delay requirements can flood the JOIN-QUERY messages. The contributing nodes are assumed to follow M/M/1 queuing systems. The queuing systems contain maximum value for queuing and contention delay which can be evaluated as the ratio of maximum queue size over the service time in a node. This model enhances link stability with contention delay and queuing system. The stable routes are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is calculated by using parameters link received power, distance between neighboring nodes and link quality. The performance of the proposed model is simulated over a large number of MANET nodes with wide range of mobility with two well known mesh based multicast routing protocol. It is observed that the proposed model produces better throughput and reduced overheads.Keywords
Multicast Routing, MANET, Stable Forwarding Node, Multicast Routing, Link StabilityReferences
- Ahmad DT (2005) Multicasting in ad hoc networks. University of Otawa.Fall
- Biradar R, Manvi S and Reddy M (2010) Link stability based multicast routing scheme in MANET. Computer Networks. 54, 1183–1196.
- Garcia JJ, Aceves Luna and Madruga E (1999) The core assisted mesh protocol. IEEE J. on Selected Areas in Commun. 17(8) August. http://www.isi.edu/nsnam/ns.
- Lee SJ, Su W, Hsu J, Gerla M and Bagrodia R (2000) A performance comparison study of ad hoc wireless multicast protocols In: Proc.19th annual joint conference and communications societies (INFOCOM).
- Oh SY, Park JS and Gerla M (2008) E-ODMRP: enhanced ODMRP with motion adaptive refresh. Elsevier J. Parallel & Distributed Comptuting. 68
- Oh SY, Park JS and Gerla M (2008) E-ODMRP: enhanced ODMRP with motion adaptive refresh. J. Parallel & Distributed Compt. 68, 1044–1053.
- Pathrina D and Kwon M (2007) RODMRP: resilient ondemand multicast routing protocol In: Proc. 21th adv. information networking and applications workshops (AINAW). May 2007
- Paul S (1998) Multicasting on the internet and its applications. Kluwer Academic Publ.
- Perkins CE and Bhagwat P (2001) Ad hoc networks Addision-Wesley Longman Publishing Co., Inc. 2001
- Qing Dai and Jie Wu (2005) Computation of minimal uniform transmission range in ad hoc wireless networks. Cluster Computing. 8,127–133.
- Rajashekhar Biradar, Sunilkumar Manvi and Mylara Reddy (2010) Link stability based multicast routing scheme in MANET. Compu. Networks. 54, 1183-1196.
- Rodolakis G, Laouiti A, Jacquet P and Naimi AM (2008) Multicast overlay spanning trees in ad hoc networks: capacity bounds protocol design and performance evaluation. Compu. Commun. 31, 1400–1412.
- Royer E and Perkins C (2000) Multicast ad hoc on demand distance vector(c) routing draftietfmanet-maodv- 00.
- Ruiz PM and Gomez-Skarmeta AF (2004) Reducing data-overhead of mesh-based ad hoc multicast routing protocols by Steiner tree meshes In: Proc. of the first IEEE conf. on sensor and ad hoc communications and networks(SECON).
- Lee SJ, Su W and Gerla M (1999) On-demand multicast routing protocol (ODMRP) for Ad Hoc networks. Internet- Draft, draft-ietf-manet-odmrprp-Ol.txt. Work in progress.
- Saiful Azad Md, Anwar Farhat and Arafatur Rahman Md (2009) Performance comparison of proactive and reactive multicast routing protocols over wireless mesh networks. Int. J. Comp. Sci. Network Security(IJCSNS).2009; 9(6) June.
- So B, Jeon H and Lee J (2004) PEODMRP: Performance enhanced on demand multicast routing protocol In: Proc. 8th joint Conf. on Commun. & Information (JCCI).
- Tijms HC (2003) A first course in stochastic models. Chichester. Wiley,2003.
- Vasiliou A Economides AA (2005) Evaluation of multicasting algorithms in mantes In: Proc. 3rd world
- Enformatika Conference (WEC), April. 20. Wu YF, Xu YL, Chen CL and Wang K (2004) On the construction of virtual multicast backbone for wireless ad hoc networks. IEEE Int. Conf. on mobile Ad hoc and sensor systems. 294–303.
- Vaishampayan R and Garcia-Luna-Aceves JJ (2004) Protocol for unified multicasting through announcements In: Proc. of the 1st IEEE nternational conference Mobile ad-hoc and sensor systems (MASS).
- Viswanath K, Obraczka K and Tsudik G (2006) Exploring mesh and tree based multicast routing protocols for MANETs. IEEE Mobile Computing;5(1).
- Yi Y, Lee S, Su W and Gerla M. On-demand multicast routing protocol (ODMRP) for ad-hoc networks.draft-yimanet- odmrp-00.txt;2003.
- An Efficient Spectrum Sensing Framework and Attack Detection in Cognitive Radio Networks using Hybrid ANFIS
Abstract Views :221 |
PDF Views:0
Authors
Affiliations
1 St. Peter’s University, Chennai - 600054, Tamil Nadu, IN
2 Anna University, Chennai - 600025, Tamil Nadu, IN
1 St. Peter’s University, Chennai - 600054, Tamil Nadu, IN
2 Anna University, Chennai - 600025, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 28 (2015), Pagination:Abstract
Background: Cognitive radio is being recognized as an intelligent technology due to its ability to rapidly and autonomously adapt operating parameters to changing environments and conditions. In order to reliably and swiftly detect spectrum holes in cognitive radios, spectrum sensing must be used. Accurate spectrum sensing is important in improving the efficiency of cognitive radio networks. False sensing results in either waste of spectrum or harmful interference to primary users who may remotely or physically capture the sensors and manipulate the sensing reports. Methods: A novel framework and an innovative approach have been introduced to eliminate the malicious behaviors of secondary users. It is found that spectrum sensing alone cannot prevent the malicious behavior without any information on users’ reputation. Based on the evaluation of malicious behavior resistance methods, joint spectrum sensing and malicious nodes detection approach for optimal prevention from sensing falsification is being proposed. Findings: The proposed approach minimizes Linear Minimum Mean-Square Errors (LMMSEs) when it is compared with the existing algorithms such spectrum sensing based on HSMM and FNN based spectrum sensing are plotted versus detection probability, false alarm probability. With more malicious nodes proposed schemes are more effective to restrain the false alarms. Improvement/Application: The proposed spectrum sensesframework with attack detection which is very effective to determine the malicious users in spectrum holes.Keywords
Fuzzy Neural Network, Linear Minimum Mean Square Error, Primary User, Secondary User, Spectrum Sensing- Detection of Duplicate Region and Hybrid Non-Local Means Filtering for Denoising with Quantization Matrix Estimation for JPEG Error Analysis
Abstract Views :135 |
PDF Views:0
Authors
Affiliations
1 St. Peter’s University, Chennai - 600054, Tamil Nadu, IN
2 Anna University, Chennai - 600025, Tamil Nadu, IN
1 St. Peter’s University, Chennai - 600054, Tamil Nadu, IN
2 Anna University, Chennai - 600025, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 28 (2015), Pagination:Abstract
Background: The existing JPEG error analysis schemes do not offer agreeable results particularly when the duplicated area is small. Region duplication is an uncomplicated and efficient process to produce digital image forgeries, where a constant segment of pixels in an image, following feasible geometrical and illumination transformations are copied and pasted to a different location in the same image. Methods: In this research work, JPEG error analysis scheme is introduced for the purpose of consistent recognition of duplicated and distorted areas in a JPEG digital image forensics. Here, presented a new Multi-directional Curvelet Transform with Fourier Transform matching Invariant Rotation (MCFTIR) region duplication detection scheme to identify duplicated regions for JPEG images. This scheme begins with estimating the overlapping blocks of a JPEG image and it is organized in accordance with the statistics of multiple curvelet sub-bands. During the second phase, the amount of candidate block pairs of JPEG images has been significantly diminished by means of spatial distance between each pair of blocks for JPEG image. For duplicate region removed images theoretically analyzing the effects of these errors on single and double JPEG compression, with five major phases like Shape-Preserving Image Resizing (SPIR) scheme for the purpose of image resizing, noises are appended to image and eliminated with the help of Hybrid Non-Local Means Filtering (HNLMF) denoising framework, Image compression through Discrete Cosine Transform – Singular Value Decomposition (DCT-SVD) was computed for single and double image compression, images were quantized by means of numerous quantization matrices, quantization matrix results are estimated with Mamdani model based Adaptive Neural Fuzzy Inference System (MANFIS) and detecting the quantization table of a JPEG image. Findings: The proposed MCFTIR methods significantly outperform existing techniques in terms of the parameters like Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE) especially for the images of small sizes. It also show that the new MCFTIR method can consistently identify JPEG image blocks which are as tiny as 8x8 pixels and compressed through quality factors as elevated as 98. This performance is significant for the purpose of analyzing and locating small tampered regions inside a composite image.Keywords
Duplicate Region Detection, Image Denoising, Image Resizing, JPEG Image Compression, Mamdani Model Based Adaptive Neural Fuzzy Inference System (MANFIS), Multi-Directional Curvelet Transform with Fourier Transform Matching Invariant Rotation (MCFTIR)- Dynamic and Secure Joint Routing and Charging Scheme with Mobile Power Back Ferry Nodes in Mobile Adhoc Networks
Abstract Views :189 |
PDF Views:0
Authors
Affiliations
1 Hindustan University, Chennai - 603103, Tamil Nadu, IN
2 Periyar Maniyammai University, Thanjavur - 613403, Tamil Nadu, IN
3 Prathyusha Engineering College, Tiruvallur - 602025, Tamil Nadu, IN
1 Hindustan University, Chennai - 603103, Tamil Nadu, IN
2 Periyar Maniyammai University, Thanjavur - 613403, Tamil Nadu, IN
3 Prathyusha Engineering College, Tiruvallur - 602025, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 33 (2016), Pagination:Abstract
Recent introduction of hybrid architectures in Mobile Adhoc NETworks (MANETs) made researchers to concentrate on routing techniques to prolong the network lifetime with improved performance and scalability. Major research activity has been carried out to explore and improve constrained lifespan of the network by proposing on - demand power aware routing protocols. However, these protocols try to increase the network life time but doesn’t guarantee a network remain operational forever. Charging of premature failure nodes which were frequently used as relying nodes is essential to prolong network lifespan. Therefore, to improve network connectivity and lifespan, it’s essential to charge energy drained nodes based on their expected lifetime. Hence, we propose a dynamic and secure routing cum energy recharging scheme using Mobile Power Back Ferry Nodes (MPBF) to recharge energy drained nodes. Consumption of energy from the MPBF nodes affords a most trustworthy energy supply than deriving energy from other sources. This approach retains the node energy to maximum time with improved battery life by selecting a gateway based on link weight age. Secure Source- Based Loose Synchronization (SOBAS) protocol is used for authenticated power transfer. The total number of MPBF nodes required for the optimum energy conservation is determined by the target detection mechanism assigned by the Secured Sink Trail (SST). Using this joint methodology, the network lifetime and percentage of energy consumption of mobile nodes under two different scenarios (a) Variable node velocity and network traffic with fixed node density (b) Variable node density and node velocity with fixed network traffic are analyzed. We evaluate the proposed scheme performance through NS2 simulations. The results show that the proposed scheme can retain the network lifetime for a longer duration. Its performance is compared with power aware and ACO based Dynamic Power Control and load balanced energy efficient routing protocols under different QoS scenarios.Keywords
Joint routing, Energy Conservation, Mobile Power Back (MPB), Residual Energy, Secure Sink Trial, SOBAS, QoS Analysis.- Integrated Intrusion Detection Approach for Cloud Computing
Abstract Views :175 |
PDF Views:0
Authors
Affiliations
1 Sathyabama University, Chennai, Tamil Nadu, IN
2 Prathyusha Institute of Technology and Management, Chennai, Tamil Nadu, IN
1 Sathyabama University, Chennai, Tamil Nadu, IN
2 Prathyusha Institute of Technology and Management, Chennai, Tamil Nadu, IN