The creation of Ultra-Wideband (UWB) radio platform has allowed the development of high bit-rate Wireless USB. Reed-Solomon (RS) code is employed in order to improve decoding at the receiver offering good reliability performance in the mobile environment. This paper presents shorten RS (23, 17) code solutions for Wireless USB system encoding/decoding needs. The result is tested from simulation in realistic multi-path environments.
{"title":"Shorten Reed-Solomon Code for Wireless USB","authors":"Runfeng Yang, Xiaoning Chen, Jian Zhao","doi":"10.1109/BWCCA.2014.57","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.57","url":null,"abstract":"The creation of Ultra-Wideband (UWB) radio platform has allowed the development of high bit-rate Wireless USB. Reed-Solomon (RS) code is employed in order to improve decoding at the receiver offering good reliability performance in the mobile environment. This paper presents shorten RS (23, 17) code solutions for Wireless USB system encoding/decoding needs. The result is tested from simulation in realistic multi-path environments.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124917665","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}
Xinyue Chang, Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli, F. Xhafa
In this paper, we used our proposed and implemented system based on Hill Climbing algorithm, called WMN-HC for mesh router node placement in WMNs. We evaluate and compare the performance of the proposed system for different movement methods. We took into consideration Exponential and Weibull distributions of mesh clients. We use as evaluation metrics giant component and number of covered mesh clients. We compare the performance of WMN-HC for Exponential and Weibull distribution of mesh clients and different movement methods. The simulation results show that, the performance of the four different movement methods depend on the distribution of mesh client nodes. For Exponential distribution of mesh clients, the WMN-HC achieves good performance for Combination, Radius and Swap movement methods. For Weibull distribution of mesh clients, the WMN-HC has the best solution when the movement method is the Swap. The Random movement method has the worst performance among other movement methods.
{"title":"Node Placement in WMNs for Different Movement Methods: A Hill Climbing System Considering Exponential and Weibull Distributions","authors":"Xinyue Chang, Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli, F. Xhafa","doi":"10.1109/BWCCA.2014.53","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.53","url":null,"abstract":"In this paper, we used our proposed and implemented system based on Hill Climbing algorithm, called WMN-HC for mesh router node placement in WMNs. We evaluate and compare the performance of the proposed system for different movement methods. We took into consideration Exponential and Weibull distributions of mesh clients. We use as evaluation metrics giant component and number of covered mesh clients. We compare the performance of WMN-HC for Exponential and Weibull distribution of mesh clients and different movement methods. The simulation results show that, the performance of the four different movement methods depend on the distribution of mesh client nodes. For Exponential distribution of mesh clients, the WMN-HC achieves good performance for Combination, Radius and Swap movement methods. For Weibull distribution of mesh clients, the WMN-HC has the best solution when the movement method is the Swap. The Random movement method has the worst performance among other movement methods.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116068656","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 cornerstone of the future intelligent transportation system, vehicular ad hoc networks (VANETs) have attracted intensive attention from the academic and industrial research communities in recent years. For widespread deployment of VANETs, security and privacy issues must be addressed properly. In this paper, we introduce the notion of pseudonym-based cryptography, and present a provable secure pseudonym-based cryptosystems with a trusted authority that includes a pseudonym-based multi-receiver encryption scheme, a pseudonym-based signature scheme, and a pseudonym-based key establishment protocol. We then propose a secure and efficient data access scheme for VANETs based on cooperative caching technology and our proposed pseudonym-based cryptosystems. On the one hand, the efficiency of data access are greatly improved by allowing the sharing and coordination of cached data among multiple vehicles. On the other hand, anonymity of the vehicles, data confidentiality, integrity and non-repudiation are guaranteed by employing our proposed pseudonym-based cryptosystems. Simulation results have shown that our proposed pseudonym-based cryptosystems are suitable to the VANETs environment.
{"title":"Pseudonym-Based Cryptography and Its Application in Vehicular Ad Hoc Networks","authors":"Chang-ji Wang, Dong-Yuan Shi, Xi-Lei Xu","doi":"10.1109/BWCCA.2014.72","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.72","url":null,"abstract":"As the cornerstone of the future intelligent transportation system, vehicular ad hoc networks (VANETs) have attracted intensive attention from the academic and industrial research communities in recent years. For widespread deployment of VANETs, security and privacy issues must be addressed properly. In this paper, we introduce the notion of pseudonym-based cryptography, and present a provable secure pseudonym-based cryptosystems with a trusted authority that includes a pseudonym-based multi-receiver encryption scheme, a pseudonym-based signature scheme, and a pseudonym-based key establishment protocol. We then propose a secure and efficient data access scheme for VANETs based on cooperative caching technology and our proposed pseudonym-based cryptosystems. On the one hand, the efficiency of data access are greatly improved by allowing the sharing and coordination of cached data among multiple vehicles. On the other hand, anonymity of the vehicles, data confidentiality, integrity and non-repudiation are guaranteed by employing our proposed pseudonym-based cryptosystems. Simulation results have shown that our proposed pseudonym-based cryptosystems are suitable to the VANETs environment.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"2009 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123917647","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 : 2014-11-08DOI: 10.22667/JISIS.2015.11.31.001
Fang-Yie Leu, Hsin-Liang Chen, Chih-Chung Cheng
In this paper, we propose a time division method to solve the congestion control problem for an event-driven sensor network. In this method, a node adjusts time (therefore bandwidth) assigned to each upstream node by a dynamic TDMA approach to efficiently use resources available to the system and avoid the situation in which a node cannot send event information to the BS on time through the insufficiently allocated bandwidth when it detects multiple events in a short time span. Experimental results show that this method can effectively improve a WSN's throughputs, shorten end-to-end delays and reduce packet loss rates.
{"title":"Improving Multi-path Congestion Control for Event-Driven Wireless Sensor Networks by Using TDMA","authors":"Fang-Yie Leu, Hsin-Liang Chen, Chih-Chung Cheng","doi":"10.22667/JISIS.2015.11.31.001","DOIUrl":"https://doi.org/10.22667/JISIS.2015.11.31.001","url":null,"abstract":"In this paper, we propose a time division method to solve the congestion control problem for an event-driven sensor network. In this method, a node adjusts time (therefore bandwidth) assigned to each upstream node by a dynamic TDMA approach to efficiently use resources available to the system and avoid the situation in which a node cannot send event information to the BS on time through the insufficiently allocated bandwidth when it detects multiple events in a short time span. Experimental results show that this method can effectively improve a WSN's throughputs, shorten end-to-end delays and reduce packet loss rates.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"638 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122949922","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}
Xiaowei Liu, Jin Zhang, Haozhou Wang, Xiaoli Gong, Yuanyuan Cheng
This paper proposes a research framework for graphic digital text Watermarking algorithms and methods. We summarized graphic text watermarking after a brief review of digital text watermarking, and propose the research framework that consists of 8 levels, such as pixel, line, etymon, character, row, paragraph, page, and chapter. According to the embedding methods, each level is divided into three typical characteristics: self-characteristics, similarity and structural feature. At last we proposed an algorithm as case study and discussed further research's possibility.
{"title":"A Novel Text Watermarking Algorithm Based on Graphic Watermarking Framework","authors":"Xiaowei Liu, Jin Zhang, Haozhou Wang, Xiaoli Gong, Yuanyuan Cheng","doi":"10.1109/BWCCA.2014.49","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.49","url":null,"abstract":"This paper proposes a research framework for graphic digital text Watermarking algorithms and methods. We summarized graphic text watermarking after a brief review of digital text watermarking, and propose the research framework that consists of 8 levels, such as pixel, line, etymon, character, row, paragraph, page, and chapter. According to the embedding methods, each level is divided into three typical characteristics: self-characteristics, similarity and structural feature. At last we proposed an algorithm as case study and discussed further research's possibility.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125825362","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}
M. Behzad, N. Javaid, A. Sana, M. Khan, N. Saeed, Z. Khan, U. Qasim
In Wireless Sensor Networks, efficient energy management is of great importance. In this paper, we propose a novel routing protocol, Threshold Sensitive Density Controlled Divide and Rule (TSDDR) to prolong network lifetime and stability period. To achieve these targets, we utilize static clustering with threshold aware transmissions. Simulations are done in MATLAB and the results show that our protocol has 60% longer stability period than LEACH [1] and 36% longer stability period than DDR [2]. We also implemented the Uniform Random Model (URM) to find Packet Drop to make our scheme more practical.
在无线传感器网络中，高效的能量管理非常重要。本文提出了一种新的路由协议——阈值敏感密度控制分治协议(TSDDR)，以延长网络的生存期和稳定周期。为了实现这些目标，我们利用具有阈值感知传输的静态集群。在MATLAB中进行了仿真，结果表明我们的协议比LEACH[1]的稳定周期长60%，比DDR[2]的稳定周期长36%。我们还实现了统一随机模型(Uniform Random Model, URM)来查找丢包，使我们的方案更加实用。
{"title":"TSDDR: Threshold Sensitive Density Controlled Divide and Rule Routing Protocol for Wireless Sensor Networks","authors":"M. Behzad, N. Javaid, A. Sana, M. Khan, N. Saeed, Z. Khan, U. Qasim","doi":"10.1109/BWCCA.2014.48","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.48","url":null,"abstract":"In Wireless Sensor Networks, efficient energy management is of great importance. In this paper, we propose a novel routing protocol, Threshold Sensitive Density Controlled Divide and Rule (TSDDR) to prolong network lifetime and stability period. To achieve these targets, we utilize static clustering with threshold aware transmissions. Simulations are done in MATLAB and the results show that our protocol has 60% longer stability period than LEACH [1] and 36% longer stability period than DDR [2]. We also implemented the Uniform Random Model (URM) to find Packet Drop to make our scheme more practical.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125859932","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}
Measurement of crank-shaped waveguide in two-dimensional square-lattice post array structure composed of aluminum pillars as well as ceramic pillars was done to investigate its fundamental transmission and reflection characteristics. Resonance in the crank by cavity structure composed of aluminum pillars was measured. To improve the resonant characteristics, a pair of rods situated in the cranked part is replaced by ceramic pillars. The result shows the improved cavity has sharper resonant characteristics.
{"title":"Experimental Study on Crank-Shaped Waveguide in 2D Post Array","authors":"Yuting Bao, Huili Chen, Jianming Jin, H. Maeda","doi":"10.1109/BWCCA.2014.91","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.91","url":null,"abstract":"Measurement of crank-shaped waveguide in two-dimensional square-lattice post array structure composed of aluminum pillars as well as ceramic pillars was done to investigate its fundamental transmission and reflection characteristics. Resonance in the crank by cavity structure composed of aluminum pillars was measured. To improve the resonant characteristics, a pair of rods situated in the cranked part is replaced by ceramic pillars. The result shows the improved cavity has sharper resonant characteristics.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133837198","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}
Flocking simulates the motion of a flock, which is well known as artificial life algorithms. By using the flocking, we can express the motion of the group such as fishes, birds, or crowded animals in computer graphics. In order to render flocking more realistically, we have devised a method that adds some dynamic conditions into flocking computation. The additional external force and the moving coordinated cameras within the three dimensional space can help us to apply the flocking algorithm into 3DCG system more extendedly and easily. In this paper we provide our algorithm and approaches.
{"title":"An Alternative Flocking Algorithm with Additional Dynamic Conditions","authors":"Ningping Sun, Y. Tokunaga","doi":"10.1109/BWCCA.2014.106","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.106","url":null,"abstract":"Flocking simulates the motion of a flock, which is well known as artificial life algorithms. By using the flocking, we can express the motion of the group such as fishes, birds, or crowded animals in computer graphics. In order to render flocking more realistically, we have devised a method that adds some dynamic conditions into flocking computation. The additional external force and the moving coordinated cameras within the three dimensional space can help us to apply the flocking algorithm into 3DCG system more extendedly and easily. In this paper we provide our algorithm and approaches.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133862865","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}
With the growing awareness of the fraud case for digital images, the researchers have developed some forensic techniques that based on the intrinsic statistical history or trace left by the JPEG compression to determine an image's manipulation. In this letter, we present an improved counter-forensic scheme that based on parameter adjustment. The simulation shows that by using the proposed strategy and combined with the chaotic theory, the scheme can erase the quantization artifacts perfectly, especially when the compression factor Q = 50, the improved algorithm can achieve a better counter-forensic result than the original method.
{"title":"Erasing the JPEG Compression Artifacts: An Improved Counter-Forensic Algorithm Based on Parameter Adjustment","authors":"Guorui Sheng, Qingtang Su","doi":"10.1109/BWCCA.2014.83","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.83","url":null,"abstract":"With the growing awareness of the fraud case for digital images, the researchers have developed some forensic techniques that based on the intrinsic statistical history or trace left by the JPEG compression to determine an image's manipulation. In this letter, we present an improved counter-forensic scheme that based on parameter adjustment. The simulation shows that by using the proposed strategy and combined with the chaotic theory, the scheme can erase the quantization artifacts perfectly, especially when the compression factor Q = 50, the improved algorithm can achieve a better counter-forensic result than the original method.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130990460","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}
K. Takahagi, Tomoyuki Ishida, Akira Sakuraba, Kaoru Sugita, Noriki Uchida, Y. Shibata
The Great East Japan Earthquake caused catastrophic damage to Iwate Prefecture, Miyagi Prefecture, and Fukushima Prefecture. A lot of relief supplies were sent to these stricken areas from all over the country in case of the Great East Japan Earthquake. However, since the relief supplies accumulation hub got confused by management and sorting work of relief supplies, "the relief supplies shortage and overage problem" arose for every evacuation center. Therefore, in this paper, we propose the "Relief Supplies Support System" for supporting relief supplies management of the disaster countermeasures headquarters at the time of large-scale natural disaster. Distribution of the exact quantity of relief supplies to each evacuation center is realized by this system. Furthermore, visualization of a relief supplies distribution status is realized by utilizing Web-GIS.
{"title":"Proposal of the Relief Supplies Support System at the Time of Large-Scale Natural Disaster","authors":"K. Takahagi, Tomoyuki Ishida, Akira Sakuraba, Kaoru Sugita, Noriki Uchida, Y. Shibata","doi":"10.1109/BWCCA.2014.99","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.99","url":null,"abstract":"The Great East Japan Earthquake caused catastrophic damage to Iwate Prefecture, Miyagi Prefecture, and Fukushima Prefecture. A lot of relief supplies were sent to these stricken areas from all over the country in case of the Great East Japan Earthquake. However, since the relief supplies accumulation hub got confused by management and sorting work of relief supplies, \"the relief supplies shortage and overage problem\" arose for every evacuation center. Therefore, in this paper, we propose the \"Relief Supplies Support System\" for supporting relief supplies management of the disaster countermeasures headquarters at the time of large-scale natural disaster. Distribution of the exact quantity of relief supplies to each evacuation center is realized by this system. Furthermore, visualization of a relief supplies distribution status is realized by utilizing Web-GIS.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122197836","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
扫码关注我们
求助内容：
应助结果提醒方式：