Pub Date : 2012-12-01DOI: 10.1109/GLOCOM.2012.6504023
Li Wang, Xi Zhang, Mei Song, Tenghui Ke
To further enhance the quality of service (QoS), this paper proposes a novel multi-objective relay-jammer pair selection scheme in wireless cooperative networks where the wireless channels are modeled as first-order finite-state Markov channels (FSMCs). The FSMC model is used to approximate the time variations of the average received signal-to-noise ratio (SNR), channel power gain, and remaining power of nodes. In addition, the candidate cooperative nodes can be selected as relay and jammer, respectively, to assist the transmission or disturb the eavesdropper. Thus, we can formulate a restless bandit problem to model and analyze how to select the optimal relay-jammer pair according to the desired QoS optimization goals, in terms of energy balance, mitigating error propagation and increasing secrecy capacity (SC). The obtained simulation results show that our proposed schemes outperform the other existing schemes.
{"title":"A novel multi-objective relay-jammer pair selection scheme in wireless cooperative networks","authors":"Li Wang, Xi Zhang, Mei Song, Tenghui Ke","doi":"10.1109/GLOCOM.2012.6504023","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6504023","url":null,"abstract":"To further enhance the quality of service (QoS), this paper proposes a novel multi-objective relay-jammer pair selection scheme in wireless cooperative networks where the wireless channels are modeled as first-order finite-state Markov channels (FSMCs). The FSMC model is used to approximate the time variations of the average received signal-to-noise ratio (SNR), channel power gain, and remaining power of nodes. In addition, the candidate cooperative nodes can be selected as relay and jammer, respectively, to assist the transmission or disturb the eavesdropper. Thus, we can formulate a restless bandit problem to model and analyze how to select the optimal relay-jammer pair according to the desired QoS optimization goals, in terms of energy balance, mitigating error propagation and increasing secrecy capacity (SC). The obtained simulation results show that our proposed schemes outperform the other existing schemes.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"54 1","pages":"5663-5668"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74673970","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.6503963
X. Hong, Bo Gu, Yuguang Zeng, Jingyuan Zhang
Human mobility, hence the movement pattern of mobile devices, often confines to relatively local geographic areas. Such a movement pattern reduces the opportunities for a message to be disseminated to a more global geographical region using the encounter-based “store-carry-forward” routing approach. On the other hand, different local areas often overlap to cover the entire region. A feasible communication architecture to help message dissemination is to deploy static storage-and-communication devices at those overlapping areas to serve as relays between the local areas. In this paper, we introduce the method to derive the simulation model for this heterogeneous network from contact trace and GPS trace of buses. Our main focus is to model communication properties between the static nodes and the mobile nodes. Typically, they are time-varying link delays formed by a collection of multiple mobile nodes. We further use a Markovian model to describe the time dependency among link delays at each static nodes and use the states to develop a network model for simulation. In the paper, we present simulation results to validate the reproduction of the mobility with the original traces by comparing routing performance. We show that the proposed network model can be used for performance evaluations with inherited realistic. The contributions of this work reside in the reproducibility to the real world traces and its flexibility in configurations. Further, it is the first simulator that enables to produce contact graph for a heterogeneous network with time-varying link properties. Its ability goes beyond simply calculating encounter events, but is well suitable for protocol evaluation in opportunistic networks, mobile social networks and delay tolerant networks.
{"title":"Constructing time-varying contact graphs for heterogeneous delay tolerant networks","authors":"X. Hong, Bo Gu, Yuguang Zeng, Jingyuan Zhang","doi":"10.1109/GLOCOM.2012.6503963","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503963","url":null,"abstract":"Human mobility, hence the movement pattern of mobile devices, often confines to relatively local geographic areas. Such a movement pattern reduces the opportunities for a message to be disseminated to a more global geographical region using the encounter-based “store-carry-forward” routing approach. On the other hand, different local areas often overlap to cover the entire region. A feasible communication architecture to help message dissemination is to deploy static storage-and-communication devices at those overlapping areas to serve as relays between the local areas. In this paper, we introduce the method to derive the simulation model for this heterogeneous network from contact trace and GPS trace of buses. Our main focus is to model communication properties between the static nodes and the mobile nodes. Typically, they are time-varying link delays formed by a collection of multiple mobile nodes. We further use a Markovian model to describe the time dependency among link delays at each static nodes and use the states to develop a network model for simulation. In the paper, we present simulation results to validate the reproduction of the mobility with the original traces by comparing routing performance. We show that the proposed network model can be used for performance evaluations with inherited realistic. The contributions of this work reside in the reproducibility to the real world traces and its flexibility in configurations. Further, it is the first simulator that enables to produce contact graph for a heterogeneous network with time-varying link properties. Its ability goes beyond simply calculating encounter events, but is well suitable for protocol evaluation in opportunistic networks, mobile social networks and delay tolerant networks.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"18 1","pages":"5302-5307"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80370126","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.6504037
Min Xing, Siyuan Xiang, Lin X. Cai
Video streaming is gaining popularity among mobile users. The latest mobile devices, such as smart phones and tablets are equipped with multiple wireless network interfaces. How to efficiently and cost-effectively utilize multiple links to improve the video streaming quality needs to be investigated. In order to maintain high video streaming quality while reduce the wireless service cost, in this paper, the optimal video streaming process with multiple links is formulated as a Markov Decision Process (MDP). The reward function is designed to consider the quality of experience (QoE) requirements for video traffic, such as the interruption rate, average playback quality, playback smoothness and wireless service cost. Using dynamic programming, the MDP can be solved to obtain the optimal streaming policy. To evaluate the performance of the proposed multi-link rate adaptation (MLRA) algorithm, we implement a testbed using the Android mobile phone and the open-source X264 video codec. Experimental results demonstrate the feasibility and effectiveness of the proposed MLRA algorithm for mobile video streaming applications, which outperforms the existing state-of-the-art one.
{"title":"Rate adaptation strategy for video streaming over multiple wireless access networks","authors":"Min Xing, Siyuan Xiang, Lin X. Cai","doi":"10.1109/GLOCOM.2012.6504037","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6504037","url":null,"abstract":"Video streaming is gaining popularity among mobile users. The latest mobile devices, such as smart phones and tablets are equipped with multiple wireless network interfaces. How to efficiently and cost-effectively utilize multiple links to improve the video streaming quality needs to be investigated. In order to maintain high video streaming quality while reduce the wireless service cost, in this paper, the optimal video streaming process with multiple links is formulated as a Markov Decision Process (MDP). The reward function is designed to consider the quality of experience (QoE) requirements for video traffic, such as the interruption rate, average playback quality, playback smoothness and wireless service cost. Using dynamic programming, the MDP can be solved to obtain the optimal streaming policy. To evaluate the performance of the proposed multi-link rate adaptation (MLRA) algorithm, we implement a testbed using the Android mobile phone and the open-source X264 video codec. Experimental results demonstrate the feasibility and effectiveness of the proposed MLRA algorithm for mobile video streaming applications, which outperforms the existing state-of-the-art one.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"12 1","pages":"5745-5750"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87662481","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.6503934
Hongjia Li, S. Ci, Zejue Wang
Service continuity in two-tier Femtocell networks, especially impaired by the handover latency, remains as a problem to be solved. Motivated by this problems, a Layer 3 prediction handover scheme is proposed, which can be integrated into the user equipment (UE) part of industry-preferable mobile-assisted network-controlled handover (MANCH). The main contributions of the proposed scheme include: 1) based on time series analysis theory, the prediction model of Layer 3 (L3) filtered reference signal received power (RSRP) is constructed to activate L3 handover prior to Layer 2 (L2) handover procedure; 2) in order to improve the reliability and robustness of the L3 prediction model, a two-priority handover trigger event evaluation method is designed, where the classical and prediction handover trigger event evaluation parts co-exist, and the former is prior to the latter; 3) the relationship between defined prediction handover gain (PHG) and the probability of false handover prediction trigger is derived. In simulations, to evaluate the robustness of the proposed scheme, a module of UEs' movement pattern is designed, considering characteristics of the UE's movement pattern. Results of the performance evaluation show that handover latency of indoor handover UEs can be effectively reduced with high prediction accuracy.
{"title":"Prediction handover trigger scheme for reducing handover latency in two-tier Femtocell networks","authors":"Hongjia Li, S. Ci, Zejue Wang","doi":"10.1109/GLOCOM.2012.6503934","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503934","url":null,"abstract":"Service continuity in two-tier Femtocell networks, especially impaired by the handover latency, remains as a problem to be solved. Motivated by this problems, a Layer 3 prediction handover scheme is proposed, which can be integrated into the user equipment (UE) part of industry-preferable mobile-assisted network-controlled handover (MANCH). The main contributions of the proposed scheme include: 1) based on time series analysis theory, the prediction model of Layer 3 (L3) filtered reference signal received power (RSRP) is constructed to activate L3 handover prior to Layer 2 (L2) handover procedure; 2) in order to improve the reliability and robustness of the L3 prediction model, a two-priority handover trigger event evaluation method is designed, where the classical and prediction handover trigger event evaluation parts co-exist, and the former is prior to the latter; 3) the relationship between defined prediction handover gain (PHG) and the probability of false handover prediction trigger is derived. In simulations, to evaluate the robustness of the proposed scheme, a module of UEs' movement pattern is designed, considering characteristics of the UE's movement pattern. Results of the performance evaluation show that handover latency of indoor handover UEs can be effectively reduced with high prediction accuracy.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"34 1","pages":"5130-5135"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76635245","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.6503481
Ning Wang, Ning Zhang, T. Gulliver
We study practical information-theoretically secure secret key agreement protocol design for wireless cooperative communication networks. By assuming the relay selection process is finished in advance, we study the key agreement problem for a classical three-node cooperative wireless communication system over independent additive white Gaussian noise (AWGN) channels. Passive attacks from an eavesdropper collocated with the relay are assumed. We derive upper and lower bounds on the secret key rate under the assumed cooperative wireless system model and find that they are close, which indicates the tightness of the bounds. We then propose an efficient practical secret key agreement protocol with both Bob and the honest relay participating in the public discussion. A compromise between security and efficiency is achieved by the joint advantage distillation and privacy amplification.
{"title":"Secret key agreement for cooperative wireless communications: bounds and efficient protocol design","authors":"Ning Wang, Ning Zhang, T. Gulliver","doi":"10.1109/GLOCOM.2012.6503481","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503481","url":null,"abstract":"We study practical information-theoretically secure secret key agreement protocol design for wireless cooperative communication networks. By assuming the relay selection process is finished in advance, we study the key agreement problem for a classical three-node cooperative wireless communication system over independent additive white Gaussian noise (AWGN) channels. Passive attacks from an eavesdropper collocated with the relay are assumed. We derive upper and lower bounds on the secret key rate under the assumed cooperative wireless system model and find that they are close, which indicates the tightness of the bounds. We then propose an efficient practical secret key agreement protocol with both Bob and the honest relay participating in the public discussion. A compromise between security and efficiency is achieved by the joint advantage distillation and privacy amplification.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"44 1","pages":"2432-2437"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78554131","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.6503753
Xiantao Cheng, Y. Guan, Guangrong Yue, Shaoqian Li
This paper addresses the application of the emerging compressive sensing (CS) technology to the detection of ultra-wideband (UWB) signals. Capitalizing on the sparseness of random UWB signals in the basis of eigen-functions, we develop a new CS dictionary called eigen- dictionary. Coupled with this eigen-dictionary, an enhanced Bayesian learning procedure is proposed to reconstruct the sparse UWB signal from a small collection of random projection measurements. Furthermore, by utilizing a common sparsity profile inherent in UWB signals, the proposed Bayesian algorithm naturally lends itself to multi-task CS for simultaneously recovering multiple UWB signals. Since the statistical inter-relationships between different CS tasks are exploited, the multi-task (MT) Bayesian CS can efficiently improve the reconstruction accuracy and thus the performance of UWB communications. Simulations based on real UWB data demonstrate the advantages of the proposed approach over its counterparts.
{"title":"Enhanced Bayesian compressive sensing for ultra-wideband channel estimation","authors":"Xiantao Cheng, Y. Guan, Guangrong Yue, Shaoqian Li","doi":"10.1109/GLOCOM.2012.6503753","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503753","url":null,"abstract":"This paper addresses the application of the emerging compressive sensing (CS) technology to the detection of ultra-wideband (UWB) signals. Capitalizing on the sparseness of random UWB signals in the basis of eigen-functions, we develop a new CS dictionary called eigen- dictionary. Coupled with this eigen-dictionary, an enhanced Bayesian learning procedure is proposed to reconstruct the sparse UWB signal from a small collection of random projection measurements. Furthermore, by utilizing a common sparsity profile inherent in UWB signals, the proposed Bayesian algorithm naturally lends itself to multi-task CS for simultaneously recovering multiple UWB signals. Since the statistical inter-relationships between different CS tasks are exploited, the multi-task (MT) Bayesian CS can efficiently improve the reconstruction accuracy and thus the performance of UWB communications. Simulations based on real UWB data demonstrate the advantages of the proposed approach over its counterparts.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"36 12 1","pages":"4065-4070"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90660710","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.6503208
Kun Xie, Wen Chen
Secure communication in the Multi-user and Multi-eavesdropper (MUME) scenario is considered in this paper. It has be shown that secrecy can be improved when the transmitter simultaneously transmits information signal to the legitimate receivers and artificial noise to confuse the eavesdroppers. Several processing schemes have been proposed to limit the co-channel interference (CCI). The conventional method and the ZF beamforming method are simple but of little ideal performance. While the block diagonalization (BD) method is of ideal performance but too complex. In this paper, we propose a new alternative approach based on maximizing the signal-to-leakage ratio (SLR). Simulations demonstrates that the proposed SLR method can achieve compromise between the secrecy performance and complexity.
{"title":"Precoding strategy based on SLR for secure communication in MUME wiretap systems","authors":"Kun Xie, Wen Chen","doi":"10.1109/GLOCOM.2012.6503208","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503208","url":null,"abstract":"Secure communication in the Multi-user and Multi-eavesdropper (MUME) scenario is considered in this paper. It has be shown that secrecy can be improved when the transmitter simultaneously transmits information signal to the legitimate receivers and artificial noise to confuse the eavesdroppers. Several processing schemes have been proposed to limit the co-channel interference (CCI). The conventional method and the ZF beamforming method are simple but of little ideal performance. While the block diagonalization (BD) method is of ideal performance but too complex. In this paper, we propose a new alternative approach based on maximizing the signal-to-leakage ratio (SLR). Simulations demonstrates that the proposed SLR method can achieve compromise between the secrecy performance and complexity.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"121 1","pages":"783-788"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72694500","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.6503135
Xiaojing Liao, Jianzhong Li
In two-tier wireless sensor networks, resource-rich storage nodes at the upper tier collect sensing data from resource-poor sensor nodes at the low tier, and then answer queries from the user. Sensor nodes perform sensing task and submit sensing data in one time-slot to the nearest storage node while storage nodes answer and process the query from the network owner. However the storage nodes confront serious security concerns. Storage nodes may be compromised and leak the sensitive data as well as returning fake query result. Therefore, it is important to protect the privacy and verify the query results. In this paper, we define and solve the practical and challenging problem of privacy-preserving and verifiable top-k query processing performed on the time-slot sensing data set in two-tier sensor network, and establish a set of privacy and correctness requirements for such a secure top-k query scheme to become a reality. We propose the basic PriSecTopk scheme by using order-preserving encryption, and then improve it step by step to achieve various privacy requirements as well as the correctness requirements in three levels of threat models. Theoretical analysis and experiment on the real-world data set successfully validate the efficacy and efficiency of the proposed schemes.
{"title":"Privacy-preserving and secure top-k query in two-tier wireless sensor network","authors":"Xiaojing Liao, Jianzhong Li","doi":"10.1109/GLOCOM.2012.6503135","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503135","url":null,"abstract":"In two-tier wireless sensor networks, resource-rich storage nodes at the upper tier collect sensing data from resource-poor sensor nodes at the low tier, and then answer queries from the user. Sensor nodes perform sensing task and submit sensing data in one time-slot to the nearest storage node while storage nodes answer and process the query from the network owner. However the storage nodes confront serious security concerns. Storage nodes may be compromised and leak the sensitive data as well as returning fake query result. Therefore, it is important to protect the privacy and verify the query results. In this paper, we define and solve the practical and challenging problem of privacy-preserving and verifiable top-k query processing performed on the time-slot sensing data set in two-tier sensor network, and establish a set of privacy and correctness requirements for such a secure top-k query scheme to become a reality. We propose the basic PriSecTopk scheme by using order-preserving encryption, and then improve it step by step to achieve various privacy requirements as well as the correctness requirements in three levels of threat models. Theoretical analysis and experiment on the real-world data set successfully validate the efficacy and efficiency of the proposed schemes.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"16 1","pages":"335-341"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74084063","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.6504017
Xiaobin Tan, Hao Yue, Yuguang Fang, Wenfei Cheng
Reliable broadcast is an important communication primitive for wireless mesh networks, which has many applications such as multimedia services and software upgrade. Recently, network coding is introduced into reliable broadcast to enhance the throughput of data transmissions. Existing network coding based reliable broadcast schemes, such as Pacifier and R-Code, fail to take advantage of the unique characteristic of reliable broadcast or the broadcast nature of wireless transmissions, which leads to redundant transmissions and performance degradation. In this paper, we propose a greedy strategy for network coding based reliable broadcast, which is called GreedyCode. GreedyCode opportunistically selects the forwarders with the highest transmission efficiency to transmit the encoded packets while the neighbors just listen. In order to measure the efficiency of broadcast transmission of a node, we also define a metric named One-hop Broadcast Throughput (OBT), which considers not only the current reception status of the destinations but also the quality of the broadcast link. Because GreedyCode only needs the information of its one-hop neighbors, so it can be distributed realized. The simulation results show that GreedyCode achieves 100% packet delivery ratio (PDR) and significantly reduces the number of transmissions and the broadcast delay.
{"title":"Greedy strategy for network coding based reliable broadcast in wireless mesh networks","authors":"Xiaobin Tan, Hao Yue, Yuguang Fang, Wenfei Cheng","doi":"10.1109/GLOCOM.2012.6504017","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6504017","url":null,"abstract":"Reliable broadcast is an important communication primitive for wireless mesh networks, which has many applications such as multimedia services and software upgrade. Recently, network coding is introduced into reliable broadcast to enhance the throughput of data transmissions. Existing network coding based reliable broadcast schemes, such as Pacifier and R-Code, fail to take advantage of the unique characteristic of reliable broadcast or the broadcast nature of wireless transmissions, which leads to redundant transmissions and performance degradation. In this paper, we propose a greedy strategy for network coding based reliable broadcast, which is called GreedyCode. GreedyCode opportunistically selects the forwarders with the highest transmission efficiency to transmit the encoded packets while the neighbors just listen. In order to measure the efficiency of broadcast transmission of a node, we also define a metric named One-hop Broadcast Throughput (OBT), which considers not only the current reception status of the destinations but also the quality of the broadcast link. Because GreedyCode only needs the information of its one-hop neighbors, so it can be distributed realized. The simulation results show that GreedyCode achieves 100% packet delivery ratio (PDR) and significantly reduces the number of transmissions and the broadcast delay.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"6 1","pages":"5627-5632"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81699700","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.6503154
Tae-Suk Kim, T. Park, M. Sha, Chenyang Lu
With the rapid permeation of smartphones and wireless sensors in our society, smartphones are poised to become personal hubs connecting wireless sensors with users and the Internet. Due to frequent changes to applications and network conditions, wireless networks connecting a personal hub and wireless sensors must meet time-varying QoS requirements at minimal energy cost. This paper presents the architecture of a novel Protocol Service System (PSS) towards the vision of protocol service over the air. In contrast to traditional wireless networks where a single MAC protocol is statically selected a priori, PSS switches among multiple MAC protocols at run time to dynamically optimize power efficiency subject and meet current QoS requirements. To meet the memory constraint on wireless sensors PSS employs a component-based reconfigurable MAC architecture to support multiple MAC protocols at significantly reduced memory footprint through component sharing. The feasibility of PSS has been demonstrated through a proof-of-concept implementation of the PSS architecture and the development of a personal hub prototype running the Android OS.
{"title":"Toward MAC Protocol Service over the air","authors":"Tae-Suk Kim, T. Park, M. Sha, Chenyang Lu","doi":"10.1109/GLOCOM.2012.6503154","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503154","url":null,"abstract":"With the rapid permeation of smartphones and wireless sensors in our society, smartphones are poised to become personal hubs connecting wireless sensors with users and the Internet. Due to frequent changes to applications and network conditions, wireless networks connecting a personal hub and wireless sensors must meet time-varying QoS requirements at minimal energy cost. This paper presents the architecture of a novel Protocol Service System (PSS) towards the vision of protocol service over the air. In contrast to traditional wireless networks where a single MAC protocol is statically selected a priori, PSS switches among multiple MAC protocols at run time to dynamically optimize power efficiency subject and meet current QoS requirements. To meet the memory constraint on wireless sensors PSS employs a component-based reconfigurable MAC architecture to support multiple MAC protocols at significantly reduced memory footprint through component sharing. The feasibility of PSS has been demonstrated through a proof-of-concept implementation of the PSS architecture and the development of a personal hub prototype running the Android OS.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"15 1","pages":"451-457"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85509026","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
扫码关注我们
求助内容：
应助结果提醒方式：