发布求助
文献互助 智能选刊 最新文献

2010 International Conference on Broadband, Wireless Computing, Communication and Applications最新文献

筛选
英文 中文
Prototype Design and Analysis of Wireless Vibration Sensor 无线振动传感器的原型设计与分析
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.178
M. Akhondi, A. Talevski, Tsung-Hsien Chou
{"title":"Prototype Design and Analysis of Wireless Vibration Sensor","authors":"M. Akhondi, A. Talevski, Tsung-Hsien Chou","doi":"10.1109/BWCCA.2010.178","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.178","url":null,"abstract":"Since the technology era began, sensor systems have been frequently updated. In order to keep the sensor up to date, components are designed using a modular approach that can be updated with the latest technology. The objective of this paper is to illustrate the design of a vibration sensor that integrates an enhanced Mechanism for Hardware Health Monitoring (MHHM). The design achieves the digitizing, wireless communication and modularity aspects of this system as required. The selection of appropriate components is also presented in the paper as a guide.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117183844","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}
引用次数: 3
Queue Management for the Heavy-Tailed Traffics 重尾流量队列管理
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1504/IJSSC.2012.049992
T. Nakashima
{"title":"Queue Management for the Heavy-Tailed Traffics","authors":"T. Nakashima","doi":"10.1504/IJSSC.2012.049992","DOIUrl":"https://doi.org/10.1504/IJSSC.2012.049992","url":null,"abstract":"The purpose of this research is to design the new queueing algorithm effectively controlling the heavy-tailed traffics based on the comparison between the performance of the passive queue algorithm and that of the active queue algorithm. We adopted the tail-drop algorithm for PQM and the Random Early Detection (RED) for AQM, and conducted the experiments using ns-2 simulator. As the results, we extracted the following features. Firstly, the different $alpha$ of the Pareto distribution made the completely different throughput performance. Secondly, the heavy-tailed traffic could improve the throughput performance for both queueing management systems even if the average of file size of distribution increases. Thirdly, RED could effectively reduce the overall load leading the throughput increase and provided the fairness in terms of the throughput. Finally, if the traffic pattern could be changed to the heavy-tailed distribution, the performance could improve.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125555702","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}
引用次数: 3
Application of a JXTA-Overlay P2P Control System for a Biped Walking Robot JXTA-Overlay P2P控制系统在双足步行机器人中的应用
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.161
Keita Matsuo, Y. Ogata, Evjola Spaho, F. Xhafa, L. Barolli
{"title":"Application of a JXTA-Overlay P2P Control System for a Biped Walking Robot","authors":"Keita Matsuo, Y. Ogata, Evjola Spaho, F. Xhafa, L. Barolli","doi":"10.1109/BWCCA.2010.161","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.161","url":null,"abstract":"The design of an efficient collaborative multi-robot framework that ensures the autonomy and the individual requirements of the involved robots is a very challenging task. This requires designing an efficient platform for inter-robot communication. P2P is a good approach to achieve this goal. P2P aims at making the communication ubiquitous thereby crossing the communication boundary and has many attractive features to use it as a platform for collaborative multi-robot environments. In this work, we presented the JXTA Overlay P2P system and implemented P2P robot control system for biped walking robot. Since JXTA-Overlay is able to overcome Firewalls, Routers and NATs, it is possible to control end-devices in a WAN without changing the network security policy. We used JXTA-Overlay for the control of biped working robot and evaluated the proposed system by many experiments. Experimental results have shown that the proposed system has a good performance and can be used successfully for the control of biped robot.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130521942","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}
引用次数: 5
Detour Routing Protocol for Geographic Sensor Networks 地理传感器网络绕行路由协议
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.122
Lih-Chyau Wuu, Wen-bin Li, W. Kuo
{"title":"Detour Routing Protocol for Geographic Sensor Networks","authors":"Lih-Chyau Wuu, Wen-bin Li, W. Kuo","doi":"10.1109/BWCCA.2010.122","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.122","url":null,"abstract":"Routing in sensor networks is a challenging research topic due to the barriers (holes) on the natural topography often causing routing algorithms to fail. Most geographic routing algorithms in sensor networks apply the greedy forwarding method to discovery a path to the destination without the global states. However, greedy forwarding could fail because the local minima problem. In this paper, we propose a novel algorithm called Detour Routing based on Quadrant Classification (DRQC), to reduce the occurrence of the local minima problem by avoiding sending packages to the nodes which could have the local minima problem. The basic idea of DRQC is based on that each node knows the geographic information of its 2-hop neighbors, and then each node decides its state: red or white. A red node has no local minima problem, but a white node could have local minima problem. DRQC requires that each node chooses one of its 2-hop neighbors, which is red and whose distance to the destination is the shortest one, as the next hop for forwarding a packet. If no such a neighbor exists, then traditional 2-hop Greedy scheme is applied to select the next forwarding node. We implement the DRQC algorithm and compare it with two algorithms: 1-hop greedy and 2-hop greedy. Simulation results show that our algorithm (DRQC) has higher packet delivery rate (96%) than the two algorithms: 1-hop Greedy (79%) and 2-hop Greedy (87%).","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134149330","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}
引用次数: 2
Noise-Resistant Joint Fingerprinting and Decryption Based on Vector Quantization 基于矢量量化的抗噪声联合指纹与解密
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.115
Chih-Yang Lin, Wei-Lun Huang, Tzungher Chen
{"title":"Noise-Resistant Joint Fingerprinting and Decryption Based on Vector Quantization","authors":"Chih-Yang Lin, Wei-Lun Huang, Tzungher Chen","doi":"10.1109/BWCCA.2010.115","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.115","url":null,"abstract":"With the popularity of the Internet and development of multimedia technology, media distribution and traitor tracing issues have become critical and urgent. In this paper, a joint fingerprinting and decryption (JFD) scheme based on vector quantization for protecting media distribution is proposed. Before transmission, the proposed method encrypts plain-images using permutation and codeword substitution on the sender side. The decryption key, which is used to decode image and to present a user’s identity, is stored in advance in the receiver’s device, such as a set-top box or iPod player. When the subscriber receives the encrypted images, these images are jointly decrypted and fingerprinted and are slightly different from original images. The proposed method, to the best of our knowledge, is the first JFD method for VQ compressed images. The experimental results show that the encrypted image possesses unintelligibility and the recovered image has desirable image quality resistant to noise interference.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132155","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}
引用次数: 4
A Mailing List Management System Mashing-Up with Web Services 一个与Web服务混搭的邮件列表管理系统
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.157
Keisuke Fujiwara, Y. Nomura, H. Taniguchi
{"title":"A Mailing List Management System Mashing-Up with Web Services","authors":"Keisuke Fujiwara, Y. Nomura, H. Taniguchi","doi":"10.1109/BWCCA.2010.157","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.157","url":null,"abstract":"Mailing list (ML) was a popular system for discussing specific topics and was an easy tool for making birds of a feather. However, today, such kinds of MLs seem to be shrunk. Instead, we usually use SNS or Wiki systems for these purposes. Do you think ML was dead? No, you would receive many mails every day via several MLs. We think today's MLs are still alive changing their styles from mass service to small-internal service. The small-internal MLs are alive in small sections of offices and labs of universities. These kinds of MLs have different characteristics from traditional mass MLs. However, we don't have any good ML management system conforming with the new style MLs. We have to settle for using old-style popular ML administration systems in spite of the mismatch of use-case. We have developed a new ML management system, which helps the new small-internal MLs. In this paper, we explain that our ML system effectively helps users' group work mashing-up with other intranet or Internet web services.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132928539","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}
引用次数: 1
Wireless Multimedia Sensor Networks Applications and Security Challenges 无线多媒体传感器网络应用与安全挑战
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.182
B. Harjito, Song Han
{"title":"Wireless Multimedia Sensor Networks Applications and Security Challenges","authors":"B. Harjito, Song Han","doi":"10.1109/BWCCA.2010.182","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.182","url":null,"abstract":"The emergence of low-cost and mature technologies in wireless communication, visual sensor devices, and digital signal processing facilitate of wireless multimedia sensor networks (WMSNs). Like sensor networks which respond to sensory information such as humidity and temperature, WMSN interconnects autonomous devices for capturing and processing video and audio sensory information. WMSNs will enable new applications such as multimedia surveillance, traffic enforcement and control systems, advanced health care delivery, structural health monitoring, and industrial process control. Due to WMSNs have some novel features which stem the fact that some of the sensor node will have video cameras and higher computation capabilities. Consequently, the WMSNs bring new security of challenges as well as new opportunities. This paper presents WMSNs application and security challenges.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132380320","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}
引用次数: 35
Adaptive Mixed Bias Resource Allocation for Wireless Mesh Networks 无线Mesh网络自适应混合偏置资源分配
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.144
Jason B. Ernst, Thabo K. R. Nkwe
{"title":"Adaptive Mixed Bias Resource Allocation for Wireless Mesh Networks","authors":"Jason B. Ernst, Thabo K. R. Nkwe","doi":"10.1109/BWCCA.2010.144","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.144","url":null,"abstract":"In wireless networks, conditions may change rapidly and unpredictably. Often wireless networks are not designed to adapt to these changing conditions and perform poorly when they become congested. The multi-hop broadcast nature of wireless mesh networks amplifies the problem of poor wireless performance. Mixed bias scheduling has previously been applied successfully to wireless mesh networks however, it still suffers from similar problems when conditions change rapidly. In this work we propose an adaptive mixed bias (AMB) algorithm which uses a tabu search approach to change based on delay and dropped packets in the network. The proposed scheduling approach consists of three important algorithms, namely, the tabu search algorithm, move generation, and utility function. The adaptive mixed bias approach is compared against IEEE 802.11 and the non-adaptive mixed bias approach. The performance is evaluated using the packet delivery ratio and average end-to-end delay metrics.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114278332","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}
引用次数: 4
Wireless Link Selection by Time Transitional AHP Based on Emergent Policy in Cognitive Wireless Network 认知无线网络中基于突发策略的时间过渡AHP无线链路选择
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.93
Noriki Uchida, Kazuo Takahata, Y. Shibata
{"title":"Wireless Link Selection by Time Transitional AHP Based on Emergent Policy in Cognitive Wireless Network","authors":"Noriki Uchida, Kazuo Takahata, Y. Shibata","doi":"10.1109/BWCCA.2010.93","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.93","url":null,"abstract":"In case of emergent situation like earthquake or taking patient in an ambulance, it is important to send the proper essential information by various situations. In this paper, Time Transitional AHP based on emergent policy in Cognitive Wireless Network is proposed. The proposal system is expected with cognitive wireless network consisted with multi wireless link and route, and the link and route selection is held by extensional AHP calculation with time transition. In the simulation, ns2 are used for the computational results to the effectiveness of the suggested transmission methods in cognitive wireless networks.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"2023 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114283842","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}
引用次数: 2
VoIP Digital Evidence Forensics Standard Operating Procedure (DEFSOP) VoIP数字证据取证标准操作程序(DEFSOP)
2010 International Conference on Broadband, Wireless Computing, Communication and Applications Pub Date : 2010-11-04 DOI: 10.1109/BWCCA.2010.105
I. Lin, Yun-Sheng Yen, Bo-Lin Wu, Hsiang-Yu Wang
{"title":"VoIP Digital Evidence Forensics Standard Operating Procedure (DEFSOP)","authors":"I. Lin, Yun-Sheng Yen, Bo-Lin Wu, Hsiang-Yu Wang","doi":"10.1109/BWCCA.2010.105","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.105","url":null,"abstract":"Research, Development and Evaluation Commission once hold an Internet election of “Top Ten Complaints”, the result showed that the overabundance of phone and Internet fraud was included. This result represents that the phone and Internet fraud trouble people a lot. Thus, this paper will first discuss the analysis of the crime mode of phone and Internet fraud and the collect the security threats of VoIP. Then this paper will analyze the threats one-by-one and comes up with different reacting policies. Furthermore, this paper also to provide the VoIP Digital Evidence Forensics Standard Operating Procedures (DEFSOP) in order to help the police organizations and sets up an experimenting platform which is able to operate phone calls, attacks and forensics to test and verify the research.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127097416","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}
引用次数: 9
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信