Probability distribution of the node degree has long been regarded as one of the important metrics to characterize the wireless ad hoc networks. However, there is no exact formulation for this probability distribution when shadow fading effects are considered. In this letter, by deriving the conditional probability of the node degree and the joint distribution of the distances between nodes and a randomly selected reference node (RSRN), we show that the probability distribution of the node degree for the wireless ad hoc networks in the shadow fading environments is binomial.

Energy efficient routing is one of the key design issues to prolong the lifetime of wireless sensor networks (WSNs) since sensor nodes can not be easily re-charged once they are deployed. During routing process, the routes with only few hops or with too many hops are not energy efficient. Hop-based routing algorithms can largely improve the energy efficiency of multi-hop routing in WSNs because they can determine the optimal hop number as well as the corresponding intermediate nodes during multi-hop routing process under medium or high density network. In this paper, we not only focus on studying the relationship between energy consumption and hop number from theoretical point of view but also provide a practical selection criterion of the sub-optimal hop number under practical sensor network so as to minimize the energy consumption. We extend the theoretical deduction of optimal hop number and propose our Hop-based Energy Aware Routing (HEAR) algorithm which is totally distributed and localized. Simulation results show that our HEAR algorithm can reduce the average energy consumption about 10 times compared to the direct transmission algorithm and 2 to 10 times than other algorithms like LEACH and HEED under various network topologies.

A joint estimator for carrier phase, symbol timing, and data sequence is proposed. This fully digital scheme is systematically derived from the maximum likelihood estimation (MLE) theory. The simulation and the analytical results demonstrate that the scheme is asymptotical to the optimum in AWGN channel.

The heterogeneous network (HetNet), which deploys small cells such as picocells, femotcells, and relay nodes within macrocell, is regarded as a cost-efficient and energy-efficient approach to resolve increasing demand for data bandwidth and thus has received a lot of attention from research and industry. Since small cells share the same licensed spectrum with macrocells, concurrent transmission induces severe interference, which causes performance degradation, particularly when coordination among small cell base stations (BSs) is infeasible. Given the dense, massive, and unplanned deployment of small cells, mitigating interference in a distributed manner is a challenge and has been explored in recent papers. An efficient and innovative approach is to apply cognitive radio (CR) into HetNet, which enables small cells to sense and to adapt to their surrounding environments. Consequently, stations in each small cell are able to acquire additional information from surrounding environments and opportunistically operate in the spectrum hole, constrained by minimal inducing interference. This paper summarizes and highlights the CR-based interference mitigation approaches in orthogonal frequency division multiple access (OFDMA)-based HetNet networks. With special discussing the role of sensed information at small cells for the interference mitigation, this paper presents the potential cross-layer facilitation of the CR-enable HetNet.

An efficient algorithm is proposed to identify the active users and extracting their respective timing information in asynchronous direct sequence CDMA (DS-CDMA) communication system over Rayleigh fading channel. The joint identification and timing estimation algorithm is derived by performing discrete Fourier transform (DFT) on the observation vector and exploiting the uniqueness and nullity characteristics of the root-MUSIC test polynomial. The root-MUSIC based algorithm is shown to be asymptotically near-far resistant. Compared to the maximum a posteriori (MAP) or maximum likelihood (ML) based multiuser timing estimator, the complexity is greatly reduced by separating the multi-dimensional optimization problem into several polynomial rooting problems. Moreover, we characterize the dependence of system performance with respect to signature sequence length, number of active users, window size, desired user's signal-to-noise ratio (SNR) and crosscorrelation property of the code structure. The analytical results reveal that under the uncorrelated Rayleigh fading model, the root-MUSIC timing estimator tends to achieve the Cramer-Rao lower bound (CRLB) at interesting signature sequence length and desired user's SNR.