Jiajia Liu, Hiroki Nishiyama, N. Kato, T. Kumagai, A. Takahara
{"title":"Modeling ad hoc mobile networks: The general k-hop relay routing","authors":"Jiajia Liu, Hiroki Nishiyama, N. Kato, T. Kumagai, A. Takahara","doi":"10.1109/GLOCOM.2013.6831042","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831042","url":null,"abstract":"In the last decade, there has been a tremendous increase in both the number of mobile devices and the consumer demand for mobile data communication. As a general network architecture, ad hoc mobile networks are expected to offload a large amount of mobile traffic in lots of promising application scenarios. However, how to achieve a good balance between delivery performances (like delivery delay and delivery probability) and network resource consumptions (like power energy and buffer storage) remains an extremely challenging problem. In this paper, we focus on the general k-hop relay routing, which covers a lot of popular routing schemes as special cases, such as the direct transmission (k = 1), the two-hop relay algorithm (k = 2), and the epidemic routing (k = n - 1). We first develop absorbing continuous-time Markov chain models to characterize the complicated message delivery process under the general k-hop relay routing, and then conduct Markovian analysis to derive all the above important performance metrics. Finally, extensive numerical results are presented to illustrate the achievable delivery performances under the general k-hop relay and the possible performance trade-offs there.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117142355","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}
{"title":"Improvement of bandwidth efficiency for ultraviolet communication through M×N-ary variable width period modulation","authors":"Shengyang He, Guanghui Ren, Z. Zhong","doi":"10.1109/GLOCOM.2013.6831654","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831654","url":null,"abstract":"By describing the principle and parameter selection guide in detail, M×N-ary variable width period modulation (MNVWPM) is proposed in this paper to increase the bandwidth efficiency for ultraviolet communication (UVC) through intensity modulation and direct detection. Theoretical analysis and experimental results indicate that, MNVWPM can be used to achieve a bandwidth efficiency higher than those of commonly used on-off keying (OOK) or pulse position modulation (PPM).","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123547760","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}
Zhengwei Zhao, Zhixiong Jiang, Chunyang Lu, Yushan Cai, Jingping Bi
{"title":"Towards coordinated congestion control and load balancing in datacenter networks","authors":"Zhengwei Zhao, Zhixiong Jiang, Chunyang Lu, Yushan Cai, Jingping Bi","doi":"10.1109/GLOCOM.2013.6831251","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831251","url":null,"abstract":"Today's data centers are facing extreme challenges in providing low latency and high throughput simultaneously for their applications. However, the fair sharing congestion control algorithms, together with the hash-based load balancing mechanisms, seriously impede the satisfaction of such requirements. In this paper, we use threshold-based signaling and marking schemes to seamlessly integrate load balancing with congestion control protocols. Through adaptive per-packet load balancing, we evenly split network traffic across multiple paths. Meanwhile, we adaptively react to ECN in the case of congestion, and prioritize flows according to their latency requirements. Using realistic data center workloads, we show that, compared to the state-of-the-art load balancing and TCP, our approach improves the application throughput and mean flow completion time by 30-50% and 40-80%, respectively.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"15 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120841061","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}
{"title":"Symbol-level combining for hybrid ARQ on interference-aware successive decoding","authors":"H. Kwon, Jungwon Lee, Inyup Kang","doi":"10.1109/GLOCOM.2013.6831640","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831640","url":null,"abstract":"This paper proposes a symbol-level combining (SLC) scheme for hybrid automatic-repeat-request (HARQ), being used with an interference-aware successive decoding (IASD) algorithm [1]. Recently, it is revealed that the capacity in an interference channel over point-to-point codes can be achieved by combining two schemes: one is jointly decoding an interfering signal with a serving signal and the other is treating it as noise. Due to its high computational complexity, joint decoding can be practically replaced with successive decoding as suggested in [1]. However, when HARQ is enabled, it has been not well defined how interference should be handled at each transmission. Since interference is changed at each transmission, it is not helpful to store the information of interfering signals. Instead, the proposed scheme employes the decoded information of interfering signals in order to convert an interference channel to a point-to-point channel. The proposed scheme only requires a fixed size of memory and does not increase the detector complexity of IASD with respect to the number of retransmission. Simulation results demonstrate the superiority of the proposed scheme to the optimal SLC scheme at the conventional receiver.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"51 90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124601880","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}
{"title":"A clustering-based coordinated spectrum sensing in wideband large-scale cognitive radio networks","authors":"Behzad Shahrasbi, N. Rahnavard","doi":"10.1109/GLOCOM.2013.6831221","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831221","url":null,"abstract":"Efficient spectrum sensing is one of the key features that allows the implementation of fully agile cognitive radio networks. In this paper, we present an efficient coordinated spectrum sensing algorithm for wideband large-scale cognitive radio networks. Our approach is based on clustering secondary users according to their spectrum sensing results and performing the spectrum sensing tasks collaboratively within each cluster. In addition, the clusters can collaborate with each other to achieve an optimal distributed spectrum sensing across the network. We set up a cognitive radio framework and evaluate our proposed algorithm using numerical simulations. We show that the proposed algorithm increases the successful channel sensing rate at a reasonable computational cost.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124742450","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}
{"title":"Link aware HTTP Adaptive Streaming for enhanced quality of experience","authors":"V. Ramamurthi, O. Oyman","doi":"10.1109/GLOCOM.2013.6831314","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831314","url":null,"abstract":"We propose a physical link-aware video rate adaptation approach for HTTP Adaptive Streaming (HAS) systems. This approach is especially suited for wireless links, whose characteristics fluctuate with time depending on the physical environment as well as load on the system. Our novel strategy relies on estimating the available link bandwidth from physical layer goodput information and using it as a complement to higher layer estimates. We develop simple novel video rate-adaptation enhancements that use physical layer goodput information to - i) improve startup video quality under tolerable startup delay and ii) reduce re-buffering during video playback. Simulation results on an LTE (Long Term Evolution) system level simulator indicate improved video quality and lower re-buffering percentage using our approach.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129509900","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}
{"title":"Time efficient data aggregation scheduling in Cognitive Radio Networks","authors":"Mingyuan Yan, S. Ji, Zhipeng Cai","doi":"10.1109/GLOCOM.2013.6831235","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831235","url":null,"abstract":"Cognitive Radio Networks (CRNs) have been proposed as a promising technology to alleviate the spectrum shortage and under-utilization problem. A large amount of research effort has been put on CRNs. However, little attention has been paid to data aggregation problem, one of the most important communication protocols in wireless networks due to its efficiency in both energy conservation and latency reduction. In this paper, we investigate the minimum latency data aggregation scheduling problem in CRNs. Considering the difficulty of this problem, two practical distributed algorithms under the Unit Disk Graph interference model and the Physical Interference Model are proposed. Extensive simulation results indicate that the proposed algorithms have good latency performance in various network scenarios.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129908388","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}
Guangshuo Chen, Xiao-Yang Liu, L. Kong, Jialiang Lu, Yu Gu, W. Shu, Minyou Wu
{"title":"Multiple attributes-based data recovery in wireless sensor networks","authors":"Guangshuo Chen, Xiao-Yang Liu, L. Kong, Jialiang Lu, Yu Gu, W. Shu, Minyou Wu","doi":"10.1109/GLOCOM.2013.6831055","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831055","url":null,"abstract":"In wireless sensor networks (WSNs), since many basic scientific works heavily rely on the complete sensory data, data recovery is an indispensable operation against the data loss. Several works have studied the missing value problem. However, existing solutions cannot achieve satisfactory accuracy due to special loss patterns and high loss rates in WSNs. In this work, we propose a multiple attributes-based recovery algorithm which can provide high accuracy. Firstly, based on two real datasets, the Intel Indoor project and the GreenOrbs project, we reveal that such correlations are strong, e.g., the change of temperature and light illumination usually has strong correlation. Secondly, motivated by this observation, we develop a Multi-Attribute-assistant Compressive-Sensing-based (MACS) algorithm to optimize the recovery accuracy. Finally, real trace-driven simulation is performed. The results show that MACS outperforms the existing solutions. Typically, MACS can recover all data with less than 5% error when the loss rate is less than 60%. Even when losing 85% data, all missing data can be estimated by MACS with less than 10% error.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128299033","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}
{"title":"Can cooperation reduce the average transmitted power per participating user?","authors":"D. Michalopoulos, R. Schober","doi":"10.1109/GLOCOM.2013.6831679","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831679","url":null,"abstract":"The answer is (in general) affirmative: For a given target bit error rate (BER), cooperation reduces the average transmitted power per user when partners are appropriately selected. The more cooperating users are available and the larger the propagation exponent, the larger the reduction on transmitted power per user. This conclusion is drawn from a preliminary study which considers a community of users located randomly along a straight line. The users communicate with a Base Station (BS) located at the end of this line, and the transmission is subject to path loss. The communication is established either directly (Direct Mode), or via another member of the community (Relaying Mode). We show that the total power needed to achieve a certain BER at the BS is on average lower for the Relaying Mode than for the Direct Mode, even without exploiting any receive diversity benefit. There exist cases, however, where the Relaying Mode is not beneficial. This is true for environments with a propagation exponent smaller than two (δ <; 2). For δ = 2, the Relaying Mode performs identical to the Direct Mode.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128709167","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}