Pub Date : 2014-07-28DOI: 10.1109/CCNC.2014.6866639
Y. Matsuzawa, Y. Yamao, K. Otake, K. Ishibashi
Multi-hop wireless ad hoc networks suffer from severe link error due to fading. In order to tailor multi-hop transmissions to fading environment and improve reliability, dynamic multi-hopping schemes have been proposed. In this paper, we theoretically analyze the end-to-end packet delivery rate performance of integrated dynamic multi-hopping (IDMH) scheme under the generalized fading model combining the effect of Rayleigh fading and log-normal shadowing, i.e., Suzuki fading model. Results show that packet delivery rate is remarkably improved by the IDMH scheme. Furthermore, numerical results via network simulator justify the accuracy of the theoretical analysis.
{"title":"Multi-hop transmission performance of integrated dynamic multi-hopping for wireless ad hoc networks","authors":"Y. Matsuzawa, Y. Yamao, K. Otake, K. Ishibashi","doi":"10.1109/CCNC.2014.6866639","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866639","url":null,"abstract":"Multi-hop wireless ad hoc networks suffer from severe link error due to fading. In order to tailor multi-hop transmissions to fading environment and improve reliability, dynamic multi-hopping schemes have been proposed. In this paper, we theoretically analyze the end-to-end packet delivery rate performance of integrated dynamic multi-hopping (IDMH) scheme under the generalized fading model combining the effect of Rayleigh fading and log-normal shadowing, i.e., Suzuki fading model. Results show that packet delivery rate is remarkably improved by the IDMH scheme. Furthermore, numerical results via network simulator justify the accuracy of the theoretical analysis.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126614909","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-07-28DOI: 10.1109/CCNC.2014.6866634
Shintaro Arai, Yasutaka Shiraki, T. Yamazato, Hiraku Okada, T. Fujii, T. Yendo
The present paper proposes a novel multiple-LED-arrays acquisition for an infrastructure-to-vehicle visible light communication (I2V-VLC) using LED arrays (transmitter) and an in-vehicle high-speed image sensor (receiver). In order to achieve a robust detection of LED arrays, we employ the block matching algorithm, which is a way of finding a corresponding position between two successive frames. The proposed method divides a captured image into a number of small domains (blocks) and determines if the LED array is present or absent using the block matching. We perform I2V-VLC experiments with multiple-LED arrays and evaluate the acquisition capability of the proposed method.
{"title":"Multiple LED arrays acquisition for image-sensor-based I2V-VLC using block matching","authors":"Shintaro Arai, Yasutaka Shiraki, T. Yamazato, Hiraku Okada, T. Fujii, T. Yendo","doi":"10.1109/CCNC.2014.6866634","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866634","url":null,"abstract":"The present paper proposes a novel multiple-LED-arrays acquisition for an infrastructure-to-vehicle visible light communication (I2V-VLC) using LED arrays (transmitter) and an in-vehicle high-speed image sensor (receiver). In order to achieve a robust detection of LED arrays, we employ the block matching algorithm, which is a way of finding a corresponding position between two successive frames. The proposed method divides a captured image into a number of small domains (blocks) and determines if the LED array is present or absent using the block matching. We perform I2V-VLC experiments with multiple-LED arrays and evaluate the acquisition capability of the proposed method.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"142 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128774439","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-07-28DOI: 10.1109/CCNC.2014.6866568
Y. Shoji, L. Zhong, Manabu Ito, Y. Kitatsuji, K. Nakauchi, H. Yokota
This paper proposes the concept of Bring Your Own Network (BYON), which could be a solution to reduce the impact of signaling traffic on the efficiency of mobile network resource utilization. The BYON would be enabled by dynamically migrating and localizing related service resources as well as configuring a service-specific wired and wireless network in a coordinated manner considering the distribution shape of the devices using the specific-service as well as their mobility tendency. The signaling traffic overhead is formulated, and how the introduction of the BYON could reduce the overhead is discussed. It is shown that a modified mobile network based on the BYON, in which the functions of P-CSCF and S/I-CSCF for IP Multimedia Subsystem (IMS) are migrated onto the location of PGW in Evolved Packet Core (EPC), could reduce the signaling traffic overhead by around 30 %. This paper also details the plan to deploy a large-scale experimental wireless network environment to demonstrate the concept of BYON, i.e., virtual wireless network facility.
本文提出了自带网络(Bring Your Own Network, BYON)的概念，可以作为一种减少信令流量对移动网络资源利用效率影响的解决方案。BYON将通过动态迁移和本地化相关服务资源，以及考虑使用特定服务的设备的分布形状及其移动性趋势，以协调的方式配置特定服务的有线和无线网络来实现。阐述了信令业务开销，并讨论了BYON的引入如何降低信令业务开销。研究表明，将IP多媒体子系统(IMS)的P-CSCF和S/I-CSCF的功能迁移到演进分组核心(EPC)的PGW位置，可以将基于BYON的改进移动网络的信令业务开销减少30%左右。本文还详细介绍了部署大规模实验性无线网络环境的计划，以演示BYON(即虚拟无线网络设施)的概念。
{"title":"Bring your own network — A network management technique to mitigate the impact of signaling traffic on network resource utilization","authors":"Y. Shoji, L. Zhong, Manabu Ito, Y. Kitatsuji, K. Nakauchi, H. Yokota","doi":"10.1109/CCNC.2014.6866568","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866568","url":null,"abstract":"This paper proposes the concept of Bring Your Own Network (BYON), which could be a solution to reduce the impact of signaling traffic on the efficiency of mobile network resource utilization. The BYON would be enabled by dynamically migrating and localizing related service resources as well as configuring a service-specific wired and wireless network in a coordinated manner considering the distribution shape of the devices using the specific-service as well as their mobility tendency. The signaling traffic overhead is formulated, and how the introduction of the BYON could reduce the overhead is discussed. It is shown that a modified mobile network based on the BYON, in which the functions of P-CSCF and S/I-CSCF for IP Multimedia Subsystem (IMS) are migrated onto the location of PGW in Evolved Packet Core (EPC), could reduce the signaling traffic overhead by around 30 %. This paper also details the plan to deploy a large-scale experimental wireless network environment to demonstrate the concept of BYON, i.e., virtual wireless network facility.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"4 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120969833","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-07-28DOI: 10.1109/CCNC.2014.6866609
Viet-Duc Le, H. Scholten, P. Havinga, H. Ngo
The emerging wave of technology in human-centric devices such as smart phones, tablets, and other small wearable sensor modules facilitates pervasive systems and applications to be economically deployed on a large scale with human participation. To exploit such environment, data gathering and dissemination based on opportunistic contact times among humans is a fundamental requirement. To tackle the lack of contemporaneous end-to-end connectivity in Delay-tolerant Networks (DTNs), most current algorithms assess the probability of the contact times to gradually convey a message towards its destination. These contact-based approaches do not perform well when historical locations of nodes have mixture distribution. In this paper, we formulate routing problems in spatial and spatiotemporal domains as an online unsupervised learning problem given location data. The key insight is that nodes frequently appearing nearer the message destinations are regarded as possessing higher delivery probability even if they have low contact times. We show how to solve the formulated problems with two basic algorithms, Location-Mean and Location-Cluster, by estimating the means of historical locations to calculate delivery probability of nodes. To our best knowledge, this is the first work to tackle DTN routing problem using online unsupervised learning on geographical locations. In the context of human mobility, simulation results of the Location-Mean algorithm show that the online unsupervised learning approach given node locations achieves better routing performances in term of delivery ratio, latency, transmission cost, and computation efficiency compared to the contact-based approach.
{"title":"Location-based data dissemination with human mobility using online density estimation","authors":"Viet-Duc Le, H. Scholten, P. Havinga, H. Ngo","doi":"10.1109/CCNC.2014.6866609","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866609","url":null,"abstract":"The emerging wave of technology in human-centric devices such as smart phones, tablets, and other small wearable sensor modules facilitates pervasive systems and applications to be economically deployed on a large scale with human participation. To exploit such environment, data gathering and dissemination based on opportunistic contact times among humans is a fundamental requirement. To tackle the lack of contemporaneous end-to-end connectivity in Delay-tolerant Networks (DTNs), most current algorithms assess the probability of the contact times to gradually convey a message towards its destination. These contact-based approaches do not perform well when historical locations of nodes have mixture distribution. In this paper, we formulate routing problems in spatial and spatiotemporal domains as an online unsupervised learning problem given location data. The key insight is that nodes frequently appearing nearer the message destinations are regarded as possessing higher delivery probability even if they have low contact times. We show how to solve the formulated problems with two basic algorithms, Location-Mean and Location-Cluster, by estimating the means of historical locations to calculate delivery probability of nodes. To our best knowledge, this is the first work to tackle DTN routing problem using online unsupervised learning on geographical locations. In the context of human mobility, simulation results of the Location-Mean algorithm show that the online unsupervised learning approach given node locations achieves better routing performances in term of delivery ratio, latency, transmission cost, and computation efficiency compared to the contact-based approach.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121775155","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-07-28DOI: 10.1109/CCNC.2014.6866600
Fukai Jiang, Hanchen Lu
Studies have shown that the size of the transmitted packet has a significant impact on the performance of wireless networks, especially those in challenged environments such as Delay Tolerant Networks (DTNs) where bandwidth is a precious resource. In order to improve the end-to-end goodput in DTNs, segment size at the convergence layer and bundle size at the bundle layer are jointly optimized in this paper. Different from existing work that only performs experimentations to find the optimal packet size in single-hop DTNs, our work focuses on the theoretic analysis and formulates the relationship between packet size at two layers (i.e., the convergence layer and the bundle layer) and the performance metrics (i.e., delay, goodput) of single-hop and multi-hop DTNs. The analysis not only confirms the existence of the optimal packet size, but also quantitatively shows that the optimal packet size is determined by the number of hops, wireless channel conditions in DTNs. Furthermore, a novel Packet Size Optimization Algorithm (PASO) is proposed, in which segment size and bundle size are jointly adjusted to maximize the goodput in multi-hop DTNs. Compared with schemes where joint packet size optimization is not considered, PASO can achieve average 15% more goodput in typical DTN environments where channel conditions are usually assumed to be poor.
{"title":"Packet size optimization in delay tolerant networks","authors":"Fukai Jiang, Hanchen Lu","doi":"10.1109/CCNC.2014.6866600","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866600","url":null,"abstract":"Studies have shown that the size of the transmitted packet has a significant impact on the performance of wireless networks, especially those in challenged environments such as Delay Tolerant Networks (DTNs) where bandwidth is a precious resource. In order to improve the end-to-end goodput in DTNs, segment size at the convergence layer and bundle size at the bundle layer are jointly optimized in this paper. Different from existing work that only performs experimentations to find the optimal packet size in single-hop DTNs, our work focuses on the theoretic analysis and formulates the relationship between packet size at two layers (i.e., the convergence layer and the bundle layer) and the performance metrics (i.e., delay, goodput) of single-hop and multi-hop DTNs. The analysis not only confirms the existence of the optimal packet size, but also quantitatively shows that the optimal packet size is determined by the number of hops, wireless channel conditions in DTNs. Furthermore, a novel Packet Size Optimization Algorithm (PASO) is proposed, in which segment size and bundle size are jointly adjusted to maximize the goodput in multi-hop DTNs. Compared with schemes where joint packet size optimization is not considered, PASO can achieve average 15% more goodput in typical DTN environments where channel conditions are usually assumed to be poor.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123781892","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-07-28DOI: 10.1109/CCNC.2014.6866610
K. Joshi, R. V. Prasad, I. Niemegeers, A. Biswas
60 GHz wireless local area networks (WLANs) standards (e.g., IEEE 802.11ad and IEEE 802.15.3c) employ hybrid MAC protocols consisting of contention based access using CSMA/CA as well as dedicated service periods using time division multiple access (TDMA). To provide the channel access in the contention part of the protocol, quasi omni (QO) antenna patterns are defined which span over the particular spatial directions and cover a limited area around access points. In this paper, we propose an algorithm to determine the beamwidth of each QO level. The proposed algorithm takes into account the spatial distribution of nodes to allocate the beamwidth of each QO level in an adaptive fashion in order to maximizes the channel utilization and satisfy the required link budget criterion. Since the proposed algorithm minimizes the collisions, it also minimizes the average time required to transmit total packets in a QO level. Proposed algorithm improves the average channel utilization up to 20-30% and reduces the time required to transmit total packets up to 40-50% for the given network parameters.
{"title":"Adaptive beamwidth selection for contention based access periods in millimeter wave WLANs","authors":"K. Joshi, R. V. Prasad, I. Niemegeers, A. Biswas","doi":"10.1109/CCNC.2014.6866610","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866610","url":null,"abstract":"60 GHz wireless local area networks (WLANs) standards (e.g., IEEE 802.11ad and IEEE 802.15.3c) employ hybrid MAC protocols consisting of contention based access using CSMA/CA as well as dedicated service periods using time division multiple access (TDMA). To provide the channel access in the contention part of the protocol, quasi omni (QO) antenna patterns are defined which span over the particular spatial directions and cover a limited area around access points. In this paper, we propose an algorithm to determine the beamwidth of each QO level. The proposed algorithm takes into account the spatial distribution of nodes to allocate the beamwidth of each QO level in an adaptive fashion in order to maximizes the channel utilization and satisfy the required link budget criterion. Since the proposed algorithm minimizes the collisions, it also minimizes the average time required to transmit total packets in a QO level. Proposed algorithm improves the average channel utilization up to 20-30% and reduces the time required to transmit total packets up to 40-50% for the given network parameters.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126129313","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-07-28DOI: 10.1109/CCNC.2014.6866566
Fei Ren, Huachun Zhou, Li Yi, Yajuan Qin, Hongke Zhang
Content-Centric Networking (CCN) has emerged as a promising paradigm in current Internet Due to the interest-driven, we concern more about the content itself rather than the place it located, and therefore, CCN supports subscriber mobility natively, however, it remains a major challenge in publisher mobility. In this paper, we propose a hierarchical mobility management scheme for CCN (HMMCCN) which contains an overlay mapping structure to store the old-to-new name binding relationship and perform the mobility management for mobile nodes. The main goals of this paper are: (a) to propose a mobility scheme suitable for all mobile nodes in CCN, both publishers and subscribers; (b) to describe the hierarchical mobility management procedure during intra-domain and inter-domain handoff; (c) to establish an analytical model and formulate the location update signaling cost.
{"title":"A hierarchical mobility management scheme for content-centric networking","authors":"Fei Ren, Huachun Zhou, Li Yi, Yajuan Qin, Hongke Zhang","doi":"10.1109/CCNC.2014.6866566","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866566","url":null,"abstract":"Content-Centric Networking (CCN) has emerged as a promising paradigm in current Internet Due to the interest-driven, we concern more about the content itself rather than the place it located, and therefore, CCN supports subscriber mobility natively, however, it remains a major challenge in publisher mobility. In this paper, we propose a hierarchical mobility management scheme for CCN (HMMCCN) which contains an overlay mapping structure to store the old-to-new name binding relationship and perform the mobility management for mobile nodes. The main goals of this paper are: (a) to propose a mobility scheme suitable for all mobile nodes in CCN, both publishers and subscribers; (b) to describe the hierarchical mobility management procedure during intra-domain and inter-domain handoff; (c) to establish an analytical model and formulate the location update signaling cost.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"1031 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134350037","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-07-28DOI: 10.1109/CCNC.2014.6866557
J. L. Zamora, Noriyuki Suzuki, Hiroaki Takemoto, S. Kashihara, Yuzo Taenaka, S. Yamaguchi
The paper proposes a collection method of SOS messages in a disaster area with collapsed communication service. So far, we have proposed and implemented SOSCast as a smartphone application to support rescue operations for finding immobilized victims. However, in its current implementation, we found that SOSCast limits the search coverage area and disregards some SOS messages. Moreover, the smartphone rapidly consumes battery due to the required constant communication. We propose, therefore, to implement Wi-Fi Direct (WD) in addition to Bluetooth (BT) to increase the search coverage area. Furthermore, we introduce an information-sharing cluster in order to collect SOS messages efficiently while preserving the smartphones' battery life. By implementing the proposed methods on actual smartphones for a performance evaluation, we showed that controlling the use of both WD and BT increases the probability of locating immobilized victims. Also, enabling an information-sharing cluster by immobilized victims' smartphones can send SOS messages to a mobile victim smartphone all at once, which can extend the lifetime of the smartphone's battery as compared with the previous method.
提出了一种通信业务中断的灾区SOS信息采集方法。到目前为止，我们已经提出并实现了SOSCast作为智能手机应用程序，以支持寻找无法移动的受害者的救援行动。然而，在目前的实现中，我们发现SOSCast限制了搜索范围，并且忽略了一些SOS消息。此外，由于需要持续的通信，智能手机迅速消耗电池。因此，我们建议在蓝牙(BT)的基础上实施Wi-Fi Direct (WD)，以增加搜索覆盖范围。此外，我们引入了一个信息共享集群，以便有效地收集SOS信息，同时保持智能手机的电池寿命。通过在实际智能手机上实施所提出的方法进行性能评估，我们发现控制WD和BT的使用增加了定位无法移动的受害者的可能性。另外，通过不活动的受害者智能手机建立信息共享集群，可以同时向移动的受害者智能手机发送SOS信息，与之前的方法相比，可以延长智能手机电池的使用寿命。
{"title":"Battery-saving message collection method for disrupted communication service areas","authors":"J. L. Zamora, Noriyuki Suzuki, Hiroaki Takemoto, S. Kashihara, Yuzo Taenaka, S. Yamaguchi","doi":"10.1109/CCNC.2014.6866557","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866557","url":null,"abstract":"The paper proposes a collection method of SOS messages in a disaster area with collapsed communication service. So far, we have proposed and implemented SOSCast as a smartphone application to support rescue operations for finding immobilized victims. However, in its current implementation, we found that SOSCast limits the search coverage area and disregards some SOS messages. Moreover, the smartphone rapidly consumes battery due to the required constant communication. We propose, therefore, to implement Wi-Fi Direct (WD) in addition to Bluetooth (BT) to increase the search coverage area. Furthermore, we introduce an information-sharing cluster in order to collect SOS messages efficiently while preserving the smartphones' battery life. By implementing the proposed methods on actual smartphones for a performance evaluation, we showed that controlling the use of both WD and BT increases the probability of locating immobilized victims. Also, enabling an information-sharing cluster by immobilized victims' smartphones can send SOS messages to a mobile victim smartphone all at once, which can extend the lifetime of the smartphone's battery as compared with the previous method.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129286948","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-07-28DOI: 10.1109/CCNC.2014.6866551
S. Tasnim, M. Chowdhury, Kishwar Ahmed, N. Pissinou, S. S. Iyengar
Mobile applications can be enhanced to a great extent by using the offloading mechanism in an energy efficient manner to the bounty resourceful clouds. Due to the huge demand of smart phones, the issue of providing more processing capability to this resource constraint device is getting more concern now-a-days. In this paper, a method level offloading mechanism has been proposed where no prior image of the mobile device is needed to be transferred to the cloud. The application is partitioned at different points where the migration of the execution thread is performed from mobile device to nearby resourceful cloud to get the best execution performance in optimal energy cost. The mobile can complete the execution after the partitioned thread returns back from the cloud to the device. This mechanism increases scalability as well as performance in the form of faster execution speed of the mobile devices. Moreover, we consider the mobility of the mobile device and propose a solution to find the best cloud instance on the move. To find out which cloud to offload, the communication latency, capacity, and current load at individual clouds are considered to find out the best cloud to offload to ensure better service for the mobile device. The proposed solution has been simulated and compared against CloneCloud in two different simulation scenarios where we show that our method performs superior to CloneCloud.
{"title":"Location aware code offloading on mobile cloud with QoS constraint","authors":"S. Tasnim, M. Chowdhury, Kishwar Ahmed, N. Pissinou, S. S. Iyengar","doi":"10.1109/CCNC.2014.6866551","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866551","url":null,"abstract":"Mobile applications can be enhanced to a great extent by using the offloading mechanism in an energy efficient manner to the bounty resourceful clouds. Due to the huge demand of smart phones, the issue of providing more processing capability to this resource constraint device is getting more concern now-a-days. In this paper, a method level offloading mechanism has been proposed where no prior image of the mobile device is needed to be transferred to the cloud. The application is partitioned at different points where the migration of the execution thread is performed from mobile device to nearby resourceful cloud to get the best execution performance in optimal energy cost. The mobile can complete the execution after the partitioned thread returns back from the cloud to the device. This mechanism increases scalability as well as performance in the form of faster execution speed of the mobile devices. Moreover, we consider the mobility of the mobile device and propose a solution to find the best cloud instance on the move. To find out which cloud to offload, the communication latency, capacity, and current load at individual clouds are considered to find out the best cloud to offload to ensure better service for the mobile device. The proposed solution has been simulated and compared against CloneCloud in two different simulation scenarios where we show that our method performs superior to CloneCloud.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132339036","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-07-28DOI: 10.1109/CCNC.2014.6866541
Bjoern Dusza, P. Marwedel, O. Spinczyk, C. Wietfeld
A Quality of Experience (QoE) parameter of increasing importance is the time that a battery powered communication device (e.g. smartphone) can be operated before it needs to be recharged. However, due to the fact that battery capacity is not evolving as fast as the power requirement, the battery lifetime of modern user equipment is stagnating or even decreasing from one device generation to another. In parallel, a major challenge for the design of next generation wireless systems such as LTE-Advanced (LTE-A) is that the required high portion of spectrum is not available in a consecutive portion. For this reason, a procedure called interband non-continuous Carrier Aggregation (CA) will be introduced in LTE-A which allows for the combination of multiple spectrum pieces from different frequency bands. This procedure however requires the parallel operation of multiple power amplifiers that are characterized by a high energy demand. In this paper, we quantify the impact of CA on the power consumption of LTE-A enabled communication by means of a Markovian based power consumption model that incorporates system parameters as well as context parameters. The results show that the suitability of CA does from a battery lifetime perspective strongly depend upon the actual device characteristics as well as the resource availability is the various frequency bands. Furthermore, the application of the sophisticated Kinetic Battery Model (KiBaM) shows that the charge recovery effect during idle periods does significantly affect the battery lifetime.
{"title":"A context-aware battery lifetime model for carrier aggregation enabled LTE-A systems","authors":"Bjoern Dusza, P. Marwedel, O. Spinczyk, C. Wietfeld","doi":"10.1109/CCNC.2014.6866541","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866541","url":null,"abstract":"A Quality of Experience (QoE) parameter of increasing importance is the time that a battery powered communication device (e.g. smartphone) can be operated before it needs to be recharged. However, due to the fact that battery capacity is not evolving as fast as the power requirement, the battery lifetime of modern user equipment is stagnating or even decreasing from one device generation to another. In parallel, a major challenge for the design of next generation wireless systems such as LTE-Advanced (LTE-A) is that the required high portion of spectrum is not available in a consecutive portion. For this reason, a procedure called interband non-continuous Carrier Aggregation (CA) will be introduced in LTE-A which allows for the combination of multiple spectrum pieces from different frequency bands. This procedure however requires the parallel operation of multiple power amplifiers that are characterized by a high energy demand. In this paper, we quantify the impact of CA on the power consumption of LTE-A enabled communication by means of a Markovian based power consumption model that incorporates system parameters as well as context parameters. The results show that the suitability of CA does from a battery lifetime perspective strongly depend upon the actual device characteristics as well as the resource availability is the various frequency bands. Furthermore, the application of the sophisticated Kinetic Battery Model (KiBaM) shows that the charge recovery effect during idle periods does significantly affect the battery lifetime.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121193586","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
扫码关注我们
求助内容：
应助结果提醒方式：