Clustering is "the method of organizing objects into groups whose members are related in some way". A cluster is therefore a collection of objects which are coherent internally, but clearly dissimilar to the objects belonging to other clusters. Document clustering is used in many fields such as data mining and information retrieval. Thus, the main goals of this paper are to identify the comparison of the performance of criterion function in the context of partition clustering approach, k means, and agglomerative hierarchical approach. By comparing all this we establish right clustering algorithm to produce qualitative clustering of real world document. And also modify existing algorithm to establish right algorithm which we try to make more efficient than existing algorithms which we are study in this paper.
{"title":"Comparison of Algorithms for Document Clustering","authors":"Mamta Gupta, A. Rajavat","doi":"10.1109/CICN.2014.123","DOIUrl":"https://doi.org/10.1109/CICN.2014.123","url":null,"abstract":"Clustering is \"the method of organizing objects into groups whose members are related in some way\". A cluster is therefore a collection of objects which are coherent internally, but clearly dissimilar to the objects belonging to other clusters. Document clustering is used in many fields such as data mining and information retrieval. Thus, the main goals of this paper are to identify the comparison of the performance of criterion function in the context of partition clustering approach, k means, and agglomerative hierarchical approach. By comparing all this we establish right clustering algorithm to produce qualitative clustering of real world document. And also modify existing algorithm to establish right algorithm which we try to make more efficient than existing algorithms which we are study in this paper.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"541-545"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88875207","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}
Green communication is the latest research trend practiced by researcher in green computing and network communication. There is no extensive work in green network design and no work in thermal aware network equipment design. In order to fill this research gap, we are going to design thermal aware energy efficient Universal Asynchronous Receiver Transmitter (UART) that will create an avenue for thermal aware green communication. We had achieved 59.32% to 72.96% reduction when temperature varies from 15°C to 75°C and airflow is 250 Linear Feet Per Minute (LFM), and reduction is in range of 59.30% to 72.97%, when temperature varies from 15°C to 75°C and airflow is 500 LFM. This design is implemented on Virtex 6 Field programmable Gate Array (FPGA) using Verilog.
{"title":"Thermal Aware Low Power Universal Asynchronous Receiver Transmitter Design on FPGA","authors":"Sunny Singh, A. Jain, A. Kaur, B. Pandey","doi":"10.1109/CICN.2014.198","DOIUrl":"https://doi.org/10.1109/CICN.2014.198","url":null,"abstract":"Green communication is the latest research trend practiced by researcher in green computing and network communication. There is no extensive work in green network design and no work in thermal aware network equipment design. In order to fill this research gap, we are going to design thermal aware energy efficient Universal Asynchronous Receiver Transmitter (UART) that will create an avenue for thermal aware green communication. We had achieved 59.32% to 72.96% reduction when temperature varies from 15°C to 75°C and airflow is 250 Linear Feet Per Minute (LFM), and reduction is in range of 59.30% to 72.97%, when temperature varies from 15°C to 75°C and airflow is 500 LFM. This design is implemented on Virtex 6 Field programmable Gate Array (FPGA) using Verilog.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"10 1","pages":"939-942"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78700159","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}
ZigBee is a specification formalized by the IEEE 802.15.4 standard designed for low rate wireless personal area networks (LR-WPAN). It consumes extremely low power for wireless connectivity which allows battery power to sustain for a long time. For routing in ZigBee mesh network, Ad-hoc on Demand Distance Vector (AODV) routing algorithm is extensively used. However the performance of the AODV degrade when the network is under black hole attack. In this paper, a technique is proposed to detect and defend black hole attack using AODV routing protocol with little modification. Analysis of AODV and suggested protocol under black hole prone network is carried out using NS-2. The result shows that efficacy of proposed protocol.
ZigBee是由IEEE 802.15.4标准正式确定的规范，专为低速率无线个人区域网络(LR-WPAN)设计。它的无线连接功耗极低，这使得电池电量可以维持很长时间。在ZigBee网状网络中，广泛采用的是AODV (Ad-hoc on Demand Distance Vector)路由算法。然而，当网络受到黑洞攻击时，AODV的性能会下降。本文提出了一种利用AODV路由协议对黑洞攻击进行检测和防御的方法。利用NS-2对黑洞易发网络下的AODV和建议协议进行了分析。实验结果表明了该方案的有效性。
{"title":"Blackhole Tolerant Protocol for ZigBee Wireless Networks","authors":"H. Sharma, Koushik Banerjee, B. Chaurasia","doi":"10.1109/CICN.2014.168","DOIUrl":"https://doi.org/10.1109/CICN.2014.168","url":null,"abstract":"ZigBee is a specification formalized by the IEEE 802.15.4 standard designed for low rate wireless personal area networks (LR-WPAN). It consumes extremely low power for wireless connectivity which allows battery power to sustain for a long time. For routing in ZigBee mesh network, Ad-hoc on Demand Distance Vector (AODV) routing algorithm is extensively used. However the performance of the AODV degrade when the network is under black hole attack. In this paper, a technique is proposed to detect and defend black hole attack using AODV routing protocol with little modification. Analysis of AODV and suggested protocol under black hole prone network is carried out using NS-2. The result shows that efficacy of proposed protocol.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"23 1","pages":"782-786"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88228769","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}
The k-means algorithm is known to have a time complexity of O(n2), where n is the input data size. This quadratic complexity debars the algorithm from being effectively used in large applications. In this article, an attempt is made to develop an O(n) complexity (linear order) counterpart of the k-means. The underlying modification includes a directional movement of intermediate clusters and thereby improves compactness and separability properties of cluster structures simultaneously. This process also results in an improved visualization of clustered data. Comparison of results obtained with the classical k-means and the present algorithm indicates usefulness of the new approach.
{"title":"A Linear Time-Complexity k-Means Algorithm Using Cluster Shifting","authors":"M. K. Pakhira","doi":"10.1109/CICN.2014.220","DOIUrl":"https://doi.org/10.1109/CICN.2014.220","url":null,"abstract":"The k-means algorithm is known to have a time complexity of O(n2), where n is the input data size. This quadratic complexity debars the algorithm from being effectively used in large applications. In this article, an attempt is made to develop an O(n) complexity (linear order) counterpart of the k-means. The underlying modification includes a directional movement of intermediate clusters and thereby improves compactness and separability properties of cluster structures simultaneously. This process also results in an improved visualization of clustered data. Comparison of results obtained with the classical k-means and the present algorithm indicates usefulness of the new approach.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"2 1","pages":"1047-1051"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88589030","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}
In this paper, we put forward a task scheduling algorithm in cloud computing with the goal of the minimum completion time, maximum load balancing degree, and the minimum energy consumption using improved differential evolution algorithm. In order to improve the global search ability in the earlier stage and the local search ability in the later stage, we have adopted the adaptive zooming factor mutation strategy and adaptive crossover factor increasing strategy. At the same time, we have strengthened the selection mechanism to keep the diversity of population in the later stage. In the process of simulation, we have performed the functional verification of the algorithm and compared with the other representative algorithms. The experimental results show that the improved differential evolution algorithm can optimize cloud computing task scheduling problems in task completion time, load balancing, and energy efficient optimization.
{"title":"A Study of Task Scheduling Based on Differential Evolution Algorithm in Cloud Computing","authors":"Jing Xue, Liutao Li, SaiSai Zhao, Litao Jiao","doi":"10.1109/CICN.2014.142","DOIUrl":"https://doi.org/10.1109/CICN.2014.142","url":null,"abstract":"In this paper, we put forward a task scheduling algorithm in cloud computing with the goal of the minimum completion time, maximum load balancing degree, and the minimum energy consumption using improved differential evolution algorithm. In order to improve the global search ability in the earlier stage and the local search ability in the later stage, we have adopted the adaptive zooming factor mutation strategy and adaptive crossover factor increasing strategy. At the same time, we have strengthened the selection mechanism to keep the diversity of population in the later stage. In the process of simulation, we have performed the functional verification of the algorithm and compared with the other representative algorithms. The experimental results show that the improved differential evolution algorithm can optimize cloud computing task scheduling problems in task completion time, load balancing, and energy efficient optimization.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"115 1","pages":"637-640"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88746719","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}
In this paper a micro strip ultra-wideband (UWB) band pass filter using open and short circuited stubs has been presented. The proposed filter is designed using Four coupled-line stubs three are short stubs and one open stub. The UWB filter is deployed on FR4 Epoxy dielectric substrate with thickness of 0.8mm and the filter occupies 15 × 10mm2. This filter is operating in the whole UWB pass band of 3.05GHz to 10.6 GHz. The design was properly calculated and design simulation was carried out using CST software to verify the performance, it has maximum return loss (S11) at 8.45GHz (-37.28dB) frequency.
{"title":"Ultra-Wideband Bandpass Filter Using Coupled Line Stubs","authors":"Priyanka Gupta, Deepak Bhatia","doi":"10.1109/CICN.2014.39","DOIUrl":"https://doi.org/10.1109/CICN.2014.39","url":null,"abstract":"In this paper a micro strip ultra-wideband (UWB) band pass filter using open and short circuited stubs has been presented. The proposed filter is designed using Four coupled-line stubs three are short stubs and one open stub. The UWB filter is deployed on FR4 Epoxy dielectric substrate with thickness of 0.8mm and the filter occupies 15 × 10mm2. This filter is operating in the whole UWB pass band of 3.05GHz to 10.6 GHz. The design was properly calculated and design simulation was carried out using CST software to verify the performance, it has maximum return loss (S11) at 8.45GHz (-37.28dB) frequency.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"51 1","pages":"126-128"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83724399","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}
Steganography in multimedia object improves the information security during communication. An analysis approach with effective frame selection, partial information storage per frame and referenced mask based embedding is suggested to improve the steganograhy process in video objects. Three step process is espoused to amend the security of video object which is as under mentioned. In first stage, the effective frame selection analysis is performed using entropy method on which the information hiding is effective. The frame analysis is performed based on content level analysis. The adaptive mask over the frame is identified using frequency based analysis over the image in second stage. At third level, LSB approach is applied over the mask to perform information embedding. The work is applied on real time images. The obtained result shows the effective information storage with high PSNR ratio.
{"title":"A Multi Phase Model to Improve Video Steganography","authors":"Seema, Jyoti Chaudhary","doi":"10.1109/CICN.2014.158","DOIUrl":"https://doi.org/10.1109/CICN.2014.158","url":null,"abstract":"Steganography in multimedia object improves the information security during communication. An analysis approach with effective frame selection, partial information storage per frame and referenced mask based embedding is suggested to improve the steganograhy process in video objects. Three step process is espoused to amend the security of video object which is as under mentioned. In first stage, the effective frame selection analysis is performed using entropy method on which the information hiding is effective. The frame analysis is performed based on content level analysis. The adaptive mask over the frame is identified using frequency based analysis over the image in second stage. At third level, LSB approach is applied over the mask to perform information embedding. The work is applied on real time images. The obtained result shows the effective information storage with high PSNR ratio.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"725-729"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91292492","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}
A new low profile and broadband monopolar patch antenna is proposed. Previously, long rectangular patch antennas have been designed with a compact structure and high gain, but these antennas do not have the required monopolar radiation pattern. On the other hand there have been patches designed to have wide bandwidth by employing thick substrates. However, the profile of such antennas may be too high for certain applications. We propose a low profile patch antenna with wide bandwidth, high gain and monopole like radiation pattern. The proposed antenna has a bandwidth of 9.4% and gain of 7 dBi with monopole like radiation pattern for an infinite ground plane. While for a finite ground plane bandwidth of 15.3% and gain of 5 dBi is obtained at a low profile of 0.027λ0.
{"title":"Design and Analysis of a Broadband Low Profile Monopolar Patch Antenna","authors":"J. Serrao, A. Fakih","doi":"10.1109/CICN.2014.22","DOIUrl":"https://doi.org/10.1109/CICN.2014.22","url":null,"abstract":"A new low profile and broadband monopolar patch antenna is proposed. Previously, long rectangular patch antennas have been designed with a compact structure and high gain, but these antennas do not have the required monopolar radiation pattern. On the other hand there have been patches designed to have wide bandwidth by employing thick substrates. However, the profile of such antennas may be too high for certain applications. We propose a low profile patch antenna with wide bandwidth, high gain and monopole like radiation pattern. The proposed antenna has a bandwidth of 9.4% and gain of 7 dBi with monopole like radiation pattern for an infinite ground plane. While for a finite ground plane bandwidth of 15.3% and gain of 5 dBi is obtained at a low profile of 0.027λ0.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"36 1","pages":"46-50"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91191896","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}
The performance of cooperative spectrum sensing (CSS) with multi-slot sensing has been investigated. A number of cognitive radio (CR) enabled users sense the primary user (PU) spectrum in multiple sensing mini-slots and the decision of each slot is combined using OR rule to evaluate the local decision about PU. All the CRs send their local decisions over faded reporting channels (R-channel) to fusion centre (FC). FC takes the final decision about PU on the basis of majority logic fusion rule. The performance of spectrum sensing has been investigated in terms of detection probability and missed detection probability for different sensing parameters such as sensing threshold, number of mini-slots and sensing channel SNR (S-SNR) etc.
{"title":"Multi-slot Spectrum Sensing in Fading Channels for a Cooperative Cognitive Radio Network","authors":"A. Bhowmick, S. D. Roy, S. Kundu","doi":"10.1109/CICN.2014.99","DOIUrl":"https://doi.org/10.1109/CICN.2014.99","url":null,"abstract":"The performance of cooperative spectrum sensing (CSS) with multi-slot sensing has been investigated. A number of cognitive radio (CR) enabled users sense the primary user (PU) spectrum in multiple sensing mini-slots and the decision of each slot is combined using OR rule to evaluate the local decision about PU. All the CRs send their local decisions over faded reporting channels (R-channel) to fusion centre (FC). FC takes the final decision about PU on the basis of majority logic fusion rule. The performance of spectrum sensing has been investigated in terms of detection probability and missed detection probability for different sensing parameters such as sensing threshold, number of mini-slots and sensing channel SNR (S-SNR) etc.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"35 1","pages":"421-424"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85063154","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}
It is essential for a network to support guaranteed quality-of-service (QoS) for some applications on Internet. Robustness of the network plays an important role to achieve the basic QoS requirements to support real-time applications. Though it has been achieved through various single path routing mechanisms but to provide the robustness and availability to the network, multiple paths have to be selected. A route is selected based on various metrics. Using soft computing techniques capability of deriving multiple paths through a single run can be enabled. In this paper an implementation of particle swarm optimization (PSO), based routing algorithm to get multiple paths satisfying various constraints of QoS parameters is shown. The results are compared with other soft computing techniques like genetic algorithm and ant colony optimization (ACO).
{"title":"Multi-constraint Multipath QoS Routing Using Swarm Intelligence","authors":"Ankur Kulhari, C. Gandhi, Anil Jaiswal","doi":"10.1109/CICN.2014.109","DOIUrl":"https://doi.org/10.1109/CICN.2014.109","url":null,"abstract":"It is essential for a network to support guaranteed quality-of-service (QoS) for some applications on Internet. Robustness of the network plays an important role to achieve the basic QoS requirements to support real-time applications. Though it has been achieved through various single path routing mechanisms but to provide the robustness and availability to the network, multiple paths have to be selected. A route is selected based on various metrics. Using soft computing techniques capability of deriving multiple paths through a single run can be enabled. In this paper an implementation of particle swarm optimization (PSO), based routing algorithm to get multiple paths satisfying various constraints of QoS parameters is shown. The results are compared with other soft computing techniques like genetic algorithm and ant colony optimization (ACO).","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"32 1","pages":"468-471"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84505481","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：