首页期刊导航|Eurasip Journal on Wireless Communications and Networking
期刊信息/Journal information
Eurasip Journal on Wireless Communications and Networking
Springer
Eurasip Journal on Wireless Communications and Networking

Springer

1687-1472

Eurasip Journal on Wireless Communications and Networking/Journal Eurasip Journal on Wireless Communications and NetworkingEIISTPSCI
正式出版
收录年代

    A collaborative service resource evaluation model based on trust network

    Shi JiantaoLiu LikunYu XiangzhanLu Hui...
    15页
    查看更多>>摘要:Abstract In the era of the 5G network, network traffic grows rapidly. Edge computing will face the challenges of high bandwidth, low latency, high reliability and other requirements of 5G network services. Due to the limited resources of node communication, computing and storage, under the sudden, intensive and high-traffic task request, edge computing will suffer from network jitter, excessive delay, access congestion, service failure and low distribution efficiency. In order to ensure network service quality and improve service efficiency, it is necessary to construct an effective collaborative service mechanism, motivate nodes to participate in cooperation, integrate network service resources and self-adapt to manage collaborative services. Therefore, establishing an effective node and service evaluation system to identify reliable resources and nodes is an effective way to improve the overall availability and reliable services of edge computing network. In this paper, we summarize and analyze the key technologies of the current collaborative service organization incentive and trust mechanism. This paper presents an attack-resistant node and service evaluation system based on a trust network. The system includes a voting collection mechanism, a trustable node selection mechanism, a questioning response mechanism and a punishment mechanism. The experiments prove that the system has a strong ability to resist attacks and is superior to the existing reputation evaluation model in terms of its performance. It can effectively improve the collaborative efficiency of edge computing and guarantee the quality of network service.

    An improved AODV routing security algorithm based on blockchain technology in ad hoc network

    Ran ConglinYan ShuailingHuang LiangZhang Lei...
    16页
    查看更多>>摘要:Abstract Ad hoc network is a special network with centerless and dynamic topology. Due to the free mobility of the nodes, routing security has been a bottleneck problem that plagues its development. Therefore, a multi-path QoS (quality of service) routing security algorithm based on blockchain by improving the traditional AODV (ad hoc on-demand distance vector) protocol (AODV-MQS) is proposed. Firstly, a chain of nodes is established in the network and the states of all nodes by making the intermediate nodes on the chain are saved. Secondly, the smart contract in the blockchain is set to filter out the nodes that meet the QoS constraints. Finally, two largest unrelated communication paths are found in the blockchain network through smart contract, one of which is the main path and the other is the standby path. Simulation experiments show that the performance of the proposed algorithm is better than other algorithms, especially in an unsafe environment.

    Low complexity channel estimation algorithm using paired spatial signatures for UAV 3D MIMO systems

    Xie PeizhongWan YingqingLi TingJu Renjie...
    20页
    查看更多>>摘要:Abstract This paper proposes a low complexity channel estimation algorithm for unmanned aerial vehicle three dimension multi-user multiple-input-multiple-output (3D MIMO) systems with the uniform planar array (UPA) at base station using paired spatial signatures. With the aid of antenna array theory and array signal processing, 3D channel is firstly modeled based on the angles between the direction of arrival along x- and y-axis of the UPA. And 3D MIMO channels can be projected onto the x- and y-directions, respectively. Then, channel estimation for multi-user uplinks using small amount of training resources is divided into two phases. At the first uplink preamble phase, each user is assigned the orthogonal pilot, and the paired spatial signatures and optimal rotation angle of each user through the same pilot sequence are obtained. We also propose a user grouping strategy based on three-dimension angle-division multiple access (3D-ADMA) to ensure that the user's spatial signatures do not overlap. At the second phase during several coherence times, the same pilot sequence within a group and orthogonal pilot sequences between groups are assigned, then, the channel state information of the user's x- and y-directions are recovered by the paired space signatures and optimal rotation angle of each user obtained in the preamble phase, respectively. And dynamically updating the user's paired spatial signatures and optimal rotation angle utilizes the obtained channel parameter of x- and y-directions. Finally, the channel parameter of the x- and y-directions are reconstructed by the updated user's space signatures and the optimal rotation angle, and the 3D MIMO channel estimation is obtained through the Kronecker product. Compared with the conventional channel estimation method of the 3D MIMO system under UPA using a low-rank model, the proposed methods reduce the computational complexity without degrading the estimated performance to a large extent. Furthermore, it is carried out with limited training resources, and the pilot resource overhead of the system is greatly reduced by the 3D-ADMA packet and the two-stage pilot allocation. Simulation results verified that the proposed algorithm is effective and feasible.

    On the achievable rate of bandlimited continuous-time AWGN channels with 1-bit output quantization

    Bender SandraD?rpinghaus MeikFettweis Gerhard P.
    30页
    查看更多>>摘要:Abstract We consider a real continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. We derive an approximate lower bound on the capacity by lower-bounding the mutual information rate for input signals with exponentially distributed zero-crossing distances, sine-shaped transition waveform, and an average power constraint. The focus is on the behavior in the mid-to-high signal-to-noise ratio?(SNR) regime above 10?dB. For hard bandlimited channels, the lower bound on the mutual information rate saturates with the SNR growing to infinity. For a given SNR the loss with respect to the unquantized additive white Gaussian noise channel solely depends on the ratio of channel bandwidth and the rate parameter of the exponential distribution. We complement those findings with an approximate upper bound on the mutual information rate for the specific signaling scheme. We show that both bounds are close in the SNR domain of approximately 10–20?dB.

    Relation extraction for coal mine safety information using recurrent neural networks with bidirectional minimal gated unit

    Liu XiuleiHou ShouluQin ZhihuiLiu Sihan...
    13页
    查看更多>>摘要:Abstract The data of coal mine safety field are massive, multi-source and heterogeneous. It is of practical importance to extract information from big data to achieve disaster precaution and emergency response. Existing approaches need to build more features and rely heavily on the linguistic knowledge of researchers, leading to inefficiency, poor portability, and slow update speed. This paper proposes a new relation extraction approach using recurrent neural networks with bidirectional minimal gated unit (MGU) model. This is achieved by adding a back-to-front MGU layer based on original MGU model. It does not require to construct complex text features and can capture the global context information by combining the forward and backward features. Evident from extensive experiments, the proposed approach outperforms the existing initiatives in terms of training time, accuracy, recall and F value.

    Energy-aware task offloading with deadline constraint in mobile edge computing

    Li ZhongjinChang VictorGe JidongPan Linxuan...
    24页
    查看更多>>摘要:Abstract With the development of the wireless network, increasing mobile applications are emerging and receiving great popularity. These applications cover a wide area, such as traffic monitoring, smart homes, real-time vision processing, objective tracking, and so on, and typically require computation-intensive resources to achieve a high quality of experience. Although the performance of mobile devices (MDs) has been continuously enhanced, running all the applications on a single MD still causes high energy consumption and latency. Fortunately, mobile edge computing (MEC) allows MDs to offload their computation-intensive tasks to proximal eNodeBs (eNBs) to augment computational capabilities. However, the current task offloading schemes mainly concentrate on average-based performance metrics, failing to meet the deadline constraint of the tasks. Based on the deep reinforcement learning (DRL) approach, this paper proposes an Energy-aware Task Offloading with Deadline constraint (DRL-E2D) algorithm for a multi-eNB MEC environment, which is to maximize the reward under the deadline constraint of the tasks. In terms of the actor-critic framework, we integrate the action representation into DRL-E2D to handle the large discrete action space problem, i.e., using the low-complexity k-nearest neighbor as an approximate approach to extract optimal discrete actions from the continuous action space. The extensive experimental results show that DRL-E2D achieves better performance than the comparison algorithms on all parameter settings, indicating that DRL-E2D is robust to the state changes in the MEC environment.

    Improved two-way double-relay selection technique for cooperative wireless communications

    Alabed SamerMaaz IssamAl-Rabayah Mohammad
    24页
    查看更多>>摘要:Abstract In this article, a novel two-way double-relay selection strategy with its bit error rate (BER) performance analysis is proposed. In this novel strategy, as a first step we choose two relays out of a set of relay-nodes in a way to maximize the system performance in terms of BER and complexity. In the second step, the selected relays apply orthogonal space-time coding scheme using the three-phase protocol to establish a two-way communication between the transceivers, which will lead to a significant improvement in the achievable diversity and coding gain with a very low decoding complexity by using a symbol-wise decoder. Furthermore, the performance of the overall system is further enhanced through the use of a network coding method at the selected relay-nodes. Moreover, this paper proposes the analytical approximation of the BER performance. As well, we show that the analytical results match perfectly the simulated ones. In addition, we prove that our strategy outperforms the current state-of-the-art ones by proposing a better cooperative communication system in terms of BER.

    Low-complexity sparse-aware multiuser detection for large-scale MIMO systems

    Ran RongOh Hayoung
    15页
    查看更多>>摘要:Abstract Sparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detectors provide the better performance but are not appropriate for the overdetermined multiuser MIMO systems in sense of power and time consumption. The linear SA detector provides a?more elegant tradeoff between performance and complexity compared to the nonlinear ones. However, the major limitation of the linear SA detector is that, as the zero-forcing or minimum mean square error detector, it was derived by relaxing the finite-alphabet constraints, and therefore its performance is still sub-optimal. In this paper, we propose a novel SA detector, named single-dimensional search-based SA (SDSB-SA) detector, for overdetermined uplink MIMO systems. The proposed SDSB-SA detector adheres to the finite-alphabet constraints so that it outperforms the conventional linear SA detector, in particular, in high SNR regime. Meanwhile, the proposed detector follows a single-dimensional search manner, so it has a very low computational complexity which is feasible for light-ware Internet of Thing devices for ultra-reliable low-latency communication. Numerical results show that the the proposed SDSB-SA detector provides a?relatively better tradeoff between the performance and complexity compared with several existing detectors.

    Research on task assignment to minimize travel cost for spatio-temporal crowdsourcing

    Pan QingxianPan TingweiDong HongbinGao Zhaolong...
    21页
    查看更多>>摘要:Abstract Online task assignment is one of the core research issues of spatio-temporal crowdsourcing technology. The current researches on minimizing travel cost all focus on the scenario of two objectives (task requesters and workers). This paper proposes a two-stage framework (GH) based on Greedy algorithm and Hungarian algorithm for three-objective online task assignment to minimize travel cost. In order to further optimize the efficiency and average travel cost, this paper proposes GH-AT (Adaptive Threshold) algorithm based on GH algorithm, and redesigns the Hungarian algorithm into the sHungarian algorithm. sHungarian algorithm has lower time complexity than Hungarian algorithm. sHungarian algorithm is not only suitable for the problem studied in this paper, but also for all task assignment problems with constraints. Compared with Greedy algorithm, GH-AT algorithm has lower travel cost and higher total utility. In terms of the number of matches, GH-AT is slightly lower than Greedy algorithm. In terms of time cost, GH-AT algorithm is higher than Greedy algorithm, but much lower than GH algorithm.

    Towards achieving efficient MAC protocols for WBAN-enabled IoT technology: a review

    Abu-Mahfouz Adnan M.Hancke Gerhard P.Olatinwo Damilola D.
    47页
    查看更多>>摘要:Abstract Internet of things (IoT) is a concept that is currently gaining a lot of popularity as a result of its potential to be incorporated into many heterogeneous systems. Because of its diversity, integrating IoT is conceivable in almost all fields, including the healthcare sector. For instance, a promising technology in the healthcare sector known as wireless body area network (WBAN) could be integrated with the IoT to enhance its productivity. However, in order to guarantee the optimization of the operation of the healthcare applications facilitated by the WBAN-enabled IoT technology, there must be enough support from all the different protocol stack layers so as to satisfy the critical quality-of-service (QoS) requirements of the WBAN systems. Consequently, the medium access control (MAC) protocol has recently been gaining lots of attention in the area of WBANs due to its ability to manage and coordinate when a shared communication channel can be accessed. For the purpose of achieving efficient MAC protocols for WBAN-enabled IoT technology, this paper investigates some key MAC protocols that could be exploited in WBANs based on their characteristics, service specifications, technical issues such as energy wastage issues, and possible technical solutions were provided to enhance energy efficiency, channel utilization, data transmission rate, and dealy rate. Also, these MAC protocols were grouped and compared based on short- and long-range communication standards. Following this, future directions and open research issues are pointed out.