M. M. Sandhu, M. Akbar, M. Behzad, N. Javaid, Z. Khan, U. Qasim
Energy efficient routing is important for increasing the lifetime of Wireless Body Area Networks (WBANs). Uniform load distribution is necessary for reliable and long term monitoring of patients in WBANs. In this paper, we propose Reliable Energy Efficient Critical data routing in WBANs (REEC). We deploy eight nodes and a sink on the human body. Two forwarder nodes are used which reduce the communication distance between nodes and the sink. The nodes send only critical data to the forwarder nodes. In order to distribute the load uniformly, forwarder nodes are selected/rotated in each round. Simulation results show that the proposed protocol achieves increased network lifetime and throughput. Therefore, REEC is useful for reliable health monitoring in WBANs.
{"title":"REEC: Reliable Energy Efficient Critical Data Routing in Wireless Body Area Networks","authors":"M. M. Sandhu, M. Akbar, M. Behzad, N. Javaid, Z. Khan, U. Qasim","doi":"10.1109/BWCCA.2014.101","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.101","url":null,"abstract":"Energy efficient routing is important for increasing the lifetime of Wireless Body Area Networks (WBANs). Uniform load distribution is necessary for reliable and long term monitoring of patients in WBANs. In this paper, we propose Reliable Energy Efficient Critical data routing in WBANs (REEC). We deploy eight nodes and a sink on the human body. Two forwarder nodes are used which reduce the communication distance between nodes and the sink. The nodes send only critical data to the forwarder nodes. In order to distribute the load uniformly, forwarder nodes are selected/rotated in each round. Simulation results show that the proposed protocol achieves increased network lifetime and throughput. Therefore, REEC is useful for reliable health monitoring in WBANs.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"13 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":"124273316","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}
Energy harvesting is the process of collecting small amounts of energies and converts them into electric power. Since power consumption of digital device has decreased, the energy harvesting is a good approach. The Fukuoka Institute of Technology is located near two AM radio broadcasting stations. Thus, a considerable electric power can be obtained by the electromagnetic waves radiated from these two stations. In this paper, we implement a rectifying antenna (rectenna) that coverts the electromagnetic waves into DC electric power. This rectenna is located at the place approximately 50 meters away from one of the AM radio broadcasting stations and provides a maximum power of 2.39 [mW]. Regarding this rectenna as a DC voltage source, the internal resistance and the electromotive force are 510 [kΩ] and 71.4 [V], respectively.
{"title":"Experimental Results on Energy Harvesting by Using AM Radio Broadcasting","authors":"Shingo Otsuka, N. Nakashima","doi":"10.1109/BWCCA.2014.88","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.88","url":null,"abstract":"Energy harvesting is the process of collecting small amounts of energies and converts them into electric power. Since power consumption of digital device has decreased, the energy harvesting is a good approach. The Fukuoka Institute of Technology is located near two AM radio broadcasting stations. Thus, a considerable electric power can be obtained by the electromagnetic waves radiated from these two stations. In this paper, we implement a rectifying antenna (rectenna) that coverts the electromagnetic waves into DC electric power. This rectenna is located at the place approximately 50 meters away from one of the AM radio broadcasting stations and provides a maximum power of 2.39 [mW]. Regarding this rectenna as a DC voltage source, the internal resistance and the electromotive force are 510 [kΩ] and 71.4 [V], respectively.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"57 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":"115810329","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}
Attribute-based signature (ABS), which enables users sign messages with any predicate of their attributes issued from an attribute authority, is useful in many important applications such as anonymous authentication and attribute-based messaging systems. However, the signature computational costs scale with the complexity of the predicate has attested to the message, which makes signature a possible bottleneck for some applications. To address this problem, we propose a new on/offline scheme for ABS that splits the computation for these algorithms into two phases: a preparation phase that does the vast majority of the work to sign a message before it knows the message and the predicate has attested to the message. The second phase can then rapidly assemble an ABS signature when the specifics become known. We note that unknown message and predicate make ABS significantly more challenging. This scheme is especially suitable for resource constrained environment. When the resource is ample, we can do the offline phase. And when it is limited, online phase can be done rapidly without much resource.
{"title":"Online/Offline Attribute Based Signature","authors":"Shaojun Zhang, Peng Chen, Jianfeng Wang","doi":"10.1109/BWCCA.2014.116","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.116","url":null,"abstract":"Attribute-based signature (ABS), which enables users sign messages with any predicate of their attributes issued from an attribute authority, is useful in many important applications such as anonymous authentication and attribute-based messaging systems. However, the signature computational costs scale with the complexity of the predicate has attested to the message, which makes signature a possible bottleneck for some applications. To address this problem, we propose a new on/offline scheme for ABS that splits the computation for these algorithms into two phases: a preparation phase that does the vast majority of the work to sign a message before it knows the message and the predicate has attested to the message. The second phase can then rapidly assemble an ABS signature when the specifics become known. We note that unknown message and predicate make ABS significantly more challenging. This scheme is especially suitable for resource constrained environment. When the resource is ample, we can do the offline phase. And when it is limited, online phase can be done rapidly without much resource.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"15 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":"117114838","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}
Management of Cloud services is one of the important aspects for the cloud service users to manage in order to ensure that they achieve their required outcomes. There is a wide interest in the literature on this problem, but most of that work has approached this problem from the service provider's (platform) viewpoint. While on the one hand, having techniques to monitor a service from this viewpoint is important, on the other hand it is also important to monitor the QoS of a cloud service being received at the user side. This is because there is a possibility of the service user being unable to obtain the promised service with the required characteristics due to factors beyond the platform side which affects the QoS being received at the run time. One of the main factors for user side service monitoring is the accurate forecasting of the QoS of cloud services over a period of time in the future based on the past observed pattern or history. In this paper we investigate the use of exponential smoothing and autoregressive moving average models for forecasting the QoS of cloud services. We propose a forecasting mechanism which uses the past QoS values collected though QoS monitoring to forecast the future QoS of cloud services.
{"title":"Time Series QoS Forecasting for Management of Cloud Services","authors":"Z. Rahman, O. Hussain, F. Hussain","doi":"10.1109/BWCCA.2014.144","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.144","url":null,"abstract":"Management of Cloud services is one of the important aspects for the cloud service users to manage in order to ensure that they achieve their required outcomes. There is a wide interest in the literature on this problem, but most of that work has approached this problem from the service provider's (platform) viewpoint. While on the one hand, having techniques to monitor a service from this viewpoint is important, on the other hand it is also important to monitor the QoS of a cloud service being received at the user side. This is because there is a possibility of the service user being unable to obtain the promised service with the required characteristics due to factors beyond the platform side which affects the QoS being received at the run time. One of the main factors for user side service monitoring is the accurate forecasting of the QoS of cloud services over a period of time in the future based on the past observed pattern or history. In this paper we investigate the use of exponential smoothing and autoregressive moving average models for forecasting the QoS of cloud services. We propose a forecasting mechanism which uses the past QoS values collected though QoS monitoring to forecast the future QoS of cloud services.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"74 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":"125410687","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}
Currently, 4G network becomes commercial in large scale around the world and the industry has started the fifth-generation mobile communication technology (5G) research. Compared to 4G network, 5G network will support larger mobility as well as higher transmission rate, higher user experience rate, energy efficiency, spectrum efficiency and so forth. All of these will boost a variety of multimedia services, especially for Over-The-Top (OTT) services. So for, OTT services have already gained great popularity and contributed to large traffic consumption, which propose a challenge for operators. As OTT services are designed to deliver over the best effort Internet, the QoE management solutions for traditional multimedia services are obsolete, which propose new challenges in QOE management aspects for network and service providers, especially for the 4G and future 5G network. This paper attempts to present the technical challenges faced by 5G network from QoE management perspective of OTT services. Our objective is to enhance the user experience of OTT services and improve network efficiency. We analysis the characteristics and QoE factors of OTT services over 5G wireless network. With the QoE factors and current QoE management situation, we summarize OTT services QoE quantification and evaluation methods, present QoE-driven radio resource management and optimization solutions. Then, we propose a framework and whole evaluation procedure which aim at obtaining the accurate user experience value as well as improving network efficiency and optimizing the user experience.
{"title":"QoE Issues of OTT Services over 5G Network","authors":"Huang Feng-hui, Zhou Wen-an, Du Yu","doi":"10.1109/BWCCA.2014.74","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.74","url":null,"abstract":"Currently, 4G network becomes commercial in large scale around the world and the industry has started the fifth-generation mobile communication technology (5G) research. Compared to 4G network, 5G network will support larger mobility as well as higher transmission rate, higher user experience rate, energy efficiency, spectrum efficiency and so forth. All of these will boost a variety of multimedia services, especially for Over-The-Top (OTT) services. So for, OTT services have already gained great popularity and contributed to large traffic consumption, which propose a challenge for operators. As OTT services are designed to deliver over the best effort Internet, the QoE management solutions for traditional multimedia services are obsolete, which propose new challenges in QOE management aspects for network and service providers, especially for the 4G and future 5G network. This paper attempts to present the technical challenges faced by 5G network from QoE management perspective of OTT services. Our objective is to enhance the user experience of OTT services and improve network efficiency. We analysis the characteristics and QoE factors of OTT services over 5G wireless network. With the QoE factors and current QoE management situation, we summarize OTT services QoE quantification and evaluation methods, present QoE-driven radio resource management and optimization solutions. Then, we propose a framework and whole evaluation procedure which aim at obtaining the accurate user experience value as well as improving network efficiency and optimizing the user experience.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"91 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":"124619000","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}
Public auditing has vital significance in cloud computing. However, current public auditing schemes are bilinear map based, and they are costly. This paper brings out an XOR based public auditing scheme, which is much more efficient than current bilinear map based schemes.
{"title":"A XOR Based Public Auditing Scheme for Proof-of-storage","authors":"Bei Pei, Changsong Chen, C. Wan","doi":"10.1109/BWCCA.2014.140","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.140","url":null,"abstract":"Public auditing has vital significance in cloud computing. However, current public auditing schemes are bilinear map based, and they are costly. This paper brings out an XOR based public auditing scheme, which is much more efficient than current bilinear map based schemes.","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":"127742047","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}
Hina Nasir, N. Javaid, Muniba Murtaza, S. Manzoor, Z. Khan, U. Qasim, M. Sher
Reliability is key factor for mission critical data applications. In poor underwater environment, where fading and noises are unavoidable, it is very difficult to have error free data transmission. This paper presents a novel cooperative routing protocol for Underwater Wireless Sensor Networks (UWSN) called Adaptive Cooperation in Energy Efficient Depth Based Routing (ACE). ACE aims to reduce high error rate and enhance throughput via retransmission through cooperative relay nodes. Retransmission is performed only when destination receives erroneous copy in direct transmission from the source node. Relay nodes are selected on the basis of depth and residual energy of sensor nodes. Simulation results show the superior performance of ACE over conventional non retransmission routing protocol in terms of throughput, packet drop and packet acceptance ratio.
{"title":"ACE: Adaptive Cooperation in EEDBR for Underwater Wireless Sensor Networks","authors":"Hina Nasir, N. Javaid, Muniba Murtaza, S. Manzoor, Z. Khan, U. Qasim, M. Sher","doi":"10.1109/BWCCA.2014.38","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.38","url":null,"abstract":"Reliability is key factor for mission critical data applications. In poor underwater environment, where fading and noises are unavoidable, it is very difficult to have error free data transmission. This paper presents a novel cooperative routing protocol for Underwater Wireless Sensor Networks (UWSN) called Adaptive Cooperation in Energy Efficient Depth Based Routing (ACE). ACE aims to reduce high error rate and enhance throughput via retransmission through cooperative relay nodes. Retransmission is performed only when destination receives erroneous copy in direct transmission from the source node. Relay nodes are selected on the basis of depth and residual energy of sensor nodes. Simulation results show the superior performance of ACE over conventional non retransmission routing protocol in terms of throughput, packet drop and packet acceptance ratio.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"21 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":"130112257","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}
Hiroki Nakayama, Dilawaer Duolikun, T. Enokido, M. Takizawa
In distributed systems, a group of multiple processes are cooperating with each other by exchanging messages in networks. A process is considered to be a sequence of events in a finite state machine model. Here, it is significant to decide on which event causally precedes another event for a pair of events in a system. In the Lamport's happen-before relation among events, events are partially ordered on the basis of send-receive semantics of messages exchanged at a network layer. In this paper, we discuss a peer-to-peer (P2P) model of a publish/subscribe (P2PPS) system composed of peer processes (peers). Each peer can subscribe and publish application events. Peers subscribing an application event are notified if a peer publishes the application event. Thus, a peer detects application events and then publishes the application events. A peer is notified of application events published by peers. Each peer has to deliver notified application events in the causal order. We discuss the causal dependency of application events handled by subscription, publication, and notification semantics.
{"title":"A P2P Model of Publish/Subscribe Systems","authors":"Hiroki Nakayama, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/BWCCA.2014.93","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.93","url":null,"abstract":"In distributed systems, a group of multiple processes are cooperating with each other by exchanging messages in networks. A process is considered to be a sequence of events in a finite state machine model. Here, it is significant to decide on which event causally precedes another event for a pair of events in a system. In the Lamport's happen-before relation among events, events are partially ordered on the basis of send-receive semantics of messages exchanged at a network layer. In this paper, we discuss a peer-to-peer (P2P) model of a publish/subscribe (P2PPS) system composed of peer processes (peers). Each peer can subscribe and publish application events. Peers subscribing an application event are notified if a peer publishes the application event. Thus, a peer detects application events and then publishes the application events. A peer is notified of application events published by peers. Each peer has to deliver notified application events in the causal order. We discuss the causal dependency of application events handled by subscription, publication, and notification semantics.","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":"129164240","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}
J. Wen, Jheng-Sian Li, Cheng-Ying Yang, Chun-Hung Chen, Hsing-Chung Chen
Based on the modified TOA and AOA measurements, a weighted least square (WLS) scheme to estimate the target location in the TRM multistatic radar system is proposed in this paper. The performance of the location estimation scheme is evaluated according to the basis of the root mean square error (RMSE). In the proposed scheme, all the measured errors including the measured azimuth angle, the measured elevation angle, and the measured range from the sum of the distance for transmitter-to-target and the distance for target-to-receiver are considered. The performance of the proposed scheme is given under the cases of the bistatic radar system and the TR4 multistatic radar system, respectively.
{"title":"Localization Scheme of Multistatic Radars System Based on the Information of Measured Signal","authors":"J. Wen, Jheng-Sian Li, Cheng-Ying Yang, Chun-Hung Chen, Hsing-Chung Chen","doi":"10.1109/BWCCA.2014.136","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.136","url":null,"abstract":"Based on the modified TOA and AOA measurements, a weighted least square (WLS) scheme to estimate the target location in the TRM multistatic radar system is proposed in this paper. The performance of the location estimation scheme is evaluated according to the basis of the root mean square error (RMSE). In the proposed scheme, all the measured errors including the measured azimuth angle, the measured elevation angle, and the measured range from the sum of the distance for transmitter-to-target and the distance for target-to-receiver are considered. The performance of the proposed scheme is given under the cases of the bistatic radar system and the TR4 multistatic radar system, respectively.","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":"128228286","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}
Virtual network is an important part of the cloud computing, Its management is achieved by the Quantum component of Open stack, which is one of the most popular cloud management platform. Currently, Quantum component has two deployment plans that is the single-host plan and the multi-host plan. Others' lab previously about the comparison of two deployment plans is incomplete and unsatisfactory. In this paper, we introduce the single-host and the multi-host deployment plan after analyzing the work mechanism of the Quantum component. Then, we deploy Hadoop on the Open stack to compare the network performance of single-host plan and the multi-host plan through the service performance of Hadoop. Experiment results show that virtual network performance of the multi-host plan has been greatly improved to compare the single-host plan.
{"title":"A Study on Service Performance Evaluation of Openstack","authors":"Qifeng Xu, Jie Yuan","doi":"10.1109/BWCCA.2014.120","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.120","url":null,"abstract":"Virtual network is an important part of the cloud computing, Its management is achieved by the Quantum component of Open stack, which is one of the most popular cloud management platform. Currently, Quantum component has two deployment plans that is the single-host plan and the multi-host plan. Others' lab previously about the comparison of two deployment plans is incomplete and unsatisfactory. In this paper, we introduce the single-host and the multi-host deployment plan after analyzing the work mechanism of the Quantum component. Then, we deploy Hadoop on the Open stack to compare the network performance of single-host plan and the multi-host plan through the service performance of Hadoop. Experiment results show that virtual network performance of the multi-host plan has been greatly improved to compare the single-host plan.","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":"128860514","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
扫码关注我们
求助内容：
应助结果提醒方式：