2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)最新文献_第2页

Robust digital image watermarking based on discrete wavelet transform and harmony search algorithm optimization technique 基于离散小波变换和和谐搜索算法优化技术的鲁棒数字图像水印

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456967

G. Nagar, S. K. Agarwal

引用次数: 3

A review on network partitioning in wireless sensor and actor networks 无线传感器和行动者网络中网络划分的研究进展

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456987

R. Pallavi, G. C. Banu Prakash

引用次数: 3

Security agents for detecting and avoiding cooperative blackhole attacks in MANET 用于探测和避免协同黑洞攻击的安全代理

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456900

V. Mohite, L. Ragha

{"title":"Security agents for detecting and avoiding cooperative blackhole attacks in MANET","authors":"V. Mohite, L. Ragha","doi":"10.1109/ICATCCT.2015.7456900","DOIUrl":"https://doi.org/10.1109/ICATCCT.2015.7456900","url":null,"abstract":"During blackhole attack, a malicious node captures packets and not forwards them in the network and advertises itself as having the shortest path to the node whose packets it wants to intercept. If more than one malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack. To avoid single blackhole attack in MANET we considered a mechanism that uses FurtherRouteRequest packets. For detecting and avoiding cooperative blackhole attack we propose a new technique which uses Cooperative Cluster Agents. In the proposed approach we pass DRI and SRT-RRT table as an input to Cooperative Security Agents. Based on these inputs the CSAs use cross checking and detection flow mechanisms for detecting cooperative blackhole attack, once it is detected that can be avoided by passing alert notification in the MANET. For implementation of the proposed scheme we will use network simulator - ns-2.35. We evaluate the proposed solution and compare it with standard AODV protocol in terms of throughput, packet delivery ratio and end-to-end delay.","PeriodicalId":276158,"journal":{"name":"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129275866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 13

A reliable data delivery using trust management system based on node behaviour predication in MANET 基于节点行为预测的MANET可靠数据传输信任管理系统

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456896

V. Pavani, B. Sathyanarayana

{"title":"A reliable data delivery using trust management system based on node behaviour predication in MANET","authors":"V. Pavani, B. Sathyanarayana","doi":"10.1109/ICATCCT.2015.7456896","DOIUrl":"https://doi.org/10.1109/ICATCCT.2015.7456896","url":null,"abstract":"An improvisation version of traditional wireless networks provide mobile ad hoc network (MANET), which is highly suitable for emergency needs. But, at the same time, due to its infrastructure less and resources limitation create many challenges in its performance. Mainly due to its dynamic behaviour it prones to high security concern, as the complete communication cycle depends on the independent nodes which voluntary join and leave. Several security studies reveal that trust management systems can be effective and attained low overhead. But, most of these studies used an automated decision algorithms based on some predefined trust scheme. This kind of scheme unable to distinguish the node intentional and unintentional errors at runtime, which impact the selected paths for the communication. So, it is very important to identify node behaviour and also provide node recovery scheme. In this paper, we propose a novel trust management system based on node behaviour predication algorithm to preserve high network stability and security for the reliable data delivery. The algorithm will predict and identify the node behaviour and distinguish between unintentional temporary errors and intentional malicious behaviour and compute a node overall trust. Experimental results show that, node behavior prediction and trust management system improvise the throughput ratio and network stability.","PeriodicalId":276158,"journal":{"name":"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129307905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Optimized cryptographic algorithm for embedded systems 嵌入式系统的优化密码算法

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456850

A. A. Deshmukh, Mintu Jothish, K. Chandrasekaran

引用次数: 0

An approach to mining information from telephone graph using graph mining techniques 利用图挖掘技术从电话图中挖掘信息的方法

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456921

B. Rao, S. Mishra

{"title":"An approach to mining information from telephone graph using graph mining techniques","authors":"B. Rao, S. Mishra","doi":"10.1109/ICATCCT.2015.7456921","DOIUrl":"https://doi.org/10.1109/ICATCCT.2015.7456921","url":null,"abstract":"Among various properties of social network, one of the important properties is to study strong community effect where social entity in a network forms a group which is closely connected. Groups formed out of such properties are communities, clusters, cohesive subgroups or modules. The authors have observed that individuals interact more frequently within a group rather than group interaction. Detection of similar groups in a social network is known as community detection. Finding such type of communities and analyzing, helps in knowledge and pattern mining. This paper focuses on methods to study a real world social network communications using the basic concepts of graph theory. For this purpose, the authors have considered telephone network. The authors have proposed an algorithm for extracting different network provider's sub-graphs, weak and strong connected sub-graphs and extracting incoming and outgoing calls of subscribers which have direct application for studying the human behavior in telephone network. The proposed algorithm has been implemented in C++ programming language and obtained satisfactory result.","PeriodicalId":276158,"journal":{"name":"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130908029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Improving the efficiency of MapReduce scheduling algorithm in Hadoop 提高Hadoop中MapReduce调度算法的效率

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456856

R. Thangaselvi, S. Ananthbabu, S. Jagadeesh, R. Aruna

{"title":"Improving the efficiency of MapReduce scheduling algorithm in Hadoop","authors":"R. Thangaselvi, S. Ananthbabu, S. Jagadeesh, R. Aruna","doi":"10.1109/ICATCCT.2015.7456856","DOIUrl":"https://doi.org/10.1109/ICATCCT.2015.7456856","url":null,"abstract":"In a distributed computing environment, to support the processing of large data sets a free Java-based programming framework Hadoop plays a vital role. In Hadoop, MapReduce technique is used for processing and generating large datasets is used with a parallel distributed algorithm on a cluster. The benefit of using MapReduce is to automatically handle failures and hides the complexity of fault tolerance from the user. The Scheduling algorithm of FIFO(FIRST IN FIRST OUT) is used in Hadoop as default in which the jobs are executed in the order of their arrival. This method suits well for homogeneous cloud and results in poor performance on the heterogeneous cloud. Later the LATE (Longest Approximate Time to End) algorithm has been developed which reduces the FIFO's response time by a factor of 2. It gives better performance in heterogeneous environments. The three principles of LATE algorithms are i) prioritizing tasks to speculate ii) selecting fast nodes to run on iii) capping speculative tasks to prevent thrashing. It takes action on appropriate slow tasks and it could not compute the remaining time for tasks correctly and can't find the real slow tasks. Finally, an SAMR (Self-Adaptive MapReduce) scheduling algorithm is being introduced which can find the slow tasks dynamically by using the historical information recorded on each node to tune parameters. SAMR reduces the execution time by 25% when compared to FIFO and 14% when compared to LATE.","PeriodicalId":276158,"journal":{"name":"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121216778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Improving recital of transport protocol in cognitive radio mobile ad hoc networks 认知无线电移动自组网中传输协议的改进

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456949

A. Selvan, K. Selvaradjou

{"title":"Improving recital of transport protocol in cognitive radio mobile ad hoc networks","authors":"A. Selvan, K. Selvaradjou","doi":"10.1109/ICATCCT.2015.7456949","DOIUrl":"https://doi.org/10.1109/ICATCCT.2015.7456949","url":null,"abstract":"Cognitive Radio (CR) networks has the potential to solve the scarcity problem of wireless resources were unlicensed users can opportunistically perform transmission without impacting the operations of licensed users. In CogMANET, the channel switching is inherently necessary when primary users appears on the channel. During the channel switching, the communication characteristics such as bottleneck bandwidth and RTT will change. Due to this change, TCP has to adaptively update its congestion window (cwnd) to make an efficient use of the available resources. TCP CRAHN which incorporate spectrum awareness by combining explicit feedback from intermediate nodes and destination was proposed. In this paper, TCP CRAHN is evaluated in cases where bottleneck bandwidth and RTT changes. Based on the results, TCP CoBA (Collabarative Bottleneck Analysis) is proposed to further improve the throughput. This protocol updates the cwnd based upon the available buffer space in the relay node upon channel switch. Comparison of TCP CRAHN and TCP CoBA throughput will be analyzed and implemented using the NS2 Simulator.","PeriodicalId":276158,"journal":{"name":"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116454326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Efficient lookup for NLAPB in named data networking 命名数据网络中NLAPB的高效查找

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456849

Chandana K L Iv, Sem M Tech Student, T. Asst, Prof, B. Shantakumar, Patil, P. Patil

引用次数: 2

Software quality assurance for object-oriented systems using meta-heuristic search techniques 使用元启发式搜索技术的面向对象系统的软件质量保证

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) Pub Date : 2015-10-01 DOI: 10.1109/ICATCCT.2015.7456924

Yeresime Suresh

{"title":"Software quality assurance for object-oriented systems using meta-heuristic search techniques","authors":"Yeresime Suresh","doi":"10.1109/ICATCCT.2015.7456924","DOIUrl":"https://doi.org/10.1109/ICATCCT.2015.7456924","url":null,"abstract":"Identifying fault prone modules at the very early stage of software development life cycle is very much necessary. This helps software developers to concentrate more on quality assurance, use the man power in proper perspective and mainly reduce the fault removal cost to be in-cured for the software system being developed. In literature, it is found that numerous authors have come up with cost based evaluation frameworks to find the effectiveness of the proposed fault prediction model based on the application of neural network models, but less emphasizes is provided on the manner in which networks are trained, where in a elementary approach of assigning random weights to the nodes is followed. This paper evaluates the capability of meta-heuristic search techniques in software fault classification for Apache Integration Framework. Genetic algorithm (GA) and Particle swarm optimization (PSO) is coupled with neural network for designing prediction models. It is observed that Modified Neuro PSO model is more effective and efficient in classifying faults accurately when compared to Neuro-GA, Adaptive Neuro-GA and Neuro-PSO.","PeriodicalId":276158,"journal":{"name":"2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124075991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4