EURASIP Journal on Wireless Communications and Networking

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
A biologically-inspired embedded monitoring network system for moving target detection in panoramic view
EURASIP Journal on Wireless Communications and Networking - Tập 2013 - Trang 1-7 - 2013
Le Song, Zihui Zhang, Haoyang Zhang
An embedded monitoring network system is based on the visual principle of compound eye, which meets the acquirements in field angle, detecting efficiency, and structural complexity of panoramic monitoring network. Three fixed wide-angle cameras are adopted as sub-eyes, and a main camera is installed on a high-speed platform. The system ensures the continuity of tracking with high sensitivity and accuracy in a field of view (FOV) of 360 × 180°. In the non-overlapping FOV of the sub-eyes, we adopt Gaussian background difference model and morphological algorithm to detect moving targets. However, in the overlapping FOV, we use the strategy of lateral inhibition network which improves the continuity of detection and speed of response. The experimental results show that our system locates a target within 0.15 s after it starts moving in the non-overlapping field; when a target moves in the overlapping field, it takes 0.23 s to locate it. The system reduces the cost and complexity in traditional panoramic monitoring network and lessens the labor intensity in the field of monitoring.
Performance analysis of wireless-powered cognitive radio networks with ambient backscatter
EURASIP Journal on Wireless Communications and Networking - Tập 2019 - Trang 1-13 - 2019
Daniyal Munir, Syed Tariq Shah, Kae Won Choi, Tae-Jin Lee, Min Young Chung
Ambient backscatter is a promising wireless communication technique where low-power users communicate with each other without any dedicated power source. These communicating users transmit their information by reflecting ambient radio-frequency (RF) signals. In this paper, we propose an ambient backscatter communications-assisted wireless-powered underlay cognitive radio network (CRN). The proposed CRN consists of a single primary transmitter (PT) and multiple primary receivers (PRs), secondary transmitters (STs), and secondary receivers (SRs). For efficient utilization of radio resources, the STs in the proposed scheme dynamically adopt either harvest-then-transmit mode or backscatter mode. Furthermore, PRs cooperate with STs to select an appropriate mode for their communication with SRs. To evaluate the performance of our proposed scheme, we conduct system-level simulations. Numerical results show that the performance of the secondary system can be improved in terms of throughput with minimum effect on the communication of primary users.
Opportunistic routing with in-network aggregation for duty-cycled WSNs with delay requirements
EURASIP Journal on Wireless Communications and Networking - Tập 2014 - Trang 1-16 - 2014
Jungmin So, Heejung Byun
This paper proposes an opportunistic routing protocol for wireless sensor networks that works on top of an asynchronous duty-cycling medium access control (MAC) protocol. The proposed protocol is designed for applications that are not real-time but still have some requirements on packet delay. The main idea is that if a packet has time to spare, it can wait on a node hoping that it can be aggregated with other packets, resulting in reduced number of transmissions. The forwarders and the packet hold time depend on the energy status of nodes in the network. The simulation results show that the proposed protocol achieves longer network lifetime compared to the other state-of-the-art protocols, while satisfying application delay requirements.
Diversity-multiplexing tradeoff analysis and optimization for OFDM-based multihop relaying systems
EURASIP Journal on Wireless Communications and Networking - Tập 2012 - Trang 1-11 - 2012
Weiwei Yang, Yueming Cai, Wendong Yang, Baoyu Zheng
In this article, we consider a single-antenna orthogonal frequency division multiplexing-based multihop relaying system over frequency selective fading channels employing subcarrier grouping and linear constellation precoding at the source, and linear detection at the destination. We derive closed-form expressions of the diversity-multiplexing tradeoff relation, and propose the optimal precoder design and symbol loading strategy to achieve the optimal diversity performance. Simulation results are presented to verify our theoretical analysis.
Design and experimental evaluation of a low-complexity spatial combiner for LTE distributed antenna systems
EURASIP Journal on Wireless Communications and Networking - Tập 2013 - Trang 1-8 - 2013
Josep Soler-Garrido, Magnus Sandell, Filippo Tosato, David Milford, Imran Ahmed
This article presents a distributed antenna system (DAS) architecture for small-cell base stations (BTSs), whereby cooperation between the DAS infrastructure and the BTS allows for an increase in performance compared to conventional systems, while at the same time keeping complexity and cost at low levels. Specifically, the article investigates the improvements in uplink physical layer performance achieved by adding an initial antenna combining step in the DAS system before conventional combining and equalization at the BTS. This initial step can be implemented in a very low-complexity fashion by performing all operations in the time domain and using channel state information calculated at the BTS itself. The article presents this technique in the context of an LTE DAS system. Results from both a software simulator and a custom-made hardware prototype are presented, establishing the feasibility of the proposed architecture.
Research on geometric algebra-based robust adaptive filtering algorithms in wireless communication systems
EURASIP Journal on Wireless Communications and Networking - - 2022
Rui Wang, Yi Wang, Yanping Li, Wenming Cao
Abstract

