Due to the reuse factor reduction, the same frequencies are reused in adjacent neighboring cells, which causes an attendant increase in co-channel interference (CCI). CCI has already become the limiting factor in the performance of orthogonal frequency division multiplexing (OFDM) based cellular systems. Joint maximum likelihood sequence estimation (JMLSE) based interference cancellation algorithms have been under intense research. However, despite the fact that the error probability of JMLSE is critical for analyzing the performance, to the best of our knowledge, the mathematical expression has not been derived for MQAM-OFDM yet. Direct computation of the error probability involves integrating a multi-dimensional Gaussian distribution that has no closed-form solution. Therefore, an alternative way is to upper and lower bound the error probability with computable quantities. In this paper, firstly, both the upper and the conventional lower error probability bounds of JMLSE are derived for MQAM-OFDM systems based on a genie-aided receiver. Secondly, in order to reduce the gap between the conventional lower bound and the simulation results, a tighter lower bound is derived by replacing the genie with a less generous one. Thirdly, those derived error probability bounds are generalized to the receiver diversity scheme. These error probability bounds are important new analytical results that can be used to provide rapid and accurate estimation of the BER performance over any MQAM scheme and an arbitrary number of interferers and receive antennas.

With Wireless Sensor Networks (WSNs) involving in diverse applications, the realistic analysis of energy consumption of a sensor node in an error-prone network environment is emerging as an elementary research issue. In this paper, we introduce a Distributed Communication Model (DCM) that can accurately determine the energy consumption through data communication from source to destination in error-prone network environments. The energy consumption is affected with the quality of link, which is characterized by symmetry, directivity, instability, and irregularity of the communication range of a sensor node. Due to weak communication links, significant packet loss occurs that affects the overall energy consumption. While other models unable to determine energy consumption due to lossy links in error-prone and unstable network environments, DCM can accurately estimate the energy consumption in such situations. We also perform comprehensive analysis of overheads caused by data propagation through multi-hop distributed networks. We validate DCM through both simulations and experiments using MICAz motes. Similarity of the results from energy consumption analysis with both simulations and experimentations shows that DCM is realistic, compared to other models in terms of accuracy and diversity of the environments.

This paper describes a forward subchannel control of multi-carrier scheme intended to compensate for phase/amplitude distortions under frequency selective fading. The forward subchannel control scheme is used for a Time Division Duplex (TDD) multi-carrier system on up-link. The forward subchannel control scheme provides forward subchannel control of phase/amplitude variation and subchannel assignment control. These controls are applied before transmission of an up-link signal. The forward control parameters are estimated by a preamble down-link signal. Simulation results clarify that the BER performance with the forward subchannel control scheme shows a superiority of more than one order at the condition of 22 dB of Eb/N0 and 400 Hz of fading frequency.

This paper proposes a new SSB-QPSK modulation/demodulation method. The present method multiplexes the USB (Upper Side Band) and LSB (Lower Side Band) of a QPSK-modulated SSB (Single Side Band) on the same SSB complex frequency band. The present method thus achieves 2 bit/s/Hz. This method is an orthogonal SSB-QPSK method, because the multiplex signals are orthogonal to each other. The demodulator consists of two SSB demodulators. A simulation result in AWGN conditions, shows that the proposed method has better BER (Bit Error Rate) performance than 16 QAM. The degradation of BER in comparison with QPSK is less than 0.2 dB on Eb/No (bit-energy-to-noise-power ratio). In a fading/Doppler environment, the BER performance of the orthogonal SSB-QPSK is the same as that of QPSK.

Low Power Wide Area Network (LPWAN) is designed for low-bandwidth, low-power, long-distance, large-scale connected IoT applications and realistic for networking in an emergency or restricted situation, so it has been proposed as an attractive communication technology to handle unexpected situations that occur during and/or after a disaster. However, the traditional LPWAN with its default protocol will reduce the communication efficiency in disaster situation because a large number of users will send and receive emergency information result in communication jams and soaring error rates. In this paper, we proposed a LPWAN based decentralized network structure as an extension of our previous Disaster Information Sharing System (DISS). Our network structure is powered by Named Node Networking (3N) which is based on the Information-Centric Networking (ICN). This network structure optimizes the excessive useless packet forwarding and path optimization problems with node name routing (NNR). To verify our proposal, we conduct a field experiment to evaluate the efficiency of packet path forwarding between 3N+LPWA structure and ICN+LPWA structure. Experimental results confirm that the load of the entire data transmission network is significantly reduced after NNR optimized the transmission path.

