Pub Date : 2009-09-01DOI: 10.1109/YCICT.2009.5382346
S. S. Rizvi, Tae-Sun Chung
Sensor nodes collect data in normal and event-driven situations for monitoring environment and performing in-network computation. Such critical event-driven data deletes later carelessly due to context-less storage mechanisms. This causes data failure for network applications and loses support for reliable in-network computation. Therefore, for wireless sensor networks supporting sense, merge, store and send schemes, an efficient data organization technique is highly required. In this paper, we propose an advanced log structured external NAND flash memory based data management method called Varying Aggressive data Quality Access Reference (VAQAR) for data centric wireless sensor network applications. We focus particularly on critical data to provide long term sustainability and rapid availability for effective in-network computations. Experimental results show VAQAR an ideal memory management system software scheme proposing high performance for vital in-network data organization for wireless sensor network applications.
{"title":"VAQAR: Flash memory based long term in-network vital data sustainability and availability for data centric wireless sensor network applications","authors":"S. S. Rizvi, Tae-Sun Chung","doi":"10.1109/YCICT.2009.5382346","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382346","url":null,"abstract":"Sensor nodes collect data in normal and event-driven situations for monitoring environment and performing in-network computation. Such critical event-driven data deletes later carelessly due to context-less storage mechanisms. This causes data failure for network applications and loses support for reliable in-network computation. Therefore, for wireless sensor networks supporting sense, merge, store and send schemes, an efficient data organization technique is highly required. In this paper, we propose an advanced log structured external NAND flash memory based data management method called Varying Aggressive data Quality Access Reference (VAQAR) for data centric wireless sensor network applications. We focus particularly on critical data to provide long term sustainability and rapid availability for effective in-network computations. Experimental results show VAQAR an ideal memory management system software scheme proposing high performance for vital in-network data organization for wireless sensor network applications.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133974578","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382365
Xinghui Dong, Junyu Dong, Liang Qu
In this paper, we introduce a simple approach for detecting enteromorpha based on statistical learning of image features using support vector machines (SVM). The approach first classifies an enteromorpha image into two classes: enteromorpha and background. Then it extracts features from those two classes and uses them for training the SVM model. Finally, the predicting process is carried out in a pixel by pixel manner using the learned model. The model uses saturation in NTSC color space or filtered images by Gabor filter as the input features while the output class label is treated as 1 or 2 (enteromorpha or background), which is assigned to the location that is being predicted. In fact, this application is only a two-class pattern classification problem. Experimental results show that the method can be effectively applied to detecting enteromorpha in aerial images.
{"title":"Enteromorpha detection in aerial images using support vector machines","authors":"Xinghui Dong, Junyu Dong, Liang Qu","doi":"10.1109/YCICT.2009.5382365","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382365","url":null,"abstract":"In this paper, we introduce a simple approach for detecting enteromorpha based on statistical learning of image features using support vector machines (SVM). The approach first classifies an enteromorpha image into two classes: enteromorpha and background. Then it extracts features from those two classes and uses them for training the SVM model. Finally, the predicting process is carried out in a pixel by pixel manner using the learned model. The model uses saturation in NTSC color space or filtered images by Gabor filter as the input features while the output class label is treated as 1 or 2 (enteromorpha or background), which is assigned to the location that is being predicted. In fact, this application is only a two-class pattern classification problem. Experimental results show that the method can be effectively applied to detecting enteromorpha in aerial images.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207548","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382446
Wang Jing, Luo Feng, Wu Shunjun, Fu Shaofeng
An improved genetic algorithm based on multiple population evolving is presented and applied to the optimization of orthogonal coded signal group for MIMO radar systems. According to the fitness of individuals, the population is divided into three groups and different evolving strategies are applied to every sub-population. The inosculation to all sub-population is actualized. This algorithm can strengthen and preserve the diversity of population. Meanwhile it can enhance the constringency speed and overcome the precocity of GA. Simulation results show that the improved genetic algorithm is effective and the optimized signal can used in MIMO radar.
{"title":"The optimization of orthogonal coded signal group based on multiple population evolving strategies","authors":"Wang Jing, Luo Feng, Wu Shunjun, Fu Shaofeng","doi":"10.1109/YCICT.2009.5382446","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382446","url":null,"abstract":"An improved genetic algorithm based on multiple population evolving is presented and applied to the optimization of orthogonal coded signal group for MIMO radar systems. According to the fitness of individuals, the population is divided into three groups and different evolving strategies are applied to every sub-population. The inosculation to all sub-population is actualized. This algorithm can strengthen and preserve the diversity of population. Meanwhile it can enhance the constringency speed and overcome the precocity of GA. Simulation results show that the improved genetic algorithm is effective and the optimized signal can used in MIMO radar.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115126073","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 augmented forms of the quadrature Kalman filter (QKF) and cubature Kalman filter (CKF) are presented for estimating the nonlinear dynamic systems. The QKF and CKF are modified by forming an augmented state variable, which concatenates the state and noise components together, so that the effect of process and measurement noises can be used to better capture the odd-order moment information. The simulation results demonstrate the improved performance of the augmented form over the nonaugmented form. Besides, the performance and the execution time of the three kinds of nonlinear filters is also compared in the augmented form and nonaugmented form.
{"title":"The augmented form of cubature Kalman filter and quadrature Kalman filter for additive noise","authors":"Pengfei Li, Jianping Yu, Mingjie Wan, Jianjun Huang, Jingxiong Huang","doi":"10.1109/YCICT.2009.5382364","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382364","url":null,"abstract":"In this paper, the augmented forms of the quadrature Kalman filter (QKF) and cubature Kalman filter (CKF) are presented for estimating the nonlinear dynamic systems. The QKF and CKF are modified by forming an augmented state variable, which concatenates the state and noise components together, so that the effect of process and measurement noises can be used to better capture the odd-order moment information. The simulation results demonstrate the improved performance of the augmented form over the nonaugmented form. Besides, the performance and the execution time of the three kinds of nonlinear filters is also compared in the augmented form and nonaugmented form.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117000278","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382325
M. Damrudi, K. J. Aval
In this paper we introduce a new architecture which is called Diamond. This architecture has new techniques for interconnection among processors. We also present a new sorting algorithm on it. This algorithm which we name it NOD (Neighborhood sort On Diamond), sorts n data with 7/4n processors. The aim of issued architecture and algorithm is to reduce the cost of sorting by using a simple architecture and a simple way of sorting. There are architectures and sorting algorithms that are used but we always endeavor to find new and optimal ones. The algorithm on the issued architecture sorts data elements using 7/4n processors with a running time of O(n) . Our architecture is heterogeneous and uses cheaper processors more than expensive ones. Though, this architecture makes a tradeoff between number of processors and their cost.
{"title":"Diamond architecture with NOD sorting","authors":"M. Damrudi, K. J. Aval","doi":"10.1109/YCICT.2009.5382325","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382325","url":null,"abstract":"In this paper we introduce a new architecture which is called Diamond. This architecture has new techniques for interconnection among processors. We also present a new sorting algorithm on it. This algorithm which we name it NOD (Neighborhood sort On Diamond), sorts n data with 7/4n processors. The aim of issued architecture and algorithm is to reduce the cost of sorting by using a simple architecture and a simple way of sorting. There are architectures and sorting algorithms that are used but we always endeavor to find new and optimal ones. The algorithm on the issued architecture sorts data elements using 7/4n processors with a running time of O(n) . Our architecture is heterogeneous and uses cheaper processors more than expensive ones. Though, this architecture makes a tradeoff between number of processors and their cost.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115161957","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382385
Wenjun Xie, G. Wen, Haiyan Jin
The Quad Flat No Lead or QFN package, a near CSP lead frame, is a promising choice for portable wireless applications such as BluetoothTM and RF SoC. Excellent attributes of this advanced package include miniaturized footprint, good electrical performance and excellent thermal characteristics. In this paper, the parasitic parameters of one signal path for a typical 32 I/O (0.5 mm pitch)QFN package structure, were extracted precisely using Ansoft HFSS and ADS of the Agilent company.
Quad Flat No Lead或QFN封装，一个接近CSP的引线框架，是便携式无线应用(如BluetoothTM和RF SoC)的一个有前途的选择。这种先进封装的优异属性包括小型化的占地面积、良好的电气性能和优异的热特性。本文利用安哲伦公司的Ansoft HFSS和ADS精确提取了典型的32 I/O (0.5 mm间距)QFN封装结构的一个信号路径的寄生参数。
{"title":"Extraction of parasitic parameters for QFN32","authors":"Wenjun Xie, G. Wen, Haiyan Jin","doi":"10.1109/YCICT.2009.5382385","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382385","url":null,"abstract":"The Quad Flat No Lead or QFN package, a near CSP lead frame, is a promising choice for portable wireless applications such as BluetoothTM and RF SoC. Excellent attributes of this advanced package include miniaturized footprint, good electrical performance and excellent thermal characteristics. In this paper, the parasitic parameters of one signal path for a typical 32 I/O (0.5 mm pitch)QFN package structure, were extracted precisely using Ansoft HFSS and ADS of the Agilent company.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123668113","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382370
Jing An, Chang Li, Donghong Wang
Due to the flexibility and freedom of the P2P e-commerce environment, peers often make transactions with other unknown peers, the trust evaluation becomes critical. Traditionally the trust evaluation model is based on feedback mechanism, which only depends on transactions number neglecting the amount of transaction, etc. This may lead to the transaction risk in the new transaction. In this paper, a novel trust evaluation model is presented, which reflects recommender's trust value and transaction amounts when computing the trust value of peer. In addition, the model introduces the factor of transaction period while updating peer's trust value, which embodies that the feedback occurred in different period have different influence to peer's trust value. Therefore results of trust evaluation become more accurate, the novel trust evaluation model is effective against malicious behavior.
{"title":"A novel trust evaluation model for peer-to-peer e-commerce","authors":"Jing An, Chang Li, Donghong Wang","doi":"10.1109/YCICT.2009.5382370","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382370","url":null,"abstract":"Due to the flexibility and freedom of the P2P e-commerce environment, peers often make transactions with other unknown peers, the trust evaluation becomes critical. Traditionally the trust evaluation model is based on feedback mechanism, which only depends on transactions number neglecting the amount of transaction, etc. This may lead to the transaction risk in the new transaction. In this paper, a novel trust evaluation model is presented, which reflects recommender's trust value and transaction amounts when computing the trust value of peer. In addition, the model introduces the factor of transaction period while updating peer's trust value, which embodies that the feedback occurred in different period have different influence to peer's trust value. Therefore results of trust evaluation become more accurate, the novel trust evaluation model is effective against malicious behavior.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124740198","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382397
Chang Li, Yafeng Wang, Fei Dong, Dacheng Yang
User cooperation enables single antenna terminals to benefit from spatial diversity by partnering with other users to create a virtual transmit antenna array. A promising form of cooperation is called coded cooperation which integrates cooperation with channel coding, showing great performance gains. In this paper, we examine the performance of coded cooperation scheme in fixed relay system, where channel coding is employed between source and relay. Simulation results are presented and show that it is always providing better performance and a higher throughput compared to decode and forward protocol. In addition to the diversity advantage, coded cooperation is based on incremental redundancy and thus receives coding gain.
{"title":"Performance analysis for coded cooperation protocol in fixed relay system","authors":"Chang Li, Yafeng Wang, Fei Dong, Dacheng Yang","doi":"10.1109/YCICT.2009.5382397","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382397","url":null,"abstract":"User cooperation enables single antenna terminals to benefit from spatial diversity by partnering with other users to create a virtual transmit antenna array. A promising form of cooperation is called coded cooperation which integrates cooperation with channel coding, showing great performance gains. In this paper, we examine the performance of coded cooperation scheme in fixed relay system, where channel coding is employed between source and relay. Simulation results are presented and show that it is always providing better performance and a higher throughput compared to decode and forward protocol. In addition to the diversity advantage, coded cooperation is based on incremental redundancy and thus receives coding gain.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125308010","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382318
Lianjing Cui, Hai Wang, Chao Dong
As an important branch of Media Access Control (MAC) protocol for Mobile Ad Hoc networks (MANETs), slotted MAC protocol with high efficiency is to pursue high throughput as well as reduce the overhead. Based on data-flow-classification method which is very mature in Internet, the paper proposes a novel distributed Flow-Driven MAC protocol (FD-MAC) for MANETs. FD-MAC reserves the slots for the elephant flows which are popular in MANETs to improve their throughput and the piggyback reservation technique is used to decrease the overhead. At the same time the mice flows contend for other unreserved slots. Simulation results show that FD-MAC performs superior to IEEE 802.11 protocol in high load environment where vast elephant flows exist. Using FD-MAC, the throughput for the elephant flows is improved up to 45% comparing to IEEE 802.11 protocol and the overhead of FD-MAC is only 10% of IEEE 802.11 protocol.
{"title":"A novel distributed Flow-Driven TDMA protocol for MANETs","authors":"Lianjing Cui, Hai Wang, Chao Dong","doi":"10.1109/YCICT.2009.5382318","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382318","url":null,"abstract":"As an important branch of Media Access Control (MAC) protocol for Mobile Ad Hoc networks (MANETs), slotted MAC protocol with high efficiency is to pursue high throughput as well as reduce the overhead. Based on data-flow-classification method which is very mature in Internet, the paper proposes a novel distributed Flow-Driven MAC protocol (FD-MAC) for MANETs. FD-MAC reserves the slots for the elephant flows which are popular in MANETs to improve their throughput and the piggyback reservation technique is used to decrease the overhead. At the same time the mice flows contend for other unreserved slots. Simulation results show that FD-MAC performs superior to IEEE 802.11 protocol in high load environment where vast elephant flows exist. Using FD-MAC, the throughput for the elephant flows is improved up to 45% comparing to IEEE 802.11 protocol and the overhead of FD-MAC is only 10% of IEEE 802.11 protocol.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129432126","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382322
Yafei Cao, Dawei Wang, Sikun Li
Network-on-Chip mapping and the configuration of the communication parameters are critical process of the NoC design. They significantly influence the performance, area and power of the NoCs. We take the NoC mapping problem and the design of the communication parameters both into account. First, we formalize the problem of NoC mapping. Then we propose an analytical delay model based on wormhole switching. We heuristic map the application model to NoC topology under the constraints of communication delay and obtain the communication parameters automatically. Experiments show that our approach is more comprehensive than previous work and the time consumed by our approach is up to 30% of the reference work.
{"title":"A heuristic mapping approach for wormhole switching based Network-on-Chip","authors":"Yafei Cao, Dawei Wang, Sikun Li","doi":"10.1109/YCICT.2009.5382322","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382322","url":null,"abstract":"Network-on-Chip mapping and the configuration of the communication parameters are critical process of the NoC design. They significantly influence the performance, area and power of the NoCs. We take the NoC mapping problem and the design of the communication parameters both into account. First, we formalize the problem of NoC mapping. Then we propose an analytical delay model based on wormhole switching. We heuristic map the application model to NoC topology under the constraints of communication delay and obtain the communication parameters automatically. Experiments show that our approach is more comprehensive than previous work and the time consumed by our approach is up to 30% of the reference work.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130378563","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
扫码关注我们
求助内容：
应助结果提醒方式：