Pub Date : 2013-03-28DOI: 10.1109/NCC.2013.6488027
Vishal Sawant, P. Chaporkar, M. Belur
Transmission Control Protocol (TCP) is most widely used protocol in the Internet. In order to overcome inefficiency of TCP's Additive Increase and Multiplicative Decrease (AIMD) policy, several end-to-end algorithms have been proposed. However, these algorithms need considerably large time for converging to efficiency and fairness. In this paper, we propose Multiplicative Increase and Exponential Decrease transmission control protocol (MIXD-TCP). MIXD-TCP is a distributed and end-to-end protocol, i.e. each user updates its own transmission rate based on one bit feedback from the receiver indicating packet drops. MIXD-TCP decouples efficiency and fairness while at the same time converges to ‘efficient and fair resource allocation’ in the network. We prove that this optimal allocation is globally asymptotically stable under MIXD-TCP. Using ns-2 simulations, we demonstrate that MIXD-TCP performs better than existing end-to-end algorithms.
{"title":"MIXD-TCP: Completely decoupled end to end congestion control algorithm","authors":"Vishal Sawant, P. Chaporkar, M. Belur","doi":"10.1109/NCC.2013.6488027","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488027","url":null,"abstract":"Transmission Control Protocol (TCP) is most widely used protocol in the Internet. In order to overcome inefficiency of TCP's Additive Increase and Multiplicative Decrease (AIMD) policy, several end-to-end algorithms have been proposed. However, these algorithms need considerably large time for converging to efficiency and fairness. In this paper, we propose Multiplicative Increase and Exponential Decrease transmission control protocol (MIXD-TCP). MIXD-TCP is a distributed and end-to-end protocol, i.e. each user updates its own transmission rate based on one bit feedback from the receiver indicating packet drops. MIXD-TCP decouples efficiency and fairness while at the same time converges to ‘efficient and fair resource allocation’ in the network. We prove that this optimal allocation is globally asymptotically stable under MIXD-TCP. Using ns-2 simulations, we demonstrate that MIXD-TCP performs better than existing end-to-end algorithms.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124717171","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 : 2013-03-28DOI: 10.1109/NCC.2013.6488033
Tamoghna Ojha, S. Misra
In this paper, we introduce a 3-dimensional, distributed, iterative, and ‘silent’ localization protocol for Mobile Underwater Sensor Networks (MUSNs) named as Mobility Assisted Localization Scheme (MobiL). The existing solutions addressing the localization problem in underwater sensor networks (UWSNs) either consider the sensor nodes to be stationary or require powerful nodes, which can directly communicate with the surface sinks. Such assumptions are not applicable in MUSNs, where sensor nodes are affected by passive node mobility and the acoustic communication channel is severely impaired by high propagation loss. On the other hand, MobiL requires only three anchor nodes capable of providing the initial location beacon and all other nodes are ordinary sensor nodes. We exploit the spatially correlated mobility pattern of UWSNs and apply it to localize the sensor nodes. Also, we employ the ‘silent’ listening of beacon messages, which empowers MobiL to be energy-efficient. Simulations in NS-3 show that the proposed scheme successfully localizes nearly 90% of the total sensor nodes with localization error in the order of 25–30% of the error threshold in highly mobile UWSNs.
{"title":"MobiL: A 3-dimensional localization scheme for Mobile Underwater Sensor Networks","authors":"Tamoghna Ojha, S. Misra","doi":"10.1109/NCC.2013.6488033","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488033","url":null,"abstract":"In this paper, we introduce a 3-dimensional, distributed, iterative, and ‘silent’ localization protocol for Mobile Underwater Sensor Networks (MUSNs) named as Mobility Assisted Localization Scheme (MobiL). The existing solutions addressing the localization problem in underwater sensor networks (UWSNs) either consider the sensor nodes to be stationary or require powerful nodes, which can directly communicate with the surface sinks. Such assumptions are not applicable in MUSNs, where sensor nodes are affected by passive node mobility and the acoustic communication channel is severely impaired by high propagation loss. On the other hand, MobiL requires only three anchor nodes capable of providing the initial location beacon and all other nodes are ordinary sensor nodes. We exploit the spatially correlated mobility pattern of UWSNs and apply it to localize the sensor nodes. Also, we employ the ‘silent’ listening of beacon messages, which empowers MobiL to be energy-efficient. Simulations in NS-3 show that the proposed scheme successfully localizes nearly 90% of the total sensor nodes with localization error in the order of 25–30% of the error threshold in highly mobile UWSNs.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122276330","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487904
Arjun Kumar, M. Kartikeyan
In this paper, a compact microstrip bandpass filter is designed using defected ground structure (DGS) with narrow bandwidth. Here a 50Ω quarter wave microstrip line is used for designing the bandpass filter. A circular head dumbbell shaped DGS in the ground plane of a microstrip line is used which provides the bandstop characteristics. Two series gap slot is introduced for achieving the bandpass characteristics in the conducting strip. These slots in conducting strip are also called defected microstrip structure (DMS). This arrangement provides better coupling in the pass band. In this paper no stubs and via are used. The bandwidth of the filter is 500 MHz and insertion loss less than 0.5 dB in passband at 5.4 GHz. The measured insertion loss (S21) is 0.6 dB at the center frequency 5.4 GHz with a bandwidth of 500 MHz which is good in agreement with measured results after the fabrications)
{"title":"A design of microstrip bandpass filter with narrow bandwidth using DGS/DMS for WLAN","authors":"Arjun Kumar, M. Kartikeyan","doi":"10.1109/NCC.2013.6487904","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487904","url":null,"abstract":"In this paper, a compact microstrip bandpass filter is designed using defected ground structure (DGS) with narrow bandwidth. Here a 50Ω quarter wave microstrip line is used for designing the bandpass filter. A circular head dumbbell shaped DGS in the ground plane of a microstrip line is used which provides the bandstop characteristics. Two series gap slot is introduced for achieving the bandpass characteristics in the conducting strip. These slots in conducting strip are also called defected microstrip structure (DMS). This arrangement provides better coupling in the pass band. In this paper no stubs and via are used. The bandwidth of the filter is 500 MHz and insertion loss less than 0.5 dB in passband at 5.4 GHz. The measured insertion loss (S21) is 0.6 dB at the center frequency 5.4 GHz with a bandwidth of 500 MHz which is good in agreement with measured results after the fabrications)","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129652346","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 : 2013-03-28DOI: 10.1109/NCC.2013.6488047
Anurag Singh, Y. N. Singh
We study the rumor spreading dynamics in complex networks, where degree correlations between the pair of nodes exist. An analytical description is provided that includes two vertices, degree-degree correlations in the dynamical evolution of the rumor spreading. In any social network, rumors can spread and may have undesirable effect. To control rumor spread, a certain fraction of nodes are inoculated against rumors. In this paper, the inoculation of nodes are done by random and targeted fashion with the variation of assortative coefficient in scale free networks. The new degree distributions of scale free networks have been calculated for both kind of inoculations. It has been observed that rumor threshold in targeted inoculation scheme is greater than the rumor threshold in the random inoculation scheme. In targeted inoculation scheme, rumor threshold for correlated networks is found to be smaller than in uncorrelated networks. Random inoculation is not that much effective for scale free networks. It is found that degree-degree correlation between nodes doesn't play any role in random inoculations. However, it is not true for targeted inoculation. The proposed hypothesis has also been verified by the simulation results.
{"title":"Rumor dynamics with inoculations for correlated scale free networks","authors":"Anurag Singh, Y. N. Singh","doi":"10.1109/NCC.2013.6488047","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488047","url":null,"abstract":"We study the rumor spreading dynamics in complex networks, where degree correlations between the pair of nodes exist. An analytical description is provided that includes two vertices, degree-degree correlations in the dynamical evolution of the rumor spreading. In any social network, rumors can spread and may have undesirable effect. To control rumor spread, a certain fraction of nodes are inoculated against rumors. In this paper, the inoculation of nodes are done by random and targeted fashion with the variation of assortative coefficient in scale free networks. The new degree distributions of scale free networks have been calculated for both kind of inoculations. It has been observed that rumor threshold in targeted inoculation scheme is greater than the rumor threshold in the random inoculation scheme. In targeted inoculation scheme, rumor threshold for correlated networks is found to be smaller than in uncorrelated networks. Random inoculation is not that much effective for scale free networks. It is found that degree-degree correlation between nodes doesn't play any role in random inoculations. However, it is not true for targeted inoculation. The proposed hypothesis has also been verified by the simulation results.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131956479","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487948
Krishna Chaitanya A, U. Mukherji, V. Sharma
We propose power allocation algorithms for increasing the sum rate of two and three user interference channels. The channels experience fast fading and there is an average power constraint on each transmitter. Our achievable strategies for two and three user interference channels are based on the classification of the interference into very strong, strong and weak interferences. We present numerical results of the power allocation algorithm for two user Gaussian interference channel with Rician fading with mean total power gain of the fade Ω = 3 and Rician factor k = 0.5 and compare the sum rate with that obtained from ergodic interference alignment with water-filling. We show that our power allocation algorithm increases the sum rate with a gain of 1.66dB at average transmit SNR of 5dB. For the three user Gaussian interference channel with Rayleigh fading with distribution CN(0, 0.5), we show that our power allocation algorithm improves the sum rate with a gain of 1.5dB at average transmit SNR of 5dB.
{"title":"Power allocation for interference channels","authors":"Krishna Chaitanya A, U. Mukherji, V. Sharma","doi":"10.1109/NCC.2013.6487948","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487948","url":null,"abstract":"We propose power allocation algorithms for increasing the sum rate of two and three user interference channels. The channels experience fast fading and there is an average power constraint on each transmitter. Our achievable strategies for two and three user interference channels are based on the classification of the interference into very strong, strong and weak interferences. We present numerical results of the power allocation algorithm for two user Gaussian interference channel with Rician fading with mean total power gain of the fade Ω = 3 and Rician factor k = 0.5 and compare the sum rate with that obtained from ergodic interference alignment with water-filling. We show that our power allocation algorithm increases the sum rate with a gain of 1.66dB at average transmit SNR of 5dB. For the three user Gaussian interference channel with Rayleigh fading with distribution CN(0, 0.5), we show that our power allocation algorithm improves the sum rate with a gain of 1.5dB at average transmit SNR of 5dB.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129402273","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487907
D. Dasgupta, Biswajit Sarkar, Manimala Pal, R. Ghatak
This paper presents a new design methodology for microstrip branch-line couplers utilizing asymmetrical π-structures. Design equations of the coupler with sub-optimum performance are analytically derived. The branches of the original hybrid coupler are decomposed in to high and low impedance sections with the low impedance section being reduced to an equivalent π-network. The proposed approach features compact size, planar structure and low-loss. The developed planar branch-line coupler occupies 46.28% of circuit area compared to the conventional structure. Design method is illustrated with a microstrip branch-line coupler operating at 2.44 GHz. The isolation is 40dB at 2.44GHz. The impedance bandwidth of 38.6% is obtained centered about the design frequency.
{"title":"Miniaturized planar branch-line coupler with asymmetrical π-shaped structure","authors":"D. Dasgupta, Biswajit Sarkar, Manimala Pal, R. Ghatak","doi":"10.1109/NCC.2013.6487907","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487907","url":null,"abstract":"This paper presents a new design methodology for microstrip branch-line couplers utilizing asymmetrical π-structures. Design equations of the coupler with sub-optimum performance are analytically derived. The branches of the original hybrid coupler are decomposed in to high and low impedance sections with the low impedance section being reduced to an equivalent π-network. The proposed approach features compact size, planar structure and low-loss. The developed planar branch-line coupler occupies 46.28% of circuit area compared to the conventional structure. Design method is illustrated with a microstrip branch-line coupler operating at 2.44 GHz. The isolation is 40dB at 2.44GHz. The impedance bandwidth of 38.6% is obtained centered about the design frequency.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133775244","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487993
D. S. Pavan Kumar, Raghavendra Bilgi, S. Umesh
An additional feature processing algorithm using Non-negative Matrix Factorization (NMF) is proposed to be included during the conventional extraction of Mel-frequency cepstral coefficients (MFCC) for achieving noise robustness in HMM based speech recognition. The proposed approach reconstructs log-Mel filterbank outputs of speech data from a set of building blocks that form the bases of a speech subspace. The bases are learned using the standard NMF of training data. A variation of learning the bases is proposed, which uses histogram equalized activation coefficients during training, to achieve noise robustness. The proposed methods give up to 5.96% absolute improvement in recognition accuracy on Aurora-2 task over a baseline with standard MFCCs, and up to 13.69% improvement when combined with other feature normalization techniques like Histogram Equalization (HEQ) and Heteroscedastic Linear Discriminant Analysis (HLDA).
{"title":"Non-negative subspace projection during conventional MFCC feature extraction for noise robust speech recognition","authors":"D. S. Pavan Kumar, Raghavendra Bilgi, S. Umesh","doi":"10.1109/NCC.2013.6487993","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487993","url":null,"abstract":"An additional feature processing algorithm using Non-negative Matrix Factorization (NMF) is proposed to be included during the conventional extraction of Mel-frequency cepstral coefficients (MFCC) for achieving noise robustness in HMM based speech recognition. The proposed approach reconstructs log-Mel filterbank outputs of speech data from a set of building blocks that form the bases of a speech subspace. The bases are learned using the standard NMF of training data. A variation of learning the bases is proposed, which uses histogram equalized activation coefficients during training, to achieve noise robustness. The proposed methods give up to 5.96% absolute improvement in recognition accuracy on Aurora-2 task over a baseline with standard MFCCs, and up to 13.69% improvement when combined with other feature normalization techniques like Histogram Equalization (HEQ) and Heteroscedastic Linear Discriminant Analysis (HLDA).","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134176894","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487943
P. Biswas, Abhishek Singh, D. Chadha
In recent years Green technologies are emerging as important research efforts to develop strategies to reduce the energy consumption in the network and also to develop energy efficient architecture for the optical networks. In this work we have considered typical optical backbone network architecture, and have minimized the operational power primarily for provisioning techniques. Typically, operational power depends on strategy operations, and route. Traffic grooming is being considered as a key functionality of WDM networks, in which, multiple low-speed traffic requests are groomed onto a single, high-capacity lightpath. Various approaches viz. direct lightpath, optical by-pass, traffic grooming, dynamic routing; have been discussed and evaluated. The work amply brings out the advantage of using dynamic routing, in conjunction with traffic grooming, in greening the optical backbone.
{"title":"Energy efficient design for Green optical core network","authors":"P. Biswas, Abhishek Singh, D. Chadha","doi":"10.1109/NCC.2013.6487943","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487943","url":null,"abstract":"In recent years Green technologies are emerging as important research efforts to develop strategies to reduce the energy consumption in the network and also to develop energy efficient architecture for the optical networks. In this work we have considered typical optical backbone network architecture, and have minimized the operational power primarily for provisioning techniques. Typically, operational power depends on strategy operations, and route. Traffic grooming is being considered as a key functionality of WDM networks, in which, multiple low-speed traffic requests are groomed onto a single, high-capacity lightpath. Various approaches viz. direct lightpath, optical by-pass, traffic grooming, dynamic routing; have been discussed and evaluated. The work amply brings out the advantage of using dynamic routing, in conjunction with traffic grooming, in greening the optical backbone.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134309184","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 : 2013-03-28DOI: 10.1109/NCC.2013.6488035
Pooja Gupta, Kaushik Kandakatla, S. De, S. Jana
Uninterrupted network operation in field sensing activities such as pollution monitoring is a big challenge, as the pollution sensors could be quite power hungry. One way to keep the network functioning is to recharge the nodes periodically via radio frequency energy transfer, which can be achieved by using a mobile robot that acts as an energy source and a data sink. Given a set of sensors deployed in a geographic area, a mobile robot is required to visit all the sensors in a way so as to avoid a node's energy drainage and its buffer overflow. Before optimum path planning strategies depending on a set of given sensing and physical environmental constraints, a critical task is to investigate the components of energy consumed by a node on different activities. To this end, this work does an extensive study on the energy consumptions with a few chosen pollution sensor examples. Based on the energy consumption and rectification parameters, the required recharging periodicity is derived. This analysis forms the basis of constrained mobility and path planning of the mobile robot.
{"title":"Feasibility analysis on integrated recharging and data collection in pollution sensor networks","authors":"Pooja Gupta, Kaushik Kandakatla, S. De, S. Jana","doi":"10.1109/NCC.2013.6488035","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488035","url":null,"abstract":"Uninterrupted network operation in field sensing activities such as pollution monitoring is a big challenge, as the pollution sensors could be quite power hungry. One way to keep the network functioning is to recharge the nodes periodically via radio frequency energy transfer, which can be achieved by using a mobile robot that acts as an energy source and a data sink. Given a set of sensors deployed in a geographic area, a mobile robot is required to visit all the sensors in a way so as to avoid a node's energy drainage and its buffer overflow. Before optimum path planning strategies depending on a set of given sensing and physical environmental constraints, a critical task is to investigate the components of energy consumed by a node on different activities. To this end, this work does an extensive study on the energy consumptions with a few chosen pollution sensor examples. Based on the energy consumption and rectification parameters, the required recharging periodicity is derived. This analysis forms the basis of constrained mobility and path planning of the mobile robot.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132976408","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 : 2013-03-28DOI: 10.1109/NCC.2013.6488015
Tanima Dutta, A. Sur, Sukumar Nandi
In recent years video watermarking has become an important research issue due to increase in threats of video piracy, content authentication, and ownership integrity. In this paper, we propose a robust watermarking method with the blind extraction process for compressed video streams like H.264/AVC. The method embeds invisible watermark bits into the P-frames. Appropriate block selection and the embedding algorithm restrict the increase in video bit rate. The security of the method lies in selecting candidate blocks using a pseudo random key from set of previously selected blocks. The simulation results show that the proposed method is robust against common image and video watermarking attacks. A robust watermark is generated in order to withstand frame drop and insert attacks, which increases the overall robustness of the proposed method.
{"title":"A robust compressed domain video watermarking in P-frames with controlled bit rate increase","authors":"Tanima Dutta, A. Sur, Sukumar Nandi","doi":"10.1109/NCC.2013.6488015","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488015","url":null,"abstract":"In recent years video watermarking has become an important research issue due to increase in threats of video piracy, content authentication, and ownership integrity. In this paper, we propose a robust watermarking method with the blind extraction process for compressed video streams like H.264/AVC. The method embeds invisible watermark bits into the P-frames. Appropriate block selection and the embedding algorithm restrict the increase in video bit rate. The security of the method lies in selecting candidate blocks using a pseudo random key from set of previously selected blocks. The simulation results show that the proposed method is robust against common image and video watermarking attacks. A robust watermark is generated in order to withstand frame drop and insert attacks, which increases the overall robustness of the proposed method.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121783203","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
扫码关注我们
求助内容：
应助结果提醒方式：