Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350736
J. Amutharaj, S. Radhakrishnan
Overlay networks have emerged as a powerful and highly flexible method of delivering content. An overlay network is a network running on top of another network, usually the Internet. These networks are employed in many settings to provide logical communication infrastructure over an existing communication network. The main objective of the overlay network is to reduce routing path lengths, stretched by the overlay routing process. In most solutions developed, a kind of fixed infrastructure in the form of excessive message exchange is necessary to guarantee good overlay locality properties. This paper presents a richly connected overlay networks based on Dominating Set Theory to optimize the number of nodes for large data transfer. Fast Replica algorithm is applied to reduce the content transfer time for replicating the content within the semantic network. To download a file from different peers in parallel from the semantic overlay network (SON) a dynamic parallel access scheme is introduced where end users access the members of the SON at the same time, fetching different portions of that file from different peers and reassembling them locally. The load is dynamically shared among all the peers. An enhanced digital fountain with Tornado codes is applied to eliminate the need for retransmission requests from the end users. Receivers run the decoding algorithm to reconstruct the original content. In this no feedback mechanisms are needed to ensure reliable delivery. This paper analyzes the performance of sequential unicast and multiple unicast content distribution strategies and compares their performance with our scheme and also analyzes the impact of dominating set theory for the construction of semantic overlays
{"title":"Dominating Set Theory Based Semantic Overlay Networks for Efficient Content Distribution","authors":"J. Amutharaj, S. Radhakrishnan","doi":"10.1109/ICSCN.2007.350736","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350736","url":null,"abstract":"Overlay networks have emerged as a powerful and highly flexible method of delivering content. An overlay network is a network running on top of another network, usually the Internet. These networks are employed in many settings to provide logical communication infrastructure over an existing communication network. The main objective of the overlay network is to reduce routing path lengths, stretched by the overlay routing process. In most solutions developed, a kind of fixed infrastructure in the form of excessive message exchange is necessary to guarantee good overlay locality properties. This paper presents a richly connected overlay networks based on Dominating Set Theory to optimize the number of nodes for large data transfer. Fast Replica algorithm is applied to reduce the content transfer time for replicating the content within the semantic network. To download a file from different peers in parallel from the semantic overlay network (SON) a dynamic parallel access scheme is introduced where end users access the members of the SON at the same time, fetching different portions of that file from different peers and reassembling them locally. The load is dynamically shared among all the peers. An enhanced digital fountain with Tornado codes is applied to eliminate the need for retransmission requests from the end users. Receivers run the decoding algorithm to reconstruct the original content. In this no feedback mechanisms are needed to ensure reliable delivery. This paper analyzes the performance of sequential unicast and multiple unicast content distribution strategies and compares their performance with our scheme and also analyzes the impact of dominating set theory for the construction of semantic overlays","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"107 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":"132544300","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.350679
E. Logashanmugam, B. Sreejaa, R. Ramachandran
In this paper we propose applying an adaptive context tree weighting method with a forbidden symbol in the H.264 coder. Arithmetic codes with a forbidden symbol and a trellis search techniques are employed on an order to estimate the best transmitted codeword. Instead of using the context modeling defined in the H.264 standard, the arithmetic code with a forbidden symbol uses a CTW method. The CABAC algorithm is replaced by GRASP algorithm and the experimental results show that coding gains similar or superior to those obtained with the H.264/AVC CABAC algorithm and arithmetic coding
{"title":"Arithmetic Coding with Forbidden Symbol and Optimized Adaptive Context Tree Modeling (GRASP Algorithm) for H.264 Video Coders","authors":"E. Logashanmugam, B. Sreejaa, R. Ramachandran","doi":"10.1109/ICSCN.2007.350679","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350679","url":null,"abstract":"In this paper we propose applying an adaptive context tree weighting method with a forbidden symbol in the H.264 coder. Arithmetic codes with a forbidden symbol and a trellis search techniques are employed on an order to estimate the best transmitted codeword. Instead of using the context modeling defined in the H.264 standard, the arithmetic code with a forbidden symbol uses a CTW method. The CABAC algorithm is replaced by GRASP algorithm and the experimental results show that coding gains similar or superior to those obtained with the H.264/AVC CABAC algorithm and arithmetic coding","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"51 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":"133356298","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.350699
K. Raja, S. Siddaraju, K. Venugopal, L. Patnaik
The steganography is the embedding of secret message in the cover image for covert communication. In this paper we present a high capacity data embedding using colour palette decomposition (CPD) in which the payload is embedded into the cover image as an index of shifted centroids which is derived from the clustering of the cover image to derive the stego image. The error control coding is applied to stego image to increase PSNR, capacity and security. It is observed that our algorithm has higher PSNR and capacity in comparison to earlier works
{"title":"Secure Steganography using Colour Palette Decomposition","authors":"K. Raja, S. Siddaraju, K. Venugopal, L. Patnaik","doi":"10.1109/ICSCN.2007.350699","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350699","url":null,"abstract":"The steganography is the embedding of secret message in the cover image for covert communication. In this paper we present a high capacity data embedding using colour palette decomposition (CPD) in which the payload is embedded into the cover image as an index of shifted centroids which is derived from the clustering of the cover image to derive the stego image. The error control coding is applied to stego image to increase PSNR, capacity and security. It is observed that our algorithm has higher PSNR and capacity in comparison to earlier works","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"12 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":"132635054","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.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.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.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.350745
M. Manikandan, A. Saravanan, K. Bagan
Curvelet transform is one of the recently developed multiscale transform, which possess directional features and provides optimally sparse representation of objects with edges. In this paper an algorithm for lossy image compression based on the second generation digital curvelet transform is proposed. The results are compared with the results obtained from wavelet based image compression methods. Compression ratio and PSNR are selected as the performance metrics,and it is shown that curvelet transform require fewer coefficients than wavelet transform to represent an image faithfully
{"title":"Curvelet Transform Based Embedded Lossy Image Compression","authors":"M. Manikandan, A. Saravanan, K. Bagan","doi":"10.1109/ICSCN.2007.350745","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350745","url":null,"abstract":"Curvelet transform is one of the recently developed multiscale transform, which possess directional features and provides optimally sparse representation of objects with edges. In this paper an algorithm for lossy image compression based on the second generation digital curvelet transform is proposed. The results are compared with the results obtained from wavelet based image compression methods. Compression ratio and PSNR are selected as the performance metrics,and it is shown that curvelet transform require fewer coefficients than wavelet transform to represent an image faithfully","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"116 1-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120889912","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.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.350706
A. Tripathy, S. S. Pathak, Soumen Chakrabarti
The soft output Viterbi algorithm (SOVA) is used for data detection in indoor wireless channels representative of the JTC and wireless local area network (WLAN). The performance of SOVA-SOVA permutation as an equalizer followed by a decoder is evaluated by simulation experiment. The performance does not improve much for more than three iterations in these ISI channels. The results obtained for 1 dB to 4 dB bit energy to noise power approach the coded AWGN performance by the end of the third iteration
{"title":"SOVA-Based Turbo Equalization and Decoding for Indoor Wireless Channels","authors":"A. Tripathy, S. S. Pathak, Soumen Chakrabarti","doi":"10.1109/ICSCN.2007.350706","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350706","url":null,"abstract":"The soft output Viterbi algorithm (SOVA) is used for data detection in indoor wireless channels representative of the JTC and wireless local area network (WLAN). The performance of SOVA-SOVA permutation as an equalizer followed by a decoder is evaluated by simulation experiment. The performance does not improve much for more than three iterations in these ISI channels. The results obtained for 1 dB to 4 dB bit energy to noise power approach the coded AWGN performance by the end of the third iteration","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":"129554568","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
扫码关注我们
求助内容：
应助结果提醒方式：