To the existing spectrum sharing schemes in wireless-powered cognitive wireless sensor networks,the protocols are limited to either separate the primary and the secondary transmission or allow the secondary user to tr...To the existing spectrum sharing schemes in wireless-powered cognitive wireless sensor networks,the protocols are limited to either separate the primary and the secondary transmission or allow the secondary user to transmit signals in a time slot when it forwards the primary signal.In order to address this limitation,a novel cooperative spectrum sharing scheme is proposed,where the secondary transmission is multiplexed with both the primary transmission and the relay transmission.Specifically,the process of transmission is on a three-phase time-switching relaying basis.In the first phase,a cognitive sensor node SU1 scavenges energy from the primary transmission.In the second phase,another sensor node SU2 and primary transmitter simultaneously transmit signals to the SU1.In the third phase,the node SU1 can assist the primary transmission to acquire the opportunity of spectrum sharing.Joint decoding and interference cancellation technique is adopted at the receivers to retrieve the desired signals.We further derive the closed-form expressions for the outage probabilities of both the primary and secondary systems.Moreover,we address optimization of energy harvesting duration and power allocation coefficient strategy under performance criteria.An effective algorithm is then presented to solve the optimization problem.Simulation results demonstrate that with the optimized solutions,the sensor nodes with the proposed cooperative spectrum sharing scheme can utilize the spectrum in a more efficient manner without deteriorating the performance of the primary transmission,as compared with the existing one-directional scheme in the literature.展开更多
Recent researches show that inter-session network coding could decrease the number of packets transmission and achieve higher throughput in wireless network compared with traditional forwarding mechanism. In most exis...Recent researches show that inter-session network coding could decrease the number of packets transmission and achieve higher throughput in wireless network compared with traditional forwarding mechanism. In most existing relay mechanisms based on inter-session network such as COPE, relay node demands to collect the messages from its neighbor nodes to get notice of which packets already overheard by them so as to determine whether there exists coding opportunity between or among forwarding packets. However, transmission overhead of this message collection and computing cost of opportunity determination will degrade the performance of these mechanisms. It is observed that coding opportunity at relay node is much more related with the local topology, and the opportunity of encoding three or more packets together is far less than that of encoding two packets together in wireless network with general density. Based on this, a new coding-aware routing mechanism, named TCAR, is proposed. TCAR ignores the oppommity of encoding three or more than three packets together. Each relay node maintains an encoding mapping table being established according to the result of its local topology detection, which can be used to calculate the path cost during routing setup phase, and determine that which two packets can be encoded together during the packets forwarding phase. In TCAR, instead of periodic messages collection, each relay nodes just need once local topology detection, and the encoding determination is much simpler than that of the former mechanisms. Simulation results show that compared with typical inter-session network coding mechanisms COPE and COPE-based routing, TCAR achieves 12% and 7% throughput gains, and keeps the minimum end to end delay.展开更多
An explicit congestion notification (ECN)-based distributed transport protocol,ARROW-WTCP (AcceleRate tRansmission towards Optimal Window size TCP for Wireless network),was proposed.The ARROW-WTCP enables feasible dep...An explicit congestion notification (ECN)-based distributed transport protocol,ARROW-WTCP (AcceleRate tRansmission towards Optimal Window size TCP for Wireless network),was proposed.The ARROW-WTCP enables feasible deployment of ARROW-TCP from wired to wireless networks by providing a joint design of source and router algorithms.The protocol obtains the actual capacity of the wireless channel by calculating the queue variation in base station (BS) and adjusts the congestion window by using the feedback from its bottleneck link.The simulation results show that the ARROW-WTCP achieves strong stability,max-min fairness in dynamic networks,fast convergence to efficiency without introducing much excess traffic,and almost full link utilization in the steady state.It outperforms the XCP-B (eXplicit Control Protocol Blind),the wireless version of XCP,in terms of stability,fairness,convergence and utilization in wireless networks.展开更多
基金Project (61201086) supported by the National Natural Science Foundation of ChinaProject (201506375060) supported by the China Scholarship Council+2 种基金Project (2013B090500007) supported by Guangdong Provincial Science and Technology Project,ChinaProject (2014509102205) supported by the Dongguan Municipal Project on the Integration of Industry,Education and Research,ChinaProject (2017GK5019) supported by 2017 Hunan-Tech&Innovation Investment Project,China
文摘To the existing spectrum sharing schemes in wireless-powered cognitive wireless sensor networks,the protocols are limited to either separate the primary and the secondary transmission or allow the secondary user to transmit signals in a time slot when it forwards the primary signal.In order to address this limitation,a novel cooperative spectrum sharing scheme is proposed,where the secondary transmission is multiplexed with both the primary transmission and the relay transmission.Specifically,the process of transmission is on a three-phase time-switching relaying basis.In the first phase,a cognitive sensor node SU1 scavenges energy from the primary transmission.In the second phase,another sensor node SU2 and primary transmitter simultaneously transmit signals to the SU1.In the third phase,the node SU1 can assist the primary transmission to acquire the opportunity of spectrum sharing.Joint decoding and interference cancellation technique is adopted at the receivers to retrieve the desired signals.We further derive the closed-form expressions for the outage probabilities of both the primary and secondary systems.Moreover,we address optimization of energy harvesting duration and power allocation coefficient strategy under performance criteria.An effective algorithm is then presented to solve the optimization problem.Simulation results demonstrate that with the optimized solutions,the sensor nodes with the proposed cooperative spectrum sharing scheme can utilize the spectrum in a more efficient manner without deteriorating the performance of the primary transmission,as compared with the existing one-directional scheme in the literature.
基金Projects(61173169,61106036)supported by the National Natural Science Foundation of ChinaProject(NCET-10-0798)Program for New Century Excellent Talents in University,China
文摘Recent researches show that inter-session network coding could decrease the number of packets transmission and achieve higher throughput in wireless network compared with traditional forwarding mechanism. In most existing relay mechanisms based on inter-session network such as COPE, relay node demands to collect the messages from its neighbor nodes to get notice of which packets already overheard by them so as to determine whether there exists coding opportunity between or among forwarding packets. However, transmission overhead of this message collection and computing cost of opportunity determination will degrade the performance of these mechanisms. It is observed that coding opportunity at relay node is much more related with the local topology, and the opportunity of encoding three or more packets together is far less than that of encoding two packets together in wireless network with general density. Based on this, a new coding-aware routing mechanism, named TCAR, is proposed. TCAR ignores the oppommity of encoding three or more than three packets together. Each relay node maintains an encoding mapping table being established according to the result of its local topology detection, which can be used to calculate the path cost during routing setup phase, and determine that which two packets can be encoded together during the packets forwarding phase. In TCAR, instead of periodic messages collection, each relay nodes just need once local topology detection, and the encoding determination is much simpler than that of the former mechanisms. Simulation results show that compared with typical inter-session network coding mechanisms COPE and COPE-based routing, TCAR achieves 12% and 7% throughput gains, and keeps the minimum end to end delay.
基金Projects(60873265,60903222) supported by the National Natural Science Foundation of China Project(IRT0661) supported by the Program for Changjiang Scholars and Innovative Research Team in University of China
文摘An explicit congestion notification (ECN)-based distributed transport protocol,ARROW-WTCP (AcceleRate tRansmission towards Optimal Window size TCP for Wireless network),was proposed.The ARROW-WTCP enables feasible deployment of ARROW-TCP from wired to wireless networks by providing a joint design of source and router algorithms.The protocol obtains the actual capacity of the wireless channel by calculating the queue variation in base station (BS) and adjusts the congestion window by using the feedback from its bottleneck link.The simulation results show that the ARROW-WTCP achieves strong stability,max-min fairness in dynamic networks,fast convergence to efficiency without introducing much excess traffic,and almost full link utilization in the steady state.It outperforms the XCP-B (eXplicit Control Protocol Blind),the wireless version of XCP,in terms of stability,fairness,convergence and utilization in wireless networks.
