A new two-stage indexless search procedure is presented that makes use of the constrained edit distance in IDS misuse detection attack database search. The procedure consists of a preselection phase, in which the original dataset is reduced and the exhaustive search phase for the database records selected in the first phase. The maximum number of consecutive deletions represents the constraint. Besides eliminating the need for finer exhaustive search in the attack database records in which the detected subsequence is too distorted, the new search procedure also enables better control over the search process in the case of deliberate distortion of the attack strings. Experimental results obtained on the SNORT signature files show that the proposed method offers average search data set reduction in the typical cases of more than 70% compared to the method that uses the unconstrained edit distance.
{"title":"A New Two-Stage Search Procedure for Misuse Detection","authors":"Slobodan V. Petrovic, K. Franke","doi":"10.1109/FGCN.2007.25","DOIUrl":"https://doi.org/10.1109/FGCN.2007.25","url":null,"abstract":"A new two-stage indexless search procedure is presented that makes use of the constrained edit distance in IDS misuse detection attack database search. The procedure consists of a preselection phase, in which the original dataset is reduced and the exhaustive search phase for the database records selected in the first phase. The maximum number of consecutive deletions represents the constraint. Besides eliminating the need for finer exhaustive search in the attack database records in which the detected subsequence is too distorted, the new search procedure also enables better control over the search process in the case of deliberate distortion of the attack strings. Experimental results obtained on the SNORT signature files show that the proposed method offers average search data set reduction in the typical cases of more than 70% compared to the method that uses the unconstrained edit distance.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128079608","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}
XML-documents are used in rapidly increasing numbers by applications for Peer-to-Peer networks. Consequently, there is a growing need for techniques to search these documents with information retrieval methods. Current XML search engines for P2P- networks lack the use of such methods. In this paper, a P2P search engine is proposed that applies an extension of the vector space model and exploits structural information to compute relevance of XML-documents, and thus can significantly improve retrieval performance. We describe how peers can perform a distributed query execution through cooperated retrieval and ranking of dynamic XML documents in a structured P2P-network based on a DHT-algorithm.
{"title":"Peer-to-Peer Cooperation for Content-Oriented XML-Retrieval","authors":"J. Winter, O. Drobnik","doi":"10.1109/FGCN.2007.178","DOIUrl":"https://doi.org/10.1109/FGCN.2007.178","url":null,"abstract":"XML-documents are used in rapidly increasing numbers by applications for Peer-to-Peer networks. Consequently, there is a growing need for techniques to search these documents with information retrieval methods. Current XML search engines for P2P- networks lack the use of such methods. In this paper, a P2P search engine is proposed that applies an extension of the vector space model and exploits structural information to compute relevance of XML-documents, and thus can significantly improve retrieval performance. We describe how peers can perform a distributed query execution through cooperated retrieval and ranking of dynamic XML documents in a structured P2P-network based on a DHT-algorithm.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133039331","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}
In this paper, the time synchronization algorithm for orthogonal frequency division multiplexing (OFDM) system is analyzed. Based on the algorithm using PN sequence, different methods of setting adaptive detection threshold have been proposed before. We analyze the performance of the methods theoretically, and propose a method which is suitable for large dynamic range of SNR. The simulation indicates the method can satisfy the demand of OFDM system in multi-path fading channel.
{"title":"Effect of Adaptive Threshold on Time Synchronization Based on PN Sequences in OFDM System","authors":"Yuan Tian, Xia Lei, Wanbin Tang, Shaoqian Li","doi":"10.1109/FGCN.2007.111","DOIUrl":"https://doi.org/10.1109/FGCN.2007.111","url":null,"abstract":"In this paper, the time synchronization algorithm for orthogonal frequency division multiplexing (OFDM) system is analyzed. Based on the algorithm using PN sequence, different methods of setting adaptive detection threshold have been proposed before. We analyze the performance of the methods theoretically, and propose a method which is suitable for large dynamic range of SNR. The simulation indicates the method can satisfy the demand of OFDM system in multi-path fading channel.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125842285","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}
Yujun Chen, Yuebin Bai, C. Li, Shujuan Liu, D. Qian
With the rapid growth of networks in scalability and complexity, it is increasingly hard to manage network resources to provide QoS-guaranteed services as demanded. In this paper, we propose a policy-based application-aware network QoS management architecture for grid environment. First, application QoS requirements can be caught by grid supporting middleware; they will then be decomposed by domain, translated into technique policies in policy engine, and enforced through real QoS guarantee mechanisms; finally, QoS monitor will collect network runtime information, monitor, report, and, if necessary, modify the policy translation process through a real-time feedback mechanism, so as to achieve adaptability and application-awareness of network QoS management. The author illustrates a case of the aforementioned architecture as well.
{"title":"An Architecture of Policy-Based Application-aware Network QoS Management for Large-scale Heterogeneous Networks","authors":"Yujun Chen, Yuebin Bai, C. Li, Shujuan Liu, D. Qian","doi":"10.1109/FGCN.2007.56","DOIUrl":"https://doi.org/10.1109/FGCN.2007.56","url":null,"abstract":"With the rapid growth of networks in scalability and complexity, it is increasingly hard to manage network resources to provide QoS-guaranteed services as demanded. In this paper, we propose a policy-based application-aware network QoS management architecture for grid environment. First, application QoS requirements can be caught by grid supporting middleware; they will then be decomposed by domain, translated into technique policies in policy engine, and enforced through real QoS guarantee mechanisms; finally, QoS monitor will collect network runtime information, monitor, report, and, if necessary, modify the policy translation process through a real-time feedback mechanism, so as to achieve adaptability and application-awareness of network QoS management. The author illustrates a case of the aforementioned architecture as well.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123452330","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}
As mobile device technologies continue to evolve, they can execute various services which are traditionally executed on more powerful machines. Among these services, a representative example is a navigation service. Enabling such a mobile phone-based navigation service requires a technology of generating a buffered map which includes polygons, polylines and points within a specific distance along a route. This operation is called a buffered search operation which is a key component of navigation services for mobile devices which store no maps for navigation services in advance. Although traditional algorithms work well for other services such as GIS CAD and so on, they do not meet the efficiency requirements of a mobile phone- based navigation service. After revealing the strong performance shortcomings of the previous algorithm, we present a novel inverted index-based algorithm which is enabling mobile phone-based navigation services. The extensive experimental results demonstrate the significant performance improvement over the previous algorithm.
{"title":"An Inverted Index-Based Buffered Search Algorithm for Mobile Navigation Services","authors":"Dongseop Kwon, Wonik Choi, Sangjun Lee","doi":"10.1109/FGCN.2007.65","DOIUrl":"https://doi.org/10.1109/FGCN.2007.65","url":null,"abstract":"As mobile device technologies continue to evolve, they can execute various services which are traditionally executed on more powerful machines. Among these services, a representative example is a navigation service. Enabling such a mobile phone-based navigation service requires a technology of generating a buffered map which includes polygons, polylines and points within a specific distance along a route. This operation is called a buffered search operation which is a key component of navigation services for mobile devices which store no maps for navigation services in advance. Although traditional algorithms work well for other services such as GIS CAD and so on, they do not meet the efficiency requirements of a mobile phone- based navigation service. After revealing the strong performance shortcomings of the previous algorithm, we present a novel inverted index-based algorithm which is enabling mobile phone-based navigation services. The extensive experimental results demonstrate the significant performance improvement over the previous algorithm.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124793824","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}
Smart home wireless mesh networks (SH-WMNs) have emerged to become one of the promising applications of Wireless Sensor Networks (WSNs). In SH-WMNs, connected dominating set (CDS) is one of candidates for clustering formation or virtual backbone construction. During the CDS construction, however, the link that has enough bandwidth to support more end-devices should be selected in order to enhance overall network throughput and reliability. Our LQ-CDS construction scheme can improve the network performance via two metrics: interference metric and bandwidth metric. The simulation results show that LQ-CDS constructs the virtual backbone with the small subset ofDS and the link that has better bandwidth.
{"title":"Link Quality-Based CDS (LQ-CDS) Construction in Smart Home Wireless Mesh Networks","authors":"Junmo Yang, Bonam Kim, I. You","doi":"10.1109/FGCN.2007.161","DOIUrl":"https://doi.org/10.1109/FGCN.2007.161","url":null,"abstract":"Smart home wireless mesh networks (SH-WMNs) have emerged to become one of the promising applications of Wireless Sensor Networks (WSNs). In SH-WMNs, connected dominating set (CDS) is one of candidates for clustering formation or virtual backbone construction. During the CDS construction, however, the link that has enough bandwidth to support more end-devices should be selected in order to enhance overall network throughput and reliability. Our LQ-CDS construction scheme can improve the network performance via two metrics: interference metric and bandwidth metric. The simulation results show that LQ-CDS constructs the virtual backbone with the small subset ofDS and the link that has better bandwidth.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124107055","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}
SRS, which stands for Sound Retrieval System, is a 3D sound reproduction method that processes signals and retrieves their spatial information lost during the recording or playback process by applying head- related transfer functions. The SRS technique, however, has the problem of causing sharp noise, due to the extreme enhancement of the audible frequency band. This paper suggests a new 3D sound reproduction method that can address this problem. In order to prevent the audible frequency band from being over- enhanced, the algorithm suggested in this paper is designed to automatically restrict gain values calculated by the output ratio of the auditory filter designed after the human auditory system. From the results of computer simulations, it is confirmed that the suggested algorithm effectively prevents the audible frequency band from being over-enhanced, which is a problem of the conventional technique. In addition, it is verified in listening tests that the bass is evaluated to be comparatively inferior to the conventional SRS technique, while the clarity of sound was found to be superior.
{"title":"A New 3D Sound Reproduction Method Using an Auditory Filter","authors":"Byoung-Uk Park, Hack-Yoon Kim","doi":"10.1109/FGCN.2007.20","DOIUrl":"https://doi.org/10.1109/FGCN.2007.20","url":null,"abstract":"SRS, which stands for Sound Retrieval System, is a 3D sound reproduction method that processes signals and retrieves their spatial information lost during the recording or playback process by applying head- related transfer functions. The SRS technique, however, has the problem of causing sharp noise, due to the extreme enhancement of the audible frequency band. This paper suggests a new 3D sound reproduction method that can address this problem. In order to prevent the audible frequency band from being over- enhanced, the algorithm suggested in this paper is designed to automatically restrict gain values calculated by the output ratio of the auditory filter designed after the human auditory system. From the results of computer simulations, it is confirmed that the suggested algorithm effectively prevents the audible frequency band from being over-enhanced, which is a problem of the conventional technique. In addition, it is verified in listening tests that the bass is evaluated to be comparatively inferior to the conventional SRS technique, while the clarity of sound was found to be superior.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130376238","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}
H.264 standard achieves higher compression ratio than previous standards with additional complexity as a price to pay in implementation. To apply H.264 in mobile multimedia terminal, implementation and optimization on platform must be studied. This paper introduces some optimization ideas and describes optimization techniques to realize real-time encoder on TMS320DM642 or equivalent chip. Some corresponding experiments have been performed on the un-optimized encoder. The optimized encoder and the results are presented here. The encoding speed is improved almost ten times after the optimization, and can realize the real-time encoding on QCIF sequences.
{"title":"The Optimization of H.264 Encoder Based On TI TMS320DM642","authors":"Chaonan Peng, Hui Wang, Chuanzhen Li, Qin Zhang","doi":"10.1109/FGCN.2007.215","DOIUrl":"https://doi.org/10.1109/FGCN.2007.215","url":null,"abstract":"H.264 standard achieves higher compression ratio than previous standards with additional complexity as a price to pay in implementation. To apply H.264 in mobile multimedia terminal, implementation and optimization on platform must be studied. This paper introduces some optimization ideas and describes optimization techniques to realize real-time encoder on TMS320DM642 or equivalent chip. Some corresponding experiments have been performed on the un-optimized encoder. The optimized encoder and the results are presented here. The encoding speed is improved almost ten times after the optimization, and can realize the real-time encoding on QCIF sequences.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127191588","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-12-06DOI: 10.1080/02533839.2009.9671589
Kai-Chun Huang, Yun-Sheng Yen, H. Chao
Wireless Sensor Networks (WSNs) consists of plenty nodes which are low cost, low power consuming, small volume and short-transmitting. As sensor nodes are deployed in sensing field, they can help people to monitor and aggregate data. Researchers also try to find more efficient ways of utilizing limited energy of sensor node in order to give longer life time of WSNs. Therefore, how to reduce node's energy that is consumed in transmitting data has became a very important issue. From many kinds of paper, multi-hop routing protocol is well known for power saving in data gathering. Recently researches uses such types of the cluster-based (e.g., LEACH), the chain-based (e.g., PEGASIS) and the tree-based (e.g., TREEPSI) to establish their energy-efficient routing protocol. In this paper, we propose tree-clustered data gathering protocol (also called TCDGP) to improve the LEACH and TREEPSI. The novel proposed protocol can preserve both advantages and improve the power consumption further. Finally, simulation results show that our proposal has better performance than before.
{"title":"Tree-Clustered Data Gathering Protocol (TCDGP) for Wireless Sensor Networks","authors":"Kai-Chun Huang, Yun-Sheng Yen, H. Chao","doi":"10.1080/02533839.2009.9671589","DOIUrl":"https://doi.org/10.1080/02533839.2009.9671589","url":null,"abstract":"Wireless Sensor Networks (WSNs) consists of plenty nodes which are low cost, low power consuming, small volume and short-transmitting. As sensor nodes are deployed in sensing field, they can help people to monitor and aggregate data. Researchers also try to find more efficient ways of utilizing limited energy of sensor node in order to give longer life time of WSNs. Therefore, how to reduce node's energy that is consumed in transmitting data has became a very important issue. From many kinds of paper, multi-hop routing protocol is well known for power saving in data gathering. Recently researches uses such types of the cluster-based (e.g., LEACH), the chain-based (e.g., PEGASIS) and the tree-based (e.g., TREEPSI) to establish their energy-efficient routing protocol. In this paper, we propose tree-clustered data gathering protocol (also called TCDGP) to improve the LEACH and TREEPSI. The novel proposed protocol can preserve both advantages and improve the power consumption further. Finally, simulation results show that our proposal has better performance than before.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129622022","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}
The interleave division multiple access (IDMA) relies on the interleavers as the only means to separate users. In this paper, we analyze the multiple access interference (MAI) performance of interleavers and propose a new design method for interleavers with lower complexity and less memory consumption: shifting interleavers. A series of interleavers can be generated by circular shifting a specific pseudo noise (PN) interleaver, which is generated by a PN sequence generator. Thus, the architecture of the proposed interleaver is much simpler than that of other interleaver schemes for IDMA systems. The simulation results show that shifting interleavers can achieve the same performance with much less resource consumption compared to random interleavers in the IDMA systems.
{"title":"The Shifting Interleaver Design Based on PN Sequence for IDMA Systems","authors":"Zhang Chenghai, Huang Jianhao","doi":"10.1109/FGCN.2007.217","DOIUrl":"https://doi.org/10.1109/FGCN.2007.217","url":null,"abstract":"The interleave division multiple access (IDMA) relies on the interleavers as the only means to separate users. In this paper, we analyze the multiple access interference (MAI) performance of interleavers and propose a new design method for interleavers with lower complexity and less memory consumption: shifting interleavers. A series of interleavers can be generated by circular shifting a specific pseudo noise (PN) interleaver, which is generated by a PN sequence generator. Thus, the architecture of the proposed interleaver is much simpler than that of other interleaver schemes for IDMA systems. The simulation results show that shifting interleavers can achieve the same performance with much less resource consumption compared to random interleavers in the IDMA systems.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129740238","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
扫码关注我们
求助内容：
应助结果提醒方式：