Pub Date : 2012-04-01DOI: 10.1109/WCNC.2012.6214205
I. Bang, Seong Hwan Kim, S. Kim, D. Sung
An inter-cell interference (ICI) problem between co-channel BSs has been one of main challenging research issues in downlink cellular networks. Fractional frequency reuse (FFR) and BS cooperation are useful techniques to manage the ICI problem. By combining the BS cooperation and FFR techniques, we propose to determine an efficient cooperation mode and the type of subchannels, i.e., reusable subchannels or exclusively used subchannels. The optimization problem to minimize the total power consumption in a cooperative cluster is formulated while satisfying a given constraint in terms of the number of subchannels. When the number of users is 20, our proposed energy-efficient subchannel allocation (EESA) scheme consumes 21%, 25%, 43%, and 43% less power than the conventional resource minimization (RM), fractional frequency reuse (FFR), exclusive (EX), and full cooperation (FCO) scheme respectively. Moreover, our proposed EESA scheme outperforms the other four schemes in terms of outage probability.
{"title":"Energy-efficient subchannel allocation scheme based on adaptive base station cooperation in downlink cellular networks","authors":"I. Bang, Seong Hwan Kim, S. Kim, D. Sung","doi":"10.1109/WCNC.2012.6214205","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214205","url":null,"abstract":"An inter-cell interference (ICI) problem between co-channel BSs has been one of main challenging research issues in downlink cellular networks. Fractional frequency reuse (FFR) and BS cooperation are useful techniques to manage the ICI problem. By combining the BS cooperation and FFR techniques, we propose to determine an efficient cooperation mode and the type of subchannels, i.e., reusable subchannels or exclusively used subchannels. The optimization problem to minimize the total power consumption in a cooperative cluster is formulated while satisfying a given constraint in terms of the number of subchannels. When the number of users is 20, our proposed energy-efficient subchannel allocation (EESA) scheme consumes 21%, 25%, 43%, and 43% less power than the conventional resource minimization (RM), fractional frequency reuse (FFR), exclusive (EX), and full cooperation (FCO) scheme respectively. Moreover, our proposed EESA scheme outperforms the other four schemes in terms of outage probability.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129369601","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-04-01DOI: 10.1109/WCNC.2012.6214025
Jari Nieminen, R. Jäntti, J. Eriksson
Several future wireless communication systems will exploit multiple frequency channels simultaneously to reduce delay, enhance throughput and/or improve robustness. Nevertheless, the impact of multi-channel communications on different applications has not been comprehensively studied even though it is of significant importance to understand the interdependencies between the communication and application parameters. In this paper we study the performance of networked estimation in contention-based multi-channel wireless sensor networks by focusing especially on the delay introduced by the Media Access Control (MAC) layer. We derive the required theoretical results and analyze the relationship between communication and estimation parameters in a target tracking application. In addition, we show how to optimize estimation performance by choosing appropriate estimation parameters with certain communication parameters and vice versa.
{"title":"Performance of target tracking applications in multi-channel wireless sensor networks","authors":"Jari Nieminen, R. Jäntti, J. Eriksson","doi":"10.1109/WCNC.2012.6214025","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214025","url":null,"abstract":"Several future wireless communication systems will exploit multiple frequency channels simultaneously to reduce delay, enhance throughput and/or improve robustness. Nevertheless, the impact of multi-channel communications on different applications has not been comprehensively studied even though it is of significant importance to understand the interdependencies between the communication and application parameters. In this paper we study the performance of networked estimation in contention-based multi-channel wireless sensor networks by focusing especially on the delay introduced by the Media Access Control (MAC) layer. We derive the required theoretical results and analyze the relationship between communication and estimation parameters in a target tracking application. In addition, we show how to optimize estimation performance by choosing appropriate estimation parameters with certain communication parameters and vice versa.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129194434","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-04-01DOI: 10.1109/WCNC.2012.6213922
Zahra Pourgharehkhan, S. Sedighi, Abbas Taherpour, M. Uysal
In this paper, we consider the problem of wideband spectrum sensing by using the correlation among the observation samples in different subbands. The Primary User (PU) signal samples in occupied subbands are assumed to be zero-mean correlated Gaussian random variables and additive noise is modeled as colored zero-mean Gaussian random variables independent of the PU signal. It is also assumed that there is at least a minimum given number of subbands that are vacant of PU signals. First we derive the optimal detector and the Generalized Likelihood Ratio (GLR) detector for the case that the covariance matrix of PUs signal samples is unknown and the noise variance in the different subbands is known. Then, we propose an iterative algorithm for GLR test when both the covariance matrix of the PUs signal samples and the noise variances in the different subbands, are unknown. For analytical performance evaluation, we derive some closed-form expressions for detection and false alarm probabilities of the proposed detectors in low Signal to Noise Ratio (SNR) regime. The simulation results are further presented to compare the performance of the proposed detectors.
{"title":"Spectrum sensing of correlated subbands with colored noise in cognitive radios","authors":"Zahra Pourgharehkhan, S. Sedighi, Abbas Taherpour, M. Uysal","doi":"10.1109/WCNC.2012.6213922","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213922","url":null,"abstract":"In this paper, we consider the problem of wideband spectrum sensing by using the correlation among the observation samples in different subbands. The Primary User (PU) signal samples in occupied subbands are assumed to be zero-mean correlated Gaussian random variables and additive noise is modeled as colored zero-mean Gaussian random variables independent of the PU signal. It is also assumed that there is at least a minimum given number of subbands that are vacant of PU signals. First we derive the optimal detector and the Generalized Likelihood Ratio (GLR) detector for the case that the covariance matrix of PUs signal samples is unknown and the noise variance in the different subbands is known. Then, we propose an iterative algorithm for GLR test when both the covariance matrix of the PUs signal samples and the noise variances in the different subbands, are unknown. For analytical performance evaluation, we derive some closed-form expressions for detection and false alarm probabilities of the proposed detectors in low Signal to Noise Ratio (SNR) regime. The simulation results are further presented to compare the performance of the proposed detectors.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123327255","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-04-01DOI: 10.1109/WCNC.2012.6214343
D. Niyato, Ping Wang, E. Hossain, W. Saad, Zhu Han
Mobile cloud computing aims at improving the performance of mobile applications and to enhance the resource utilization of service providers. In this paper, we consider a mobile cloud computing environment in which the service providers can form a coalition to create a resource pool to support the mobile applications. First, an admission control mechanism is used to provide services of mobile applications to the users given the available long-term reserved resources in a pool. An optimization formulation is introduced to obtain the optimal decision of admission control. Then, for a given coalition of service providers, the revenue obtained from utilizing the resource pool has to be shared among the service providers. A coalitional game model is developed for sharing the revenue. In addition, since the service providers can decide on short-term capacity expansion of the resource pool, a game model is introduced to obtain the optimal strategies of service providers on capacity expansion such that their profits are maximized.
{"title":"Game theoretic modeling of cooperation among service providers in mobile cloud computing environments","authors":"D. Niyato, Ping Wang, E. Hossain, W. Saad, Zhu Han","doi":"10.1109/WCNC.2012.6214343","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214343","url":null,"abstract":"Mobile cloud computing aims at improving the performance of mobile applications and to enhance the resource utilization of service providers. In this paper, we consider a mobile cloud computing environment in which the service providers can form a coalition to create a resource pool to support the mobile applications. First, an admission control mechanism is used to provide services of mobile applications to the users given the available long-term reserved resources in a pool. An optimization formulation is introduced to obtain the optimal decision of admission control. Then, for a given coalition of service providers, the revenue obtained from utilizing the resource pool has to be shared among the service providers. A coalitional game model is developed for sharing the revenue. In addition, since the service providers can decide on short-term capacity expansion of the resource pool, a game model is introduced to obtain the optimal strategies of service providers on capacity expansion such that their profits are maximized.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123604566","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-04-01DOI: 10.1109/WCNC.2012.6214222
S. Yiu, D. Calin, A. O. Kaya, Kai Yang
Distributed space-time block coding with orthogonal frequency division multiplexing (DSTBC-OFDM) and distributed space-frequency block coding with orthogonal frequency division multiplexing (DSFBC-OFDM) are introduced in this paper. Unlike the original DSTBC scheme which was designed for networks with a fixed number of relays operating in frequency-nonselective channels with insignificant Doppler spread, the proposed schemes are designed specifically for networks with an arbitrary number of relays and wireless channels with significant delay spread and Doppler spread. It is shown that geographically distributed antennas employing the new transmission schemes in a frequency-selective and severe Doppler spread environment can achieve the same performance (in terms of diversity gain and coding gain) as the previously proposed scheme.
{"title":"Distributed STBC-OFDM and distributed SFBC-OFDM for frequency-selective and time-varying channels","authors":"S. Yiu, D. Calin, A. O. Kaya, Kai Yang","doi":"10.1109/WCNC.2012.6214222","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214222","url":null,"abstract":"Distributed space-time block coding with orthogonal frequency division multiplexing (DSTBC-OFDM) and distributed space-frequency block coding with orthogonal frequency division multiplexing (DSFBC-OFDM) are introduced in this paper. Unlike the original DSTBC scheme which was designed for networks with a fixed number of relays operating in frequency-nonselective channels with insignificant Doppler spread, the proposed schemes are designed specifically for networks with an arbitrary number of relays and wireless channels with significant delay spread and Doppler spread. It is shown that geographically distributed antennas employing the new transmission schemes in a frequency-selective and severe Doppler spread environment can achieve the same performance (in terms of diversity gain and coding gain) as the previously proposed scheme.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123619486","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-04-01DOI: 10.1109/WCNC.2012.6214363
Nianwang Liu, Zheng Wen, K. Yeung, Zhibin Lei
Unlike peer-to-peer (P2P) file sharing, P2P live streaming systems have to meet real-time playback constraints, which makes it very challenging yet crucial to maximize the peer uplink bandwidth utilization so as to deliver content pieces in time. In general, this is achieved by adopting tailor-made piece selection and request-peer selection algorithms. The design philosophy is to regulate the network traffic and to balance the load among peers. In this paper, we propose a new request-peer selection algorithm. In particular, a peer in the network estimates the service response time (SRT) between itself and each neighboring peer. An SRT is measured from when a data piece request is sent until the requested piece arrives. When a peer makes a piece request, the neighbor with smaller SRT and fewer data pieces would be favored among potential providers. This is because smaller SRT implies excess serving capacity and fewer data pieces suggests less piece requests received. We evaluate the performance of our request-peer selection algorithm through extensive packet level simulations. Our simulation results show that the traffic load in the network is better balanced in the sense that the difference of the normalized number of data packets uploaded by each peer is getting smaller and the number of repeated piece requests generated by each peer (due to request failure) is significantly reduced. We also found that the load of streaming server is reduced, and the overall quality of service, measured by playback continuity, startup delay etc, is improved as well.
{"title":"Request-peer selection for load-balancing in P2P live streaming systems","authors":"Nianwang Liu, Zheng Wen, K. Yeung, Zhibin Lei","doi":"10.1109/WCNC.2012.6214363","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214363","url":null,"abstract":"Unlike peer-to-peer (P2P) file sharing, P2P live streaming systems have to meet real-time playback constraints, which makes it very challenging yet crucial to maximize the peer uplink bandwidth utilization so as to deliver content pieces in time. In general, this is achieved by adopting tailor-made piece selection and request-peer selection algorithms. The design philosophy is to regulate the network traffic and to balance the load among peers. In this paper, we propose a new request-peer selection algorithm. In particular, a peer in the network estimates the service response time (SRT) between itself and each neighboring peer. An SRT is measured from when a data piece request is sent until the requested piece arrives. When a peer makes a piece request, the neighbor with smaller SRT and fewer data pieces would be favored among potential providers. This is because smaller SRT implies excess serving capacity and fewer data pieces suggests less piece requests received. We evaluate the performance of our request-peer selection algorithm through extensive packet level simulations. Our simulation results show that the traffic load in the network is better balanced in the sense that the difference of the normalized number of data packets uploaded by each peer is getting smaller and the number of repeated piece requests generated by each peer (due to request failure) is significantly reduced. We also found that the load of streaming server is reduced, and the overall quality of service, measured by playback continuity, startup delay etc, is improved as well.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114557477","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-04-01DOI: 10.1109/WCNC.2012.6214482
J. P. Leite, P. Carvalho, R. Vieira
This paper presents a machine learning approach for link adaptation in orthogonal frequency-division multiplexing systems through adaptive modulation and coding. Although machine learning techniques have attracted attention for link adaptation, most of the the schemes proposed so far are based on off-line training algorithms, which make them not well suited for real time operation. The proposed solution, based on the reinforcement learning technique, learns the best modulation and coding scheme for a given signal-to-noise ratio by interacting with the radio channel and it does not rely on an off-line training mode. Simulation results show that under specific conditions, the proposed technique can outperform the well-known solution based on look-up tables for adaptive modulation and coding, and it can potentially adapt itself to distinct characteristics of the radio environment.
{"title":"A flexible framework based on reinforcement learning for adaptive modulation and coding in OFDM wireless systems","authors":"J. P. Leite, P. Carvalho, R. Vieira","doi":"10.1109/WCNC.2012.6214482","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214482","url":null,"abstract":"This paper presents a machine learning approach for link adaptation in orthogonal frequency-division multiplexing systems through adaptive modulation and coding. Although machine learning techniques have attracted attention for link adaptation, most of the the schemes proposed so far are based on off-line training algorithms, which make them not well suited for real time operation. The proposed solution, based on the reinforcement learning technique, learns the best modulation and coding scheme for a given signal-to-noise ratio by interacting with the radio channel and it does not rely on an off-line training mode. Simulation results show that under specific conditions, the proposed technique can outperform the well-known solution based on look-up tables for adaptive modulation and coding, and it can potentially adapt itself to distinct characteristics of the radio environment.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114858516","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-04-01DOI: 10.1109/WCNC.2012.6214415
S. Schedler, A. Angierski, V. Kühn
This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.
{"title":"Resource allocation for the AF Multiple Access Relay Channel with OFDMA","authors":"S. Schedler, A. Angierski, V. Kühn","doi":"10.1109/WCNC.2012.6214415","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214415","url":null,"abstract":"This paper considers the resource allocation problem for a Multiple Access Relay Channel (MARC). A transmission scheme with OFDMA and Amplify-and-Forward (AF) relaying is assumed. To maximise the sum rate a joint allocation of transmit power and subcarriers has to be done. This problem is known to be NP-hard and can only be solved by an exhaustive search which is not feasible for practical problem sizes. Different near-optimum algorithms for solving this problem are proposed. The problem of carrier and power allocation can either be done separately or jointly. For example a straight forward gradient method can be applied if the constraints of the allocation problem are relaxed. The obtained solution tends to fulfil the original constraints and it is also shown to be nearly optimum. The performance of all algorithms is evaluated by numerical simulations. Furthermore, their complexities are analysed and compared.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127608293","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-04-01DOI: 10.1109/WCNC.2012.6214445
Xiang Chen, Shenghui Song, K. Letaief
The degrees of freedom (DoF) has been recognized as a powerful metric to characterize the capacity of interference channels in the high signal-to-noise (SNR) region. In this paper, by utilizing linear interference alignment, we investigate the DoF of multiple-input and multiple-output (MIMO) interference relay channels without symbol extensions. An innovative algorithm is presented to align the interference, where the filter matrices at the sources, relays and destinations are determined in an iterative manner. Based on the assumption that improperness of the alignment condition implies its unsolvability, an upper bound for the achievable DoF tuple by linear interference alignment is derived, and then utilized to examine the performance of the proposed alignment algorithm. Simulation results show that the iterative algorithm can achieve the upper bound in medium to high DoF regions.
{"title":"Interference alignment in MIMO interference relay channels","authors":"Xiang Chen, Shenghui Song, K. Letaief","doi":"10.1109/WCNC.2012.6214445","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214445","url":null,"abstract":"The degrees of freedom (DoF) has been recognized as a powerful metric to characterize the capacity of interference channels in the high signal-to-noise (SNR) region. In this paper, by utilizing linear interference alignment, we investigate the DoF of multiple-input and multiple-output (MIMO) interference relay channels without symbol extensions. An innovative algorithm is presented to align the interference, where the filter matrices at the sources, relays and destinations are determined in an iterative manner. Based on the assumption that improperness of the alignment condition implies its unsolvability, an upper bound for the achievable DoF tuple by linear interference alignment is derived, and then utilized to examine the performance of the proposed alignment algorithm. Simulation results show that the iterative algorithm can achieve the upper bound in medium to high DoF regions.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127697037","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-04-01DOI: 10.1109/WCNC.2012.6214028
Zheng Lu, T. Luo, Xiaoyan Wang
Short preamble MAC protocols such as X-MAC use a series of consecutive short preamble packets with pauses between them, which refer to as a strobed preamble. Target receiver can send an ACK packet during those pauses to stop the preamble transmission. Hence, the average length of transmitted preamble is reduced in this way, higher energy efficiency and lower latency are achieved accordingly. But with pauses longer than the transmission of an ACK packet, the sampling period at receivers is increased significantly as well, which makes it suboptimal of energy efficiency in light traffic load networks. In this paper, the XY-MAC proposes a technique called early termination to sharpen the size of those pauses. With sharpened pauses, the sampling period at receivers can be effectively reduced to acquire a high level of energy efficiency, especially under low traffic loads. A set of experiments have been held to compare with X-MAC. The results show that the duty cycle can be reduced to 37% to 65% of X-MAC under various traffic loads and bit rates.
{"title":"XY-MAC: A short preamble MAC with sharpened pauses for wireless sensor networks","authors":"Zheng Lu, T. Luo, Xiaoyan Wang","doi":"10.1109/WCNC.2012.6214028","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214028","url":null,"abstract":"Short preamble MAC protocols such as X-MAC use a series of consecutive short preamble packets with pauses between them, which refer to as a strobed preamble. Target receiver can send an ACK packet during those pauses to stop the preamble transmission. Hence, the average length of transmitted preamble is reduced in this way, higher energy efficiency and lower latency are achieved accordingly. But with pauses longer than the transmission of an ACK packet, the sampling period at receivers is increased significantly as well, which makes it suboptimal of energy efficiency in light traffic load networks. In this paper, the XY-MAC proposes a technique called early termination to sharpen the size of those pauses. With sharpened pauses, the sampling period at receivers can be effectively reduced to acquire a high level of energy efficiency, especially under low traffic loads. A set of experiments have been held to compare with X-MAC. The results show that the duty cycle can be reduced to 37% to 65% of X-MAC under various traffic loads and bit rates.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126473838","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
扫码关注我们
求助内容：
应助结果提醒方式：