Cooperative jamming weapon-target assignment （CJWTA） problem is a key issue in electronic countermeasures （ECM）. Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness...Cooperative jamming weapon-target assignment （CJWTA） problem is a key issue in electronic countermeasures （ECM）. Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution （SLDDE） algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems.展开更多
In this paper, we propose a smart step closed-loop power control (SSPC) algorithm and a base station assignment method based on minimizing the transmitter power (BSA-MTP) technique in a direct sequence-code division m...In this paper, we propose a smart step closed-loop power control (SSPC) algorithm and a base station assignment method based on minimizing the transmitter power (BSA-MTP) technique in a direct sequence-code division multiple access (DS-CDMA) receiver with frequency-selective Rayleigh fading. This receiver consists of three stages. In the first stage, with constrained least mean squared (CLMS) algorithm, the desired users’ signal in an arbitrary path is passed and the inter-path interference (IPI) is reduced in other paths in each RAKE finger. Also in this stage, the multiple access interference (MAI) from other users is reduced. Thus, the matched filter (MF) can use for more reduction of the IPI and MAI in each RAKE finger in the second stage. Also in the third stage, the output signals from the matched filters are combined according to the conventional maximal ratio combining (MRC) principle and then are fed into the decision circuit of the desired user. The simulation results indicate that the SSPC algorithm and the BSA-MTP technique can significantly reduce the network bit error rate (BER) compared to the other methods. Also, we observe that significant savings in total transmit power (TTP) are possible with our methods.展开更多
Many efforts have been made to develop time division multiple access （TDMA） slots allocation in a multi-hop converge-cast wireless sensor network （WSN）, however, most of them either use complex algorithm or concer...Many efforts have been made to develop time division multiple access （TDMA） slots allocation in a multi-hop converge-cast wireless sensor network （WSN）, however, most of them either use complex algorithm or concern frames only without simultaneous transmission in a single slot. In this paper, we present a timeslot assignment scheme for cluster-tree-based TDMA WSN, co：＇ering three frequently used working modes in practical applications. The shortest frame formed can guarantee real-time conununication and is also facilitated for message and slot integration, since timeslots allocated to a single node are continuous. During allocation processes, the algorithms are distributed and light-weighted. The experiment resulted from a WSN prototype system shows that our scheme can achieve a good reliability.展开更多
This paper proposes a novel adaptive time division vehicular ad-hoc networks. ATSA divides different sets multiple access （TDMA） slot assignment protocol （ATSA） for of time slots according to vehicles moving in op...This paper proposes a novel adaptive time division vehicular ad-hoc networks. ATSA divides different sets multiple access （TDMA） slot assignment protocol （ATSA） for of time slots according to vehicles moving in opposite directions. When a node accesses the networks, it choices a frame length and competes a slot based on its direction and location to communication with the other nodes. Based on the binary tree algorithm, the frame length is dynamically doubled or shortened, and the ratio of two slot sets is adjusted to decrease the probability of transmission collisions. The theoretical analysis proves ATSA protocol can reduce the time delay at least 20% than the media access control protocol for vehicular ad-hoc networks （VeMAC） and 30% than the ad-hoc. The simulation experiment shows that ATSA has a good scalability and the collisions would be reduced about 50% than VeMAC, channel utilization is significantly improved than several existing protocols.展开更多
基金supported by the Fundamental Research Funds for the Central Universities(NZ2013306)the Funding of Jiangsu Innovation Program for Graduate Education(CXLX11 0203)
文摘Cooperative jamming weapon-target assignment （CJWTA） problem is a key issue in electronic countermeasures （ECM）. Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution （SLDDE） algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems.
文摘In this paper, we propose a smart step closed-loop power control (SSPC) algorithm and a base station assignment method based on minimizing the transmitter power (BSA-MTP) technique in a direct sequence-code division multiple access (DS-CDMA) receiver with frequency-selective Rayleigh fading. This receiver consists of three stages. In the first stage, with constrained least mean squared (CLMS) algorithm, the desired users’ signal in an arbitrary path is passed and the inter-path interference (IPI) is reduced in other paths in each RAKE finger. Also in this stage, the multiple access interference (MAI) from other users is reduced. Thus, the matched filter (MF) can use for more reduction of the IPI and MAI in each RAKE finger in the second stage. Also in the third stage, the output signals from the matched filters are combined according to the conventional maximal ratio combining (MRC) principle and then are fed into the decision circuit of the desired user. The simulation results indicate that the SSPC algorithm and the BSA-MTP technique can significantly reduce the network bit error rate (BER) compared to the other methods. Also, we observe that significant savings in total transmit power (TTP) are possible with our methods.
基金Supported by the National High Technology Research and Development Programme of China ( No. 2006AA040302 2007AA041201 +1 种基金 2007AA041301 )the National Creative Research Groups Science Foundation of China (No. 60721062)
文摘Many efforts have been made to develop time division multiple access （TDMA） slots allocation in a multi-hop converge-cast wireless sensor network （WSN）, however, most of them either use complex algorithm or concern frames only without simultaneous transmission in a single slot. In this paper, we present a timeslot assignment scheme for cluster-tree-based TDMA WSN, co：＇ering three frequently used working modes in practical applications. The shortest frame formed can guarantee real-time conununication and is also facilitated for message and slot integration, since timeslots allocated to a single node are continuous. During allocation processes, the algorithms are distributed and light-weighted. The experiment resulted from a WSN prototype system shows that our scheme can achieve a good reliability.
基金supported by the National Natural Science Foundation of China (61202099, 61073180)the National Science and Technology Major Project (2010ZX03006-004)+1 种基金the Science and Technology Project of Henan province (102102210026)Ph.D.Programs Foundation of Henan University of Technology(2009BS021)
文摘This paper proposes a novel adaptive time division vehicular ad-hoc networks. ATSA divides different sets multiple access （TDMA） slot assignment protocol （ATSA） for of time slots according to vehicles moving in opposite directions. When a node accesses the networks, it choices a frame length and competes a slot based on its direction and location to communication with the other nodes. Based on the binary tree algorithm, the frame length is dynamically doubled or shortened, and the ratio of two slot sets is adjusted to decrease the probability of transmission collisions. The theoretical analysis proves ATSA protocol can reduce the time delay at least 20% than the media access control protocol for vehicular ad-hoc networks （VeMAC） and 30% than the ad-hoc. The simulation experiment shows that ATSA has a good scalability and the collisions would be reduced about 50% than VeMAC, channel utilization is significantly improved than several existing protocols.
