Pub Date : 2012-11-29DOI: 10.1109/ICC.2012.6364628
C. Thai, P. Popovski
Recently, the ideas of wireless network coding (NC) has significantly enriched the area of wireless cooperation/relaying. They bring substantial gains in spectral efficiency mainly in scenarios with two-way relaying. Inspired by the ideas of wireless NC, recently we have proposed techniques for coordinated direct/relay (CDR) transmissions. Leveraging on the fact that the interference can be subsequently canceled, these techniques embrace the interference among the communication flows to/from direct and relayed users. Hence, by allowing simultaneous transmissions, spectral efficiency is increased. In our prior work, we have proposed CDR with Decode-and-Forward (DF) relay in two scenarios. In this paper, we extend the two existing regenerative CDR schemes and proposed for the other two scenarios such that all schemes benefit from the aforementioned principle of containing the interference. The parameters in the schemes are optimized to have the largest rate region or the highest sum-rate. Numerical results show that DF CDR is better than the reference scheme and almost better than AF CDR.
{"title":"Rate regions for coordination of Decode-and-Forward relays and direct users","authors":"C. Thai, P. Popovski","doi":"10.1109/ICC.2012.6364628","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364628","url":null,"abstract":"Recently, the ideas of wireless network coding (NC) has significantly enriched the area of wireless cooperation/relaying. They bring substantial gains in spectral efficiency mainly in scenarios with two-way relaying. Inspired by the ideas of wireless NC, recently we have proposed techniques for coordinated direct/relay (CDR) transmissions. Leveraging on the fact that the interference can be subsequently canceled, these techniques embrace the interference among the communication flows to/from direct and relayed users. Hence, by allowing simultaneous transmissions, spectral efficiency is increased. In our prior work, we have proposed CDR with Decode-and-Forward (DF) relay in two scenarios. In this paper, we extend the two existing regenerative CDR schemes and proposed for the other two scenarios such that all schemes benefit from the aforementioned principle of containing the interference. The parameters in the schemes are optimized to have the largest rate region or the highest sum-rate. Numerical results show that DF CDR is better than the reference scheme and almost better than AF CDR.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128535888","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-11-29DOI: 10.1109/ICC.2012.6364276
C. Ang
This paper proposes a MAC-layer timeslot allocation signaling protocol for IEEE 802.16d mesh networks. The proposed mechanism complements the three-way-handshake signaling described in the specification to achieve fair sharing of timeslots among nodes and flows. In this paper we study the case where timeslots are reserved until cancelled explicitly. This form of reservation is efficient for long sessions of data transmissions such as video streaming or interactive media applications. Since timeslots are exclusively reserved for individual flows, bandwidth starvation can occur if remaining timeslots in the wireless medium around a node are not enough to fulfill new bandwidth requests. It is thus important to design a set of mechanisms to enable sharing of network capacity across all flows fairly. A set of intra- and inter-flow fairness mechanisms is designed to work with an adaptive timeslot allocation scheme. The mechanisms and signaling are designed to efficiently integrate with the three-way-handshake signaling of the IEEE 802.16d mesh specification. Simulation results showed that the proposed schemes can prevent starvation of slot allocation and are able to maintain fairness across flows in the persistence-reservation-based IEEE 802.16d mesh network.
{"title":"Protocol design of a slot allocation scheme for persistence-reservation-based IEEE 802.16d mesh networks","authors":"C. Ang","doi":"10.1109/ICC.2012.6364276","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364276","url":null,"abstract":"This paper proposes a MAC-layer timeslot allocation signaling protocol for IEEE 802.16d mesh networks. The proposed mechanism complements the three-way-handshake signaling described in the specification to achieve fair sharing of timeslots among nodes and flows. In this paper we study the case where timeslots are reserved until cancelled explicitly. This form of reservation is efficient for long sessions of data transmissions such as video streaming or interactive media applications. Since timeslots are exclusively reserved for individual flows, bandwidth starvation can occur if remaining timeslots in the wireless medium around a node are not enough to fulfill new bandwidth requests. It is thus important to design a set of mechanisms to enable sharing of network capacity across all flows fairly. A set of intra- and inter-flow fairness mechanisms is designed to work with an adaptive timeslot allocation scheme. The mechanisms and signaling are designed to efficiently integrate with the three-way-handshake signaling of the IEEE 802.16d mesh specification. Simulation results showed that the proposed schemes can prevent starvation of slot allocation and are able to maintain fairness across flows in the persistence-reservation-based IEEE 802.16d mesh network.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128638581","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-11-29DOI: 10.1109/ICC.2012.6364405
E. D. N. Ndih, S. Cherkaoui
In this paper we investigate the improvements in the capability of neighborhood prediction when the Physical-Layer Network Coding (PLNC) is used for relaying messages in Vehiculars Ad Hoc Networks (VANETs). We compute the probability that a link between two nodes is available at a given time in a three-node cooperative network, and we demonstrate that the use of PLNC, compared to the use of Network Coding (NC)-based or traditional routing (TR)-based relaying techniques, leads to a better accuracy of the neighborhood prediction. We also demonstrate that the accuracy of the prediction is tightly related to the mobility model used and that this tight relationship can be relaxed by using PLNC-based relaying neighborhood prediction (PRNP). The results demonstrate that PRNP can improve the accuracy of neighborhood prediction due to the high network capacity of PLNC-based networks.
{"title":"Toward neighborhood prediction using Physical-Layer Network Coding","authors":"E. D. N. Ndih, S. Cherkaoui","doi":"10.1109/ICC.2012.6364405","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364405","url":null,"abstract":"In this paper we investigate the improvements in the capability of neighborhood prediction when the Physical-Layer Network Coding (PLNC) is used for relaying messages in Vehiculars Ad Hoc Networks (VANETs). We compute the probability that a link between two nodes is available at a given time in a three-node cooperative network, and we demonstrate that the use of PLNC, compared to the use of Network Coding (NC)-based or traditional routing (TR)-based relaying techniques, leads to a better accuracy of the neighborhood prediction. We also demonstrate that the accuracy of the prediction is tightly related to the mobility model used and that this tight relationship can be relaxed by using PLNC-based relaying neighborhood prediction (PRNP). The results demonstrate that PRNP can improve the accuracy of neighborhood prediction due to the high network capacity of PLNC-based networks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116854911","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-11-29DOI: 10.1109/ICC.2012.6364476
R. G. Cid-Fuentes, J. Jornet, I. Akyildiz, E. Alarcón
Graphene-enabled wireless communications set the Terahertz Band as the frequency band of operation of future nanodevices (0.1-10 THz). Amongst others, femtosecond-long pulse-based modulation schemes have been recently proposed to enable the communication among nanodevices. Within this context, a receiver architecture suitable for nanodevices must be ultra compact, must have high sensitivity and must be ultra-low power. Unfortunately, common receiver architectures used in other communication schemes, such as IR-UWB, show a strong compromise between low complexity and performance. In this paper, a novel receiver architecture for pulse-based communication based on a Continuous-time Moving Average (CTMA) symbol detection scheme is presented. This scheme bases its symbol decision on the received signal power maximum peak after the CTMA, which is implemented with a single low-pass filter. Moreover, an analytical model for the symbol detection is provided and it is quantitatively shown that the proposed CTMA scheme outperforms previous symbol detection schemes for pulse-based modulations in terms of Symbol Error Rate (SER). The low complexity and relaxed synchronization needed for this symbol detector makes this structure specially suited for the development of future transceivers for nano-devices.
{"title":"A receiver architecture for pulse-based electromagnetic nanonetworks in the Terahertz Band","authors":"R. G. Cid-Fuentes, J. Jornet, I. Akyildiz, E. Alarcón","doi":"10.1109/ICC.2012.6364476","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364476","url":null,"abstract":"Graphene-enabled wireless communications set the Terahertz Band as the frequency band of operation of future nanodevices (0.1-10 THz). Amongst others, femtosecond-long pulse-based modulation schemes have been recently proposed to enable the communication among nanodevices. Within this context, a receiver architecture suitable for nanodevices must be ultra compact, must have high sensitivity and must be ultra-low power. Unfortunately, common receiver architectures used in other communication schemes, such as IR-UWB, show a strong compromise between low complexity and performance. In this paper, a novel receiver architecture for pulse-based communication based on a Continuous-time Moving Average (CTMA) symbol detection scheme is presented. This scheme bases its symbol decision on the received signal power maximum peak after the CTMA, which is implemented with a single low-pass filter. Moreover, an analytical model for the symbol detection is provided and it is quantitatively shown that the proposed CTMA scheme outperforms previous symbol detection schemes for pulse-based modulations in terms of Symbol Error Rate (SER). The low complexity and relaxed synchronization needed for this symbol detector makes this structure specially suited for the development of future transceivers for nano-devices.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126179222","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-11-29DOI: 10.1109/ICC.2012.6364930
M. Kuscu, Derya Malak, Ö. Akan
Nanoscale communication based on Förster Resonance Energy Transfer (FRET) enables nanomachines to communicate with each other using the excited state of the fluorescent molecules as the information conveyer. In this study, FRET-based nanoscale communication is further extended to realize FRET-based nanoscale broadcast communication with one transmitter and many receiver nanomachines, and the performance of the broadcast channel is analyzed information theoretically. Furthermore, an electrically controllable routing mechanism is proposed exploiting the Quantum Confined Stark Effect (QCSE) observed in quantum dots. It is shown that by appropriately selecting the employed molecules on the communicating nanomachines, it is possible to control the route of the information flow by externally applying electric field in FRET-based nanonetworks.
{"title":"An information theoretical analysis of broadcast networks and channel routing for FRET-based nanoscale communications","authors":"M. Kuscu, Derya Malak, Ö. Akan","doi":"10.1109/ICC.2012.6364930","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364930","url":null,"abstract":"Nanoscale communication based on Förster Resonance Energy Transfer (FRET) enables nanomachines to communicate with each other using the excited state of the fluorescent molecules as the information conveyer. In this study, FRET-based nanoscale communication is further extended to realize FRET-based nanoscale broadcast communication with one transmitter and many receiver nanomachines, and the performance of the broadcast channel is analyzed information theoretically. Furthermore, an electrically controllable routing mechanism is proposed exploiting the Quantum Confined Stark Effect (QCSE) observed in quantum dots. It is shown that by appropriately selecting the employed molecules on the communicating nanomachines, it is possible to control the route of the information flow by externally applying electric field in FRET-based nanonetworks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126508480","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-11-29DOI: 10.1109/ICC.2012.6364057
Li-Yu Daisy Liu, Chang Wen Chen
Multi-user multiple input multiple output (MU-MIMO) system is an excellent choice for the next generation broadband communications because of its great potential in enhancing MIMO system capacity. One major challenge of such system is the jointly optimal transceiver beamforming design that maximizes the sum capacity under a total power constraint. Existing approaches have provided convex optimization solution by exploiting the duality between transmitter and receiver. However, with high computation complexity, these approaches are ineligible of practical implementation. In this paper, we aim to provide complexity efficient transceiver beamformer and power allocation design in MU-MIMO downlink (broadcast) channels. We first develop an iterative sub-optimal algorithm based on cyclic self-SINR-maximization (CSSM) beamforming design and water-filling power allocation. Comparing to convex-optimization-based (COB) approaches, the proposed solution (i.e. CSSM-WF algorithm) have insignificant sum-rate degradation but very low computational complexity and extremely fast converging speed. Trying to improve the performance of CSSM-WF algorithm, we then introduce another algorithm denoted as efficient COB (ECOB) algorithm in which CSSM-WF algorithm is used to generate a good start point for optimal COB approaches. Simulation results prove the efficiency of both proposed algorithms.
{"title":"Joint transceiver beamforming design and power allocation for multiuser MIMO systems","authors":"Li-Yu Daisy Liu, Chang Wen Chen","doi":"10.1109/ICC.2012.6364057","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364057","url":null,"abstract":"Multi-user multiple input multiple output (MU-MIMO) system is an excellent choice for the next generation broadband communications because of its great potential in enhancing MIMO system capacity. One major challenge of such system is the jointly optimal transceiver beamforming design that maximizes the sum capacity under a total power constraint. Existing approaches have provided convex optimization solution by exploiting the duality between transmitter and receiver. However, with high computation complexity, these approaches are ineligible of practical implementation. In this paper, we aim to provide complexity efficient transceiver beamformer and power allocation design in MU-MIMO downlink (broadcast) channels. We first develop an iterative sub-optimal algorithm based on cyclic self-SINR-maximization (CSSM) beamforming design and water-filling power allocation. Comparing to convex-optimization-based (COB) approaches, the proposed solution (i.e. CSSM-WF algorithm) have insignificant sum-rate degradation but very low computational complexity and extremely fast converging speed. Trying to improve the performance of CSSM-WF algorithm, we then introduce another algorithm denoted as efficient COB (ECOB) algorithm in which CSSM-WF algorithm is used to generate a good start point for optimal COB approaches. Simulation results prove the efficiency of both proposed algorithms.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128575413","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-11-29DOI: 10.1109/ICC.2012.6364046
Malavika Bhaskaranand, J. Gibson
Most standard video compression schemes such as H.264/AVC involve a high complexity encoder with block motion estimation (ME) engine. However, applications such as video reconnaissance and surveillance using unmanned aerial vehicles (UAVs) require a low complexity video encoder. Additionally, in such applications, the motion in the video is primarily global and due to the known movement of the camera platform. Therefore in this work, we propose and investigate a low complexity encoder with global motion based frame prediction and no block ME. We show that for videos with mostly global motion, this encoder performs better than a baseline H.264 encoder with ME block size restricted to 8×8. Furthermore, the quality degradation of this encoder with decreasing bit rate is more gradual than that of the baseline H.264 encoder since it does not need to allocate bits across motion vectors (MVs) and residue data. We also incorporate a spectral entropy based coefficient selection and quantizer design scheme that entails latency and demonstrate that it helps achieve more consistent frame quality across the video sequence.
{"title":"Global motion compensation and spectral entropy bit allocation for low complexity video coding","authors":"Malavika Bhaskaranand, J. Gibson","doi":"10.1109/ICC.2012.6364046","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364046","url":null,"abstract":"Most standard video compression schemes such as H.264/AVC involve a high complexity encoder with block motion estimation (ME) engine. However, applications such as video reconnaissance and surveillance using unmanned aerial vehicles (UAVs) require a low complexity video encoder. Additionally, in such applications, the motion in the video is primarily global and due to the known movement of the camera platform. Therefore in this work, we propose and investigate a low complexity encoder with global motion based frame prediction and no block ME. We show that for videos with mostly global motion, this encoder performs better than a baseline H.264 encoder with ME block size restricted to 8×8. Furthermore, the quality degradation of this encoder with decreasing bit rate is more gradual than that of the baseline H.264 encoder since it does not need to allocate bits across motion vectors (MVs) and residue data. We also incorporate a spectral entropy based coefficient selection and quantizer design scheme that entails latency and demonstrate that it helps achieve more consistent frame quality across the video sequence.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129262228","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-11-29DOI: 10.1109/ICC.2012.6364792
R. Goyette, A. Karmouch
In future Internet architectures, Virtual Network Providers (VNP) must be able to compose virtual networks in a way that balances security with other priorities as expressed by Service Providers (SP). In this paper, we outline a framework in which a VNP can assess the security and assurance (robustness) properties of virtual networks and use these to help select an SP-appropriate topology. The topology selection algorithm is based on the Analytic Hierarchy Process (AHP) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and uses cost and robustness as selection constraints. Our framework allows the VNP to identify the customer's needs for security and balance these with other priorities such as quality of service and cost. We show that this approach fits naturally into the business model of the VNP and takes advantage of risk management activities that may already be performed by SPs. Because security concerns can dampen enthusiasm for new ways of doing business, addressing the challenges above can help ease the transition to the future Internet.
{"title":"Using AHP/TOPSIS with cost and robustness criteria for virtual network node assignment","authors":"R. Goyette, A. Karmouch","doi":"10.1109/ICC.2012.6364792","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364792","url":null,"abstract":"In future Internet architectures, Virtual Network Providers (VNP) must be able to compose virtual networks in a way that balances security with other priorities as expressed by Service Providers (SP). In this paper, we outline a framework in which a VNP can assess the security and assurance (robustness) properties of virtual networks and use these to help select an SP-appropriate topology. The topology selection algorithm is based on the Analytic Hierarchy Process (AHP) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and uses cost and robustness as selection constraints. Our framework allows the VNP to identify the customer's needs for security and balance these with other priorities such as quality of service and cost. We show that this approach fits naturally into the business model of the VNP and takes advantage of risk management activities that may already be performed by SPs. Because security concerns can dampen enthusiasm for new ways of doing business, addressing the challenges above can help ease the transition to the future Internet.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117174117","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-11-29DOI: 10.1109/ICC.2012.6364620
Virginia Pilloni, M. Franceschelli, L. Atzori, A. Giua
We consider the scenario of a Wireless Sensor Networks (WSN) where the nodes are equipped with a programmable middleware that allows for quickly deploying different applications running on top of it so as to follow the changing ambient needs. We then address the problem of finding the optimal deployment of the target applications in terms of network lifetime. We approach the problem considering every possible decomposition of an application's sensing and computing operations into tasks to be assigned to each infrastructure component. The contribution of energy consumption due to the energy cost of each task is then considered into local cost functions in each node, allowing us to evaluate the viability of the deployment solution. The proposed algorithm is based on an iterative and asynchronous local optimization of the task allocations between neighboring nodes that increases the network lifetime. Simulation results show that our framework leads to considerable energy saving with respect to both sink-oriented and cluster-oriented deployment approaches, particularly for networks with high node densities and non-uniform energy consumption or initial battery charge.
{"title":"A decentralized lifetime maximization algorithm for distributed applications in Wireless Sensor Networks","authors":"Virginia Pilloni, M. Franceschelli, L. Atzori, A. Giua","doi":"10.1109/ICC.2012.6364620","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364620","url":null,"abstract":"We consider the scenario of a Wireless Sensor Networks (WSN) where the nodes are equipped with a programmable middleware that allows for quickly deploying different applications running on top of it so as to follow the changing ambient needs. We then address the problem of finding the optimal deployment of the target applications in terms of network lifetime. We approach the problem considering every possible decomposition of an application's sensing and computing operations into tasks to be assigned to each infrastructure component. The contribution of energy consumption due to the energy cost of each task is then considered into local cost functions in each node, allowing us to evaluate the viability of the deployment solution. The proposed algorithm is based on an iterative and asynchronous local optimization of the task allocations between neighboring nodes that increases the network lifetime. Simulation results show that our framework leads to considerable energy saving with respect to both sink-oriented and cluster-oriented deployment approaches, particularly for networks with high node densities and non-uniform energy consumption or initial battery charge.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129824847","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-11-29DOI: 10.1109/ICC.2012.6364080
Le-Nam Tran, M. Juntti, M. Bengtsson, B. Ottersten
Successive zero-forcing dirty paper coding (SZF-DPC) is a simplified alternative to DPC for MIMO broadcast channels (MIMO BCs). In the SZF-DPC scheme, the noncausally-known interference is canceled by DPC, while the residual interference is suppressed by the ZF technique. Due to the ZF constraints, the precoders are constrained to lie in the null space of a matrix. For the sum rate maximization problem under a sum power constraint, the existing precoder designs naturally rely on the singular value decomposition (SVD). The SVD-based design is optimal but needs high computational complexity. Herein, we propose two low-complexity optimal precoder designs for SZF-DPC, all based on the QR decomposition (QRD), which requires lower complexity than SVD. The first design method is an iterative algorithm to find an orthonormal basis of the null space of a matrix that has a recursive structure. The second proposed method, which will be shown to require the lowest complexity, results from applying a single QRD to the matrix comprising all users' channel matrices. We analytically and numerically show that the two proposed precoder designs are optimal.
{"title":"Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs","authors":"Le-Nam Tran, M. Juntti, M. Bengtsson, B. Ottersten","doi":"10.1109/ICC.2012.6364080","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364080","url":null,"abstract":"Successive zero-forcing dirty paper coding (SZF-DPC) is a simplified alternative to DPC for MIMO broadcast channels (MIMO BCs). In the SZF-DPC scheme, the noncausally-known interference is canceled by DPC, while the residual interference is suppressed by the ZF technique. Due to the ZF constraints, the precoders are constrained to lie in the null space of a matrix. For the sum rate maximization problem under a sum power constraint, the existing precoder designs naturally rely on the singular value decomposition (SVD). The SVD-based design is optimal but needs high computational complexity. Herein, we propose two low-complexity optimal precoder designs for SZF-DPC, all based on the QR decomposition (QRD), which requires lower complexity than SVD. The first design method is an iterative algorithm to find an orthonormal basis of the null space of a matrix that has a recursive structure. The second proposed method, which will be shown to require the lowest complexity, results from applying a single QRD to the matrix comprising all users' channel matrices. We analytically and numerically show that the two proposed precoder designs are optimal.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127538328","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
扫码关注我们
求助内容：
应助结果提醒方式：