Yaoxing Li, Yuhong Li, L. Wolf, Anders Lindgren, Ji Wang
Many common DTN routing protocols are replication-based, which have relatively good performance in terms of message delivery ratio but high overhead, and leave the issue of garbage collection open. In this paper, we propose Named Data Distance Routing (NDDR), a named data based DTN routing approach which makes routing decisions for named data based on topological distance information. This helps to reduce the overhead of routing. We have implemented NDDR in the ONE simulation environment and the simulation results show that the proposed routing method has better performance in terms of message delivery ratio and network overhead compared with several typical replication-based DTN routing protocols.
{"title":"A named data approach for DTN routing","authors":"Yaoxing Li, Yuhong Li, L. Wolf, Anders Lindgren, Ji Wang","doi":"10.1109/WD.2017.7918135","DOIUrl":"https://doi.org/10.1109/WD.2017.7918135","url":null,"abstract":"Many common DTN routing protocols are replication-based, which have relatively good performance in terms of message delivery ratio but high overhead, and leave the issue of garbage collection open. In this paper, we propose Named Data Distance Routing (NDDR), a named data based DTN routing approach which makes routing decisions for named data based on topological distance information. This helps to reduce the overhead of routing. We have implemented NDDR in the ONE simulation environment and the simulation results show that the proposed routing method has better performance in terms of message delivery ratio and network overhead compared with several typical replication-based DTN routing protocols.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125260993","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}
IoT (Internet of Things) has attracted a lot of attention recently. IoT devices need to report their data or status to base stations at various frequencies. The IoT communications observed by a base station normally exhibit the following characteristics: (1) massively connected, (2) lightly loaded per packet, and (3) periodical or at least mostly predictable. The current design principals of communication networks, when applied to IoT scenarios, however, do not fit well to these requirements. For example, an IPv6 address is 128 bits, which is much longer than a 16-bit temperature report. Also, contending to send a small packet is not cost-effective. In this work, we propose a novel framework, which is slot-based, schedule-oriented, and identity-free for uploading IoT devices' data. We show that it fits very well for IoT applications. The main idea is to bundle time slots with certain hashing functions of device IDs, thus significantly reducing transmission overheads, including device IDs and contention overheads. The framework is applicable from small-scale body-area (wearable) networks to large-scale massively connected IoT networks. Our simulation results verify that this framework is very effective for IoT small data uploading.
物联网(Internet of Things)最近引起了人们的广泛关注。物联网设备需要以不同的频率向基站报告其数据或状态。基站观察到的物联网通信通常具有以下特征:(1)大规模连接，(2)每个数据包的负载较轻，以及(3)周期性或至少大部分可预测。然而，当应用于物联网场景时，当前通信网络的设计原则并不能很好地满足这些要求。例如，IPv6地址是128位，比16位的温度报告长得多。此外，争着发送一个小数据包是不划算的。在这项工作中，我们提出了一个新的框架，该框架基于插槽，面向时间表，并且无需身份来上传物联网设备的数据。我们证明它非常适合物联网应用。其主要思想是将时隙与设备id的某些散列函数捆绑在一起，从而显著降低传输开销，包括设备id和争用开销。该框架适用于从小规模身体区域(可穿戴)网络到大规模大规模连接的物联网网络。仿真结果验证了该框架对于物联网小数据上传是非常有效的。
{"title":"Give me a hint: An ID-free small data transmission protocol for dense IoT devices","authors":"Yi Ren, Ren-Jie Wu, Teng-Wei Huang, Y. Tseng","doi":"10.1109/WD.2017.7918126","DOIUrl":"https://doi.org/10.1109/WD.2017.7918126","url":null,"abstract":"IoT (Internet of Things) has attracted a lot of attention recently. IoT devices need to report their data or status to base stations at various frequencies. The IoT communications observed by a base station normally exhibit the following characteristics: (1) massively connected, (2) lightly loaded per packet, and (3) periodical or at least mostly predictable. The current design principals of communication networks, when applied to IoT scenarios, however, do not fit well to these requirements. For example, an IPv6 address is 128 bits, which is much longer than a 16-bit temperature report. Also, contending to send a small packet is not cost-effective. In this work, we propose a novel framework, which is slot-based, schedule-oriented, and identity-free for uploading IoT devices' data. We show that it fits very well for IoT applications. The main idea is to bundle time slots with certain hashing functions of device IDs, thus significantly reducing transmission overheads, including device IDs and contention overheads. The framework is applicable from small-scale body-area (wearable) networks to large-scale massively connected IoT networks. Our simulation results verify that this framework is very effective for IoT small data uploading.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121150184","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}
Visible light communications (VLC) is a potential candidate to be utilized in future 5G networks with energy efficient indoor and outdoor communications with available hardware components such as LED bulbs, TV screens and camera receivers. In this article, a low cost cellular infrastructure is proposed for Internet service providing (ISP). Hybrid TV radio frequency (RF) broadcast and display screen based VLC transmitters are utilized for the downlink while telescopes, camera receivers and LED arrays placed on the roofs of the houses are utilized for the uplink. In the downlink, display screens with quantum dot (QD), organic light emitting diode (OLED) and liquid-crystal display (LCD) technologies are compared in terms of response time, color gamut, spectral color output, contrast ratio and power consumption. Uplink capacity reaches hundreds of Kbit/s data rates for hundreds of houses at tens of kilometer distances with a simple and low cost system with less than hundred watts power consumption at each house while downlink capacity promises several Mbit/s at each house.
{"title":"Wireless Internet service providing for 5G with hybrid TV broadcast and visible light communications","authors":"B. Gulbahar, Sezgin Sencan","doi":"10.1109/WD.2017.7918117","DOIUrl":"https://doi.org/10.1109/WD.2017.7918117","url":null,"abstract":"Visible light communications (VLC) is a potential candidate to be utilized in future 5G networks with energy efficient indoor and outdoor communications with available hardware components such as LED bulbs, TV screens and camera receivers. In this article, a low cost cellular infrastructure is proposed for Internet service providing (ISP). Hybrid TV radio frequency (RF) broadcast and display screen based VLC transmitters are utilized for the downlink while telescopes, camera receivers and LED arrays placed on the roofs of the houses are utilized for the uplink. In the downlink, display screens with quantum dot (QD), organic light emitting diode (OLED) and liquid-crystal display (LCD) technologies are compared in terms of response time, color gamut, spectral color output, contrast ratio and power consumption. Uplink capacity reaches hundreds of Kbit/s data rates for hundreds of houses at tens of kilometer distances with a simple and low cost system with less than hundred watts power consumption at each house while downlink capacity promises several Mbit/s at each house.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122590390","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}
Content Delivery Networks (CDNs) are faced with an increasing and time varying demand of video contents. Their ability to promptly react to this demand is a success factor. Caching helps, but the question is: which contents to cache? Considering that the most popular contents should be cached, this paper focuses on how to predict the popularity of video contents. With real traces extracted from YouTube, we show that Auto-Regressive and Moving Average (ARMA) models can provide accurate predictions. We propose an original solution combining the predictions of several ARMA models. This solution achieves a better Hit Ratio and a smaller Update Ratio than the classical Least Frequently Used (LFU) caching technique.
{"title":"ARMA based popularity prediction for caching in Content Delivery Networks","authors":"N. Hassine, R. Milocco, P. Minet","doi":"10.1109/WD.2017.7918125","DOIUrl":"https://doi.org/10.1109/WD.2017.7918125","url":null,"abstract":"Content Delivery Networks (CDNs) are faced with an increasing and time varying demand of video contents. Their ability to promptly react to this demand is a success factor. Caching helps, but the question is: which contents to cache? Considering that the most popular contents should be cached, this paper focuses on how to predict the popularity of video contents. With real traces extracted from YouTube, we show that Auto-Regressive and Moving Average (ARMA) models can provide accurate predictions. We propose an original solution combining the predictions of several ARMA models. This solution achieves a better Hit Ratio and a smaller Update Ratio than the classical Least Frequently Used (LFU) caching technique.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123432790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we propose a model of the IEEE 802.11 Enhanced Distributed Coordination Function (EDCF) which can build different access priorities for different classes of traffic. These priorities are obtained using different inter frame spacings called Arbitration Inter Frame Spacings (AIFSs) to differentiate the access of different classes of traffic. When a node has a pending packet it must first wait for the channel to become idle for a given number A of mini-slots σ before starting to decrement its back-off; this interval of A mini-slots σ is called the AIFS. If the channel becomes busy before this back-off expires, then the node will have to to wait for another A mini-slots before starting to decrement its back-off again. The nodes can also use different back-off windows to further differentiate between different classes of traffic. The model we propose is much simpler than previous models [1], [2], [3] and handles the more general case of a Poisson arrival for the traffic. Moreover, the model presented here is designed for broadcast traffic whereas most models handle point-to-point IEEE 802.11 transmission. When we have two classes of traffic, the model leads to two coupled non-linear equations involving the transmission rates in each class of traffics. These equations can be easily solved using simple numerical methods. The model then allows the successful rate or the throughput for each class of traffic to be computed in a straightforward manner. Numerical examples derived from VANET scenarios show the direct and positive influence of the Arbitration Inter Frame Spacings on the performance of each class of traffic.
{"title":"Analysis of the IEEE 802.11 EDCF scheme for broadcast traffic: Application for VANETs","authors":"Younes Bouchaala, P. Mühlethaler, N. Achir","doi":"10.1109/WD.2017.7918156","DOIUrl":"https://doi.org/10.1109/WD.2017.7918156","url":null,"abstract":"In this paper we propose a model of the IEEE 802.11 Enhanced Distributed Coordination Function (EDCF) which can build different access priorities for different classes of traffic. These priorities are obtained using different inter frame spacings called Arbitration Inter Frame Spacings (AIFSs) to differentiate the access of different classes of traffic. When a node has a pending packet it must first wait for the channel to become idle for a given number A of mini-slots σ before starting to decrement its back-off; this interval of A mini-slots σ is called the AIFS. If the channel becomes busy before this back-off expires, then the node will have to to wait for another A mini-slots before starting to decrement its back-off again. The nodes can also use different back-off windows to further differentiate between different classes of traffic. The model we propose is much simpler than previous models [1], [2], [3] and handles the more general case of a Poisson arrival for the traffic. Moreover, the model presented here is designed for broadcast traffic whereas most models handle point-to-point IEEE 802.11 transmission. When we have two classes of traffic, the model leads to two coupled non-linear equations involving the transmission rates in each class of traffics. These equations can be easily solved using simple numerical methods. The model then allows the successful rate or the throughput for each class of traffic to be computed in a straightforward manner. Numerical examples derived from VANET scenarios show the direct and positive influence of the Arbitration Inter Frame Spacings on the performance of each class of traffic.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125645145","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}
Geological processes such tornados, avalanches or earthquakes can unleash adverse effects especially life losses, when we miss detect the presence of victims in devastated area. Statistics prove that death toll caused by natural hazards is becoming more prevalent from year to another. Meanwhile, telecommunications are booming with arising broadband networks. Besides, new wireless applications lead to the necessity of emerging a new communication fashion, especially in sensitive situation like public safety. Device to Device (D2D) communication, is one of promising alternative to circumvent public safety and to enhance emergency communications capabilities. The non assisted peer discovery concept over LTE raises some significant challenges so that in this paper, we propose a new approach that relies on spreading technique using orthogonal codes. Every victim signal will be spreaded by a code drawn from an orthogonal matrix called Hadamard matrix. Doing so, we improve the probability of successful detection of victims while keeping very low the probability of False Alarm thanks to the strengthening of signal by the spread process. The reliability of our proposal scheme is underlying by numerical simulations. Detection decision considers a correlation coefficient between the amount of received signal and the expected one spreaded to every orthogonal code. The coefficient is compared to a threshold in order to conclude a peer presence.
{"title":"D2D discovery approach based on spreading technique for public safety","authors":"L. Jedidi, F. Louati, M. Chekir, Hichem Besbes","doi":"10.1109/WD.2017.7918149","DOIUrl":"https://doi.org/10.1109/WD.2017.7918149","url":null,"abstract":"Geological processes such tornados, avalanches or earthquakes can unleash adverse effects especially life losses, when we miss detect the presence of victims in devastated area. Statistics prove that death toll caused by natural hazards is becoming more prevalent from year to another. Meanwhile, telecommunications are booming with arising broadband networks. Besides, new wireless applications lead to the necessity of emerging a new communication fashion, especially in sensitive situation like public safety. Device to Device (D2D) communication, is one of promising alternative to circumvent public safety and to enhance emergency communications capabilities. The non assisted peer discovery concept over LTE raises some significant challenges so that in this paper, we propose a new approach that relies on spreading technique using orthogonal codes. Every victim signal will be spreaded by a code drawn from an orthogonal matrix called Hadamard matrix. Doing so, we improve the probability of successful detection of victims while keeping very low the probability of False Alarm thanks to the strengthening of signal by the spread process. The reliability of our proposal scheme is underlying by numerical simulations. Detection decision considers a correlation coefficient between the amount of received signal and the expected one spreaded to every orthogonal code. The coefficient is compared to a threshold in order to conclude a peer presence.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129893758","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}
Composing pervasive services can be a challenging task, especially in networks where connectivity disruptions are prevalent and unpredictable, such as in networks formed spontaneously by connected things. In this paper, we propose a REST service composing system for such networks. This system has been built upon an opportunistic computing middleware to support connectivity disruptions. It implements orchestration-based and choreography-based composition techniques, and uses inter-contact time average as a metric to carry out the composition process.
{"title":"Opportunistic service composition in pervasive networks","authors":"Fadhlallah Baklouti, N. L. Sommer, Y. Mahéo","doi":"10.1109/WD.2017.7918150","DOIUrl":"https://doi.org/10.1109/WD.2017.7918150","url":null,"abstract":"Composing pervasive services can be a challenging task, especially in networks where connectivity disruptions are prevalent and unpredictable, such as in networks formed spontaneously by connected things. In this paper, we propose a REST service composing system for such networks. This system has been built upon an opportunistic computing middleware to support connectivity disruptions. It implements orchestration-based and choreography-based composition techniques, and uses inter-contact time average as a metric to carry out the composition process.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129295093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a cooperative cyclostationary compressed spectrum sensing algorithm is proposed to enable accurate, reliable and fast sensing of wideband spectrum. In the proposed algorithm each secondary-user (SU) sends the compressed data vector to the fusion center (FC) which has a copy of the sensing matrices for all cooperated SUs. Then, at the FC, the fast fourier transform accumulation method (FAM) based on cooperative multitask compressive sensing (MCS) algorithm is employed to recover the spectral correlation function (SCF) from the compressed measurements. The proposed algorithm has two main components. The first component exploits the cooperation between SUs to produce an estimate of the investigated signal spectrum using multi-task compressive sensing. In the second component, the cyclic feature detection is performed based on the recovered SCF function. Simulation results demonstrate the robustness and the effectiveness of the proposed framework against both sampling rate reduction and noise uncertainty.
{"title":"Cyclostationary-based cooperative compressed wideband spectrum sensing in cognitive radio networks","authors":"Osama Elnahas, M. Elsabrouty","doi":"10.1109/WD.2017.7918119","DOIUrl":"https://doi.org/10.1109/WD.2017.7918119","url":null,"abstract":"In this paper, a cooperative cyclostationary compressed spectrum sensing algorithm is proposed to enable accurate, reliable and fast sensing of wideband spectrum. In the proposed algorithm each secondary-user (SU) sends the compressed data vector to the fusion center (FC) which has a copy of the sensing matrices for all cooperated SUs. Then, at the FC, the fast fourier transform accumulation method (FAM) based on cooperative multitask compressive sensing (MCS) algorithm is employed to recover the spectral correlation function (SCF) from the compressed measurements. The proposed algorithm has two main components. The first component exploits the cooperation between SUs to produce an estimate of the investigated signal spectrum using multi-task compressive sensing. In the second component, the cyclic feature detection is performed based on the recovered SCF function. Simulation results demonstrate the robustness and the effectiveness of the proposed framework against both sampling rate reduction and noise uncertainty.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130157761","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}
Andrea Lupia, Kerrache Chaker Abdelaziz, F. Rango, C. Calafate, Juan-Carlos Cano, P. Manzoni
Detecting malicious and selfish nodes in mobile and wireless networks is a task that typically relies on watchdog techniques. However, such medium overhearing techniques are prone to cause a high energy consumption. In this paper we propose a distributed time division-based monitoring strategy to achieve the high security levels required while consuming less energy. Our proposal involves both trust and link duration among honest peers to fairly divide the monitoring period, and takes advantage of the periodically exchanged hello messages to make this solution fully distributed. Simulations results evidence our proposal energy efficiency, especially for high density scenarios (>100 nodes) where the consumption became stable and does not increase with the number of nodes (<4300 W·s), while ensuring high detection ratios of malicious nodes (>90%).
{"title":"TEEM: Trust-based Energy-Efficient Distributed Monitoring for Mobile Ad-hoc Networks","authors":"Andrea Lupia, Kerrache Chaker Abdelaziz, F. Rango, C. Calafate, Juan-Carlos Cano, P. Manzoni","doi":"10.1109/WD.2017.7918128","DOIUrl":"https://doi.org/10.1109/WD.2017.7918128","url":null,"abstract":"Detecting malicious and selfish nodes in mobile and wireless networks is a task that typically relies on watchdog techniques. However, such medium overhearing techniques are prone to cause a high energy consumption. In this paper we propose a distributed time division-based monitoring strategy to achieve the high security levels required while consuming less energy. Our proposal involves both trust and link duration among honest peers to fairly divide the monitoring period, and takes advantage of the periodically exchanged hello messages to make this solution fully distributed. Simulations results evidence our proposal energy efficiency, especially for high density scenarios (>100 nodes) where the consumption became stable and does not increase with the number of nodes (<4300 W·s), while ensuring high detection ratios of malicious nodes (>90%).","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134532665","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}
Shun-Cheng Zhan, Shi-Chung Chang, Chun-Ting Chou, Z. Tsai
Licensed shared access (LSA) is an emergent regulatory approach that allows spectrum licensed for shared secondary use among multiple entities while maintaining a level of quality of service. There have been bands planned and pilot trials conducted for LSA such as 2.3–2.4 GHz in European Union. Market mechanism and platform to realize LSA among regulator, primary license holders and secondary LSA licensees remain outstanding challenges. This paper designs and implements a prototype of online Auction platform for LSA-based Short-term Spectrum Sharing (ALS3) by exploiting two economically-robust and computation time efficient single-round auction mechanisms, one unilateral and one bilateral, that Zhan et al. proposed. Core to system implementation of ALS3 is a solution stack of Windows-Apache-MySQL-PHP (WAMP), which runs auction algorithms in the background, facilitates market player communications and brokerage database management, and provides user friendly interfaces. Performance tests over scenarios of realistic dimensions show that ALS3 completes one single-round auction within a few minutes after bid submissions. This prototype platform not only has the potential for applications to future LSA markets but may also serve as baseline environment for LSA trading behavior experiments.
{"title":"Spectrum Sharing Auction platform for Short-term licensed shared access","authors":"Shun-Cheng Zhan, Shi-Chung Chang, Chun-Ting Chou, Z. Tsai","doi":"10.1109/WD.2017.7918140","DOIUrl":"https://doi.org/10.1109/WD.2017.7918140","url":null,"abstract":"Licensed shared access (LSA) is an emergent regulatory approach that allows spectrum licensed for shared secondary use among multiple entities while maintaining a level of quality of service. There have been bands planned and pilot trials conducted for LSA such as 2.3–2.4 GHz in European Union. Market mechanism and platform to realize LSA among regulator, primary license holders and secondary LSA licensees remain outstanding challenges. This paper designs and implements a prototype of online Auction platform for LSA-based Short-term Spectrum Sharing (ALS3) by exploiting two economically-robust and computation time efficient single-round auction mechanisms, one unilateral and one bilateral, that Zhan et al. proposed. Core to system implementation of ALS3 is a solution stack of Windows-Apache-MySQL-PHP (WAMP), which runs auction algorithms in the background, facilitates market player communications and brokerage database management, and provides user friendly interfaces. Performance tests over scenarios of realistic dimensions show that ALS3 completes one single-round auction within a few minutes after bid submissions. This prototype platform not only has the potential for applications to future LSA markets but may also serve as baseline environment for LSA trading behavior experiments.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127897699","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
扫码关注我们
求助内容：
应助结果提醒方式：