We propose the node name routing (NNR) strategy for information-centric ad-hoc networks based on the named-node networking (3N). This strategy is especially valuable for use in disaster areas because, when the Internet is out of service during a disaster, our strategy can be used to set up a self-organizing network via cell phones or other terminal devices that have a sharing ability, and it does not rely on a base station (BS) or similar providers. Our proposed strategy can solve the multiple-name problem that has arisen in prior 3N proposals, as well as the dead loop problems in both 3N ad-hoc networks and TCP/IP ad-hoc networks. To evaluate the NNR strategy, it is compared with the optimized link state routing protocol (OLSR) and the dynamic source routing (DSR) strategy. Computer-based comprehensive simulations showed that our NNR proposal exhibits a better performance in this environment when all of the users are moving randomly. We further observed that with a growing number of users, our NNR protocol performs better in terms of packet delivery, routing cost, etc.

This paper describes two dimensional (2D) equalization scheme of orthogonal coding multi-carrier CDMA for reverse link of mobile communication systems. The purpose of the 2D equalization is the reduction of Multiple Access Interference (MAI) which is caused by the random access and the different propagation path from each mobile station. The orthogonal coding multi-carrier CDMA multiplexes all mobile stations' data by Code Division Multiplexing (CDM). The 2D coding scheme spreads a preamble signal at time (in subchannel signals) and frequency (between subchannel signals) domains. The 2D decoding scheme estimates transmission delay time and instantaneous fading frequency from preamble signal for individual mobile stations and compensate the received data using these estimation values to reduce MAI.

This paper describes the evaluation results for Group 3 (G3) facsimile transmission in the transparent mode over the digital cellular system. Effectiveness of a convolutional code is clarified for encoding the G3 facsimile data from analysis of error correction capability for the transparent mode. The 1/2 convolutional code is used as the error correction code in the digital cellular circuit, and a simulation experiment is conducted at the data transmission speed of 4,800 bit/sec in a G3 facsimile. It has been clarified that the transparent transmission system is applicable up to a fading frequency of 80 Hz, a received power of 100 dBm and a handoff occupancy frequency of 4 times per minute on asumption of handoff occurrence probability in a Poisson distribution. This scheme presents the high reliable G3 facsimile transmission which does not depend on delay time of the digital cellular system.

In order to support seamless mobility in the Information-Centric Networking (ICN) Architecture we propose the Named-Node Network Architecture (3NA). 3NA introduces two independent namespaces to ICN, the 3N namespace used to uniquely identify nodes within a network and the Point of Attachment (PoA) namespace to identify a node's PoA to the network. The mappings between the two namespaces, along with all the necessary mechanisms to keep the mappings updated over time, are used when routing ICN packets to improve delay and the goodput when either the producer or the consumer are mobile. To support simultaneous producer and consumer mobility, we expand on the 3NA by adding a new Protocol Data Unit (PDU), the DU PDU. The DU PDU permits the encapsulation of ICN packets in a header that has source and destination name fields which belong to 3NA's 3N namespace. The new PDU permits seamless connectivity as long as 3NA's point of attachment signaling is strictly followed. We demonstrate the performance of the DU PDU against our previous defined communication methods and Named Data Networking's (NDN) Smart Flooding forwarding strategy using our open source nnnSIM module for the ns-3 framework. The new PDU outperforms all existing alternatives when the producer or both consumer and provider are mobile, obtaining overall lower mean network delay and higher median goodput.

