Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350758
Krishan Kumar, Rajesh Joshi, K. Singh
DDoS attacks are best detected near the victim's site as maximum attack traffic converges at this point. In most of the current solutions, monitoring and analysis of traffic for DDoS detection have been carried at a single link which connects victim to ISP. However the mammoth volume generated by DDoS attacks pose the biggest challenge in terms of memory and computational overheads. These overheads make DDoS solution itself vulnerable against DDoS attacks. We propose to distribute these overheads amongst all POPs of the ISP using an ISP level traffic feature distribution based approach. An ISP level topology and well known attack tools are used for simulations in ns-2. The comparison with volume based approach clearly indicates the supremacy of the proposed methodology
{"title":"A Distributed Approach using Entropy to Detect DDoS Attacks in ISP Domain","authors":"Krishan Kumar, Rajesh Joshi, K. Singh","doi":"10.1109/ICSCN.2007.350758","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350758","url":null,"abstract":"DDoS attacks are best detected near the victim's site as maximum attack traffic converges at this point. In most of the current solutions, monitoring and analysis of traffic for DDoS detection have been carried at a single link which connects victim to ISP. However the mammoth volume generated by DDoS attacks pose the biggest challenge in terms of memory and computational overheads. These overheads make DDoS solution itself vulnerable against DDoS attacks. We propose to distribute these overheads amongst all POPs of the ISP using an ISP level traffic feature distribution based approach. An ISP level topology and well known attack tools are used for simulations in ns-2. The comparison with volume based approach clearly indicates the supremacy of the proposed methodology","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117311301","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350708
F. Jing, R. Bhuvaneswaran, Y. Katayama, N. Takahashi
Multipath routing selection strategy has been studied in the context of ad hoc networks. It has been shown that this selection strategy is categorized into two parts according to the utilization of multiple routes: best routing selection strategy and load balancing selection strategy. The best routing selection strategy use one route and save backup routes information for fault tolerance. The load balancing selection strategy uses route diversity to balance network load. In this paper, we show that many complicated reasons decide the effects of the multipath routing selection strategies in various load conditions. The effects of the strategies reverse some time. We show that unless a dynamic multipath routing selection strategy is used, the effect of the multipath does not have the perfect impact
{"title":"Multipath Routing Selection Strategies in Wireless Mobile Ad Hoc Networks","authors":"F. Jing, R. Bhuvaneswaran, Y. Katayama, N. Takahashi","doi":"10.1109/ICSCN.2007.350708","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350708","url":null,"abstract":"Multipath routing selection strategy has been studied in the context of ad hoc networks. It has been shown that this selection strategy is categorized into two parts according to the utilization of multiple routes: best routing selection strategy and load balancing selection strategy. The best routing selection strategy use one route and save backup routes information for fault tolerance. The load balancing selection strategy uses route diversity to balance network load. In this paper, we show that many complicated reasons decide the effects of the multipath routing selection strategies in various load conditions. The effects of the strategies reverse some time. We show that unless a dynamic multipath routing selection strategy is used, the effect of the multipath does not have the perfect impact","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124912260","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350777
K. Bhuvaneswari, S. Sivanandam
In this paper we introduce and study the concept of (taui , tauj)-fuzzy generalized alpha-closed sets, (tau i, tauj)-fuzzy pair wise generalized xi-mappings, where xiisin {continuous, open closed and irresolute}
{"title":"Fuzzy Pairwise Generalized a-Closed Mappings in Fuzzy Bitopological Spaces","authors":"K. Bhuvaneswari, S. Sivanandam","doi":"10.1109/ICSCN.2007.350777","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350777","url":null,"abstract":"In this paper we introduce and study the concept of (tau<sub>i </sub>, tau<sub>j</sub>)-fuzzy generalized alpha-closed sets, (tau <sub>i</sub>, tau<sub>j</sub>)-fuzzy pair wise generalized xi-mappings, where xiisin {continuous, open closed and irresolute}","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114965972","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350755
D. Saini, S. Bhooshan
UTRA-FDD systems use orthogonal variable spreading factor (OVSF) codes for channel separation in uplink and downlink. The OVSF codes are the limited resources in the downlink. The limited codes as well as code blocking property of OVSF codes gives lower system throughput. In this paper the OVSF code tree is extended such that the capacity of the tree becomes four times. Also the modified system uses single rake combiner providing no additional complexity increase in the user equipments (UEs). Simulation results are demonstrated to show the reduction in new call blocking probability using the OVSF code tree extension
{"title":"Code Tree Extension and Performance Improvement in OVSF-CDMA Systems","authors":"D. Saini, S. Bhooshan","doi":"10.1109/ICSCN.2007.350755","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350755","url":null,"abstract":"UTRA-FDD systems use orthogonal variable spreading factor (OVSF) codes for channel separation in uplink and downlink. The OVSF codes are the limited resources in the downlink. The limited codes as well as code blocking property of OVSF codes gives lower system throughput. In this paper the OVSF code tree is extended such that the capacity of the tree becomes four times. Also the modified system uses single rake combiner providing no additional complexity increase in the user equipments (UEs). Simulation results are demonstrated to show the reduction in new call blocking probability using the OVSF code tree extension","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"303 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122723059","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350673
K. Satya Prasad, K. Anitha Sheela, M. Sridevi
This paper deals with implementing an efficient optimization technique for designing an automatic speaker recognition (ASR) System, which uses average F-ratio score of TESPAR features, to yield high recognition accuracy even in adverse noisy conditions. A new ranking scheme is also proposed in order to stabilize the rank of features in various noise levels by taking arithmetic mean of the F-Ratio scores obtained from various levels of signal to noise ratio (SNR). The result is presented for a text-dependent ASR system with 20 speaker database. An RBF (radial basis function) neural network is used for recognition purpose
{"title":"Optimization of TESPAR Features using Robust F-Ratio for Speaker Recognition","authors":"K. Satya Prasad, K. Anitha Sheela, M. Sridevi","doi":"10.1109/ICSCN.2007.350673","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350673","url":null,"abstract":"This paper deals with implementing an efficient optimization technique for designing an automatic speaker recognition (ASR) System, which uses average F-ratio score of TESPAR features, to yield high recognition accuracy even in adverse noisy conditions. A new ranking scheme is also proposed in order to stabilize the rank of features in various noise levels by taking arithmetic mean of the F-Ratio scores obtained from various levels of signal to noise ratio (SNR). The result is presented for a text-dependent ASR system with 20 speaker database. An RBF (radial basis function) neural network is used for recognition purpose","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122934571","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350698
K. G. Subramanian, S. Hemalatha, C. Sri, Hari Nagore
A two-dimensional array grammar that uses sequential rewriting in a horizontal phase and parallel rewriting in the vertical phase, is proposed for generation of images that are rectangular arrays of symbols. This model which is related but different from a similar model introduced, is compared with the other model, for its image generative power. An application to generation of interesting patterns is also considered
{"title":"On Image Generation by Sequential/Parallel Array Grammars","authors":"K. G. Subramanian, S. Hemalatha, C. Sri, Hari Nagore","doi":"10.1109/ICSCN.2007.350698","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350698","url":null,"abstract":"A two-dimensional array grammar that uses sequential rewriting in a horizontal phase and parallel rewriting in the vertical phase, is proposed for generation of images that are rectangular arrays of symbols. This model which is related but different from a similar model introduced, is compared with the other model, for its image generative power. An application to generation of interesting patterns is also considered","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125380599","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350753
Yew Kuan, Min, Varun Jeotil
New techniques for the reduction of peak to average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems are presented. These techniques are based on precoding the constellation symbols with Zadoff-Chu and generalized chirp-like (GCL) precoders. The proposed techniques can achieve a PAPR reduction of up to 4.5 dB for OFDM systems. The techniques have been shown to be effective and have low complexity
{"title":"A Novel Signal Independent Technique for PAPR Reduction in OFDM Systems","authors":"Yew Kuan, Min, Varun Jeotil","doi":"10.1109/ICSCN.2007.350753","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350753","url":null,"abstract":"New techniques for the reduction of peak to average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems are presented. These techniques are based on precoding the constellation symbols with Zadoff-Chu and generalized chirp-like (GCL) precoders. The proposed techniques can achieve a PAPR reduction of up to 4.5 dB for OFDM systems. The techniques have been shown to be effective and have low complexity","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126508971","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350738
M. Sumalatha, V. Vaidehi, A. Kannan, S. Anandhi
The semantic Web browsing offers several benefits for the users. The researchers have done lots of work in this area. The proposals specified by them are not used much effectively for accessing the information. The search engines built today serve all users, independent of the special needs of any individual user. Personalization of Web search for each user incorporating his/her interests would give effective information retrieval. A user may associate one or more categories to their query manually. We have improved the existing, Rocchio based algorithm to construct the general profile and user profile for personalization. In our proposed method, we have constructed a Web browser; the information is retrieved through the browser with the aid of category hierarchy. The category hierarchy information will be frequently updated and ranked as per the user's interest during his/her Web search dynamically, the information retrieved is also cached on the client side using semantic cache mechanism which improves the response time. We have experimentally proved that our technique personalizes the Web search and reduces the hits made by the search engine providing appropriate results and improves the retrieval efficiency
{"title":"Information Retrieval using Semantic Web Browser - Personalized and Categorical Web Search","authors":"M. Sumalatha, V. Vaidehi, A. Kannan, S. Anandhi","doi":"10.1109/ICSCN.2007.350738","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350738","url":null,"abstract":"The semantic Web browsing offers several benefits for the users. The researchers have done lots of work in this area. The proposals specified by them are not used much effectively for accessing the information. The search engines built today serve all users, independent of the special needs of any individual user. Personalization of Web search for each user incorporating his/her interests would give effective information retrieval. A user may associate one or more categories to their query manually. We have improved the existing, Rocchio based algorithm to construct the general profile and user profile for personalization. In our proposed method, we have constructed a Web browser; the information is retrieved through the browser with the aid of category hierarchy. The category hierarchy information will be frequently updated and ranked as per the user's interest during his/her Web search dynamically, the information retrieved is also cached on the client side using semantic cache mechanism which improves the response time. We have experimentally proved that our technique personalizes the Web search and reduces the hits made by the search engine providing appropriate results and improves the retrieval efficiency","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130279924","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350693
N. Chatterjee, Y. Jaya Lakshmi, A. Potluri, A. Negi
The route discovery stage in MANET routing requires multi-hop message communication and is a crucial stage of any MANET routing protocol. Any optimization which increases the overall effectiveness in terms of routing efficiency and power utilization would improve the MANET performance. In this paper, we present our study of the effect of promiscuous mode operation of the wireless adapters on the dynamic source routing protocol (DSR) performance in different mobility and density conditions. DSR is an on-demand routing protocol that is actively being studied by IETF for standardization. The performance, especially with respect to power dissipation is observed and we correlate this with the packet delivery ratio and present our recommendations. Contrary to the expectation that an adapter in promiscuous mode would unnecessarily dissipate more energy, from our simulations we find that the overall MANET efficiency is enhanced
{"title":"Effect of Adapter Promiscuous Mode Operation on DSR Performance in MANETs","authors":"N. Chatterjee, Y. Jaya Lakshmi, A. Potluri, A. Negi","doi":"10.1109/ICSCN.2007.350693","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350693","url":null,"abstract":"The route discovery stage in MANET routing requires multi-hop message communication and is a crucial stage of any MANET routing protocol. Any optimization which increases the overall effectiveness in terms of routing efficiency and power utilization would improve the MANET performance. In this paper, we present our study of the effect of promiscuous mode operation of the wireless adapters on the dynamic source routing protocol (DSR) performance in different mobility and density conditions. DSR is an on-demand routing protocol that is actively being studied by IETF for standardization. The performance, especially with respect to power dissipation is observed and we correlate this with the packet delivery ratio and present our recommendations. Contrary to the expectation that an adapter in promiscuous mode would unnecessarily dissipate more energy, from our simulations we find that the overall MANET efficiency is enhanced","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129543375","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}
Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350770
C. Sivakumar, A. Velmurugan
The advanced encryption standard (AES) algorithm has become the default choice for various security services in numerous applications. In this paper, we propose a high speed, non-pipelined FPGA implementation of the AES-CCMP (counter-mode/CBC-MAC protocol) cipher for wireless LAN using Xilinx development tools and Virtex-II Pro FPGA circuits. IEEE 802.11i defines the AES-based cipher system, which is operated on CCMP Mode. All the modules in this core are described by using Verilog 2001 language. The developed AES CCMP core is aimed at providing high speed with sufficient security. The encryption/decryption data path operates at 194/148 MHz resulting in a throughput of 2.257 Gbits/sec for the encryption and 1.722 Gbits/sec for decryption. Compared to software implementation, migrating to hardware provides higher level of security and faster encryption speed. A comparison is provided between our design and similar existing implementations
{"title":"High Speed VLSI Design CCMP AES Cipher for WLAN (IEEE 802.11i)","authors":"C. Sivakumar, A. Velmurugan","doi":"10.1109/ICSCN.2007.350770","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350770","url":null,"abstract":"The advanced encryption standard (AES) algorithm has become the default choice for various security services in numerous applications. In this paper, we propose a high speed, non-pipelined FPGA implementation of the AES-CCMP (counter-mode/CBC-MAC protocol) cipher for wireless LAN using Xilinx development tools and Virtex-II Pro FPGA circuits. IEEE 802.11i defines the AES-based cipher system, which is operated on CCMP Mode. All the modules in this core are described by using Verilog 2001 language. The developed AES CCMP core is aimed at providing high speed with sufficient security. The encryption/decryption data path operates at 194/148 MHz resulting in a throughput of 2.257 Gbits/sec for the encryption and 1.722 Gbits/sec for decryption. Compared to software implementation, migrating to hardware provides higher level of security and faster encryption speed. A comparison is provided between our design and similar existing implementations","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129418461","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
扫码关注我们
求助内容：
应助结果提醒方式：