Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350702
S. Shobana, S. Priyadharshini, S. Amritha, G. Revadhi, R. Manickavasagam, B. Revathi, V. Vaidehi, S. Vasuhi
Code division multiple access (CDMA) is a digital wireless transmission technology that allows for a large amount of users to share access to a single radio channel. This technology is being widely used in cellular communication and can be extended to store and forward (S&F) payload that provides message relay service for several users with ground terminals, simultaneously. In this paper, the three layered model for the store and forward payload using CDMA medium access control (MAC) is considered. Their design methodologies are discussed assuming static code assignment
{"title":"Design of CDMA MAC for Microsatellite","authors":"S. Shobana, S. Priyadharshini, S. Amritha, G. Revadhi, R. Manickavasagam, B. Revathi, V. Vaidehi, S. Vasuhi","doi":"10.1109/ICSCN.2007.350702","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350702","url":null,"abstract":"Code division multiple access (CDMA) is a digital wireless transmission technology that allows for a large amount of users to share access to a single radio channel. This technology is being widely used in cellular communication and can be extended to store and forward (S&F) payload that provides message relay service for several users with ground terminals, simultaneously. In this paper, the three layered model for the store and forward payload using CDMA medium access control (MAC) is considered. Their design methodologies are discussed assuming static code assignment","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":"134052123","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.350691
B. B. Kiranagi, D. S. Guru
In this paper, the importance of non-symmetric proximity between symbolic data is discussed and a new algorithm for clustering is proposed. The proposed algorithm works directly on the non-symmetric proximity matrices and is based on the leader oriented incremental approach. Experiments on the standard symbolic data sets have been conducted in order to study the efficacy of the proposed methodology
{"title":"An Attractive Leader Approach Based Clustering for Non-Symmetric Proximity","authors":"B. B. Kiranagi, D. S. Guru","doi":"10.1109/ICSCN.2007.350691","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350691","url":null,"abstract":"In this paper, the importance of non-symmetric proximity between symbolic data is discussed and a new algorithm for clustering is proposed. The proposed algorithm works directly on the non-symmetric proximity matrices and is based on the leader oriented incremental approach. Experiments on the standard symbolic data sets have been conducted in order to study the efficacy of the proposed methodology","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"19 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":"134145757","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.350658
S. Veeraraghavan, S. Bose, K. Anand, A. Kannan
This paper describes about an intelligent agent based intrusion detection and prevention system for mobile ad hoc network. This system collects data from application layer and network layer and classifies them using the log file data collected from these layers and local anomalies are computed using local agents finally it is sent to a global agent for integration. The local agents monitor the two layers of the network to determine the correlation among the observed anomalous patterns, reporting such abnormal behavior to the administrator for taking possible action. Our simulation results obtained after integration shows that it is possible to obtain high intrusion-detection rates (99.2%) and low false-alarm rates
{"title":"An Intelligent Agent Based Approach for Intrusion Detection and Prevention in Adhoc Networks","authors":"S. Veeraraghavan, S. Bose, K. Anand, A. Kannan","doi":"10.1109/ICSCN.2007.350658","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350658","url":null,"abstract":"This paper describes about an intelligent agent based intrusion detection and prevention system for mobile ad hoc network. This system collects data from application layer and network layer and classifies them using the log file data collected from these layers and local anomalies are computed using local agents finally it is sent to a global agent for integration. The local agents monitor the two layers of the network to determine the correlation among the observed anomalous patterns, reporting such abnormal behavior to the administrator for taking possible action. Our simulation results obtained after integration shows that it is possible to obtain high intrusion-detection rates (99.2%) and low false-alarm rates","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"38 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":"132232773","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.350670
G. Ananthakrishna, H. G. Ranjani, A. Ramakrishnan
This paper describes a method of automated segmentation of speech assuming the signal is continuously time varying rather than the traditional short time stationary model. It has been shown that this representation gives comparable if not marginally better results than the other techniques for automated segmentation. A formulation of the 'Bach' (music semitonal) frequency scale filter-bank is proposed. A comparative study has been made of the performances using Mel, Bark and Bach scale filter banks considering this model. The preliminary results show up to 80 % matches within 20 ms of the manually segmented data, without any information of the content of the text and without any language dependence. 'Bach' filters are seen to marginally outperform the other filters
{"title":"Comparative Study of Filter-Bank Mean-Energy Distance for Automated Segmentation of Speech Signals","authors":"G. Ananthakrishna, H. G. Ranjani, A. Ramakrishnan","doi":"10.1109/ICSCN.2007.350670","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350670","url":null,"abstract":"This paper describes a method of automated segmentation of speech assuming the signal is continuously time varying rather than the traditional short time stationary model. It has been shown that this representation gives comparable if not marginally better results than the other techniques for automated segmentation. A formulation of the 'Bach' (music semitonal) frequency scale filter-bank is proposed. A comparative study has been made of the performances using Mel, Bark and Bach scale filter banks considering this model. The preliminary results show up to 80 % matches within 20 ms of the manually segmented data, without any information of the content of the text and without any language dependence. 'Bach' filters are seen to marginally outperform the other filters","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"38 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":"129580944","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.350722
S. Chand, H. Om
Channelization is one of the important techniques for sharing a single physical channel among the multiple videos. In channelization the videos are partitioned into segments and the bandwidth of the physical channel is partitioned into logical channels. The first segment of each video is transmitted through the first logical channel, the second segment of each video through the second logical channel, and so forth. The segments are transmitted periodically through the logical channels. In this paper, the video signals to be transmitted through different logical channels are estimated. Furthermore, using the Hilbert transform the phase is estimated by incorporating the jitter delays occurring among the video segments while transmitting through the logical channels. The phase is helpful in estimating the storage space at the user's site so that continuous delivery of the video services can be maintained
{"title":"Phase Estimation in Video Transmission using Hilbert Transform","authors":"S. Chand, H. Om","doi":"10.1109/ICSCN.2007.350722","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350722","url":null,"abstract":"Channelization is one of the important techniques for sharing a single physical channel among the multiple videos. In channelization the videos are partitioned into segments and the bandwidth of the physical channel is partitioned into logical channels. The first segment of each video is transmitted through the first logical channel, the second segment of each video through the second logical channel, and so forth. The segments are transmitted periodically through the logical channels. In this paper, the video signals to be transmitted through different logical channels are estimated. Furthermore, using the Hilbert transform the phase is estimated by incorporating the jitter delays occurring among the video segments while transmitting through the logical channels. The phase is helpful in estimating the storage space at the user's site so that continuous delivery of the video services can be maintained","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"115 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":"131417100","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.350769
V. K, R. A, K. Suriya Kumar, M. Kannan
The major problem posed by very deep sub-micrometer is the inaccuracies which it introduces into the conventional electronic design automation tool estimates. The estimates of power and speed reported by these tools do not consider the effects posed by very deep sub micrometer because of the non-availability of 45 nm cell libraries. Thus, there is an urgent need of a design flow which results in power and speed predictions at very deep sub micrometer considering the various issues in the same. The objective of this research paper is to analyze the prerequisites for electronic design automation tool which provides the front-end engineer the real insight into the physical manifestation of the design in the deep sub-micron. The tool has been partially implemented using PERL, and has yielded results which have been validated at 180 nm after comparison with conventional synthesis engines. The accuracy of results depends solely on the accuracy of the sub 65 nm models employed for gates and interconnects
{"title":"Empowering ASIC Front-End to Meet the Challenges of the Ultra Deep Sub-Micrometer","authors":"V. K, R. A, K. Suriya Kumar, M. Kannan","doi":"10.1109/ICSCN.2007.350769","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350769","url":null,"abstract":"The major problem posed by very deep sub-micrometer is the inaccuracies which it introduces into the conventional electronic design automation tool estimates. The estimates of power and speed reported by these tools do not consider the effects posed by very deep sub micrometer because of the non-availability of 45 nm cell libraries. Thus, there is an urgent need of a design flow which results in power and speed predictions at very deep sub micrometer considering the various issues in the same. The objective of this research paper is to analyze the prerequisites for electronic design automation tool which provides the front-end engineer the real insight into the physical manifestation of the design in the deep sub-micron. The tool has been partially implemented using PERL, and has yielded results which have been validated at 180 nm after comparison with conventional synthesis engines. The accuracy of results depends solely on the accuracy of the sub 65 nm models employed for gates and interconnects","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":"128528681","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.350661
R. Vidhyapriya, P. Vanathi
Applications of sensor networks have become an emerging technology, which can monitor a specific area and collect environmental data around a place. In recent years, low power wireless communication and the availability of cheap and small micro sensor nodes lead to enhanced developments of wireless sensor network applications in real society. The energy constraint inherent in the small battery powered nodes presents a considerable problem, and much effort is being put into reducing the power consumption. We introduce a reactive routing protocol called energy aware routing that is intended to provide a reliable transmission environment with low energy consumption. This protocol efficiently utilizes both the energy available in the node and quality of the link to identify the best possible route to the destination. Simulation results show that the energy aware routing scheme outperforms the existing schemes even in the presence of high node density and overcomes simultaneous packet forwarding
{"title":"Energy Aware Routing for Wireless Sensor Networks","authors":"R. Vidhyapriya, P. Vanathi","doi":"10.1109/ICSCN.2007.350661","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350661","url":null,"abstract":"Applications of sensor networks have become an emerging technology, which can monitor a specific area and collect environmental data around a place. In recent years, low power wireless communication and the availability of cheap and small micro sensor nodes lead to enhanced developments of wireless sensor network applications in real society. The energy constraint inherent in the small battery powered nodes presents a considerable problem, and much effort is being put into reducing the power consumption. We introduce a reactive routing protocol called energy aware routing that is intended to provide a reliable transmission environment with low energy consumption. This protocol efficiently utilizes both the energy available in the node and quality of the link to identify the best possible route to the destination. Simulation results show that the energy aware routing scheme outperforms the existing schemes even in the presence of high node density and overcomes simultaneous packet forwarding","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"40 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":"128964756","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.350651
P. Prakasam, M. Madheswaran
This paper presents an automatic modulation identification (AMI) algorithm using wavelet transform for distinguishing QPSK and GMSK in adaptive demodulator. The developed algorithm has been tested by introducing additive white Gaussian noise (AWGN) in the modulated signal. It has been found that the identification of QPSK and GMSK using histogram peaks simplifies the procedure. The performance of the proposed AMI algorithm has been computed by estimating the bit error rate (BER) and reconstruction efficiency. This shows that the correct modulation identification is possible to a lower bound of 15 dB and 6 dB for GMSK and QPSK respectively
提出了一种基于小波变换的自适应解调器中QPSK和GMSK的自动调制识别算法。通过在调制信号中引入加性高斯白噪声(AWGN)对该算法进行了验证。研究发现，利用直方图峰值识别QPSK和GMSK简化了程序。通过估计误码率和重建效率，计算了AMI算法的性能。这表明GMSK和QPSK的正确调制识别下限分别为15 dB和6 dB
{"title":"Automatic Modulation Identification of QPSK and GMSK using Wavelet Transform for Adaptive Demodulator in SDR","authors":"P. Prakasam, M. Madheswaran","doi":"10.1109/ICSCN.2007.350651","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350651","url":null,"abstract":"This paper presents an automatic modulation identification (AMI) algorithm using wavelet transform for distinguishing QPSK and GMSK in adaptive demodulator. The developed algorithm has been tested by introducing additive white Gaussian noise (AWGN) in the modulated signal. It has been found that the identification of QPSK and GMSK using histogram peaks simplifies the procedure. The performance of the proposed AMI algorithm has been computed by estimating the bit error rate (BER) and reconstruction efficiency. This shows that the correct modulation identification is possible to a lower bound of 15 dB and 6 dB for GMSK and QPSK respectively","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"25 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":"128579567","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.350720
T. C. Sarmal, C. Srinivas
Remote sensing satellites orbit around the Earth around 600-900 kilometers in sun synchronous polar orbit. Each satellite transmits the image data in X-band and the data reception is carried out through a parabolic antenna along with the associated systems. The entire data acquisition system is complex and expensive as it has to meet the requirements of the fast orbiting remote sensing satellites. During the visibility of the satellite, the data is acquired at the acquisition systems, frame synchronized band separated and displayed in the monitor in real-time. The authors of this paper used the concept of archiving the RAW data directly to redundant array of inexpensive disks (RAID) in real-time and also to provide on the fly sub-sampled video image display using generic PC Based Linux Servers available in the industry. Handling of high speed image data from satellite involves de-randomization, decryption and decompression in real time. Innovative multiplexing techniques are used for digital correlation to increase the operating speed. Effective system design strategies rely on appropriate matching of systems hardware, software and environment. This needs the proper evaluation of the system environment. Schedulers for a realtime system are concerned with maximizing resource utilization subject to meeting system timing constraints. Priority-driven presumptive schedulers used in realtime systems require predictable cache performance. The design involved shared memory concepts, cache memory handling, image data handling and transfer to RAID while each system handles the data of around 500 GB per day. The paper deals with a generalized design of such system using a common platform as a part of Indian Remote Sensing Satellite Program and supplied to many users around the world. These systems are working error free all over
{"title":"Design and Implementation of High Bit Rate Satellite Image Data Ingest and Processing System","authors":"T. C. Sarmal, C. Srinivas","doi":"10.1109/ICSCN.2007.350720","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350720","url":null,"abstract":"Remote sensing satellites orbit around the Earth around 600-900 kilometers in sun synchronous polar orbit. Each satellite transmits the image data in X-band and the data reception is carried out through a parabolic antenna along with the associated systems. The entire data acquisition system is complex and expensive as it has to meet the requirements of the fast orbiting remote sensing satellites. During the visibility of the satellite, the data is acquired at the acquisition systems, frame synchronized band separated and displayed in the monitor in real-time. The authors of this paper used the concept of archiving the RAW data directly to redundant array of inexpensive disks (RAID) in real-time and also to provide on the fly sub-sampled video image display using generic PC Based Linux Servers available in the industry. Handling of high speed image data from satellite involves de-randomization, decryption and decompression in real time. Innovative multiplexing techniques are used for digital correlation to increase the operating speed. Effective system design strategies rely on appropriate matching of systems hardware, software and environment. This needs the proper evaluation of the system environment. Schedulers for a realtime system are concerned with maximizing resource utilization subject to meeting system timing constraints. Priority-driven presumptive schedulers used in realtime systems require predictable cache performance. The design involved shared memory concepts, cache memory handling, image data handling and transfer to RAID while each system handles the data of around 500 GB per day. The paper deals with a generalized design of such system using a common platform as a part of Indian Remote Sensing Satellite Program and supplied to many users around the world. These systems are working error free all over","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"61 6 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":"124323477","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.350715
Nagarajanvelmurugan, S. Karthikeyan, P. Dananjayan
Adaptive resource allocation for multimedia quality of service (QoS) support in broadband wireless network is examined in this work. A service model consisting of three classes with different handoff dropping requirements is presented. Appropriate call admission control and resource reservation schemes are developed to allocate resource adaptively to the real time service classes with stringent delay bound. An efficient and effective measurement based dynamic resource allocation scheme is proposed for prioritized services. The non real time application serviced by the best effort model, are supported. The system accommodates adaptive multimedia applications to further reduce the blocking and dropping probabilities of real time application. The simulation results show that the proposed system can satisfy desired QoS of multimedia application under different traffic loads while achieving high channel utilization
{"title":"Resource Allocation Management for Multimedia QoS in Wireless Networks","authors":"Nagarajanvelmurugan, S. Karthikeyan, P. Dananjayan","doi":"10.1109/ICSCN.2007.350715","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350715","url":null,"abstract":"Adaptive resource allocation for multimedia quality of service (QoS) support in broadband wireless network is examined in this work. A service model consisting of three classes with different handoff dropping requirements is presented. Appropriate call admission control and resource reservation schemes are developed to allocate resource adaptively to the real time service classes with stringent delay bound. An efficient and effective measurement based dynamic resource allocation scheme is proposed for prioritized services. The non real time application serviced by the best effort model, are supported. The system accommodates adaptive multimedia applications to further reduce the blocking and dropping probabilities of real time application. The simulation results show that the proposed system can satisfy desired QoS of multimedia application under different traffic loads while achieving high channel utilization","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"60 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":"121075789","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
扫码关注我们
求助内容：
应助结果提醒方式：