Information Centric Networking (ICN) had merits in terms of mobility, security, power consumption and network traffic. When a large-scale disaster occurred, the current communication system might be fragile and the server based network service might be unavailable due to the damages, network congestions, and power failure, etc. In this paper, we proposed an ICN based Disaster Information Sharing Service (DISS) [1], [2] system. DISS could provide robust information sharing service. Users could publish disaster information as a content message with the help of our DISS. In addition, by utilizing DISS's message naming strategy, users could retrieve disaster information even without a server connection. The ICN based DISS could reduce the probability of network congestion when a large number of simultaneous connections occurring. It could provide server-less service in poor network condition. DISS allows users retrieve disaster information from terminals or ICN nodes. During disasters, sharing information timely and effective could protect people from disaster, ensure people's safety.

The involvement of IEEE 802.15.4 Wireless Sensor Networks (WSNs) in diverse applications has made the realistic analysis of sensor power dissipation in distributed network environments an essential research issue. In this paper, we propose and thoroughly analyze a power dissipation model for Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) based IEEE 802.15.4 distributed multi-hop WSNs. Our model takes the loss rate of frames, neighbor sensors density in communication range of a sensor, number of hops, distance of source to the sink, and density of the network into account. We evaluate the impact of these factors on overall power dissipation. We also perform comprehensive analysis of overheads caused by message routing through multi-hop distributed networks. We validate our proposed model through Monte Carlo simulations. Results show that our power dissipation model is more realistic compared to other proposed models in terms of accuracy and multiplicity of the environments.

The rise of next-generation logistics systems featuring autonomous vehicles and drones has brought to light the severe problem of Global navigation satellite system (GNSS) location data spoofing. While signal-based anti-spoofing techniques have been studied, they can be challenging to apply to current commercial GNSS modules in many cases. In this study, we explore using multiple sensing devices and machine learning techniques such as decision tree classifiers and Long short-term memory (LSTM) networks for detecting GNSS location data spoofing. We acquire sensing data from six trajectories and generate spoofing data based on the Software-defined radio (SDR) behavior for evaluation. We define multiple features using GNSS, beacons, and Inertial measurement unit (IMU) data and develop models to detect spoofing. Our experimental results indicate that LSTM networks using ten-sequential past data exhibit higher performance, with the accuracy F1 scores above 0.92 using appropriate features including beacons and generalization ability for untrained test data. Additionally, our results suggest that distance from beacons is a valuable metric for detecting GNSS spoofing and demonstrate the potential for beacon installation along future drone highways.

Routing in Ad-hoc networks is unreliable due to the mobility of the nodes. Location-based routing protocols, unlike other protocols which rely on flooding, excel in network scalability. Furthermore, new location-based routing protocols, like, e.g. BLR [1] , IGF [2], & CBF [3] have been proposed, with the feature of not requiring beacons in MAC-layer, which improve more in terms of scalability. Such beaconless routing protocols can work efficiently in dense network areas. However, these protocols' algorithms have no ability to avoid from routing into sparse areas. In this article, historical signal strength has been added as a factor into the BLR algorithm, which avoids routing into sparse area, and consequently improves the global routing efficiency.

In this paper, a sub-optimal Rake receiver combined with a Wiener Filter is investigated for use in an indoor environment. Inner-Chip-interference is dominant when the application is indoors, so the inner-chip-interference rejection function becomes critical for the receiver. Pilot symbols in each slot are used for channel estimation and weight calculation of Rake combining through Wiener Filter. Compared to conventional combining which uses maximum ratio combining, Wiener combining using IRC (Interference rejection combining) achieves better ICI (Inner-chip-Interference) rejection. This paper clarified that the sub optimal Rake receiver using Wiener Filter is 4 dB better than the conventional Rake receiver under the indoor application.

A modified 0.35 µm gate-length MOSFET large-signal microwave device model, based on the widely used BSIM3 model, is presented in this report. This large-signal microwave model includes a BSIM3 model together with the passive components required to fit the device dc and microwave characteristics over a wide range of biasing points and frequency operation. In this report, we propose a methodology to improve the device microwave linearity by controlling a suitable biasing condition, which is based on the predictions of this modified CMOS large-signal model. The input IM3 enhances more than 10 dB at a 2.4 GHz operation. Furthermore, the adjacent channel power ratio also improves 7.5 dB with proper choosing device dc bias.

