Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716212
Yun Li, M. Xie
An effective algorithm for number and letter character recognition is proposed in this paper. Our algorithm employs template matching, but it unlike traditional template matching method using the original pixel value to match. Our algorithm draws some features from the original image, and then obtains an eigenvector of 192 dimensions. Before drawing features, the image is disposed using math morphologic algorithm. And then measures the Euclidean distance between the sample vector and the template vector. Then we can obtain the result of recognition. A larger number of experiments prove that this algorithm own high performance and robustness. It can recognize characters which have high similarities, for example, 8, B, R, O and Q. This algorithm also tolerates the slightly tilt of the image. The recognition rate of this algorithm is 99.25%.
{"title":"An effective method for number and letter character recognition","authors":"Yun Li, M. Xie","doi":"10.1109/ICCT.2008.4716212","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716212","url":null,"abstract":"An effective algorithm for number and letter character recognition is proposed in this paper. Our algorithm employs template matching, but it unlike traditional template matching method using the original pixel value to match. Our algorithm draws some features from the original image, and then obtains an eigenvector of 192 dimensions. Before drawing features, the image is disposed using math morphologic algorithm. And then measures the Euclidean distance between the sample vector and the template vector. Then we can obtain the result of recognition. A larger number of experiments prove that this algorithm own high performance and robustness. It can recognize characters which have high similarities, for example, 8, B, R, O and Q. This algorithm also tolerates the slightly tilt of the image. The recognition rate of this algorithm is 99.25%.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121414681","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716252
Wang Wei-hong, Lin Yu-bing, Chen Tie-ming
Information security on WSN is an open and hot area. Firstly, this paper briefly introduces the structure of WSN operating system TinyOs, the flow of Nesc program and the elliptic curve cryptography library TinyECC. On the basis of TinyOs platform and TinyECC, this paper designs and implements a lightweight node authentication protocol. Finally, this paper analyzes its test result and proves its feasibility.
{"title":"The study and application of elliptic curve cryptography library on wireless sensor network","authors":"Wang Wei-hong, Lin Yu-bing, Chen Tie-ming","doi":"10.1109/ICCT.2008.4716252","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716252","url":null,"abstract":"Information security on WSN is an open and hot area. Firstly, this paper briefly introduces the structure of WSN operating system TinyOs, the flow of Nesc program and the elliptic curve cryptography library TinyECC. On the basis of TinyOs platform and TinyECC, this paper designs and implements a lightweight node authentication protocol. Finally, this paper analyzes its test result and proves its feasibility.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122609902","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716105
Shou-Chih Lo, Yuan-Yung Hong
In this paper, we propose a novel packet scheduling approach for quality-of-service support in the IEEE 802.16 systems. The proposed approach is a really compromised solution which has good performance on all evaluating aspects of data throughput, packet drop rate, and fairness. We discuss different scheduling strategies for 802.16 systems and propose a new scheduling approach based on both the concepts of weighted fair queuing and earliest deadline first. The simulation results show the superiority of our proposed approach over other ones.
{"title":"A novel QoS scheduling approach for IEEE 802.16 BWA systems","authors":"Shou-Chih Lo, Yuan-Yung Hong","doi":"10.1109/ICCT.2008.4716105","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716105","url":null,"abstract":"In this paper, we propose a novel packet scheduling approach for quality-of-service support in the IEEE 802.16 systems. The proposed approach is a really compromised solution which has good performance on all evaluating aspects of data throughput, packet drop rate, and fairness. We discuss different scheduling strategies for 802.16 systems and propose a new scheduling approach based on both the concepts of weighted fair queuing and earliest deadline first. The simulation results show the superiority of our proposed approach over other ones.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127564200","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716107
Haipeng Yao, Luyong Zhang, Ran Zhou, Zheng Zhou
In practical cognitive radio networks, the topology is constantly changing since the primary and secondary users join and leave the network at any moment. So it is very important to design a distributed spectrum offering scheme that can coordinate the spectrum offering scheme adapt to dynamic topology with only local information. In this paper, we propose a game-based distributed spectrum offering scheme in cognitive radio network with dynamic topology in which multiple primary users with spectrum opportunity compete with each other to offer spectrum access to the secondary users. We obtain the Nash equilibrium of the game and analyze the impacts of the dynamic topology on the Nash equilibrium. In addition, we present a iterative distributed spectrum offering algorithm for the case when the primary users can not observe the current action and utility adopted by others. We theoretically prove that the algorithm can converge to Nash equilibrium within a few iterative steps. The simulation results show that the proposed scheme can achieve better performances.
{"title":"An efficient game-based competitive spectrum offering scheme in cognitive radio networks with dynamic topology","authors":"Haipeng Yao, Luyong Zhang, Ran Zhou, Zheng Zhou","doi":"10.1109/ICCT.2008.4716107","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716107","url":null,"abstract":"In practical cognitive radio networks, the topology is constantly changing since the primary and secondary users join and leave the network at any moment. So it is very important to design a distributed spectrum offering scheme that can coordinate the spectrum offering scheme adapt to dynamic topology with only local information. In this paper, we propose a game-based distributed spectrum offering scheme in cognitive radio network with dynamic topology in which multiple primary users with spectrum opportunity compete with each other to offer spectrum access to the secondary users. We obtain the Nash equilibrium of the game and analyze the impacts of the dynamic topology on the Nash equilibrium. In addition, we present a iterative distributed spectrum offering algorithm for the case when the primary users can not observe the current action and utility adopted by others. We theoretically prove that the algorithm can converge to Nash equilibrium within a few iterative steps. The simulation results show that the proposed scheme can achieve better performances.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130336155","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716155
Xianghua Xu, Wanyong Chen, Jian Wan, Ritai Yu
In wireless sensor networks (WSN), faults occurring to sensor nodes are common due to the sensor device itself and the harsh deployment environment. In order to avoid degradation of service due to faults, it is necessary for the WSN to be able to detect faults early. In this paper we propose a localized fault diagnosis algorithm which executes in tree-like networks effectively. It is based on local comparisons of sensed data and dissemination of the test results to the remaining sensors. Furthermore, Times redundancy is used to diagnose the intermittent fault in sensing and communication. Simulation results show the proposed algorithm has high detection accuracy and low false alarm rate.
{"title":"Distributed fault diagnosis of wireless sensor networks","authors":"Xianghua Xu, Wanyong Chen, Jian Wan, Ritai Yu","doi":"10.1109/ICCT.2008.4716155","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716155","url":null,"abstract":"In wireless sensor networks (WSN), faults occurring to sensor nodes are common due to the sensor device itself and the harsh deployment environment. In order to avoid degradation of service due to faults, it is necessary for the WSN to be able to detect faults early. In this paper we propose a localized fault diagnosis algorithm which executes in tree-like networks effectively. It is based on local comparisons of sensed data and dissemination of the test results to the remaining sensors. Furthermore, Times redundancy is used to diagnose the intermittent fault in sensing and communication. Simulation results show the proposed algorithm has high detection accuracy and low false alarm rate.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115633032","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716183
Junping Li, Jie Ma, Shouyin Liu
In this paper, A Recursive Least Squares (RLS) channel estimator with improved decision-directed algorithm (referred as DDA2-RLS) is proposed based on the superimposed training sequence in orthogonal frequency division multiplexing (OFDM) systems. The DDA2-RLS is exploited to further eliminate the interference driven by the superimposed unknown information data. Then, the theoretical analysis for DDA2-RLS algorithm with superimposed training sequence that uses the constant Pseudo-Noise (PN) sequence is given. It is shown that the proposed DDA2-RLS algorithm can improve the channel estimation performance compared with the original RLS and decision-directed algorithm (DDA) RLS algorithms. Simulations results demonstrate the effectiveness of the proposed DDA2-RLS, and the performance is close to the theoretical analysis compared with original RLS and DDA-RLS algorithms.
{"title":"RLS channel estimation with superimposed training sequence in OFDM systems","authors":"Junping Li, Jie Ma, Shouyin Liu","doi":"10.1109/ICCT.2008.4716183","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716183","url":null,"abstract":"In this paper, A Recursive Least Squares (RLS) channel estimator with improved decision-directed algorithm (referred as DDA2-RLS) is proposed based on the superimposed training sequence in orthogonal frequency division multiplexing (OFDM) systems. The DDA2-RLS is exploited to further eliminate the interference driven by the superimposed unknown information data. Then, the theoretical analysis for DDA2-RLS algorithm with superimposed training sequence that uses the constant Pseudo-Noise (PN) sequence is given. It is shown that the proposed DDA2-RLS algorithm can improve the channel estimation performance compared with the original RLS and decision-directed algorithm (DDA) RLS algorithms. Simulations results demonstrate the effectiveness of the proposed DDA2-RLS, and the performance is close to the theoretical analysis compared with original RLS and DDA-RLS algorithms.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124955406","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716285
Wen-Ku Su, Pei-Yu Shih, Tsung-Ching Lin, T. Truong
In this paper, a new decoding algorithm of the extended binary Golay code is proposed. Based on the proposition developed in this paper, all probable patterns of occurred weight-4 error, which are always decoded to the same weight-3 error pattern, are determined from an iterative invert-one-bit scheme instead of the look-up table of weight-7 codewords. And the most possible one will be obtained by estimating the emblematic probability values of all probable patterns. The simulation result of this decoder in AWGN shows that more than 99% of four errors are corrected if Eb/N0 is greater than 5 dB.
{"title":"Decoding the extended binary Golay code by an iterative invert-one-bit scheme","authors":"Wen-Ku Su, Pei-Yu Shih, Tsung-Ching Lin, T. Truong","doi":"10.1109/ICCT.2008.4716285","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716285","url":null,"abstract":"In this paper, a new decoding algorithm of the extended binary Golay code is proposed. Based on the proposition developed in this paper, all probable patterns of occurred weight-4 error, which are always decoded to the same weight-3 error pattern, are determined from an iterative invert-one-bit scheme instead of the look-up table of weight-7 codewords. And the most possible one will be obtained by estimating the emblematic probability values of all probable patterns. The simulation result of this decoder in AWGN shows that more than 99% of four errors are corrected if Eb/N0 is greater than 5 dB.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121718423","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716166
Chinchen Chang
In most data-hiding schemes, the area of interest in the cover image should be protected from being modified. In this paper, we propose a data-hiding scheme in which the changeable and unchangeable pixels can be specified by the data-hider. To reduce the size of extra information, the location map used to depict the location information of changeable and unchangeable pixels is compressed by Huffman coding. Therefore, only a little additional information, a private key, is needed to depict the changeable pixels in which the Huffman code is embedded. The experimental results show that our proposed scheme can efficiently embed and successfully extract the secret information.
{"title":"Keynote Address V A restricted region-based data-hiding scheme","authors":"Chinchen Chang","doi":"10.1109/ICCT.2008.4716166","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716166","url":null,"abstract":"In most data-hiding schemes, the area of interest in the cover image should be protected from being modified. In this paper, we propose a data-hiding scheme in which the changeable and unchangeable pixels can be specified by the data-hider. To reduce the size of extra information, the location map used to depict the location information of changeable and unchangeable pixels is compressed by Huffman coding. Therefore, only a little additional information, a private key, is needed to depict the changeable pixels in which the Huffman code is embedded. The experimental results show that our proposed scheme can efficiently embed and successfully extract the secret information.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122044663","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716172
R. Qiang, Jiang Tingbiao
Using embedded processor chip ARM9-S3C2410 and DSP-MCX314As motion control chip as the core to build the hardware platform of embedded networked numerical control (NC) system is proposed in this paper. The software structure of embedded networked NC system is founded, including system software and user software. The embedded Linux operating system can deal with multitask well and satisfy the real-time and reliability of motion control. At last, the principle of achieving networked NC system based on embedded Web boa server is introduced. Developing networked NC system with embedded technology is the direction of future development. It has the advantages of full use of resources, the compact system and provides a wealth of features and superior performance with a lower cost.
{"title":"Research on embedded networked numerical control system based on ARM and DSP","authors":"R. Qiang, Jiang Tingbiao","doi":"10.1109/ICCT.2008.4716172","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716172","url":null,"abstract":"Using embedded processor chip ARM9-S3C2410 and DSP-MCX314As motion control chip as the core to build the hardware platform of embedded networked numerical control (NC) system is proposed in this paper. The software structure of embedded networked NC system is founded, including system software and user software. The embedded Linux operating system can deal with multitask well and satisfy the real-time and reliability of motion control. At last, the principle of achieving networked NC system based on embedded Web boa server is introduced. Developing networked NC system with embedded technology is the direction of future development. It has the advantages of full use of resources, the compact system and provides a wealth of features and superior performance with a lower cost.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128667277","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716123
Pouria Zand, Mohsen Shiva
In this paper the model for coloring the edge (channel assignment) and eliminating the secondary interference is introduced. This algorithm is run in the network manager with our routing and scheduling algorithm. One of the constraints in coloring the edge is when we have broadcasting transmission together with the unicast transmission in one time-slot; for this situation several solutions such as changing the coloring algorithm or having a multicast transmission in time, or considering only the unicast transmission which increases the length of frame are proposed. We also have a brief introduction of ISA-SP100 and wireless HART standards.
{"title":"The centralized channel assignment algorithm for multi-channel single -transceiver WMNs with IEEE 802. 15. 4 MAC layer","authors":"Pouria Zand, Mohsen Shiva","doi":"10.1109/ICCT.2008.4716123","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716123","url":null,"abstract":"In this paper the model for coloring the edge (channel assignment) and eliminating the secondary interference is introduced. This algorithm is run in the network manager with our routing and scheduling algorithm. One of the constraints in coloring the edge is when we have broadcasting transmission together with the unicast transmission in one time-slot; for this situation several solutions such as changing the coloring algorithm or having a multicast transmission in time, or considering only the unicast transmission which increases the length of frame are proposed. We also have a brief introduction of ISA-SP100 and wireless HART standards.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121035473","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
扫码关注我们
求助内容：
应助结果提醒方式：