Pub Date : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503243
Weihan Goh, C. Yeo
In disruption tolerant networks (DTNs), nodes exchange beacon messages to set up links via a process known as neighbor discovery. However as it is, beacon messages are susceptible to forgery and tampering that could be exploited to attack and participate in the network. This paper outlines a protocol to 1) protect beacon messages in tactical-level DTNs from forgery and tampering utilizing an identity-based signature scheme (IBS), and 2) provide capabilities for nodes that are compromised or captured to signal its state discreetly to other DTN nodes. The protocol maintains the same amount of message overhead as without it.
{"title":"Threat mitigation in tactical-level disruption tolerant networks","authors":"Weihan Goh, C. Yeo","doi":"10.1109/GLOCOM.2012.6503243","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503243","url":null,"abstract":"In disruption tolerant networks (DTNs), nodes exchange beacon messages to set up links via a process known as neighbor discovery. However as it is, beacon messages are susceptible to forgery and tampering that could be exploited to attack and participate in the network. This paper outlines a protocol to 1) protect beacon messages in tactical-level DTNs from forgery and tampering utilizing an identity-based signature scheme (IBS), and 2) provide capabilities for nodes that are compromised or captured to signal its state discreetly to other DTN nodes. The protocol maintains the same amount of message overhead as without it.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77530342","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503503
Zhuofan Liao, Jianxin Wang, Shigeng Zhang, Jiannong Cao
In WiMAX mesh networks based on IEEE 802.16j, when transmission power of the base station (BS) and the number of radios and channels are settled, data rate at the subscriber (SS) is decided by the distance between the SS and its uplink relay station (RS). In this paper, we study the problem of deploying a minimum number of RSs to satisfy all SSs' distance requirements. Firstly, we translate it into a minimum clique partition problem, which is NP-complete. Based on SSs' neighbor information and location information, we then propose two heuristic algorithms based on clique partition, named as MAXDCP and GEOCP, respectively. Simulation results show that, compared with the state-of-the-art MIS and HS algorithms, MAXDCP uses 23.8% fewer relays than MIS with the same time complexity, and GEOCP uses 35% fewer relays than MIS in the same time and 18.5% fewer relays than HS in much less time.
{"title":"Clique partition based relay placement in WiMAX mesh networks","authors":"Zhuofan Liao, Jianxin Wang, Shigeng Zhang, Jiannong Cao","doi":"10.1109/GLOCOM.2012.6503503","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503503","url":null,"abstract":"In WiMAX mesh networks based on IEEE 802.16j, when transmission power of the base station (BS) and the number of radios and channels are settled, data rate at the subscriber (SS) is decided by the distance between the SS and its uplink relay station (RS). In this paper, we study the problem of deploying a minimum number of RSs to satisfy all SSs' distance requirements. Firstly, we translate it into a minimum clique partition problem, which is NP-complete. Based on SSs' neighbor information and location information, we then propose two heuristic algorithms based on clique partition, named as MAXDCP and GEOCP, respectively. Simulation results show that, compared with the state-of-the-art MIS and HS algorithms, MAXDCP uses 23.8% fewer relays than MIS with the same time complexity, and GEOCP uses 35% fewer relays than MIS in the same time and 18.5% fewer relays than HS in much less time.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77631371","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503543
Huichen Dai, Jianyuan Lu, Yi Wang, B. Liu
Routing is undoubtedly the foundation of NDN's data transmission service. We propose a two-layer routing protocol for NDN [1], [2], which is composed of a Topology Maintaining (TM) layer and a Prefix Announcing (PA) layer. The underlying layer (TM) maintains the full topology of an NDN network domain and calculates the shortest-path trees. The upper layer (PA) provides content in two ways: active publishing and passive serving. However, solely adopting either of them will lead to the problem of scalability. We compare the efficiency and cost of the two methods, and evaluation results show that active publishing is much more efficient than the passive serving method in terms of triggered traffic, but actively publishing all the content will lead to Forwarding Information Base (FIB) explosion. Therefore, we further propose a popularity-based active publishing policy and arrive at a compromise between the active and passive methods. Moreover, we put forward several methods to aggregate FIB entries, and the FIB size shrinks effectively after aggregation. This routing protocol is compliant with the NDN characteristics and supports NDN multipath routing.
{"title":"A two-layer intra-domain routing scheme for named data networking","authors":"Huichen Dai, Jianyuan Lu, Yi Wang, B. Liu","doi":"10.1109/GLOCOM.2012.6503543","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503543","url":null,"abstract":"Routing is undoubtedly the foundation of NDN's data transmission service. We propose a two-layer routing protocol for NDN [1], [2], which is composed of a Topology Maintaining (TM) layer and a Prefix Announcing (PA) layer. The underlying layer (TM) maintains the full topology of an NDN network domain and calculates the shortest-path trees. The upper layer (PA) provides content in two ways: active publishing and passive serving. However, solely adopting either of them will lead to the problem of scalability. We compare the efficiency and cost of the two methods, and evaluation results show that active publishing is much more efficient than the passive serving method in terms of triggered traffic, but actively publishing all the content will lead to Forwarding Information Base (FIB) explosion. Therefore, we further propose a popularity-based active publishing policy and arrive at a compromise between the active and passive methods. Moreover, we put forward several methods to aggregate FIB entries, and the FIB size shrinks effectively after aggregation. This routing protocol is compliant with the NDN characteristics and supports NDN multipath routing.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83934171","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503416
Min Chen
While demands on video traffic over mobile networks have been souring, the wireless link capacity cannot keep up with the traffic demand. The gap between the traffic demand and the link capacity, along with time-varying link conditions, results in poor service quality of video streaming over mobile networks such as long buffering time and intermittent disruptions. Leveraging the cloud computing technology, we propose a new mobile video streaming framework, dubbed AMVSC, which constructs a private agent at the cloud to provide video streaming services efficiently for each mobile user. For a given user, AMVSC lets her private agent adaptively adjust her streaming flow with a scalable video coding technique based on the feedback of link quality. We implement a prototype of the AMVSC framework to demonstrate its performance. It is shown that the private agents in the clouds can effectively provide the adaptive streaming.
{"title":"AMVSC: A framework of adaptive mobile video streaming in the cloud","authors":"Min Chen","doi":"10.1109/GLOCOM.2012.6503416","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503416","url":null,"abstract":"While demands on video traffic over mobile networks have been souring, the wireless link capacity cannot keep up with the traffic demand. The gap between the traffic demand and the link capacity, along with time-varying link conditions, results in poor service quality of video streaming over mobile networks such as long buffering time and intermittent disruptions. Leveraging the cloud computing technology, we propose a new mobile video streaming framework, dubbed AMVSC, which constructs a private agent at the cloud to provide video streaming services efficiently for each mobile user. For a given user, AMVSC lets her private agent adaptively adjust her streaming flow with a scalable video coding technique based on the feedback of link quality. We implement a prototype of the AMVSC framework to demonstrate its performance. It is shown that the private agents in the clouds can effectively provide the adaptive streaming.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74430370","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503749
Yong Li, L. Wang, Z. Ding
In this work1, we present a new multiple-input-multiple-output (MIMO) receiver that integrates the MIMO signal detection and the decoding of low density parity check coded data. This joint MIMO detector and decoder utilizes linear programming and achieves about 9.0 dB gain over existing works in terms of bit error rate (BER) of 4 × 10−5 with comparable computational complexity. The proposed detector also outperforms the classic turbo equalizer by achieving up to 4.0 dB improvement over turbo equalizer at frame error rate (FER) of 1 × 104. In fact, we can achieve further gain by improving the proposed joint detector through the use of redundant parity checks.
{"title":"Linear programming based joint detection of LDPC coded MIMO systems","authors":"Yong Li, L. Wang, Z. Ding","doi":"10.1109/GLOCOM.2012.6503749","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503749","url":null,"abstract":"In this work1, we present a new multiple-input-multiple-output (MIMO) receiver that integrates the MIMO signal detection and the decoding of low density parity check coded data. This joint MIMO detector and decoder utilizes linear programming and achieves about 9.0 dB gain over existing works in terms of bit error rate (BER) of 4 × 10−5 with comparable computational complexity. The proposed detector also outperforms the classic turbo equalizer by achieving up to 4.0 dB improvement over turbo equalizer at frame error rate (FER) of 1 × 104. In fact, we can achieve further gain by improving the proposed joint detector through the use of redundant parity checks.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75857553","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503351
Yisheng Zhao, Xi Li, Xiaoliang Zhang, Yi Li, Hong Ji
With the wide deployment of high-speed railway at more than 300 kilometers per hour, providing various services effectively for users in the train becomes both practical demand and interesting challenge for wireless communication. Resource allocation problem in high-speed railway communication system is one of the key issues to improve the efficiency of resource utilization. In this paper, we propose a multidimensional resource allocation strategy for high-speed railway downlink orthogonal frequency-division multiplexing (OFDM) system with multiple-input multiple-output (MIMO) antennas. Sub-carrier, antenna, time slot, and power are considered jointly, which is modeled as a nonlinear integer programming problem. The effect of the moving speed on inter-carrier interference is analyzed to calculate the transmitted power. The objective is to minimize the total transmitted power while satisfying quality of service requirement of each user. Moreover, optimal and approximate solutions are obtained by linearization and quadratic fitting, respectively. Simulation results have proved that approximate solution has lower total transmitted power than optimal solution while the computation complexity is higher.
{"title":"Multidimensional resource allocation strategy for high-speed railway MIMO-OFDM system","authors":"Yisheng Zhao, Xi Li, Xiaoliang Zhang, Yi Li, Hong Ji","doi":"10.1109/GLOCOM.2012.6503351","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503351","url":null,"abstract":"With the wide deployment of high-speed railway at more than 300 kilometers per hour, providing various services effectively for users in the train becomes both practical demand and interesting challenge for wireless communication. Resource allocation problem in high-speed railway communication system is one of the key issues to improve the efficiency of resource utilization. In this paper, we propose a multidimensional resource allocation strategy for high-speed railway downlink orthogonal frequency-division multiplexing (OFDM) system with multiple-input multiple-output (MIMO) antennas. Sub-carrier, antenna, time slot, and power are considered jointly, which is modeled as a nonlinear integer programming problem. The effect of the moving speed on inter-carrier interference is analyzed to calculate the transmitted power. The objective is to minimize the total transmitted power while satisfying quality of service requirement of each user. Moreover, optimal and approximate solutions are obtained by linearization and quadratic fitting, respectively. Simulation results have proved that approximate solution has lower total transmitted power than optimal solution while the computation complexity is higher.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/GLOCOM.2012.6503351","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72426025","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503491
Zhouyue Pi
Many MIMO capacity analyses and precoding algorithms are obtained based on the assumption of total power constraint while assuming power can be allocated freely across antennas. In practical MIMO systems, however, per-antenna power constraints are often more predominant design consideration than the total power constraints. In this paper, we study the transmission schemes for MIMO systems with per-antenna power constraints. We derive the necessary and sufficient conditions for the optimal transmission scheme. We also develop an iterative algorithm and prove its convergence to the optimal solution.
{"title":"Optimal MIMO transmission with per-antenna power constraints","authors":"Zhouyue Pi","doi":"10.1109/GLOCOM.2012.6503491","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503491","url":null,"abstract":"Many MIMO capacity analyses and precoding algorithms are obtained based on the assumption of total power constraint while assuming power can be allocated freely across antennas. In practical MIMO systems, however, per-antenna power constraints are often more predominant design consideration than the total power constraints. In this paper, we study the transmission schemes for MIMO systems with per-antenna power constraints. We derive the necessary and sufficient conditions for the optimal transmission scheme. We also develop an iterative algorithm and prove its convergence to the optimal solution.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78618164","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503616
Shuo Fang, Hui Li, C. Foh, Yonggang Wen, Khin Mi Mi Aung
Data center consumes increasing amount of power nowadays, together with expanding number of data centers and upgrading data center scale, its power consumption becomes a knotty issue. While main efforts of this research focus on server and storage power reduction, network devices as part of the key components of data centers, also contribute to the overall power consumption as data centers expand. In this paper, we address this problem with two perspectives. First, in a macro level, we attempt to reduce redundant energy usage incurred by network redundancies for load balancing. Second, in the micro level, we design algorithm to limit port rate in order to reduce unnecessary power consumption. Given the guidelines we obtained from problem formulation, we propose a solution based on greedy approach with integration of network traffic and minimization of switch link rate. We also present results from a simulation-based performance evaluation which shows that expected power saving is achieved with tolerable delay.
{"title":"Energy optimizations for data center network: Formulation and its solution","authors":"Shuo Fang, Hui Li, C. Foh, Yonggang Wen, Khin Mi Mi Aung","doi":"10.1109/GLOCOM.2012.6503616","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503616","url":null,"abstract":"Data center consumes increasing amount of power nowadays, together with expanding number of data centers and upgrading data center scale, its power consumption becomes a knotty issue. While main efforts of this research focus on server and storage power reduction, network devices as part of the key components of data centers, also contribute to the overall power consumption as data centers expand. In this paper, we address this problem with two perspectives. First, in a macro level, we attempt to reduce redundant energy usage incurred by network redundancies for load balancing. Second, in the micro level, we design algorithm to limit port rate in order to reduce unnecessary power consumption. Given the guidelines we obtained from problem formulation, we propose a solution based on greedy approach with integration of network traffic and minimization of switch link rate. We also present results from a simulation-based performance evaluation which shows that expected power saving is achieved with tolerable delay.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78641483","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503863
Yixin Li, F. Zheng
In this paper, we study the performance of relay selection in a two-way relay network (TWRN) using analog network coding (ANC) with asymmetric traffic requirements at the end terminals under imperfect channel state information (CSI). We derive the system outage probability under Rayleigh flat-fading channels with channel estimation error. Three different power allocation schemes are presented. Simulations validate our analysis and show the performance gain of the proposed schemes.
{"title":"Relay selection and power allocation in analogue network coding system with asymmetric traffic under imperfect CSI","authors":"Yixin Li, F. Zheng","doi":"10.1109/GLOCOM.2012.6503863","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503863","url":null,"abstract":"In this paper, we study the performance of relay selection in a two-way relay network (TWRN) using analog network coding (ANC) with asymmetric traffic requirements at the end terminals under imperfect channel state information (CSI). We derive the system outage probability under Rayleigh flat-fading channels with channel estimation error. Three different power allocation schemes are presented. Simulations validate our analysis and show the performance gain of the proposed schemes.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77501122","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 : 2012-12-01DOI: 10.1109/GLOCOM.2012.6503612
Sung Whan Yoon, J. Moon
This paper considers error-correcting codes designed to correct a finite set of known two-dimensional (2D) error patterns that can occur in a 2D array of bits. Obvious applications for this type of codes include storage and display devices. The specific codes designed in this paper are cyclic codes that can correct any single occurrences of dominant known error patterns that can occur anywhere in the 2D array. As example codes, rate-0.994 codes are constructed which target eight known 2D error patterns in a 63 × 63 bit array.
{"title":"Two-dimensional cyclic codes correcting known error patterns","authors":"Sung Whan Yoon, J. Moon","doi":"10.1109/GLOCOM.2012.6503612","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503612","url":null,"abstract":"This paper considers error-correcting codes designed to correct a finite set of known two-dimensional (2D) error patterns that can occur in a 2D array of bits. Obvious applications for this type of codes include storage and display devices. The specific codes designed in this paper are cyclic codes that can correct any single occurrences of dominant known error patterns that can occur anywhere in the 2D array. As example codes, rate-0.994 codes are constructed which target eight known 2D error patterns in a 63 × 63 bit array.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81309816","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
扫码关注我们
求助内容：
应助结果提醒方式：