Pub Date : 2015-04-22DOI: 10.1109/LANMAN.2015.7114718
ChaoYi Bian, Tong Zhao, Xiaoming Li, W. Yan
Named Data Networking (NDN) is a data-centric architecture designed for the future Internet. Existing works show that NDN brings significant performance improvement for typical content-centric applications, and can also fit the mobile environment well. However, directly applying NDN to Vehicular Ad hoc NETworks (VANETs) is confronted with great challenges due to the high mobility of vehicles. Most applications in VANETs are relied on data dissemination mechanisms. Therefore, we aim to improve the performance of NDN packet forwarding for the efficient content delivery in urban VANET scenarios. Specifically, we introduce the geo-location information to the NDN forwarding plane, and propose a geo-based forwarding strategy to make NDN fit the urban VANETs. Simulation results show our strategy can achieve 27% ~ 75% higher request success ratio, and 40% ~ 80% lower delay compared with the default NDN strategy in urban scenarios with different vehicle densities.
{"title":"Boosting named data networking for efficient packet forwarding in urban VANET scenarios","authors":"ChaoYi Bian, Tong Zhao, Xiaoming Li, W. Yan","doi":"10.1109/LANMAN.2015.7114718","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114718","url":null,"abstract":"Named Data Networking (NDN) is a data-centric architecture designed for the future Internet. Existing works show that NDN brings significant performance improvement for typical content-centric applications, and can also fit the mobile environment well. However, directly applying NDN to Vehicular Ad hoc NETworks (VANETs) is confronted with great challenges due to the high mobility of vehicles. Most applications in VANETs are relied on data dissemination mechanisms. Therefore, we aim to improve the performance of NDN packet forwarding for the efficient content delivery in urban VANET scenarios. Specifically, we introduce the geo-location information to the NDN forwarding plane, and propose a geo-based forwarding strategy to make NDN fit the urban VANETs. Simulation results show our strategy can achieve 27% ~ 75% higher request success ratio, and 40% ~ 80% lower delay compared with the default NDN strategy in urban scenarios with different vehicle densities.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132137675","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114717
Yuanhong Huo, Xiaoyang Li, Wei Wang, Dake Liu
A high performance table-based architecture implementation for CRC (cyclic redundancy check) algorithms is proposed. The architecture is designed based on a highly parallel CRC algorithm. The algorithm first divides a given message with any length into bytes. Then it performs CRC computation using lookup tables among the divided bytes in parallel. At last, the results are XORed to obtain the CRC value of the given message. The algorithm is table-based and can accelerate different CRC algorithms. Based on the algorithm, the architecture is designed to accelerate CRC algorithms with high parallelism and flexibility. The architecture is configurable and can support CRC algorithms such as CRC32, CRC24, CRC-CCITT, CRC16, CRC8. CRC value of 128-bit input data can be generated in one cycle. Our method also allows calculation over data that is less than 128-bit wide without increasing hardware cost. With 128-bit input each clock cycle, the throughput of the proposed architecture reaches up to 100 Gbps by utilizing 16 KB SRAM (Static Random Access Memory) with about 12% area reduction compared with previous work.
{"title":"High performance table-based architecture for parallel CRC calculation","authors":"Yuanhong Huo, Xiaoyang Li, Wei Wang, Dake Liu","doi":"10.1109/LANMAN.2015.7114717","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114717","url":null,"abstract":"A high performance table-based architecture implementation for CRC (cyclic redundancy check) algorithms is proposed. The architecture is designed based on a highly parallel CRC algorithm. The algorithm first divides a given message with any length into bytes. Then it performs CRC computation using lookup tables among the divided bytes in parallel. At last, the results are XORed to obtain the CRC value of the given message. The algorithm is table-based and can accelerate different CRC algorithms. Based on the algorithm, the architecture is designed to accelerate CRC algorithms with high parallelism and flexibility. The architecture is configurable and can support CRC algorithms such as CRC32, CRC24, CRC-CCITT, CRC16, CRC8. CRC value of 128-bit input data can be generated in one cycle. Our method also allows calculation over data that is less than 128-bit wide without increasing hardware cost. With 128-bit input each clock cycle, the throughput of the proposed architecture reaches up to 100 Gbps by utilizing 16 KB SRAM (Static Random Access Memory) with about 12% area reduction compared with previous work.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"2 37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122577840","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114739
Saheed A. Adegbite, S. McMeekin, B. Stewart
This paper studies control format indicator (CFI) estimation methods in 4G-LTE communication systems. CFI is an essential control signal in LTE, and must be correctly detected at the receiver to avoid degraded system performance. The standard method of CFI detection involves the use of the Maximum Likelihood (ML) estimation criterion. Unfortunately, ML decoding performance relies on accurate channel estimation, and as a consequence may result in poor CFI decoding when channel estimates are poor. To improve CFI detection in severe fading channel conditions, a time-domain decision rule that requires no channel estimation, is proposed. Results show that when compared with the ML approach, the proposed method reduces the probability of CFI estimation error in the form of reduced block error rate.
{"title":"Improved PCFICH decoding in LTE systems","authors":"Saheed A. Adegbite, S. McMeekin, B. Stewart","doi":"10.1109/LANMAN.2015.7114739","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114739","url":null,"abstract":"This paper studies control format indicator (CFI) estimation methods in 4G-LTE communication systems. CFI is an essential control signal in LTE, and must be correctly detected at the receiver to avoid degraded system performance. The standard method of CFI detection involves the use of the Maximum Likelihood (ML) estimation criterion. Unfortunately, ML decoding performance relies on accurate channel estimation, and as a consequence may result in poor CFI decoding when channel estimates are poor. To improve CFI detection in severe fading channel conditions, a time-domain decision rule that requires no channel estimation, is proposed. Results show that when compared with the ML approach, the proposed method reduces the probability of CFI estimation error in the form of reduced block error rate.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134517559","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114732
Saheed A. Adegbite, S. McMeekin, B. Stewart
To reduce the occurrence of high peak-to-average power ratio (PAPR), this paper introduces prolate-binary sequences, and their application in orthogonal frequency division multiplexing (OFDM) systems that implement selected mapping (SLM). Through computer simulation, it is shown that the proposed prolate-binary sequences offer combined improved PAPR reduction performance, and reduced computational complexity compared with Riemann-binary sequences.
{"title":"Prolate-binary sequences for SLM based papr reduction in OFDM systems","authors":"Saheed A. Adegbite, S. McMeekin, B. Stewart","doi":"10.1109/LANMAN.2015.7114732","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114732","url":null,"abstract":"To reduce the occurrence of high peak-to-average power ratio (PAPR), this paper introduces prolate-binary sequences, and their application in orthogonal frequency division multiplexing (OFDM) systems that implement selected mapping (SLM). Through computer simulation, it is shown that the proposed prolate-binary sequences offer combined improved PAPR reduction performance, and reduced computational complexity compared with Riemann-binary sequences.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133044659","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114716
Hyunsub Kim, Hyukyeon Lee, Jaeseok Kim
In this paper, we propose a minimum-mean-squared-error (MMSE)-based lattice-reduction (LR)-aided fixed-complexity sphere decoder (FSD) for low-complexity near-maximum-likelihood (near-ML) multiple-input multiple-output (MIMO) detection. In order for the FSD to achieve optimal performance, the number of full expansion (FE) stages should be sufficient, which is the major cause of the increase in the computational complexity when either a large signal constellation or a large number of antennas are adopted. However, the proposed algorithm maintains the near-ML performance with the aid of the MMSE-based LR algorithm while reducing the number of FE stages. Although there exists the increase in the computational complexity for the application of the additional processing elements, the decrease in the number of FE stages results in the lower computational complexity of the overall algorithm. The numerical analysis demonstrates that there is a considerable decrease in the computational complexity while the performance degradation is negligible, compared to the optimal FSD.
{"title":"MMSE-based lattice-reduction-aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection","authors":"Hyunsub Kim, Hyukyeon Lee, Jaeseok Kim","doi":"10.1109/LANMAN.2015.7114716","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114716","url":null,"abstract":"In this paper, we propose a minimum-mean-squared-error (MMSE)-based lattice-reduction (LR)-aided fixed-complexity sphere decoder (FSD) for low-complexity near-maximum-likelihood (near-ML) multiple-input multiple-output (MIMO) detection. In order for the FSD to achieve optimal performance, the number of full expansion (FE) stages should be sufficient, which is the major cause of the increase in the computational complexity when either a large signal constellation or a large number of antennas are adopted. However, the proposed algorithm maintains the near-ML performance with the aid of the MMSE-based LR algorithm while reducing the number of FE stages. Although there exists the increase in the computational complexity for the application of the additional processing elements, the decrease in the number of FE stages results in the lower computational complexity of the overall algorithm. The numerical analysis demonstrates that there is a considerable decrease in the computational complexity while the performance degradation is negligible, compared to the optimal FSD.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125154394","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114724
Hong Jiang, Shuqiao Chen, Hong-chao Hu, Mingming Zhang
DDoS flooding attack is a critical threat to the normal operation of network. However, current feature-based detection methods are cheated by hackers easily and most of these mechanisms do not differentiate between DDoS flooding attacks and legitimate random flash crowds with feature independent and location extended. To address the challenges, we propose a two-stage detection strategy by combining superpoints and flow similarity measurement. To locate the suspicious flows, polymerization degree of destination superpoints is introduced in a moving time window mechanism. Based on the suspicious flows, a sliding-detection algorithm is presented for distinguishing flooding attacks from flash crowds with similarity metrics. Computer simulation results indicate that our detection approach can detect DDoS flooding attacks efficiently and Total Variation Distance (TVD) is the most suitable metric for discriminating DDoS flooding attack flows from flash crowds. Built on flow arrivals, the proposed mechanism is practical for the attack detection on high speed links.
{"title":"Superpoint-based detection against distributed denial of service (DDoS) flooding attacks","authors":"Hong Jiang, Shuqiao Chen, Hong-chao Hu, Mingming Zhang","doi":"10.1109/LANMAN.2015.7114724","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114724","url":null,"abstract":"DDoS flooding attack is a critical threat to the normal operation of network. However, current feature-based detection methods are cheated by hackers easily and most of these mechanisms do not differentiate between DDoS flooding attacks and legitimate random flash crowds with feature independent and location extended. To address the challenges, we propose a two-stage detection strategy by combining superpoints and flow similarity measurement. To locate the suspicious flows, polymerization degree of destination superpoints is introduced in a moving time window mechanism. Based on the suspicious flows, a sliding-detection algorithm is presented for distinguishing flooding attacks from flash crowds with similarity metrics. Computer simulation results indicate that our detection approach can detect DDoS flooding attacks efficiently and Total Variation Distance (TVD) is the most suitable metric for discriminating DDoS flooding attack flows from flash crowds. Built on flow arrivals, the proposed mechanism is practical for the attack detection on high speed links.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128018186","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114721
Takahiko Yamada, Toshikazu Nishimura
This paper presents possibility of dense small cell network for local areas from a view of network control considering two types of applications; one is 100m cells for a major road supporting vehicles' mobility and another one is 10m cells for campuses supporting walking mobility. They adopt 3GLTE protocol after slight modification. Handover is directly triggered from a UE (User Equipment) to a target BS (base station) to shorten the handover period though it is relayed on a serving BS in conventional systems while drawing large latency due to backhaul communications. The direct request uses SR (Schedule Request) signal on PUCCH (Physical Uplink Control Channel) of 3G-LTE protocol. This can be allowed by short propagating delay in a small cell and synchronous operation of all BSs under clock of PON (Passive Optical Network) used for the backhaul network. Handover resources like SR codes, downward frames, and terminal ID are reserved among the target UE and a group of BSs next to one serving the target UE before handover. Cells surrounding the target UE follow the move of the UE always confining the target UE in the cells with the reserved handover resources.
本文从网络控制的角度考虑了两类应用，提出了局部密集小蜂窝网络的可能性;一个是100米的单元用于支持主要道路车辆的机动性，另一个是10米的单元用于支持校园步行的机动性。他们在稍作修改后采用了3GLTE协议。切换从UE(用户设备)直接触发到目标BS(基站)，以缩短切换周期，尽管在传统系统中它是在服务BS上中继的，但由于回程通信而产生很大的延迟。直接请求使用3G-LTE协议PUCCH (Physical Uplink Control Channel)上的SR (Schedule request)信号。这可以通过在一个小小区内的短传播延迟和在回程网络使用的PON(无源光网络)时钟下所有BSs的同步操作来实现。SR码、下行帧、终端标识码等切换资源在切换前在目标终端和服务目标终端的一组BSs之间保留。围绕目标终端的单元遵循终端的移动，始终将目标终端限制在具有保留切换资源的单元中。
{"title":"Virtual-single-cell wireless networks with 3G-LTE-based protocol and PON for backhaul network","authors":"Takahiko Yamada, Toshikazu Nishimura","doi":"10.1109/LANMAN.2015.7114721","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114721","url":null,"abstract":"This paper presents possibility of dense small cell network for local areas from a view of network control considering two types of applications; one is 100m cells for a major road supporting vehicles' mobility and another one is 10m cells for campuses supporting walking mobility. They adopt 3GLTE protocol after slight modification. Handover is directly triggered from a UE (User Equipment) to a target BS (base station) to shorten the handover period though it is relayed on a serving BS in conventional systems while drawing large latency due to backhaul communications. The direct request uses SR (Schedule Request) signal on PUCCH (Physical Uplink Control Channel) of 3G-LTE protocol. This can be allowed by short propagating delay in a small cell and synchronous operation of all BSs under clock of PON (Passive Optical Network) used for the backhaul network. Handover resources like SR codes, downward frames, and terminal ID are reserved among the target UE and a group of BSs next to one serving the target UE before handover. Cells surrounding the target UE follow the move of the UE always confining the target UE in the cells with the reserved handover resources.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116014533","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114719
G. Carofiglio, Massimo Gallo, L. Muscariello, Diego Perino
The rapid traffic growth fueled by mobile devices spread and high speed network access calls for substantial innovation at network layer. The content-centric nature of Internet usage highlights the limitations of the host-centric model in coping with dynamic content-to-location binding, mobility, multicast, multi-homing, etc. If transmission capacity speedups in the backhaul may hide inefficiencies in the short term, the hostcentric communication model needs to be revisited to sustain future mobile demand. In this paper, we first identify and quantify the opportunities for backhaul evolution by analyzing a large set of traffic measurements collected between mobile core and backhaul of Orange France. The analysis reveals that 50% of HTTP requests are cacheable and traffic can be reduced from 60% to 95% during the peak hour by using 350GBs to 1TB of memory overall. Motivated by such significant opportunities for latency reduction and network cost savings, we present a solution based on Information-Centric Networking (ICN). First results of a large scale experimentation with 100 Linux servers and customized software, in a realistic network setting, provide a glimpse into ICN gains even under naive caching: a factor three reduction in delivery time and almost 40% bandwidth savings, when compared to existing alternatives.
{"title":"Scalable mobile backhauling via information-centric networking","authors":"G. Carofiglio, Massimo Gallo, L. Muscariello, Diego Perino","doi":"10.1109/LANMAN.2015.7114719","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114719","url":null,"abstract":"The rapid traffic growth fueled by mobile devices spread and high speed network access calls for substantial innovation at network layer. The content-centric nature of Internet usage highlights the limitations of the host-centric model in coping with dynamic content-to-location binding, mobility, multicast, multi-homing, etc. If transmission capacity speedups in the backhaul may hide inefficiencies in the short term, the hostcentric communication model needs to be revisited to sustain future mobile demand. In this paper, we first identify and quantify the opportunities for backhaul evolution by analyzing a large set of traffic measurements collected between mobile core and backhaul of Orange France. The analysis reveals that 50% of HTTP requests are cacheable and traffic can be reduced from 60% to 95% during the peak hour by using 350GBs to 1TB of memory overall. Motivated by such significant opportunities for latency reduction and network cost savings, we present a solution based on Information-Centric Networking (ICN). First results of a large scale experimentation with 100 Linux servers and customized software, in a realistic network setting, provide a glimpse into ICN gains even under naive caching: a factor three reduction in delivery time and almost 40% bandwidth savings, when compared to existing alternatives.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115979877","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114726
Xiaolong Ma, Fanzi Zeng, Jisheng Xu
In this paper, we focused on how to get CRs collaborate effectively as well as maximize energy savings in cognitive radio sensor network. We have established a model of evolutionary game between a cognitive sensors. In order to let cognitive sensors sense spectrum effectively, we designed a contribution-punishment mechanism, which can stimulate high SNR sensors to participate in spectrum sensing. Additionally, in order to reduce the wasted energy of sensors in idle, we introduced periodic sleep-listen mechanism. Finally, we simulated behavior dynamics for a 6-player polymorphic population game and compared our proposed scheme with non-periodic sleep-listen mechanism scheme. Result shows that our proposed scheme can stimulate high SNR sensors to participate in spectrum sensing effectively and can make the system more energy efficient.
{"title":"A novel energy efficient cooperative spectrum sensing scheme for cognitive radio sensor network based on evolutionary game","authors":"Xiaolong Ma, Fanzi Zeng, Jisheng Xu","doi":"10.1109/LANMAN.2015.7114726","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114726","url":null,"abstract":"In this paper, we focused on how to get CRs collaborate effectively as well as maximize energy savings in cognitive radio sensor network. We have established a model of evolutionary game between a cognitive sensors. In order to let cognitive sensors sense spectrum effectively, we designed a contribution-punishment mechanism, which can stimulate high SNR sensors to participate in spectrum sensing. Additionally, in order to reduce the wasted energy of sensors in idle, we introduced periodic sleep-listen mechanism. Finally, we simulated behavior dynamics for a 6-player polymorphic population game and compared our proposed scheme with non-periodic sleep-listen mechanism scheme. Result shows that our proposed scheme can stimulate high SNR sensors to participate in spectrum sensing effectively and can make the system more energy efficient.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114867966","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 : 2015-04-22DOI: 10.1109/LANMAN.2015.7114727
Yipeng Zhou, Liang Chen, Mi Jing, Zhong Ming, D. Chiu
Crowdsourcing-based video service systems, e.g., Thunder Crystal, are novel content distribution platforms composed by a large number of agent devices, acting like miniservers. Most agents are normal Internet users who would like to earn rewarded cash by uploading content through their devices. Compared with CDN, the bandwidth cost is much cheaper; while compared with Peer-to-Peer(P2P), the bandwidth supply is more stable. In this work, we create a stochastic model to analyze the live and VoD streaming performance in such crowdsourcingbased video service systems. Simulation is conducted to validate the accuracy of our analytical results.
{"title":"Analyzing streaming performance in crowdsourcing-based video service systems","authors":"Yipeng Zhou, Liang Chen, Mi Jing, Zhong Ming, D. Chiu","doi":"10.1109/LANMAN.2015.7114727","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114727","url":null,"abstract":"Crowdsourcing-based video service systems, e.g., Thunder Crystal, are novel content distribution platforms composed by a large number of agent devices, acting like miniservers. Most agents are normal Internet users who would like to earn rewarded cash by uploading content through their devices. Compared with CDN, the bandwidth cost is much cheaper; while compared with Peer-to-Peer(P2P), the bandwidth supply is more stable. In this work, we create a stochastic model to analyze the live and VoD streaming performance in such crowdsourcingbased video service systems. Simulation is conducted to validate the accuracy of our analytical results.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131320089","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
扫码关注我们
求助内容：
应助结果提醒方式：