Jianqi Liu, Bi Zeng, Xiuwen Yin, B. Zhong, Xiuzhang Zheng
This paper discussed advantage and disadvantage of solution scheme of embedded ship navigation system platform, established a ship navigation embedded terminal platform base on S3C2440 which has high price performance ratio. Introduced bootloader designation, Linux kernel porting and graphic library QTE porting, as well as ship navigation application framework and implemented result based on this platform. With combination of global satellite, position technology, wireless communication technology and embedded system technology, realized embedded platform and confirmed the practicability of platform by navigation application.
{"title":"Designation and Realization of Ship Navigation System Embedded Platform Based on ARM","authors":"Jianqi Liu, Bi Zeng, Xiuwen Yin, B. Zhong, Xiuzhang Zheng","doi":"10.1109/SEC.2008.20","DOIUrl":"https://doi.org/10.1109/SEC.2008.20","url":null,"abstract":"This paper discussed advantage and disadvantage of solution scheme of embedded ship navigation system platform, established a ship navigation embedded terminal platform base on S3C2440 which has high price performance ratio. Introduced bootloader designation, Linux kernel porting and graphic library QTE porting, as well as ship navigation application framework and implemented result based on this platform. With combination of global satellite, position technology, wireless communication technology and embedded system technology, realized embedded platform and confirmed the practicability of platform by navigation application.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124806869","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 pure mobile ad hoc networks, trust based routing protocol is much more efficient at coping with the dynamic topology, open network environments and works well at identifying malicious behaviors. A number of trust routing protocols proposed restrict at standard routing protocols, therefore, lack accuracy in routing selection and rationality at trust evaluation. In this paper, a novel trust routing decision algorithm based on fuzzy dynamic programming theory has been proposed, which, to the best of our knowledge, is the first such solution proposed. Moreover, we have also proposed a model for trust evaluation and trust update that can be used with our trusted routing protocol. The model is different from other schemes in that it tries to analyze the physical requirements and psychology of the malicious attackers. Extensive simulation has been carried out on verifying the performance of our protocol.
{"title":"Fuzzy Dynamic Programming Based Trusted Routing Decision in Mobile Ad Hoc Networks","authors":"Zhiwei Qin, Zhiping Jia, Xihui Chen","doi":"10.1109/SEC.2008.46","DOIUrl":"https://doi.org/10.1109/SEC.2008.46","url":null,"abstract":"In pure mobile ad hoc networks, trust based routing protocol is much more efficient at coping with the dynamic topology, open network environments and works well at identifying malicious behaviors. A number of trust routing protocols proposed restrict at standard routing protocols, therefore, lack accuracy in routing selection and rationality at trust evaluation. In this paper, a novel trust routing decision algorithm based on fuzzy dynamic programming theory has been proposed, which, to the best of our knowledge, is the first such solution proposed. Moreover, we have also proposed a model for trust evaluation and trust update that can be used with our trusted routing protocol. The model is different from other schemes in that it tries to analyze the physical requirements and psychology of the malicious attackers. Extensive simulation has been carried out on verifying the performance of our protocol.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125502641","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}
First we analyze the shortcomings of existing routing protocols in intermittently connected mobile networks (ICMN) such as high delivery delay, low success rate and cannot adaptive to the different network environment. With this in mind, we propose a new routing scheme called adaptive multiple copy multiple hop algorithm (AMM). By collecting the simple information about the status of the network, AMM dynamically adjusts the number of message copies and forwarding conditions in the process of message delivery. Furthermore, AMM takes use of the stability of the network topology during a short period of time in some local area, and establishes group connected domain to help data transmission. The simulation results show that AMM achieves a good performance on delivery delay, and reduces the network load and the energy consumption in guarantee of certain delivery rate.
{"title":"Adaptive Multiple-Copy Multiple-Hop Forwarding in Intermittently Connected Mobile Networks","authors":"J. Niu, Hang Zhou, Linmin Sun, Yongping Xiong","doi":"10.1109/SEC.2008.53","DOIUrl":"https://doi.org/10.1109/SEC.2008.53","url":null,"abstract":"First we analyze the shortcomings of existing routing protocols in intermittently connected mobile networks (ICMN) such as high delivery delay, low success rate and cannot adaptive to the different network environment. With this in mind, we propose a new routing scheme called adaptive multiple copy multiple hop algorithm (AMM). By collecting the simple information about the status of the network, AMM dynamically adjusts the number of message copies and forwarding conditions in the process of message delivery. Furthermore, AMM takes use of the stability of the network topology during a short period of time in some local area, and establishes group connected domain to help data transmission. The simulation results show that AMM achieves a good performance on delivery delay, and reduces the network load and the energy consumption in guarantee of certain delivery rate.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122802783","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}
Transmission security of media data in video conference system has been a challenging task, since those data are high volume and latency sensitive. Partial encryption and other media encryption schemes are effective approaches to encrypt those data. However, a partial disclosure of media data can leak the secret about the conference, moreover when wireless terminals joint in those systems, the limited wireless bandwidth and computational capability will lead to new security challenges. To solve those problems, a novel security scheme for video conference system with wireless terminals is proposed, which integrates three key modules seamlessly: 1) wireless access gateway based on adaptive selective forwarding; 2) dynamic optimal selective control mechanism for securing multi-data stream in the system; 3) a novel lightweight fast media data encryption algorithm. A prototype has been implemented in an actual video conferencing system: Admire. Experimental results show the efficiency of the scheme is suitable for real-time applications.
{"title":"A Novel Security Scheme for Video Conference System with Wireless Terminals","authors":"Chen Xiao, Shilong Ma, Jianwei Niu, Lifeng Wang, Baosong Shan, Tan Chen","doi":"10.1109/SEC.2008.62","DOIUrl":"https://doi.org/10.1109/SEC.2008.62","url":null,"abstract":"Transmission security of media data in video conference system has been a challenging task, since those data are high volume and latency sensitive. Partial encryption and other media encryption schemes are effective approaches to encrypt those data. However, a partial disclosure of media data can leak the secret about the conference, moreover when wireless terminals joint in those systems, the limited wireless bandwidth and computational capability will lead to new security challenges. To solve those problems, a novel security scheme for video conference system with wireless terminals is proposed, which integrates three key modules seamlessly: 1) wireless access gateway based on adaptive selective forwarding; 2) dynamic optimal selective control mechanism for securing multi-data stream in the system; 3) a novel lightweight fast media data encryption algorithm. A prototype has been implemented in an actual video conferencing system: Admire. Experimental results show the efficiency of the scheme is suitable for real-time applications.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133494141","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}
A method of rapid secret sharing scheme based on STAR codes is proposed. Due to the characteristic of array codes such as STAR codes, the computation in secret sharing scheme need only XOR operation on GF(2), which is distinguished with the modulation and other complex operation on GF(q) in the traditional schemes. Thus, it's more rapid and suitable for large capacity secret sharing, and also appropriate for resource constrained environments, such as embedded systems. The process of distribution and reconstruction of the secret key in our scheme is depicted in details, and an example of (5, 8) threshold secret sharing scheme based on (8, 5, 4) STAR code is demonstrated. Our scheme is proved to be perfect and ideal.
{"title":"A Rapid Secret Sharing Scheme for Resource Constrained Environments","authors":"Zheng Chen, Xiaojing Wang, Sheng Cao, Dan Tang","doi":"10.1109/SEC.2008.36","DOIUrl":"https://doi.org/10.1109/SEC.2008.36","url":null,"abstract":"A method of rapid secret sharing scheme based on STAR codes is proposed. Due to the characteristic of array codes such as STAR codes, the computation in secret sharing scheme need only XOR operation on GF(2), which is distinguished with the modulation and other complex operation on GF(q) in the traditional schemes. Thus, it's more rapid and suitable for large capacity secret sharing, and also appropriate for resource constrained environments, such as embedded systems. The process of distribution and reconstruction of the secret key in our scheme is depicted in details, and an example of (5, 8) threshold secret sharing scheme based on (8, 5, 4) STAR code is demonstrated. Our scheme is proved to be perfect and ideal.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"318 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134525498","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}
Large scale loosely coupled PCs can organize a cluster and form desktop computing grids on sharing each processing power; power of PCs, transaction distributions and load balancing characterize the performance of the computing grids. This paper describes performance comparison of load balancing control through code migration in distributed desktop computing grids. A prototype of the middleware which migrates object code for computing was implemented, and the trade-off of code migration was observed. Based on the prototype experiment, several centralized and decentralized algorithms for location policy were examined on simulations, and the methodology to control code migration to have suitable response time in the system is derived. The result will be applied to design the grid computing systems and the peer to peer computing systems to maintain the proper performance.
{"title":"Performance Comparison of Decentralized Workload Control through Code Migration in Distributed Desktop Computing Grids","authors":"M. Yoshida, K. Sakamoto","doi":"10.1109/SEC.2008.38","DOIUrl":"https://doi.org/10.1109/SEC.2008.38","url":null,"abstract":"Large scale loosely coupled PCs can organize a cluster and form desktop computing grids on sharing each processing power; power of PCs, transaction distributions and load balancing characterize the performance of the computing grids. This paper describes performance comparison of load balancing control through code migration in distributed desktop computing grids. A prototype of the middleware which migrates object code for computing was implemented, and the trade-off of code migration was observed. Based on the prototype experiment, several centralized and decentralized algorithms for location policy were examined on simulations, and the methodology to control code migration to have suitable response time in the system is derived. The result will be applied to design the grid computing systems and the peer to peer computing systems to maintain the proper performance.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133784889","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}
Zhenhua Tan, G. Chang, Wei Cheng, Xiaoxing Gao, He Wang, Lili
The routing protocol of structured peer-to-peer overlay networks influences the p2p network performances in route table maintenance, routing hops, and network churning. Current protocols we used usually maintain a O(logN) route table and O(logN) routing hops. To get better routing speed with less scale routing table, using O(1) node finger to get O(N) route path, a new protocol named CSSP was presented. A short routing table was made to record ldquoLrdquo cache nodes, one super node and one successor node. Algorithms for maintaining the route table was presented in this paper. A selection algorithm was presented to select the super node who could cache all of the nodes. And the cache-nodes, super-node and successor-node ensure the high performance of the CSSP. Compared to chord, pastry and etc., the CSSP increases the performance in routing table maintaining, routing hops, fault-tolerance and the amount of churning nodes while some nodes inject and eject the CSSP p2p system. The simulations and analysis shows that the CSSP is an efficient route algorithm, but also some problems waiting for further study.
{"title":"A New Routing Protocol of Structured Peer-to-Peer Overlay Networks","authors":"Zhenhua Tan, G. Chang, Wei Cheng, Xiaoxing Gao, He Wang, Lili","doi":"10.1109/SEC.2008.14","DOIUrl":"https://doi.org/10.1109/SEC.2008.14","url":null,"abstract":"The routing protocol of structured peer-to-peer overlay networks influences the p2p network performances in route table maintenance, routing hops, and network churning. Current protocols we used usually maintain a O(logN) route table and O(logN) routing hops. To get better routing speed with less scale routing table, using O(1) node finger to get O(N) route path, a new protocol named CSSP was presented. A short routing table was made to record ldquoLrdquo cache nodes, one super node and one successor node. Algorithms for maintaining the route table was presented in this paper. A selection algorithm was presented to select the super node who could cache all of the nodes. And the cache-nodes, super-node and successor-node ensure the high performance of the CSSP. Compared to chord, pastry and etc., the CSSP increases the performance in routing table maintaining, routing hops, fault-tolerance and the amount of churning nodes while some nodes inject and eject the CSSP p2p system. The simulations and analysis shows that the CSSP is an efficient route algorithm, but also some problems waiting for further study.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129674181","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 the continual decrease of the feature size, the parasitic inductance and capacitance effect play important role in IC design and verification. Previous works on layout extraction mainly concentrated on how to find out the type of devices and connections between them, few works has addressed the information of centerlines and widths of IC interconnects in a polygon-based VLSI layout, which are required in inductance calculation and other applications. In this paper, an efficient scheme for the centerline-based path recognition from an IC mask layout is presented. Unlike the division-based methods, a tree-traverse-based approach is proposed. This new scheme can be realized as a reverse procedure of the layout generation from wire routing trees. Moreover, this scheme can handle complex all-angle wires. Experimental results show that this scheme has nearly linear computational complexity yet generates precise results.
{"title":"Recognizing Geometric Path from Polygon-Based Integrated Circuit Layout","authors":"Zhaohui Yuan, Shilei Sun, Gaofeng Wang","doi":"10.1109/SEC.2008.22","DOIUrl":"https://doi.org/10.1109/SEC.2008.22","url":null,"abstract":"As the continual decrease of the feature size, the parasitic inductance and capacitance effect play important role in IC design and verification. Previous works on layout extraction mainly concentrated on how to find out the type of devices and connections between them, few works has addressed the information of centerlines and widths of IC interconnects in a polygon-based VLSI layout, which are required in inductance calculation and other applications. In this paper, an efficient scheme for the centerline-based path recognition from an IC mask layout is presented. Unlike the division-based methods, a tree-traverse-based approach is proposed. This new scheme can be realized as a reverse procedure of the layout generation from wire routing trees. Moreover, this scheme can handle complex all-angle wires. Experimental results show that this scheme has nearly linear computational complexity yet generates precise results.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116418098","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}
Personal digital assistant (PDA) is more and more popular due to its powerful functions. To protect the personal information of PDA, we adopt the technology of text-independent speaker verification (SV) for this kind of embedded system. In this paper, Gaussian mixture model (GMM) and universal background model (UBM) are addressed in detail. The optimization of mathematical computation of GMM-UBM guarantees the real-time performance of our SV system.
{"title":"Real-Time Speaker Verification Based on GMM-UBM for PDA","authors":"Yan Chen, Q. Hong, Xiaoyang Chen, Caihong Zhang","doi":"10.1109/SEC.2008.56","DOIUrl":"https://doi.org/10.1109/SEC.2008.56","url":null,"abstract":"Personal digital assistant (PDA) is more and more popular due to its powerful functions. To protect the personal information of PDA, we adopt the technology of text-independent speaker verification (SV) for this kind of embedded system. In this paper, Gaussian mixture model (GMM) and universal background model (UBM) are addressed in detail. The optimization of mathematical computation of GMM-UBM guarantees the real-time performance of our SV system.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122193410","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}
Aiming at a complicated coupling and non-linear brushless DC motor (BLDCM) servo system, the conventional algorithms have many disadvantages, such as less precision, lower speed response. Taking the mechanical characteristics of BLDCM into consideration, an improved particle swarm optimization algorithm is presented in this paper, which is applied in the speed control of the Brushless DC Motor (BLDCM) servo system. Firstly, an improved Particle Swarm Optimization algorithm is introduced. Secondly, the way of finding PID coefficient will be studied by using this algorithm. Finally, the mathematical model of the servo system speed control is built by MATLAB/Simulink.
{"title":"Optimization Research of PSO-PID Algorithm for the Design of Brushless Permanent Magnet Machines","authors":"Yu Ren, Xiaobai Xu","doi":"10.1109/SEC.2008.40","DOIUrl":"https://doi.org/10.1109/SEC.2008.40","url":null,"abstract":"Aiming at a complicated coupling and non-linear brushless DC motor (BLDCM) servo system, the conventional algorithms have many disadvantages, such as less precision, lower speed response. Taking the mechanical characteristics of BLDCM into consideration, an improved particle swarm optimization algorithm is presented in this paper, which is applied in the speed control of the Brushless DC Motor (BLDCM) servo system. Firstly, an improved Particle Swarm Optimization algorithm is introduced. Secondly, the way of finding PID coefficient will be studied by using this algorithm. Finally, the mathematical model of the servo system speed control is built by MATLAB/Simulink.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"81 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131626553","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
扫码关注我们
求助内容：
应助结果提醒方式：