Pub Date : 2014-04-06DOI: 10.1109/WCNC.2014.6952572
Dajin Wang
In this paper we consider relay channel (RC) with non-causal channel state information (CSI) only at the relay. Three compress-forward (CF) lower bounds were established. The first one is obtained by letting the relay transmit compressed CSI and message information directly. The second bound is a special case of the first one, which is achieved by letting the relay only transmit CSI regardless of message. It is equivalent to the first one under some cases. To achieve the third bound we introduce a new coding scheme, which makes more use of the non-causal CSI. The third bound contains all previous bounds. In our scheme, the non-causal CSI is compressed and transmitted with message information. The transmission of CSI has twofold effect. On the one hand, it may reduce the message rate sent by the relay. On the other hand, the destination can decode the CSI and use it to improve decoding message from both the source and the relay. We find that our scheme is equivalent to CF strategy with Gelfand-Pinsker (GP) coding, in which the non-causal CSI is only used to improve decoding the message from the relay. Note that if the channel between the relay and destination is good enough, the relay can transmit all the message information it got and use the extra capacity to transmit compressed CSI. In this situation the transmission of CSI doesn't reduce the message rate to be relayed, and our scheme outperforms CF strategy with GP coding.
{"title":"Compress-forward strategy with non-causal channel state information at the relay","authors":"Dajin Wang","doi":"10.1109/WCNC.2014.6952572","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952572","url":null,"abstract":"In this paper we consider relay channel (RC) with non-causal channel state information (CSI) only at the relay. Three compress-forward (CF) lower bounds were established. The first one is obtained by letting the relay transmit compressed CSI and message information directly. The second bound is a special case of the first one, which is achieved by letting the relay only transmit CSI regardless of message. It is equivalent to the first one under some cases. To achieve the third bound we introduce a new coding scheme, which makes more use of the non-causal CSI. The third bound contains all previous bounds. In our scheme, the non-causal CSI is compressed and transmitted with message information. The transmission of CSI has twofold effect. On the one hand, it may reduce the message rate sent by the relay. On the other hand, the destination can decode the CSI and use it to improve decoding message from both the source and the relay. We find that our scheme is equivalent to CF strategy with Gelfand-Pinsker (GP) coding, in which the non-causal CSI is only used to improve decoding the message from the relay. Note that if the channel between the relay and destination is good enough, the relay can transmit all the message information it got and use the extra capacity to transmit compressed CSI. In this situation the transmission of CSI doesn't reduce the message rate to be relayed, and our scheme outperforms CF strategy with GP coding.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114373520","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-04-06DOI: 10.1109/WCNC.2014.6952638
Ke Wang, T. Chai, L. Wong
Since both transmission power and modulation method can be varied in Mobile Ad hoc Networks (MANETs), it is necessary to take power control and rate adaptation into account when dealing with routing problems. In this paper, we propose a Q-Learning-based Rate-aware Power-Controlled Routing scheme (QLRPCR) to address the joint optimization of power, rate and routing in an on-demand and distributed manner. An evaluation considering traffic load and node mobility shows that QLRPCR improves the average latency and the packet delivery ratio, while maintaining an acceptable overhead level compared with other Q-learning or power-controlled-routing protocols.
{"title":"An on-demand rate-aware joint power control and routing scheme","authors":"Ke Wang, T. Chai, L. Wong","doi":"10.1109/WCNC.2014.6952638","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952638","url":null,"abstract":"Since both transmission power and modulation method can be varied in Mobile Ad hoc Networks (MANETs), it is necessary to take power control and rate adaptation into account when dealing with routing problems. In this paper, we propose a Q-Learning-based Rate-aware Power-Controlled Routing scheme (QLRPCR) to address the joint optimization of power, rate and routing in an on-demand and distributed manner. An evaluation considering traffic load and node mobility shows that QLRPCR improves the average latency and the packet delivery ratio, while maintaining an acceptable overhead level compared with other Q-learning or power-controlled-routing protocols.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114396789","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-04-06DOI: 10.1109/WCNC.2014.6952646
Na Li, Xiaofeng Tao, Qimei Cui, Juan Bai, Yujia Hu
Consider secure transmissions over the downlink of a multiuser MISO system with independent confidential messages, each of which is intended for one of the users and should keep secret from others. We are interested in a scenario where users have individual secrecy rate requirements. This scenario is practical but has drawn little attention in the literature so far. In this paper, we propose a secrecy rate balancing algorithm which tries to fulfill the secrecy rate requirements of users, and maximizes the minimum margin which is defined as the difference between the available secrecy rate and the required rate for each user. This algorithm balances out all the secrecy rate margins until an equilibrium is reached. We derive a necessary condition for the optimal solution. Finally, theoretical results are illustrated by numerical simulations.
{"title":"Secrecy rate balancing for the downlink multiuser MISO system with independent confidential messages","authors":"Na Li, Xiaofeng Tao, Qimei Cui, Juan Bai, Yujia Hu","doi":"10.1109/WCNC.2014.6952646","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952646","url":null,"abstract":"Consider secure transmissions over the downlink of a multiuser MISO system with independent confidential messages, each of which is intended for one of the users and should keep secret from others. We are interested in a scenario where users have individual secrecy rate requirements. This scenario is practical but has drawn little attention in the literature so far. In this paper, we propose a secrecy rate balancing algorithm which tries to fulfill the secrecy rate requirements of users, and maximizes the minimum margin which is defined as the difference between the available secrecy rate and the required rate for each user. This algorithm balances out all the secrecy rate margins until an equilibrium is reached. We derive a necessary condition for the optimal solution. Finally, theoretical results are illustrated by numerical simulations.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114664661","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-04-06DOI: 10.1109/WCNC.2014.6952328
D. Nguyen, Le-Nam Tran, P. Pirinen, M. Latva-aho
We study the joint subcarrier allocation and pre-coder design (JSAPD) problem to maximize the sum rate of downlink orthogonal frequency division multiple access (OFDMA) systems under a sum power constraint. Naturally, this problem belongs to a class of combinatorial optimization problems which are difficult to solve in general. Based on the concept of big-M formulation, and by exploiting its specific structure, we can transform the JSAPD problem into a mixed integer second order cone program (MI-SOCP), which then offers two advantages. Firstly, when the number of subcarriers/users is small, the design problem can be solved to global optimum in reasonable time by dedicated solvers. Secondly, when the number of subcarriers/users is large, near-optimal solutions of the JSAPD problem can be found by considering the continuous convex relaxation of the MI-SOCP. Numerical experiments are carried out to demonstrate the improved performance of the proposed designs compared to known solutions.
{"title":"SOCP approaches to joint subcarrier allocation and precoder design for downlink OFDMA systems","authors":"D. Nguyen, Le-Nam Tran, P. Pirinen, M. Latva-aho","doi":"10.1109/WCNC.2014.6952328","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952328","url":null,"abstract":"We study the joint subcarrier allocation and pre-coder design (JSAPD) problem to maximize the sum rate of downlink orthogonal frequency division multiple access (OFDMA) systems under a sum power constraint. Naturally, this problem belongs to a class of combinatorial optimization problems which are difficult to solve in general. Based on the concept of big-M formulation, and by exploiting its specific structure, we can transform the JSAPD problem into a mixed integer second order cone program (MI-SOCP), which then offers two advantages. Firstly, when the number of subcarriers/users is small, the design problem can be solved to global optimum in reasonable time by dedicated solvers. Secondly, when the number of subcarriers/users is large, near-optimal solutions of the JSAPD problem can be found by considering the continuous convex relaxation of the MI-SOCP. Numerical experiments are carried out to demonstrate the improved performance of the proposed designs compared to known solutions.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114925961","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-04-06DOI: 10.1109/WCNC.2014.6953070
Alexander Pyattaev, Kerstin Johnsson, Adam Surak, R. Florea, S. Andreev, Y. Koucheryavy
Currently, cellular operators are struggling to relieve congestion on their networks in the face of rapidly growing mobile data traffic. While deploying an increasing number of base stations is expected to mitigate the disproportion between user demand and available radio resources, this solution is costly and plagued with many practical challenges. An attractive alternative is to enable cellular traffic offloading onto device-to-device (D2D) connections in the unlicensed bands, as current multi-radio user devices are already capable of establishing concurrent LTE and WiFi links. However, WiFi lacks a fast, efficient method of device/service discovery, and it is not equipped to efficiently manage numerous D2D connections. In our research, we have found that a limited amount of network assistance for D2D communications can overcome these limitations; and in this paper we describe our network-assisted D2D technology prototype. Specifically, we outline a complete standards-compliant solution that provides a seamless D2D connectivity experience to the end user. Our solution utilizes WiFi Direct as the link-layer technology for proximal D2D connections. However, the challenges faced during the design phase are universal to all D2D link-layer protocols, thus the proposed solutions are applicable to other potential D2D technologies.
{"title":"Network-assisted D2D communications: Implementing a technology prototype for cellular traffic offloading","authors":"Alexander Pyattaev, Kerstin Johnsson, Adam Surak, R. Florea, S. Andreev, Y. Koucheryavy","doi":"10.1109/WCNC.2014.6953070","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6953070","url":null,"abstract":"Currently, cellular operators are struggling to relieve congestion on their networks in the face of rapidly growing mobile data traffic. While deploying an increasing number of base stations is expected to mitigate the disproportion between user demand and available radio resources, this solution is costly and plagued with many practical challenges. An attractive alternative is to enable cellular traffic offloading onto device-to-device (D2D) connections in the unlicensed bands, as current multi-radio user devices are already capable of establishing concurrent LTE and WiFi links. However, WiFi lacks a fast, efficient method of device/service discovery, and it is not equipped to efficiently manage numerous D2D connections. In our research, we have found that a limited amount of network assistance for D2D communications can overcome these limitations; and in this paper we describe our network-assisted D2D technology prototype. Specifically, we outline a complete standards-compliant solution that provides a seamless D2D connectivity experience to the end user. Our solution utilizes WiFi Direct as the link-layer technology for proximal D2D connections. However, the challenges faced during the design phase are universal to all D2D link-layer protocols, thus the proposed solutions are applicable to other potential D2D technologies.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117041895","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-04-06DOI: 10.1109/WCNC.2014.6952400
Omar A. Elgendy, M. H. Ismail, K. Elsayed
Relaying in OFDMA-based networks is an effective mechanism for enhancing the cell-edge capacity, extending the coverage and utilizing the bandwidth efficiently through spatial reuse. To harness the benefits of relaying, efficient resource allocation schemes should be used, which are aware of the highly dynamic nature of interference in OFDMA relay-enhanced cells (RECs). This paper tackles the joint Power Allocation (PA) and Resource Block Assignment (RBA) problem in a single-cell OFDMA REC. Fair allocation of resources is achieved by assuming a max-min fair objective for the problem and a novel solution technique is proposed, which is capable of obtaining a local optimum for this complex problem. Comparison with other similar works shows the effectiveness of our proposed technique. Simulation results show increase in the 10%tile capacity by a factor of 6.6 compared to previous solution techniques. Moreover, using Jain's fairness index, we show that this technique guarantees more fairness among users.
{"title":"Max-min fair resource allocation for LTE-advanced relay-enhanced cells","authors":"Omar A. Elgendy, M. H. Ismail, K. Elsayed","doi":"10.1109/WCNC.2014.6952400","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952400","url":null,"abstract":"Relaying in OFDMA-based networks is an effective mechanism for enhancing the cell-edge capacity, extending the coverage and utilizing the bandwidth efficiently through spatial reuse. To harness the benefits of relaying, efficient resource allocation schemes should be used, which are aware of the highly dynamic nature of interference in OFDMA relay-enhanced cells (RECs). This paper tackles the joint Power Allocation (PA) and Resource Block Assignment (RBA) problem in a single-cell OFDMA REC. Fair allocation of resources is achieved by assuming a max-min fair objective for the problem and a novel solution technique is proposed, which is capable of obtaining a local optimum for this complex problem. Comparison with other similar works shows the effectiveness of our proposed technique. Simulation results show increase in the 10%tile capacity by a factor of 6.6 compared to previous solution techniques. Moreover, using Jain's fairness index, we show that this technique guarantees more fairness among users.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117348720","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-04-06DOI: 10.1109/WCNC.2014.6952042
S. Videv, H. Haas
This paper presents results of a practical implementation of a spatial shift keying (SSK) visible light communication (VLC) system. This is the first practical proof-of-concept realtime implementation of SSK for VLC to the best knowledge of the authors. The system uses four transmitter light emitting diodes (LEDs) to encode information, and four receiver photo diodes (PDs) to decode the spatial signatures and decode the incoming data signal. The achieved bit error ratio (BER) of less than 2 × 10-3 allows for error-free communication if forward error correction (FEC) is to be applied. The main challenge with practical implementations of SSK in VLC is identified, namely maintaining symbol separation in the received constellation, and solutions are proposed.
{"title":"Practical space shift keying VLC system","authors":"S. Videv, H. Haas","doi":"10.1109/WCNC.2014.6952042","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952042","url":null,"abstract":"This paper presents results of a practical implementation of a spatial shift keying (SSK) visible light communication (VLC) system. This is the first practical proof-of-concept realtime implementation of SSK for VLC to the best knowledge of the authors. The system uses four transmitter light emitting diodes (LEDs) to encode information, and four receiver photo diodes (PDs) to decode the spatial signatures and decode the incoming data signal. The achieved bit error ratio (BER) of less than 2 × 10-3 allows for error-free communication if forward error correction (FEC) is to be applied. The main challenge with practical implementations of SSK in VLC is identified, namely maintaining symbol separation in the received constellation, and solutions are proposed.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123553980","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-04-06DOI: 10.1109/WCNC.2014.6952858
Alvaro Torres, P. Piñol, C. Calafate, Juan-Carlos Cano, P. Manzoni
Video transmission over VANETs is an extremely difficult task not only due to the high bandwidth requirements, but also due to typical VANET characteristics such as signal attenuation, packet losses, high relative speeds and fast topology changes. In future scenarios, vehicles will provide other vehicles with information about accidents or congestion on the road, and in these cases offering visual information can be a really valuable resource for both drivers and traffic authorities. Hence, achieving an efficient transmission is critical to maximize the user-perceived quality. In this paper we evaluate solutions that combine different flooding techniques, and different video codecs to assess the effectiveness of long-distance real-time video streaming. In particular, we will compare the most effective video coding standard available (H.264) with the upcoming H.265 codec in terms of both frame loss and PSNR.
{"title":"Evaluating H.265 real-time video flooding quality in highway V2V environments","authors":"Alvaro Torres, P. Piñol, C. Calafate, Juan-Carlos Cano, P. Manzoni","doi":"10.1109/WCNC.2014.6952858","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952858","url":null,"abstract":"Video transmission over VANETs is an extremely difficult task not only due to the high bandwidth requirements, but also due to typical VANET characteristics such as signal attenuation, packet losses, high relative speeds and fast topology changes. In future scenarios, vehicles will provide other vehicles with information about accidents or congestion on the road, and in these cases offering visual information can be a really valuable resource for both drivers and traffic authorities. Hence, achieving an efficient transmission is critical to maximize the user-perceived quality. In this paper we evaluate solutions that combine different flooding techniques, and different video codecs to assess the effectiveness of long-distance real-time video streaming. In particular, we will compare the most effective video coding standard available (H.264) with the upcoming H.265 codec in terms of both frame loss and PSNR.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123620745","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-04-06DOI: 10.1109/WCNC.2014.6952557
Mohammed S. Elbamby, K. Elsayed
We propose a resource allocation scheme based on the auction algorithm that aims at minimizing inter-cell interference (ICI) in multi-carrier LTE-A systems. The prices paid for resources by cell-edge users are infrequently exchanged between adjacent cells to help deciding who needs a specific resource the most. Furthermore, the Relative Narrowband Transmit Power (RNTP) indicator that is exchanged between cells in the LTE-A system is exploited to minimize the information exchange rate. When RNTP is used, only resources that suffer interference higher than a certain threshold are considered in the price exchange mechanism. Performance evaluation results show that the proposed scheme significantly improves the cell-edge throughput. The use of RNTP not only minimizes the exchange overhead, especially in a multi-carrier scenario, but it also improves the system performance as the cell neighbors would not avoid using a resource unless they are the culprit interferers to the original cell that uses it.
{"title":"An auction approach to resource allocation with interference coordination in LTE-A systems","authors":"Mohammed S. Elbamby, K. Elsayed","doi":"10.1109/WCNC.2014.6952557","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6952557","url":null,"abstract":"We propose a resource allocation scheme based on the auction algorithm that aims at minimizing inter-cell interference (ICI) in multi-carrier LTE-A systems. The prices paid for resources by cell-edge users are infrequently exchanged between adjacent cells to help deciding who needs a specific resource the most. Furthermore, the Relative Narrowband Transmit Power (RNTP) indicator that is exchanged between cells in the LTE-A system is exploited to minimize the information exchange rate. When RNTP is used, only resources that suffer interference higher than a certain threshold are considered in the price exchange mechanism. Performance evaluation results show that the proposed scheme significantly improves the cell-edge throughput. The use of RNTP not only minimizes the exchange overhead, especially in a multi-carrier scenario, but it also improves the system performance as the cell neighbors would not avoid using a resource unless they are the culprit interferers to the original cell that uses it.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124045129","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-04-06DOI: 10.1109/WCNC.2014.6953075
Fang-jing Wu, Xiaoming Zhang, H. Lim
This paper exploits smartphones to design a transportation activity survey system that investigates when, where and how people travel in an urban area. In such a system, the essential requirement is collecting and processing big data which will raise two critical issues, energy-conservation and scalability. To address the former issue, the GPS sleeping interval of a smart-phone is controlled by the back-end servers adaptively based on the real-time moving speed and transportation modes. To address the latter issue, we consider MapReduce to design the back-end Cloud, where intelligent learning and classification algorithms are implemented to detect the stops and transportation modes and provide smartphones with an appropriate GPS sleeping interval based on the GPS statistics on the back-end Cloud. The unique feature of our system is to integrate participatory sensing and Cloud-enabled processing system closely which incorporates knowledge extracted from the Cloud (i.e., transportation modes) into sensing control of smartphones. In this way, sensing control could be optimized through the knowledge behind crowdsourced data. Our system has been deployed in Singapore to support the Land Transport Authority's transportation activity survey over 1 year. Extensive experimental results indicate that our system can reduce the energy consumption of smartphones efficiently and process concurrent data arrival from a huge number of users.
{"title":"A cooperative sensing and mining system for transportation activity survey","authors":"Fang-jing Wu, Xiaoming Zhang, H. Lim","doi":"10.1109/WCNC.2014.6953075","DOIUrl":"https://doi.org/10.1109/WCNC.2014.6953075","url":null,"abstract":"This paper exploits smartphones to design a transportation activity survey system that investigates when, where and how people travel in an urban area. In such a system, the essential requirement is collecting and processing big data which will raise two critical issues, energy-conservation and scalability. To address the former issue, the GPS sleeping interval of a smart-phone is controlled by the back-end servers adaptively based on the real-time moving speed and transportation modes. To address the latter issue, we consider MapReduce to design the back-end Cloud, where intelligent learning and classification algorithms are implemented to detect the stops and transportation modes and provide smartphones with an appropriate GPS sleeping interval based on the GPS statistics on the back-end Cloud. The unique feature of our system is to integrate participatory sensing and Cloud-enabled processing system closely which incorporates knowledge extracted from the Cloud (i.e., transportation modes) into sensing control of smartphones. In this way, sensing control could be optimized through the knowledge behind crowdsourced data. Our system has been deployed in Singapore to support the Land Transport Authority's transportation activity survey over 1 year. Extensive experimental results indicate that our system can reduce the energy consumption of smartphones efficiently and process concurrent data arrival from a huge number of users.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124475253","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
扫码关注我们
求助内容：
应助结果提醒方式：