Pub Date : 2012-04-03DOI: 10.1109/NCC.2012.6176799
O. Krishna, R. K. Jha, P. Biswas, M. Mushrif
In this paper a dynamic stochastic resonance (DSR)-based watermark extraction technique from audio signal in discrete wavelet transform domain has been presented. The watermark embedding has been done in detail coefficient of DWT transformed audio signal. DSR improves the authenticity of the extraction process by utilizing noise or degradation introduced during different signal processing attacks. DSR is an iterative process that tunes the coefficient of possibly attacked watermarked audio signal so that effect of noise is suppressed and hidden information is enhanced. An adaptive optimization procedure has been adopted for selection of bistable parameters to achieve maximum correlation coefficient under minimum computational complexity. Resilience of this technique has been tested in presence of various signal processing attacks. Using proposed technique robust extraction of watermark is obtained without trading off the audibility of audio signal.
{"title":"Dynamic stochastic resonance-based improved watermark extraction from audio signal","authors":"O. Krishna, R. K. Jha, P. Biswas, M. Mushrif","doi":"10.1109/NCC.2012.6176799","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176799","url":null,"abstract":"In this paper a dynamic stochastic resonance (DSR)-based watermark extraction technique from audio signal in discrete wavelet transform domain has been presented. The watermark embedding has been done in detail coefficient of DWT transformed audio signal. DSR improves the authenticity of the extraction process by utilizing noise or degradation introduced during different signal processing attacks. DSR is an iterative process that tunes the coefficient of possibly attacked watermarked audio signal so that effect of noise is suppressed and hidden information is enhanced. An adaptive optimization procedure has been adopted for selection of bistable parameters to achieve maximum correlation coefficient under minimum computational complexity. Resilience of this technique has been tested in presence of various signal processing attacks. Using proposed technique robust extraction of watermark is obtained without trading off the audibility of audio signal.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132745429","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176788
Gaurav Jyoti Phukan, P. Bora, A. Rajesh, C. Ramesh
The classification of digital modulation schemes plays an important role in communication intelligence (COMINT) and other related applications. The existing algorithms for modulation classification consider a semi-blind scenario, where certain signal parameters are assumed to be known. The pre-processing accuracy of signal parameters like the symbol rate, the center frequency, the carrier phase and the signal amplitude etc. has direct implication on classification. Here we address the case of model mismatch due to the amplitude uncertainty in maximum likelihood (ML) classification and propose a new approach to mitigate the situation. The method is based on the normalization of received signal amplitude using fuzzy clustering algorithm. Simulation results are presented to show the robustness of the algorithm for blind scenario. Concluding remarks are made with the scope for future work.
{"title":"Amplitude normalization in blind modulation classification","authors":"Gaurav Jyoti Phukan, P. Bora, A. Rajesh, C. Ramesh","doi":"10.1109/NCC.2012.6176788","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176788","url":null,"abstract":"The classification of digital modulation schemes plays an important role in communication intelligence (COMINT) and other related applications. The existing algorithms for modulation classification consider a semi-blind scenario, where certain signal parameters are assumed to be known. The pre-processing accuracy of signal parameters like the symbol rate, the center frequency, the carrier phase and the signal amplitude etc. has direct implication on classification. Here we address the case of model mismatch due to the amplitude uncertainty in maximum likelihood (ML) classification and propose a new approach to mitigate the situation. The method is based on the normalization of received signal amplitude using fuzzy clustering algorithm. Simulation results are presented to show the robustness of the algorithm for blind scenario. Concluding remarks are made with the scope for future work.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131379565","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176798
S. Chand, H. Om
The staircase scheme is one of the important broadcasting schemes. It however does not provide the video data to all users on time. This problem has been overcome in the conservative staircase scheme at the cost of bandwidth. The number of segments in the conservative staircase scheme is less and hence the segment size is large, which signifies the user's waiting time. Thus, the conservative staircase scheme has more user's waiting time than the staircase scheme. In this paper, we propose a hybrid scheme of the staircase and conservative staircase schemes that provides the video data to users on time and has better performance than the conservative staircase scheme for the user's waiting time.
{"title":"Timely delivery of video data in staircase scheme","authors":"S. Chand, H. Om","doi":"10.1109/NCC.2012.6176798","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176798","url":null,"abstract":"The staircase scheme is one of the important broadcasting schemes. It however does not provide the video data to all users on time. This problem has been overcome in the conservative staircase scheme at the cost of bandwidth. The number of segments in the conservative staircase scheme is less and hence the segment size is large, which signifies the user's waiting time. Thus, the conservative staircase scheme has more user's waiting time than the staircase scheme. In this paper, we propose a hybrid scheme of the staircase and conservative staircase schemes that provides the video data to users on time and has better performance than the conservative staircase scheme for the user's waiting time.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115688348","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176884
R. Travadi, G. Saha
Segmentation is typically the most computationally expensive step involved in majority of speaker diarization systems. Bayesian Information Criterion (BIC) is a very widely adopted method for segmentation of audio data. While BIC returns fairly good results in terms of segmentation performance, it suffers from the problem of enormous complexity. Moreover, BIC based diarization systems encounter the worst case complexity when there is no change point in the input audio stream at all. Many audio streams contain fairly large segments separated by a very few change points. In such cases, it becomes impractical to employ BIC segmentation because of its complexity. In this paper, we have proposed a modification to the baseline BIC segmentation scheme, which makes use of local search information to reduce the overall complexity of the segmentation procedure. The results have been tested on several audio streams from broadcast news and the diarization runtime has been found to get reduced by a factor of 3.45, with a marginally better segmentation performance.
{"title":"Faster BIC segmentation using local speaker modeling","authors":"R. Travadi, G. Saha","doi":"10.1109/NCC.2012.6176884","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176884","url":null,"abstract":"Segmentation is typically the most computationally expensive step involved in majority of speaker diarization systems. Bayesian Information Criterion (BIC) is a very widely adopted method for segmentation of audio data. While BIC returns fairly good results in terms of segmentation performance, it suffers from the problem of enormous complexity. Moreover, BIC based diarization systems encounter the worst case complexity when there is no change point in the input audio stream at all. Many audio streams contain fairly large segments separated by a very few change points. In such cases, it becomes impractical to employ BIC segmentation because of its complexity. In this paper, we have proposed a modification to the baseline BIC segmentation scheme, which makes use of local search information to reduce the overall complexity of the segmentation procedure. The results have been tested on several audio streams from broadcast news and the diarization runtime has been found to get reduced by a factor of 3.45, with a marginally better segmentation performance.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115590259","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176781
P. Raghu, P. Chaporkar
IEEE 802.16j standard defines the WiMAX Mobile Multihop Relay (MMR) networks. Multihop relays are introduced to improve the network throughput and to extend the coverage area of the network. In MMR networks, the MR-BS (Multihop Relay Base Station) has to associate each User (MS) with an Access Station which can be either one of the RS or MR-BS itself. Intuitively, MR-BS can select an Access Station for MS based on Maximum SINR or Minimum Traffic or Minimum Number of Hops. However, such association schemes will lead to inefficient resource utilization. In this paper, we propose an association scheme that guarantees the required QoS and minimize the resources required to serve an MS. The proposed association scheme exploits the frame scheduling to decide on access station for an MS. By allocating minimum possible resources to a each user without violating the user service requirement, we can accommodate maximum number of users within the current frame. The frame scheduling considered for the analysis is Even-Odd scheduling which is recommended by the standard [1]. The simulation results show that the proposed algorithm will result in efficient resource utilization and have less user drop percentage compared with the other intuitive algorithms of choosing Access Station based on Maximum SINR or Minimum Number of Hops or Minimum Traffic.
{"title":"Optimal user association in WiMAX MMR (802.16j) metworks","authors":"P. Raghu, P. Chaporkar","doi":"10.1109/NCC.2012.6176781","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176781","url":null,"abstract":"IEEE 802.16j standard defines the WiMAX Mobile Multihop Relay (MMR) networks. Multihop relays are introduced to improve the network throughput and to extend the coverage area of the network. In MMR networks, the MR-BS (Multihop Relay Base Station) has to associate each User (MS) with an Access Station which can be either one of the RS or MR-BS itself. Intuitively, MR-BS can select an Access Station for MS based on Maximum SINR or Minimum Traffic or Minimum Number of Hops. However, such association schemes will lead to inefficient resource utilization. In this paper, we propose an association scheme that guarantees the required QoS and minimize the resources required to serve an MS. The proposed association scheme exploits the frame scheduling to decide on access station for an MS. By allocating minimum possible resources to a each user without violating the user service requirement, we can accommodate maximum number of users within the current frame. The frame scheduling considered for the analysis is Even-Odd scheduling which is recommended by the standard [1]. The simulation results show that the proposed algorithm will result in efficient resource utilization and have less user drop percentage compared with the other intuitive algorithms of choosing Access Station based on Maximum SINR or Minimum Number of Hops or Minimum Traffic.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116457977","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176836
N. Sriram, B. S. Adiga, K. Hari
There is a strong relation between sparse signal recovery and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve burst error correction problem using block sparse signal recovery methods. We construct partial Fourier based encoding and decoding matrices using results on difference sets. These constructions offer guaranteed and efficient error correction when used in conjunction with reconstruction algorithms which exploit block sparsity.
{"title":"Burst error correction using partial fourier matrices and block sparse representation","authors":"N. Sriram, B. S. Adiga, K. Hari","doi":"10.1109/NCC.2012.6176836","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176836","url":null,"abstract":"There is a strong relation between sparse signal recovery and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve burst error correction problem using block sparse signal recovery methods. We construct partial Fourier based encoding and decoding matrices using results on difference sets. These constructions offer guaranteed and efficient error correction when used in conjunction with reconstruction algorithms which exploit block sparsity.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116926922","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176756
A. Krishnan, C. L. Selvati, U. Dias, M. Yacoub
This paper presents the results of outdoor field trial measurements in order to obtain the probability density functions and the autocorrelation functions of the fading parameters of the α-μ distribution. The ranges of possible practical values of the α and μ fading parameters are also obtained from the empirical data. In addition, the instantaneous magnitude variations of α and μ considering the mobile receiver displacement are estimated and discussed. The results provide important information about the practical usefulness of the α-μ fading model in mobile communication systems.
{"title":"On the statistics of the fading parameters of the α-μ distribution: Field trials and validation","authors":"A. Krishnan, C. L. Selvati, U. Dias, M. Yacoub","doi":"10.1109/NCC.2012.6176756","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176756","url":null,"abstract":"This paper presents the results of outdoor field trial measurements in order to obtain the probability density functions and the autocorrelation functions of the fading parameters of the α-μ distribution. The ranges of possible practical values of the α and μ fading parameters are also obtained from the empirical data. In addition, the instantaneous magnitude variations of α and μ considering the mobile receiver displacement are estimated and discussed. The results provide important information about the practical usefulness of the α-μ fading model in mobile communication systems.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122748296","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176757
M. Harish, B. Srikanth, R. Bhattacharjee
Some of the vital issues that need to be addressed in wireless sensor network (WSN) based applications are improving the network lifetime without replacing the batteries of node and diminution of energy imbalanced hotspots in the network. Many protocols are proposed for energy efficient cluster based sensor network. In this paper, energy efficient Adaptive number of Frames per Round (AFR) protocol is proposed for a WSN where cluster heads are evenly distributed. The proposed AFR protocol combined with the cooperative Multiple Input Single Output (MISO) technique is extended for dual-hop wireless sensor networks to improve the network lifetime. The selection of the cooperative relay then explored so that the unexpected partition in network is avoided. Different cooperative relay positions have been investigated for decreasing and balancing the energy consumption in the network. Comparison is made for AFR protocol with and without dual-hop cooperative MISO scheme as well as with some other existing protocols.
无线传感器网络(WSN)应用中需要解决的一些关键问题是在不更换节点电池的情况下提高网络的使用寿命和减少网络中的能量不平衡热点。为实现高效节能的集群传感器网络，提出了多种协议。针对簇头均匀分布的无线传感器网络，提出了一种节能的AFR (Adaptive number of Frames per Round)协议。将所提出的AFR协议与多输入单输出(MISO)合作技术相结合，扩展到双跳无线传感器网络中，以提高网络的生存时间。探讨了协作中继的选择，避免了网络中的意外分区。为了降低和平衡网络中的能量消耗，研究了不同的协同中继位置。对采用和不采用双跳合作MISO方案的AFR协议进行了比较，并与现有协议进行了比较。
{"title":"An Energy efficient WSN with cooperative relaying technique","authors":"M. Harish, B. Srikanth, R. Bhattacharjee","doi":"10.1109/NCC.2012.6176757","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176757","url":null,"abstract":"Some of the vital issues that need to be addressed in wireless sensor network (WSN) based applications are improving the network lifetime without replacing the batteries of node and diminution of energy imbalanced hotspots in the network. Many protocols are proposed for energy efficient cluster based sensor network. In this paper, energy efficient Adaptive number of Frames per Round (AFR) protocol is proposed for a WSN where cluster heads are evenly distributed. The proposed AFR protocol combined with the cooperative Multiple Input Single Output (MISO) technique is extended for dual-hop wireless sensor networks to improve the network lifetime. The selection of the cooperative relay then explored so that the unexpected partition in network is avoided. Different cooperative relay positions have been investigated for decreasing and balancing the energy consumption in the network. Comparison is made for AFR protocol with and without dual-hop cooperative MISO scheme as well as with some other existing protocols.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125689761","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176833
H. K. Boyapati, R. Rajakumar, S. Chakrabarti
Recent wireless broadband cellular standards are aimed at making provisions for supporting very high data rate applications in limited available bandwidth. The most sophisticated as well as computationally complex subsystem of a transceiver of any such system is the baseband processing part of the system. A multi-core processor is typically needed to provide the required computational power for implementing the complex baseband processing subsystem such as that of LTE transceiver. The energy consumption in the baseband part of subsystem is a very significant component of the total energy expenditure of a cellular radio system, particularly when system employs MIMO and advanced VLSI state of art. This paper aims at reducing the energy consumption and also quantify the achievable energy savings by applying the recent trends in VLSI such as CMOS technology scaling and usage of new heterogeneous multi-core architectures specific to signal processing. To be able to explore and apply these energy efficient techniques, we have first estimated the energy consumption in LTE baseband functions then we have explored possible energy savings obtained from technology scaling and optimum heterogeneous combination of architectures for mapping baseband algorithms.
{"title":"Quantifying the improvement in energy savings for LTE eNodeB baseband subsystem with technology scaling and multi-core architectures","authors":"H. K. Boyapati, R. Rajakumar, S. Chakrabarti","doi":"10.1109/NCC.2012.6176833","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176833","url":null,"abstract":"Recent wireless broadband cellular standards are aimed at making provisions for supporting very high data rate applications in limited available bandwidth. The most sophisticated as well as computationally complex subsystem of a transceiver of any such system is the baseband processing part of the system. A multi-core processor is typically needed to provide the required computational power for implementing the complex baseband processing subsystem such as that of LTE transceiver. The energy consumption in the baseband part of subsystem is a very significant component of the total energy expenditure of a cellular radio system, particularly when system employs MIMO and advanced VLSI state of art. This paper aims at reducing the energy consumption and also quantify the achievable energy savings by applying the recent trends in VLSI such as CMOS technology scaling and usage of new heterogeneous multi-core architectures specific to signal processing. To be able to explore and apply these energy efficient techniques, we have first estimated the energy consumption in LTE baseband functions then we have explored possible energy savings obtained from technology scaling and optimum heterogeneous combination of architectures for mapping baseband algorithms.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124604126","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176753
A. Bhadriraju, S. Bhaumik, Y. Lohith, M. Brinda, A. Svr, M. Hegde
6PANview[1] is a Wireless Sensor Network(WSN) monitoring system for 6LoWPAN/RPL networks which we developed as an overlay network for a WSN application. A monitoring system, while performing its operations for maintaining the health of the monitored network, must also be conscious of its impact on the application performance, and must strive to minimize this impact. To this end, we propose a centralized scheduling algorithm within 6PANview which non-intrusively analyzes application traffic arrival patterns at the base station, identifies network idle periods and schedules monitoring activities. The proposed algorithm finds those periodic sequences which are likely to have given rise to the pattern of arrivals seen at the base station. Parts of those sequences are then extended to coarsely predict future traffic and find epochs where low traffic is predicted, in order to schedule monitoring traffic or other activities at these times. We present simulation results for the proposed prediction and scheduling algorithm and its implementation as part of 6PANview. As an enhancement, we briefly talk about using 6PANview's overlay network architecture for distributed scheduling.
{"title":"6PANview: Application performance conscious network monitoring for 6LoWPAN based WSNs","authors":"A. Bhadriraju, S. Bhaumik, Y. Lohith, M. Brinda, A. Svr, M. Hegde","doi":"10.1109/NCC.2012.6176753","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176753","url":null,"abstract":"6PANview[1] is a Wireless Sensor Network(WSN) monitoring system for 6LoWPAN/RPL networks which we developed as an overlay network for a WSN application. A monitoring system, while performing its operations for maintaining the health of the monitored network, must also be conscious of its impact on the application performance, and must strive to minimize this impact. To this end, we propose a centralized scheduling algorithm within 6PANview which non-intrusively analyzes application traffic arrival patterns at the base station, identifies network idle periods and schedules monitoring activities. The proposed algorithm finds those periodic sequences which are likely to have given rise to the pattern of arrivals seen at the base station. Parts of those sequences are then extended to coarsely predict future traffic and find epochs where low traffic is predicted, in order to schedule monitoring traffic or other activities at these times. We present simulation results for the proposed prediction and scheduling algorithm and its implementation as part of 6PANview. As an enhancement, we briefly talk about using 6PANview's overlay network architecture for distributed scheduling.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129200292","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
扫码关注我们
求助内容：
应助结果提醒方式：