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
Thamizhmaran, K.
- Multilevel Image Segmentation Based On Firefly Algorithm
Authors
1 Department of ECE, Annamalai University, Annamalai Nagar, Tamil Nadu, IN
Source
Biometrics and Bioinformatics, Vol 9, No 3 (2017), Pagination: 57-60Abstract
Multilevel image segmentation is time-consuming and involves large computation. The Firefly Algorithm (FA) has been applied to enhancing the efficiency of multilevel image segmentation. Threshold values are the values chosen from the intensity values of the image ranges from 0 to 255. In this work OTSU based firefly algorithm is applied for the gray scale images. OTSU’S between-class variance function is maximized to obtain optimal threshold level for gray scale images. The existence Darwinian Particle Swarm Optimization (DPSO) gives small swarm size and few numbers of iterations. In FA, the performance assessment of the proposed algorithm is carried using prevailing parameters such as Objective function, Standard deviation, Peak-to-Signal Ratio (PSNR), and Best cost value and search time of CPU. The experimental results show that the proposed method can efficiently segment multilevel images and obtain better performance than DPSO.
Keywords
OTSU, Firefly Algorithm, DPSO, Peak-To-Signal Ratio, PSNR.
- Mobility and Handoff Management in Vehicular Ad-Hoc Networks
Authors
1 Department of ECE, Annamalai University, Annamalai Nagar, Tamilnadu, IN
Source
Programmable Device Circuits and Systems, Vol 9, No 3 (2017), Pagination: 59-62Abstract
VANET is different from MANET due to high mobility of nodes and large scale networks. VANET is a form of network that provide vehicle to vehicle and vehicle to infrastructure communication. The main gaol of VANET is to provide the road safety . Various wireless communication technologies used for VANET, the IEEE 802.11p is to support the medium range communication characteristics of vehicular environments. One of the main issues of VANET is handover process. It can be effectively achieved through FHP mechanisms . The handover algorithm for IEEE 802.11p based on the vehicular communications. This handover based on a V2I communications is done by varying the size of the topology. The performance evaluation and simulation results show that the scheme can minimize the handover latency and packet loss.Keywords
VANET, IEEE82.11p, V2V, FHP, WAVE.- Message Transmission Using UMB Protocol in Urban Vehicular Ad-Hoc Networks
Authors
1 Department of ECE, Annamalai University, Tamil Nadu, IN
Source
Data Mining and Knowledge Engineering, Vol 9, No 3 (2017), Pagination: 65-68Abstract
Emerging research works of Vehicular Ad-hoc Networks (VANET) has a major problems of message redundancy and message transmission delay during active communication, this issue has been overcome by introducing a new protocol namely Urban Multi-hop Broadcast Protocol (UMBP). In this paper, UMBP includes a novel forwarding node selection scheme that utilizes iterative partition, mini-slot, and black-burst to quickly select remote neighboring nodes, and a single forwarding node is successfully chosen by the asynchronous contention among them. Then, bidirectional broadcast, multi-directional broadcast, and directional broadcast are designed according to the positions of the emergency message senders. The information during the emergency situations like accidents, traffic jams can be computed by road-side nodes and then broadcasted to road users for optimized multi-hop packet transmission in the communication network. In addition, the weather report is continuously sent to the vehicle via road side unit. In this work, better performance has been obtained using UMBP than the existing system namely Profile-driven Adaptive Warning Dissemination Scheme (PAWDS). In the proposed scheme, it has been tested and analyzed several parameters namely, delay, throughput and packet delivery ratio using Network Simulator-2 (NS-2).
Keywords
VANET, Broadcast, UMBP, Delay, Throughput, Packet Delivery Ratio, NS2.- Evaluation of Traditional SPAs with AODV Routing Protocol for MANETs
Authors
1 Department of ECE, FEAT, Annamalai University, IN
Source
Networking and Communication Engineering, Vol 10, No 3 (2018), Pagination: 59-64Abstract
In recent emerging research need topic of Mobile Ad-hoc Networks (MANET) is one of dominating in society for natural issues in world.MANET to face many critical problems in society day by day, in this aspect the most dominating issue is link breakage, packet dropping, energy and retransmission. In this paper i plane to serve society in first step of my research reduce packet droppingwith minimum energy. This technical research work discussed On-demand routing protocol (AODV) technic with many set of topologies and three set of nodes using two different shortest path algorithms (SPA) namely, Bellman Ford andDijkstra’s algorithm.Primary goal of this work to reduce packet dropping and increases remaining energy using five steps (i) flooding route request to all the active nodes, (ii) test all node ID from our network group, (iii) find minimum weighted of route, (iv) calculate utilization energy of finding route (v) communication start from source to destination. Analysisvarious parameters such as,Packet Delivery Ratio, Routing Overhead, End-to-End Delay andThroughput through one of the most popular user friendly software Network Simulator 2 (NS2). Finallyit’s clear that all results of SPA using protocols better than the traditional routingprotocols.
Keywords
MANET, Routing Protocols, SPA’s, NS2, PDR, RO, Delay, Energy, Throughput, Speed, Packet Loss.References
- P. Narvaez, et al (2000) “New dynamic algorithms for shortest path tree computation,” IEEE, Vol. 8, No. 6, pp. 734–746.
- Xiao, et al (2004) “Dynamic update of shortest path tree in OSPF”, in Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 18–23.
- JieGao and Li Zhang (2004) “Load balanced short path routing in wireless networks”, IEEE.
- Alvin C. Valera, et al (2005) “Improving protocol robustness in ad-hoc networks through cooperative packet caching and shortest multipath routing”, IEEE, Vol. 4, No. 5, pp. 443-457
- AnandPatwardhan and Iorga, (2005) “Secure routing and Intrusion Detection in Ad-hoc networks”, in Proc. 3rd Int. Conf. Pervasive Computer Communication, pp.191–199.
- Demetrescu and G. F. Italiano (2006) “Experimental analysis of dynamic all pairs shortest path algorithms”, ACM, Vol. 2, No. 4, pp. 578–601.
- S. Taoka, et al (2007) “Performance comparison of algorithms for the dynamic shortest path problem”, IEICE, Vol. 90, No. 4, pp. 847–856.
- Jack Tsai and Tim Moors (2007) “A review of multipath routing protocols from wireless ad-hoc to mesh networks” IEEE, Vol. 12, No. 3, pp. 367-372.
- Fuhaozhang, et al (2007) “Improve on dijkstra shortest path algorithm for huge data”, IEEE, Vol. 7, No. 2, pp. 313-316.
- Yangcheng Huang, et al (2008) “Route dynamics for shortest path first routing in mobile ad-hoc networks”, IEEE, Vol. 12, No. 4, pp. 87-93.
- Shengxiang Yang, et al (2010) “A genetic algorithm with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad-hoc networks”, IEEE, Vol. 40, No. 1, pp. 52-63.
- Yanfang Deng and Hengqing Tong (2010) “Dynamic shortest path algorithm in stochastic traffic networks using PSO based on fluid neural network”, JILSA, Vol. 3, pp. 11-16.
- ParulTomar, and Suri, (2010) “A Comparative Study for Secure Routing in MANET”, IJCA, Vol.4, No.5, pp. 298-307.
- AishwaryaSagar and MeenuChawla, (2010) “Detection of Packet Dropping Attack Using Improved Acknowledgement Based Scheme in MANET”, IJCSI, Vol.7, No. 4, pp.
- Thamizhmaran, K. et al. (2012) “Authentication and Intrusion Detection in MANET”, IJART, Vol. 3, No. 3, pp.15-21.
- Naveen Kumar Gupta (2013) “Trust and shortest path selection based routing protocol for MANET”, IJCA, Vol. 76, No. 12, pp. 20-23.
- KanikaPasrija, et al (2013) “Shortest path routing over mobile ad-hoc networks”, IJARCSSE, Vol. 3, No. 9. pp. 467-471.
- Rameshkumar, and Damodaram (2013) “Efficient secure AODV using hybrid shortest path routing to improve the performance for grid computing”, IJES, Vol. 2, No. 3, pp. 1-7.
- Ragb O. M. Saleh, et al (2013) “Impact of route selection metrics on the performance of DSR protocol for MANETs”, IJCSI, Vol. 10, No. 2(3), pp. 123-130.
- Selvakumar and Seetha (2014) “Improving the network Lifetime of MANETs through CSP routing algorithm”, IJCSET, Vol. 5, No. 4, pp. 404-409.
- Prabu, K. and Subramani, A. (2014) “Energy efficient routing in MANET through edge node selection using ESPR algorithm”, Int. J. Mobile Network Design and Innovation, Vol. 5, No. 3, pp. 166–175.
- Performance Analysis of On-Demand Routing Protocols in MANETs Using (SHSP-EA3ACK) Algorithms
Authors
1 Annamalai University, Tamilnadu–608 002, IN
Source
Digital Signal Processing, Vol 10, No 3 (2018), Pagination: 50-54Abstract
Mobile Adhoc Networks (MANETs) require a reliable, efficient, scalable routing and most importantly, every single node in the MANETs works as both receiver and transmitter within their communication range. As they are highly secure, self-organizing, rapidly deployed, they use dynamic routing to access information and services anywhere regardless of their geographic location. MANETs are the significant technologies among various air communication technologies where all the nodes are mobile and can be connected dynamically using wireless link in a random manner. All nodes work router and maintain routes to other nodes in the network. Introduction of the Enhanced Adaptive 3 Acknowledgement (EA3ACK) is to prevent the attacker from forging acknowledgement packets. In this paper recent research, a new intrusion detection system, EA3ACK using EAACK (DSA) with Secure Hybrid Shortest Path (SHSP) Routing is specially designed for MANETs to reduce end-to-end delay. ACK method is implemented to avoid any type of attacking model on the network with secure hybrid shortest path routing algorithm besides avoiding delay and packet loss, it increases the node speed also. Network Simulator (NS2) is used to simulate the proposed method and implemented in the test system.
Keywords
MANET, Watchdog, EA3ACK, HSPR, Delay, Packet Loss.References
- AnandPatwardhan and Iorga, Secure routing and Intrusion Detec-tion in Ad-hoc networks, in Proc. 3rd Int. Conf. Pervasive Com-puter Communication, pp.191–199, (2005).
- Balakrishnan, et al, TWOACK: preventing selfishness in mobile ad hoc networks, Proc. Int. Conf. on Wireless Communications and Networking, vol.4, no.10, pp. 2137-2142, (2005).
- Jongoh Choi, et al, Malicious Nodes Detection in AODV- Based Mobile Ad Hoc Networks, GESTS Trans. Comp. Science and Engg, vol.18, no.1, pp.49-55, (2005).
- Liu, et al, An acknowledgment-based approach for the detection of routing misbehaviour in MANETs, IEEE Trans. Mobile Comput., vol.6, no.5, pp.536–550, (2007).
- AishwaryaSagar and MeenuChawla, Detection of Packet Dropping Attack Using Improved Acknowledgement Based Scheme in MANET, IJCSI, vol.7, iss.4, no.1, pp.12-17, (2010).
- K. Sahadevaiah, et.al, Impact of Security Attacks on a New Securi-ty Protocol for Mobile Ad Hoc Networks, in Proc. 3rd Int. Conf. Network Protocols and Algorithms, vol.3, no.4, pp.122-128, (2010).
- Prabu, K. and Subramani, A. Performance comparison of routing protocol in MANET, Int. J. of Adv. Research in Com. Sci. and Soft Engg., Vol. 2, No. 9, pp.388–392, (2012).
- Shakshuki, et al, EAACK — A Secure Intrusion: Detection System for MANETs, IEEE Trans on industrial electronics, vol. 60, no. 3, pp.1089-1098, (2013).
- Prabu, K. and Subramani, A. Energy efficient routing in MANET through edge node selection using ESPR algorithm, Int. J. Mobile Network Design and Innovation, vol. 5, no. 3, pp.166–175, (2014).
- AbdulsalamBasabaaa, et al, Implementation of A3ACKs intrusion detection system under various mobility speeds, in Proc. 5th Int. Conf. on Ambient Systems, Networks and Technologies, pp.571-578 (2014).
- Modified-Dynamic Source Routing Protocol with Multi-cost Parameters for Effective Communication in MANETs
Authors
Source
Wireless Communication, Vol 10, No 6 (2018), Pagination: 120-123Abstract
A Wireless ad-hoc network is a collection of wireless mobile nodes that dynamically form a network connection temporarily without any support of static infrastructure. Caused by mobility of nodes, routing take a vital role in transmission and numerous routing protocols are available like table driven, on-demand and hybrid. The protocol presents the mechanism which reduces route loops and confirms trustworthy message exchange. The Dynamic Source Routing (DSR) algorithm is anon-demand routing protocol designed for ad-hoc mobile nodes. Hopcount, total interference, node link delay, residual energy of anode and the node transmission power are the cost parameters assigned for link and path of the ad-hoc networks. These parameters are combined in different optimization function with respect to various routing algorithm for selecting the optimal path. This paper accesses the Modified DSR (M-DSR) routing protocol with multi-cost parameters to acquire dynamic network performance metrics like routing overhead, energy, packet delivery ratio and throughput of mobile ad-hoc networks.