A regional protection system based on a wireless Ad-Hoc network has been in operation since 2008 in Shiojiri City, Japan. Wireless terminals transmit data packets to a server via transponders situated around the city. In this paper, a new routing algorithm that takes into account the level of congestion of the transponders is proposed. Using computer simulations, the proposed algorithm is shown to reduce the packet loss rate compared to the previous algorithm which is based on minimization of the number of hops to the server. Also, the proposed algorithm is shown be have almost the same packet loss rate as the best routing decisions obtained by an exhaustive search. Furthermore, the simulations used recreate the actual movement of terminals, so the results show what will happen in a realistic environment.

We consider space time block coded-continuous phase modulation (STBC-CPM), which has the advantages of both STBC and CPM at the same time. A weak point of STBC-CPM is that the normalized spectral efficiency (NSE) is limited by the orthogonality of the STBC and CPM parameters. The purpose of this study is to improve the NSE of STBC-CPM. The NSE depends on the transmission rate (TR), the bit error rate (BER) and the occupied bandwidth (OBW). First, to improve the TR, we adapt quasi orthogonal-STBC (QO-STBC) for four transmit antennas and quasi-group orthogonal Toeplitz code (Q-GOTC) for eight transmit antennas, at the expense of the orthogonality. Second, to evaluate the BER, we derive a BER approximation of STBC-CPM with non-orthogonal STBC (NO-STBC). The theoretical analysis and simulation results show that the NSE can be improved by using QO-STBC and Q-GOTC. Third, the OBW depends on CPM parameters, therefore, the tradeoff between the NSE and the CPM parameters is considered. A computer simulation provides a candidate set of CPM parameters which have better NSE. Finally, the adaptation of non-orthogonal STBC to STBC-CPM can be viewed as a generalization of the study by Silvester et al., because orthogonal STBC can be thought of as a special case of non-orthogonal STBC. Also, the adaptation of Q-GOTC to CPM can be viewed as a generalization of our previous letter, because linear modulation scheme can be thought of as a special case of non-linear modulation.

In this paper, an automatic identification method based on frequency discrimination is proposed. The proposed method can be used when the received signal is a constant envelope modulation scheme. To test the proposed method PSK and FSK are considered. Using computer simulations, the performance of the proposed method was evaluated and found to be able to distinguish between PSK and FSK well even in the presence of noise.

Landslides during heavy rainfall cause a great amount of damage in terms of both property and human life. To predict landslide disasters, we designed and implemented a wireless sensor network using our existing highly fault tolerant ad-hoc network. Since many sensors must be used, we propose a new MAC protocol that allows the network to support more sensor terminals. Our protocol is a hybrid CSMA/Psuedo-TDMA scheme which allows the terminals to decide their transmission timing independently in a random fashion. A timing beacon is not required, so power consumption can be reduced. Simulation results show that the number of terminals supported by the network can be greatly increased.

In this letter, the tradeoff between symbol rate and diversity gain of Space-Time Block Codes (STBCs) with linear receivers is considered. It is known that Group Orthogonal-Toeplitz Codes (GOTCs) can achieve a good tradeoff with linear receivers. However, the symbol rate of GOTCs is limited to that of the base Orthogonal Space-Time Block Codes (OSTBCs). We propose to simply change the GOTC base codes from OSTBCs to Quasi-Orthogonal Space-Time Block Codes (Q-OSTBCs). Q-OSTBCs can improve the symbol rate of GOTCs at the expense of diversity gain. Simulation results show that Q-OSTBC based GOTCs can improve the tradeoff between symbol rate and diversity gain over that of the original GOTCs.

This paper examines a coded Gaussian Minimum Shift Keying (GMSK) system which uses Reed-Solomon (RS) codes both in Additive White Gaussian Noise (AWGN) channels and Rayleigh fading channels. The performance of GMSK and RS code combinations is compared with the constraint that the transmitted signal bandwidth is constant. The coding gains were obtained using simulations and the best combination of GMSK and RS codes was found. The optimal code rates over AWGN and Rayleigh fading channels were also compared.