In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,w...In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.展开更多
A new combinational technology is proposed,which is feasible to apply physical-layer network coding（PNC） to wireless fading channels by employing the harmful interference strategically.The key step of PNC is that so...A new combinational technology is proposed,which is feasible to apply physical-layer network coding（PNC） to wireless fading channels by employing the harmful interference strategically.The key step of PNC is that sources broadcast signals simultaneously without orthogonal scheduling.Naturally,the signals overlap in the free space at the receivers.Since the signals from different sources are mutual independent,rooted on this rational assumption,an enhanced joint diagonalization separation named altering row diagonalization（ARD） algorithm is exploited to separate these signals by maximizing the cost function measuring independence among them.This ARD PNC（APNC） methodology provides an innovative way to implement signal-level network coding at the presence of interference and without any priori information about channels in fading environments.In conclusions,the proposed APNC performs well with higher bandwidth utility and lower error rate.展开更多
This study analyzes the impact of Physical-layer Network Coding （PNC） on the throughput of a large random wireless network, including one-dimensional and two-dimensional networks. Three different transmission scheme...This study analyzes the impact of Physical-layer Network Coding （PNC） on the throughput of a large random wireless network, including one-dimensional and two-dimensional networks. Three different transmission schemes, （1） a traditional flow-based scheme, （2） a network coding scheme, and （3） the PNC scheme are compared to show that the PNC scheme improves wireless network throughput by a constant factor without changing the scaling law compared to the traditional flow-based and network coding schemes. Furthermore, PNC can reduce the effect of interference for the one-dimensional networks, and has a tighter throughput bound for the two-dimensional network.展开更多
This article considers the two-way multiple-input multiple-output（MIMO） relaying channels with multiple users,in which multiple users are served simultaneously by the base station（BS） with the assistance of the re...This article considers the two-way multiple-input multiple-output（MIMO） relaying channels with multiple users,in which multiple users are served simultaneously by the base station（BS） with the assistance of the relay.The transmission consists of only two phases,doubling the system throughout over traditional one-way half-duplex transmission.A zero-forcing dirty paper coding（ZFDPC） aided physical-layer network coding（PNC） scheme is proposed in this article and the achievable capacity of the ZFDPC aided PNC scheme is derived.Simulation results show that the proposed scheme outperforms the previous decode-and-forward（DF） and zero-forcing beamforming（ZFBF） aided PNC scheme due to more degrees of freedoms and the advantage of PNC.Moreover,we analyze the effect of the imperfect channel state information（CSI） from RS to users at BS side to show the robustness of the proposed ZFDPC aided PNC scheme.展开更多
In this paper, a network scenario of two-way relaying over orthogonal frequency division multiplexing （OFDM） is considered, in which two nodes intend to exchange the information via a relay using physical-layer netw...In this paper, a network scenario of two-way relaying over orthogonal frequency division multiplexing （OFDM） is considered, in which two nodes intend to exchange the information via a relay using physical-layer network coding （PLNC）. Assuming that the full channel knowledge is available, an optimization problem, which maximizes the achievable sum rate under a sum-power constraint, is investigated. It is shown that the optimization problem is non-convex, which is difficult to find the global optimum solution in terms of the computational complexity. In consequence, a low-complexity optimal power allocation scheme is proposed for practice implementation. A link capacity diagram is first employed for power allocation on each subcarrier. Subsequently, an equivalent relaxed optimization problem and Karush-Kuhn-Tucker （KKT） conditions are developed for power allocation among each subcarrier. Simulation results demonstrate that the substantial capacity gains are achieved by implementing the proposed schemes efficiently with a low-complexity computational effort.展开更多
Systems are always designed and optimized based on full traffic load in the current literatures. However, practical systems are seldom operating at full load, even at peak traffic hours. Instead of maximizing system r...Systems are always designed and optimized based on full traffic load in the current literatures. However, practical systems are seldom operating at full load, even at peak traffic hours. Instead of maximizing system rate to achieve the full load, an optimal energy-efficient scheme to minimize the transmit power with required rates is investigated in this article. The considered scenario is a two-way relay channel using amplify-and-forward protocol of physical layer network coding, where two end nodes exchange messages via multiple relay nodes within two timeslots. A joint power allocation and relay selection scheme is designed to achieve the minimum transmit power. Through convex optimization theory, we firstly prove that single relay selection scheme is the most energy-efficient way for physical layer network coding. The closed-form expressions of power allocation are also given. Numerical simulations demonstrate the performance of the designed scheme as well as the comparison among different schemes.展开更多
Previous research on security of network coding focused on the protection of data dissemination procedures and the detection of malicious activities such as pollution attacks. The capabilities of network coding to det...Previous research on security of network coding focused on the protection of data dissemination procedures and the detection of malicious activities such as pollution attacks. The capabilities of network coding to detect other attacks have not been fully explored. In this paper, we propose a new mechanism based on physical layer network coding to detect wormhole attacks. When two signal sequences collide at the receiver, the starting point of the collision is determined by the distances between the receiver and the senders. Therefore, by comparing the starting points of the collisions at two receivers, we can estimate the distance between them and detect fake neighbor connections via wormholes. While the basic idea is clear, we have proposed several schemes at both physical and network layers to transform the idea into a practical approach. Simulations using BPSK modulation at the physical layer show that the wireless nodes can effectively detect fake neighbor connections without the adoption of special hardware or time synchronization.展开更多
基金the National Natural Science Foundation of China under Grant 61502411Natural Science Foundation of Jiangsu Province under Grant BK20150432 and BK20151299+7 种基金Natural Science Research Project for Universities of Jiangsu Province under Grant 15KJB520034China Postdoctoral Science Foundation under Grant 2015M581843Jiangsu Provincial Qinglan ProjectTeachers Overseas Study Program of Yancheng Institute of TechnologyJiangsu Provincial Government Scholarship for Overseas StudiesTalents Project of Yancheng Institute of Technology under Grant KJC2014038“2311”Talent Project of Yancheng Institute of TechnologyOpen Fund of Modern Agricultural Resources Intelligent Management and Application Laboratory of Huzhou Normal University.
文摘In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.
基金supported by the National Natural Science Foundation of China(6120118361132002)
文摘A new combinational technology is proposed,which is feasible to apply physical-layer network coding（PNC） to wireless fading channels by employing the harmful interference strategically.The key step of PNC is that sources broadcast signals simultaneously without orthogonal scheduling.Naturally,the signals overlap in the free space at the receivers.Since the signals from different sources are mutual independent,rooted on this rational assumption,an enhanced joint diagonalization separation named altering row diagonalization（ARD） algorithm is exploited to separate these signals by maximizing the cost function measuring independence among them.This ARD PNC（APNC） methodology provides an innovative way to implement signal-level network coding at the presence of interference and without any priori information about channels in fading environments.In conclusions,the proposed APNC performs well with higher bandwidth utility and lower error rate.
文摘This study analyzes the impact of Physical-layer Network Coding （PNC） on the throughput of a large random wireless network, including one-dimensional and two-dimensional networks. Three different transmission schemes, （1） a traditional flow-based scheme, （2） a network coding scheme, and （3） the PNC scheme are compared to show that the PNC scheme improves wireless network throughput by a constant factor without changing the scaling law compared to the traditional flow-based and network coding schemes. Furthermore, PNC can reduce the effect of interference for the one-dimensional networks, and has a tighter throughput bound for the two-dimensional network.
基金supported by IMT-Advanced Novel Wireless Transmission Technology Program (2008ZX03003-004,2008BAH30B09)Chinese Important National Science and Technology Specific Project (2010ZX03002-003)+1 种基金the National Basic Research Program of China (2007CB310602)International Science and Technology Cooperation Program (2008DFA12160)
文摘This article considers the two-way multiple-input multiple-output（MIMO） relaying channels with multiple users,in which multiple users are served simultaneously by the base station（BS） with the assistance of the relay.The transmission consists of only two phases,doubling the system throughout over traditional one-way half-duplex transmission.A zero-forcing dirty paper coding（ZFDPC） aided physical-layer network coding（PNC） scheme is proposed in this article and the achievable capacity of the ZFDPC aided PNC scheme is derived.Simulation results show that the proposed scheme outperforms the previous decode-and-forward（DF） and zero-forcing beamforming（ZFBF） aided PNC scheme due to more degrees of freedoms and the advantage of PNC.Moreover,we analyze the effect of the imperfect channel state information（CSI） from RS to users at BS side to show the robustness of the proposed ZFDPC aided PNC scheme.
基金supported by the National Natural Science Foundation of China (60496315,60802009)the Hi-Tech Research and Development Program of China (2008AA01Z204,2009AA011202,2009AA01Z205)the International Science and Technology Cooperation Programmer of China (2008DFA11630)
文摘In this paper, a network scenario of two-way relaying over orthogonal frequency division multiplexing （OFDM） is considered, in which two nodes intend to exchange the information via a relay using physical-layer network coding （PLNC）. Assuming that the full channel knowledge is available, an optimization problem, which maximizes the achievable sum rate under a sum-power constraint, is investigated. It is shown that the optimization problem is non-convex, which is difficult to find the global optimum solution in terms of the computational complexity. In consequence, a low-complexity optimal power allocation scheme is proposed for practice implementation. A link capacity diagram is first employed for power allocation on each subcarrier. Subsequently, an equivalent relaxed optimization problem and Karush-Kuhn-Tucker （KKT） conditions are developed for power allocation among each subcarrier. Simulation results demonstrate that the substantial capacity gains are achieved by implementing the proposed schemes efficiently with a low-complexity computational effort.
基金supported by the International Scientific and Technological Cooperation Program (S2010GR0902)
文摘Systems are always designed and optimized based on full traffic load in the current literatures. However, practical systems are seldom operating at full load, even at peak traffic hours. Instead of maximizing system rate to achieve the full load, an optimal energy-efficient scheme to minimize the transmit power with required rates is investigated in this article. The considered scenario is a two-way relay channel using amplify-and-forward protocol of physical layer network coding, where two end nodes exchange messages via multiple relay nodes within two timeslots. A joint power allocation and relay selection scheme is designed to achieve the minimum transmit power. Through convex optimization theory, we firstly prove that single relay selection scheme is the most energy-efficient way for physical layer network coding. The closed-form expressions of power allocation are also given. Numerical simulations demonstrate the performance of the designed scheme as well as the comparison among different schemes.
基金Supported in part by the NSF CNS Award (No. 1143602)
文摘Previous research on security of network coding focused on the protection of data dissemination procedures and the detection of malicious activities such as pollution attacks. The capabilities of network coding to detect other attacks have not been fully explored. In this paper, we propose a new mechanism based on physical layer network coding to detect wormhole attacks. When two signal sequences collide at the receiver, the starting point of the collision is determined by the distances between the receiver and the senders. Therefore, by comparing the starting points of the collisions at two receivers, we can estimate the distance between them and detect fake neighbor connections via wormholes. While the basic idea is clear, we have proposed several schemes at both physical and network layers to transform the idea into a practical approach. Simulations using BPSK modulation at the physical layer show that the wireless nodes can effectively detect fake neighbor connections without the adoption of special hardware or time synchronization.