Noise and interference are the two most common and basic problems in wireless communication systems. The noise in wireless communication channels has the characteristics of randomness and impulsivity, so the performance of adaptive filtering algorithms based on geometric algebra (GA) and second-order statistics is greatly reduced in the wireless communication systems. In order to improve the performance of adaptive filtering algorithms in wireless communication systems, this paper proposes two novel GA-based adaptive filtering algorithms, which are deduced from the robust algorithms based on the minimum error entropy (MEE) criterion and the joint criterion (MSEMEE) of the MEE and the mean square error (MSE) with the help of GA theory. The noise interference in wireless communication is modeled by $$\alpha$$ α -stable distribution which is in good agreement with the actual data in this paper. Simulation results show that for the mean square deviation (MSD) learning curve, the GA-based MEE (GA-MEE) algorithm has faster convergence rate and better steady-state accuracy compared to the GA-based maximum correntropy criterion algorithm (GA-MCC) under the same generalized signal-to-noise ratio (GSNR). The GA-MEE algorithm reduces the convergence rate, but improves the steady-state accuracy by 10–15 dB compared to the adaptive filtering algorithms based on GA and second-order statistics. For GA-based MSEMEE (GA-MSEMEE) algorithm, when GA-MSEMEE and the adaptive filtering algorithms based on GA and second-order statistics keep the same convergence rate, its steady-state accuracy is improved by 10–15 dB, and when GA-MSEMEE and GA-MEE maintain approximately steady-state accuracy, its convergence rate is improved by nearly 100 iterations. In addition, when the algorithms are applied to noise cancellation, the average recovery error of the two proposed algorithms is 7 points lower than that of other GA-based adaptive filtering algorithms. The results validate the effectiveness and superiority of the GA-MEE and GA-MSEMEE algorithms in the $$\alpha$$ α -stable noise environment, providing new methods to deal with multi-channel interference in wireless networks.

Analysis of group paging with pre-backoff
EURASIP Journal on Wireless Communications and Networking - Tập 2015 - Trang 1-9 - 2015
Ruki Harwahyu, Xian Wang, Riri Fitri Sari, Ray-Guang Cheng
Group paging can simultaneously activate hundreds of user equipments (UEs) using a single paging message. Upon receiving the group paging message, all UEs should immediately transmit their paging response messages through the random access channels (RACHs). Simultaneous channel access from a huge group of UEs may result in severe collisions of the RACHs during a very short period of time. In this paper, we propose a pre-backoff method to reduce the collision probability of random access requests. We develop an analytical model to investigate the performance and optimize the setting of the pre-backoff method. The accuracy of the analytical model is verified through computer simulation. Results show that the proposed pre-backoff method can effectively enhance the performance of group paging.
Retraction Note: Research on English teaching system based on artificial intelligence and WBIETS wireless network system
EURASIP Journal on Wireless Communications and Networking - Tập 2023 - Trang 1-1 - 2023
Minghua Tan
Joint resource optimization for secure transmission in cooperative CR networks
EURASIP Journal on Wireless Communications and Networking - Tập 2017 - Trang 1-8 - 2017
Weidang Lu, Kecai Gu, Min Jia, Zhanghui Lu, Hong Peng
In this paper, we investigate the joint resource allocation to provide secure information transmission in a five-node cooperative cognitive radio network, which contains a primary transmitter (PT), a primary receiver (PR), a secondary transmitter (ST), a secondary receiver (SR), and an eavesdropper (E). To ensure the information is securely transmitted, PT and PR use a part of the power to transmit artificial noise (i.e., jamming signal) to confuse the eavesdropper. Specifically, in the first phase, PT transmits its signal, which contains secrecy information and artificial noise, by using all of its power and bandwidth. In the second phase, ST accesses to the PT’s licensed bandwidth as a trusted relay by allocating a fraction of the bandwidth and power to forward PT’s information with decode-and-forward (DF) relaying protocol. As a reward, ST can utilize the remaining bandwidth and power to transmit its own information simultaneously. We study the joint optimization of the time, bandwidth, and power allocation to maximize ST’s transmission rate while satisfying PT’s secrecy transmission rate requirements. Numerical results demonstrate that our strategy can achieve a win-win result.
Two-hop time synchronization protocol for sensor networks
EURASIP Journal on Wireless Communications and Networking - Tập 2014 - Trang 1-10 - 2014
Jing Wang, Shuai Zhang, Dan Gao, Yingguan Wang
One of the critical middleware services for sensor networks is the time synchronization, which provides supports to different applications. Synchronization protocols used for Internet and LANs are not appropriate in the sensor networks for the high-density and limited energy resource. This paper describes two-hop time synchronization (TTS) that aims at reducing the synchronization overhead and providing more accurate network-wide synchronization. The synchronization message exchanges are minimized by making full use of sensors’ broadcast domain and enlarging the common node synchronization range in multi-hop scenarios. By halving synchronization hops, the TTS achieves high multi-hop synchronization precision. The proposed protocol contains single-hop synchronization model, multi-hop synchronization algorithm, and a power control scheme. We prove that the extension of single-hop TTS to network-wide synchronization is NP-complete. The complexity and convergence time of multi-hop TTS are analyzed in detail. We simulate TTS on MATLAB and show that it requires minimal overhead and convergence time compared with other protocols. We also implement TTS on common sensors and its multi-hop synchronization error is less than that of receiver-receiver synchronization (R-RS).
Tổng số: 2,851   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10