This paper describes a delay control scheme for synchronous detection of an orthogonal coding multi-carrier CDMA (Code Division Multiple Access) system. The delay control scheme estimates transmission timing of data from each mobile station. At a base station, delay time is obtained by detecting phase shift value of the preamble signal from each mobile station. The estimated transmission timing information is sent from base station to each mobile station and the mobile station then adjusts its transmission timing. Simulation results clarified that Bit Error Rate (BER) is 2.510-3 at 19dB of Eb/No under conditions of 29.4 msec initial delay time, 32kbit/sec data rate, 16 subchannels and 100Hz of fading frequency.

In implementing the future Personal Communication Services (PCS), providing a system allowing simultaneous access by many subscribers is of utmost importance. The study of CDMA, as a candidate for the radio access method is being promoted for this purpose. Increasing the CDMA system capacity is determined by; the selection of a spread code having an excellent correlation characteristic; the interference cancellation method and; the method for controlling the power accordance with the near-far problems. In this paper we considered the cellular system, and have analyzed the correlation characteristic by using the PN or Walsh code as the innercell spreading code and the PN or Gold code as the intercell spreading code. We have also analyzed the sysytem capacity in terms of the correlation characteristics for different combinations of these spreading codes. It has been clarified as a result that 40 subscriber channels can be accommodated per cell by using the Walsh code and PN code as the innercell and intercell codes for the forward link (the Base Station (BS) to the Personal Station (PS)) and the PN code as both the innercell and intercell codes for the reverse link (the PS to the BS).

Due to the reuse factor reduction, the attendant increase in co-channel interference (CCI) becomes the limiting factor in the performance of the orthogonal frequency division multiplexing (OFDM) based cellular systems. In the previous work, we proposed the least mean square-blind joint maximum likelihood sequence estimation (LMS-BJMLSE) algorithm, which is effective for CCI cancellation in OFDM systems with only one receive antenna. However, LMS-BJMLSE requires a long training sequence (TS) for channel estimation, which reduces the transmission efficiency. In this paper, we propose a subcarrier identification and interpolation algorithm, in which the subcarriers are divided into groups based on the coherence bandwidth, and the slowest converging subcarrier in each group is identified by exploiting the correlation between the mean-square error (MSE) produced by LMS and the mean-square deviation (MSD) of the desired channel estimate. The identified poor channel estimate is replaced by the interpolation result using the adjacent subcarriers' channel estimates. Simulation results demonstrate that the proposed algorithm can reduce the required training sequence dramatically for both the cases of single interference and dual interference. We also generalize LMS-BJMLSE from single antenna to receiver diversity, which is shown to provide a huge improvement.

For wireless multicast applications like multimedia conferencing, voice over IP and video/audio streaming, a reliable transmission of packets within short delivery delay is needed. Moreover, reliability is crucial to the performance of error intolerant applications like file transfer, distributed computing, chat and whiteboard sharing. Forward Error Correction (FEC) is frequently used in wireless multicast to enhance Packet Error Rate (PER) performance, but cannot assure full reliability unless coupled with Automatic Repeat Request forming what is knows as Hybrid-ARQ. While reliable FEC can be deployed at different levels of the protocol stack, it cannot be deployed on the MAC layer of the unreliable IEEE802.11 WLAN due to its inability to exchange ACKs with multiple recipients. In this paper, we propose a Multicast MAC protocol that enhances WLAN reliability by using Adaptive FEC and study it's performance through mathematical analysis and simulation. Our results show that our protocol can deliver high reliability and throughput performance.

This paper assesses the performance of the handoff algorithm based on distance and RSSI measurements in a multi-cellular environment by computer simulation. The algorithm performs a handoff if handoff initiation conditions, handoff possible conditions, and handoff selective conditions are met. The performance criteria are based on the average number of handoffs, the crossover points and the average number of outages. Numerical results are presented to demonstrate the feasibility of the algorithm. The performance of the distance-assisted handoff algorithm is compared with that of a conventional algorithm that utilizes signal strength alone. Overall, the distance-assisted algorithm exhibits higher performance in average number of handoffs and the crossover points, yet exhibits a higher number of outages on average than the conventional algorithm.