W. Raza, Ilyas Khan, F. Arshad, I. Naqvi, U. Qasim, Z. Khan, N. Javai
Randomly deployed nodes in wireless sensor network (WSN) have limited energy so their energy should be efficiently utilized. Early death of nodes is the major problem in WSN as it causes uneven load distribution. Compared with dynamic clustering schemes, multi hop communication in static clustering improves the stability region. It also provides better coverage and reduces energy hole problem. But, as the life of network proceeds, premature death of data forwarding nodes reduces stability region and prolongs unstable region. To address this we proposed THEEM, a hybrid approach which brings threshold sensitivity with static clustering multi hop routing protocol. Additionally data forwarding nodes are provided with extra energy but it is compensated from other nodes. We included random uniform packet drop model to include the effect of the wireless medium. Results show that our strategy improves stable region and network lifetime and minimizes energy hole problem.
{"title":"THEEM: Threshold-Sensitive Energy Efficient Multi-hop Routing Protocol for WSNs","authors":"W. Raza, Ilyas Khan, F. Arshad, I. Naqvi, U. Qasim, Z. Khan, N. Javai","doi":"10.1109/BWCCA.2014.40","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.40","url":null,"abstract":"Randomly deployed nodes in wireless sensor network (WSN) have limited energy so their energy should be efficiently utilized. Early death of nodes is the major problem in WSN as it causes uneven load distribution. Compared with dynamic clustering schemes, multi hop communication in static clustering improves the stability region. It also provides better coverage and reduces energy hole problem. But, as the life of network proceeds, premature death of data forwarding nodes reduces stability region and prolongs unstable region. To address this we proposed THEEM, a hybrid approach which brings threshold sensitivity with static clustering multi hop routing protocol. Additionally data forwarding nodes are provided with extra energy but it is compensated from other nodes. We included random uniform packet drop model to include the effect of the wireless medium. Results show that our strategy improves stable region and network lifetime and minimizes energy hole problem.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"334 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":"131468565","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}
Remote attestation is an important characteristic of trusted computing technology which provides reliable evidence that a trusted environment actually exists. In this paper, we present a new paradigm that leverages software attack graph for dynamic remote attestation. The major contributions of this paper are two-folds: (1) From the angle of attack, we propose a method to reduce the number of objects to be monitored. (2)We propose a flexible and complete execution status information collection method at operating system level. (3)Software attack graph is introduced as the basis for remote attestation. Analysis shows that our method is complete, efficient and flexible.
{"title":"An Efficient and Flexible Dynamic Remote Attestation Method","authors":"Hongjiao Li, Shan Wang","doi":"10.1109/BWCCA.2014.138","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.138","url":null,"abstract":"Remote attestation is an important characteristic of trusted computing technology which provides reliable evidence that a trusted environment actually exists. In this paper, we present a new paradigm that leverages software attack graph for dynamic remote attestation. The major contributions of this paper are two-folds: (1) From the angle of attack, we propose a method to reduce the number of objects to be monitored. (2)We propose a flexible and complete execution status information collection method at operating system level. (3)Software attack graph is introduced as the basis for remote attestation. Analysis shows that our method is complete, efficient and flexible.","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":"127754329","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, we propose a communication support tool for understanding emotion in an unstable narrowband network. The tool can reflect some emotion with a selected voice to character-based real time communication such as chat. The voice data is transmitted asynchronously and stored in local storage. In order to evaluate the effectiveness of communication to play voice data according to emotion, we implemented Web-based voice contents classified according to some massage types and primitive emotion.
{"title":"Construction of a Communication Support Tool for Understanding Emotion in an Unstable Narrowband Network","authors":"Kaoru Sugita, Kaori Urabe, Ken Nishimura","doi":"10.1109/BWCCA.2014.100","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.100","url":null,"abstract":"In this paper, we propose a communication support tool for understanding emotion in an unstable narrowband network. The tool can reflect some emotion with a selected voice to character-based real time communication such as chat. The voice data is transmitted asynchronously and stored in local storage. In order to evaluate the effectiveness of communication to play voice data according to emotion, we implemented Web-based voice contents classified according to some massage types and primitive emotion.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"4 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":"132653698","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}
Some authenticated data structures (ADS) can reduce authentication cost with using signature aggregation method, such as authenticated skip list, merkle hash tree etc. But these ADS cannot solve the complicated authenticated problems, such as relational query authentication. Pang et al present signature chain scheme aims at various types of relational query but has high cost. Therefore an improved authenticated skip list (I-ASL for short) which is a new authenticated data structure is proposed in this paper. The formal definition of I-ASL and the construction method is presented. Based on the I-ASL, the paper presents the new relational query authentication methods to outsourced database. Moreover, our new relational query authentication methods achieve authentication in relational algebra, which includes select, projection, join, aggregate functions and other query operations. In addition, we analyze the security of our methods and prove that our methods could detect multiple possible adversaries' behaviors, and thus ensure the soundness of various relational query results.
{"title":"An Improved Authenticated Skip List for Relational Query Authentication","authors":"Jian Xu, Ze Cao, Qiong Xiao, Fu-cai Zhou","doi":"10.1109/BWCCA.2014.75","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.75","url":null,"abstract":"Some authenticated data structures (ADS) can reduce authentication cost with using signature aggregation method, such as authenticated skip list, merkle hash tree etc. But these ADS cannot solve the complicated authenticated problems, such as relational query authentication. Pang et al present signature chain scheme aims at various types of relational query but has high cost. Therefore an improved authenticated skip list (I-ASL for short) which is a new authenticated data structure is proposed in this paper. The formal definition of I-ASL and the construction method is presented. Based on the I-ASL, the paper presents the new relational query authentication methods to outsourced database. Moreover, our new relational query authentication methods achieve authentication in relational algebra, which includes select, projection, join, aggregate functions and other query operations. In addition, we analyze the security of our methods and prove that our methods could detect multiple possible adversaries' behaviors, and thus ensure the soundness of various relational query results.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"4 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":"124224566","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}
Having not the apriority knowledge about the DSSS signal in the non-cooperation condition, we proposed a Non-Supervised neural network algorithm to detect and identify the PN sequence. A cognitive learning algorithms for estimation the direct sequence spread spectrum (DSSS) signal pseudo-noise (PN) sequence is presented. The non-supervised learning algorithm is proposed according to the Kohonen rule in SOFM. The blind algorithm can also estimation the PN sequence in low SNR and computer simulation demonstrated that the algorithm is effective. Comparing the traditional algorithm based on slip-correlation, the cognitive algorithm's bit error rate (BER) and complexity is lower.
{"title":"Non-supervised Rule for Direct Sequence Spread Spectrum Signal Sequence Acquisition","authors":"H. Cheng, Zhenghua Luo, Guolin Sun","doi":"10.1109/BWCCA.2014.59","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.59","url":null,"abstract":"Having not the apriority knowledge about the DSSS signal in the non-cooperation condition, we proposed a Non-Supervised neural network algorithm to detect and identify the PN sequence. A cognitive learning algorithms for estimation the direct sequence spread spectrum (DSSS) signal pseudo-noise (PN) sequence is presented. The non-supervised learning algorithm is proposed according to the Kohonen rule in SOFM. The blind algorithm can also estimation the PN sequence in low SNR and computer simulation demonstrated that the algorithm is effective. Comparing the traditional algorithm based on slip-correlation, the cognitive algorithm's bit error rate (BER) and complexity is lower.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"34 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":"132414392","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}
Makoto Ikeda, Taiki Honda, S. Ishikawa, L. Barolli
The Delay/Disruption Tolerant Networking (DTN) aims to provide inter-operable communications with wide range of networks which have poor performance characteristics. In this paper, we propose a message suppression method for Vehicular DTN (VDTN). The simulations for two scenarios are conducted considering obstacles (buildings), where Message Suppression with Road Side Units (MSRs) are present or not present. We consider 802.11p standard and send bundle messages in a realistic scenario of east side of Tokyo station area in Japan imported from open street map. We use the packet delivery ratio, duplicated bundle messages and end-to-end delay as evaluation metrics. We can observe that our proposed method can reduce the duplicated bundle messages, even if the number of vehicles is increased. Moreover, our message suppression method has almost the same packet delivery ratio with the Epidemic conventional method.
{"title":"Performance Comparison of DTN Routing Protocols in Vehicular-DTN Environment","authors":"Makoto Ikeda, Taiki Honda, S. Ishikawa, L. Barolli","doi":"10.1109/BWCCA.2014.71","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.71","url":null,"abstract":"The Delay/Disruption Tolerant Networking (DTN) aims to provide inter-operable communications with wide range of networks which have poor performance characteristics. In this paper, we propose a message suppression method for Vehicular DTN (VDTN). The simulations for two scenarios are conducted considering obstacles (buildings), where Message Suppression with Road Side Units (MSRs) are present or not present. We consider 802.11p standard and send bundle messages in a realistic scenario of east side of Tokyo station area in Japan imported from open street map. We use the packet delivery ratio, duplicated bundle messages and end-to-end delay as evaluation metrics. We can observe that our proposed method can reduce the duplicated bundle messages, even if the number of vehicles is increased. Moreover, our message suppression method has almost the same packet delivery ratio with the Epidemic conventional method.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"37 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":"115903133","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}
How to make software developers focus on building the basic infrastructure and enabling environment and the business users themselves configure the resources to fulfill their certain requirements is critical. To support rapid service coordination system, the method of redesigning and redeploying is needed. Business events are changes of state in enterprises or business correlated cases under the condition that the expected changes fail to appear. In this paper, we propose a rule-based business data processing method with event management in service coordination systems.
{"title":"Rule-Based Business Data Processing in Service Coordination Systems","authors":"Jie Yuan, L. Qiu","doi":"10.1109/BWCCA.2014.82","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.82","url":null,"abstract":"How to make software developers focus on building the basic infrastructure and enabling environment and the business users themselves configure the resources to fulfill their certain requirements is critical. To support rapid service coordination system, the method of redesigning and redeploying is needed. Business events are changes of state in enterprises or business correlated cases under the condition that the expected changes fail to appear. In this paper, we propose a rule-based business data processing method with event management in service coordination systems.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"88 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":"131807030","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 accelerating development of aged tendency of population and rapid growth in the number of the disabled caused by diseases or injuries, the wheelchair with good performance for the aged and disabled is attracting the attention from the society. A wheelchair can provide the user with many benefits, such as maintaining mobility, continuing or broadening community and social activities, conserving strength and energy, and enhancing quality of life. The wheelchair body must be compact enough to go through narrow doorways. The wheelchair must be wide enough to prevent the patient from falling on the floor. A large footprint is therefore desirable for stability and safety, while wheelchairs must conform to dimensional constraints. For this reason, in this paper, we present the design and implementation of an omni directional wheelchair, which has a small size and can move easily in narrow spaces. We present the design of the proposed omni directional wheelchair and discuss some implementation and application issues.
{"title":"Design and Implementation of an Omnidirectional Wheelchair: Control System and Its Applications","authors":"Keita Matsuo, L. Barolli","doi":"10.1109/BWCCA.2014.123","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.123","url":null,"abstract":"With the accelerating development of aged tendency of population and rapid growth in the number of the disabled caused by diseases or injuries, the wheelchair with good performance for the aged and disabled is attracting the attention from the society. A wheelchair can provide the user with many benefits, such as maintaining mobility, continuing or broadening community and social activities, conserving strength and energy, and enhancing quality of life. The wheelchair body must be compact enough to go through narrow doorways. The wheelchair must be wide enough to prevent the patient from falling on the floor. A large footprint is therefore desirable for stability and safety, while wheelchairs must conform to dimensional constraints. For this reason, in this paper, we present the design and implementation of an omni directional wheelchair, which has a small size and can move easily in narrow spaces. We present the design of the proposed omni directional wheelchair and discuss some implementation and application issues.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"163 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":"117141145","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}
This paper proposes an efficient head pose determination method and its application to face recognition on a multi-pose face DB in order to solve the pose variation-related problem. The first step is to detect a facial region using Adaboost. Next, after undergoing preprocessing on the detected face, a mask covers it. At the detected facial region, the pose is determined by relations of the position of centroid points on the eyes and lip regions, which are detected by using the ellipse fitting method. Finally, we select Pose DB and SVM Classification that correspond to the point determined in input facial images. Then, we perform face recognition based on the learning data of the subject present in SVM Classification. It was found that recognition performance has been improved through the comparative experiment of the proposed method and the multi-view face recognition of the template matching algorithm using multi-view low-capacity DB.
{"title":"An Efficient Head Pose Determination and its Application to Face Recognition Using Multi-pose Face DB and SVM","authors":"Jun Lee, Yongho Seo","doi":"10.1109/BWCCA.2014.124","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.124","url":null,"abstract":"This paper proposes an efficient head pose determination method and its application to face recognition on a multi-pose face DB in order to solve the pose variation-related problem. The first step is to detect a facial region using Adaboost. Next, after undergoing preprocessing on the detected face, a mask covers it. At the detected facial region, the pose is determined by relations of the position of centroid points on the eyes and lip regions, which are detected by using the ellipse fitting method. Finally, we select Pose DB and SVM Classification that correspond to the point determined in input facial images. Then, we perform face recognition based on the learning data of the subject present in SVM Classification. It was found that recognition performance has been improved through the comparative experiment of the proposed method and the multi-view face recognition of the template matching algorithm using multi-view low-capacity DB.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"11 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":"121849215","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}
Takaaki Inaba, Shinji Sakamoto, Vladi Koliçi, Gjergji Mino, L. Barolli
Call Admission Control (CAC) is one of the resource management functions, which regulates network access to ensure QoS provisioning. However, the decision for CAC is very challenging issue due to user mobility, limited radio spectrum, and multimedia traffic characteristics. In this paper, we propose a new CAC scheme which considers for acceptance decision except other parameters also the security and priority. We call the proposed system FACS-SP (Fuzzy Admission Control - with Security and Priority). We evaluated by simulations the performance of proposed system and show that the FACS-SP has a good behavior.
{"title":"A CAC Scheme Based on Fuzzy Logic for Cellular Networks Considering Security and Priority Parameters","authors":"Takaaki Inaba, Shinji Sakamoto, Vladi Koliçi, Gjergji Mino, L. Barolli","doi":"10.1109/BWCCA.2014.87","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.87","url":null,"abstract":"Call Admission Control (CAC) is one of the resource management functions, which regulates network access to ensure QoS provisioning. However, the decision for CAC is very challenging issue due to user mobility, limited radio spectrum, and multimedia traffic characteristics. In this paper, we propose a new CAC scheme which considers for acceptance decision except other parameters also the security and priority. We call the proposed system FACS-SP (Fuzzy Admission Control - with Security and Priority). We evaluated by simulations the performance of proposed system and show that the FACS-SP has a good behavior.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"17 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":"122369442","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
扫码关注我们
求助内容：
应助结果提醒方式：