2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES最新文献_第9页

Routing protocol for Delay Tolerant Network: A survey and comparison 容忍延迟网络的路由协议:综述与比较

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670553

Ramchandra S. Mangrulkar, M. Atique

{"title":"Routing protocol for Delay Tolerant Network: A survey and comparison","authors":"Ramchandra S. Mangrulkar, M. Atique","doi":"10.1109/ICCCCT.2010.5670553","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670553","url":null,"abstract":"Delay Tolerant Network (DTN) is evolved from Mobile Adhoc Network, MaNet. It is sparse and intermittently connected mobile adhoc network where reliable communication and end-to-end connectivity is not available for message transmission. The end to end connectivity is not ensured in Delay Tolerant Network. Only high latency applications are used in DTN. Latency may be in hours or days. The store and forward approach helps to increase message delivery probability in DTN irrespective of time taken to delivered message over normal MaNet. In DTN, the two or more nodes can exchange message when they move in transmission range of each other. Routing issue is very important due to limited resources for message storage and forwarding. This Routing issue is considered by many researchers which results in many routing protocol based on Flooding and Forwarding Approach. In this paper we try to summarize the routing protocols till date which are available in literature. We also try to compare the entire routing protocol. This paper gives right direction to researchers to proceed for designing a new routing protocol for Delay Tolerant Network.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129902387","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}

引用次数: 53

Classification of remote sensed image using Rapid Genetic k-Means algorithm 基于快速遗传k-均值算法的遥感图像分类

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670754

S. Arunprasath, S. Chandrasekar, K. Venkatalakshmi, S. Shalinie

{"title":"Classification of remote sensed image using Rapid Genetic k-Means algorithm","authors":"S. Arunprasath, S. Chandrasekar, K. Venkatalakshmi, S. Shalinie","doi":"10.1109/ICCCCT.2010.5670754","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670754","url":null,"abstract":"An attempt has been made in the paper to find globally optimal cluster centers for remote-sensed images with the proposed Rapid Genetic k-Means algorithm. The idea is to avoid the expensive crossover or fitness to produce valid clusters in pure GA and to improve the convergence time. The drawback of using pure GA in the problem is the usage of an expensive crossover or fitness to produce valid clusters (Non-empty clusters). To circumvent the disadvantage of GA, hybridization of GA with k-Means as Genetic k-Means (GKA) is already proposed[GKA, Fast,Flash]. The Genetic k-Means Algorithm always finds the globally optimal cluster centers but the drawback is the usage of an expensive fitness function which involves σ truncation. The Rapid GKA alleviates the problem by using a simple fitness function with an incremental factor. A k-Means operator, one-step of k-Means algorithm, used in GKA as a search operator is adopted in this paper. In Rapid GKA the mutation involves less computation than the mutation involved in GKA and Fast GKA(FGKA). In order to avoid the invalid clusters formed during the iterations the empty clusters are converted into singleton cluster by adding a randomly selected data item until none of the cluster is empty. The results show that the proposed algorithm converges to the global optimum in fewer numbers of generations than conventional GA and also found to consume less computational complexity than GKA and FGKA. It proves to be an effective clustering algorithm for remote sensed images.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128707191","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}

引用次数: 3

Speed control of PMSM by hybrid genetic Artificial Bee Colony Algorithm 基于混合遗传人工蜂群算法的永磁同步电机速度控制

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670559

R. K. Jatoth, A. Rajasekhar

引用次数: 26

Detection of malicious nodes in MANETs manet中恶意节点检测

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670735

T. Manikandan, K. B. Sathyasheela

引用次数: 11

Performance enhancement of Continuous Transverse Stub(CTS) antenna array with monopole termination 单极端接连续横截短(CTS)天线阵列的性能增强

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670737

P. Jothilakshmi, S. Raju

{"title":"Performance enhancement of Continuous Transverse Stub(CTS) antenna array with monopole termination","authors":"P. Jothilakshmi, S. Raju","doi":"10.1109/ICCCCT.2010.5670737","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670737","url":null,"abstract":"The modern antenna design structure requires low-loss, low-dispersion, dimensional robustness and design flexibility. Continuous Transverse Stub (CTS) is an antenna technology that offers greater tunable bandwidth than waveguide or Microstrip patch antennas. This paper proposes a newer design of Continuous Transverse Stub (CTS) antenna. The two major problems arises, while designing large bandwidth antennae are size of the antenna and presence of side-lobe levels. When a concept is introduced, there will be sustainable improvement in its conceptual design. In this way the CTS antenna has undergone several developments. The Co-axial CTS antenna is a structure with Co-axial waveguide skeleton, which runs along the length of the antenna. Radial stubs that are in the form of circular plates separated by a dielectric medium, interrupt the waveguide at regular intervals. This design not only improves the band of operation, but also reduces the total length of the antenna. It is seen that radiating efficiency of a stub is not high, so stubs should be connected for good efficiency. The proposed antenna arrays are mainly suitable for wireless OFDM network application. Using the simulation tool CST MICROWAVE STUDIO SUITE 2008, the various properties of the proposed model were analyzed by finite integral method.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126655460","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}

引用次数: 3

Analysis of biomedical EEG signals using Wavelet Transforms and Multifractal Analysis 基于小波变换和多重分形分析的生物医学脑电信号分析

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670780

D. Easwaramoorthy, R. Uthayakumar

{"title":"Analysis of biomedical EEG signals using Wavelet Transforms and Multifractal Analysis","authors":"D. Easwaramoorthy, R. Uthayakumar","doi":"10.1109/ICCCCT.2010.5670780","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670780","url":null,"abstract":"Fractal Analysis is the well developed theory in the Non-linear Analysis of Biomedical Signals such as Electroencephalogram (EEG). EEG signal is essentially multi scale fractal, i.e. Multifractal. Therefore Multifractal measures such as Generalized Fractal Dimensions (GFD), could be a useful tool to compute the degree of disorders, complexity, irregularity and chaotic nature of the Biomedical Signals of the Epileptic patients. We organized a novel scheme for detecting epileptic seizures from EEG data recorded from Healthy subjects and Epileptic patients. The scheme was based on GFD and the Discrete Wavelet Transform (DWT) analysis of EEG signals. First EEG signals were decomposed into approximation and detail coefficients using DWT and then GFD values of the original EEGs, approximation and detail coefficients were computed. Significant differences were found between the GFD values of the Healthy and Epileptic EEGs showing us to detect seizures with high accuracy. Without DWT as preprocessing step, it was shown that the detection rate is very less. The proposed idea was demonstrated through the graphical and statistical tools. Hence we conclude that the Multifractal Analysis based on GFD and the Wavelet Decomposition through DWT are the strong detectors and indicators of the state of illness of the Epileptic Patients.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126799618","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}

引用次数: 35

A hybrid evolutionary approach for optimal fuzzy classifier design 模糊分类器优化设计的混合进化方法

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670725

A. S. Karthik Kannan, P. Thanapal

引用次数: 2

An integrated approach in achieving optimization using LS-FW-AC algorithm LS-FW-AC算法实现优化的集成方法

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670552

S. Archana, R. Nadhiya Subashini, A. Vaishnavi

{"title":"An integrated approach in achieving optimization using LS-FW-AC algorithm","authors":"S. Archana, R. Nadhiya Subashini, A. Vaishnavi","doi":"10.1109/ICCCCT.2010.5670552","DOIUrl":"https://doi.org/10.1109/ICCCCT.2010.5670552","url":null,"abstract":"There are certain aspects in the field of networking that needs to be accomplished, yet it is very difficult to achieve. One such concept is Optimization. Achieving a high degree of reliability will eventually lead us to Optimization. But, achieving high degree of reliability?? This indeed is a very big problem that needs a solution. There have been many solutions before that solves the problem in some cases, yet there is nothing so called a global technique available that can be applied to any networks. The next big problem is guaranteeing Quality of Service (QOS). Our paper basically aims at providing a method or an approach which will give us a solution for both of these problems depicted above. The approach we are going to adopt is something related to effective utilization of the routing algorithms available. When one algorithm gives some efficiency criteria, then what will happen to the efficiency if some algorithms are combined? This basic fascination led us to use 3 known Routing algorithms namely Link state, Floyd war shall and Ant colony. These algorithms are applied in phases or stages to get some effective optimization result. This effective optimization will naturally lead us to a stage where we could easily guarantee QOS too. The state conditions that will possibly decrease the reliability criteria here can be easily overcome than in other cases where a single routing algorithm is used.","PeriodicalId":250834,"journal":{"name":"2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128223424","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

Impedance matching for the reduction of via induced signal reflection in on-chip high speed interconnect lines 片上高速互连线路中减少经感信号反射的阻抗匹配

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670539

Krishna K Soorya, M. S. Bhat

引用次数: 1

A comparative study of PID controller tuning using GA, EP, PSO and ACO 采用遗传算法、EP算法、粒子群算法和蚁群算法进行PID控制器整定的比较研究

2010 INTERNATIONAL CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES Pub Date : 2010-12-17 DOI: 10.1109/ICCCCT.2010.5670571

B. Nagaraj, N. Murugananth

引用次数: 144