首页期刊导航|Wireless communications & mobile computing
期刊信息/Journal information
Wireless communications & mobile computing
John Wiley & Sons
Wireless communications & mobile computing

John Wiley & Sons

1530-8669

Wireless communications & mobile computing/Journal Wireless communications & mobile computingISTPSCI
正式出版
收录年代

    Hybrid Parallel FDTD Calculation Method Based on MPI for Electrically Large Objects

    Qingwu ShiBin ZouLamei ZhangDesheng Liu...
    9页
    查看更多>>摘要:At present, the Internet of Things (IoT) has attracted more and more researchers' attention. Electromagnetic scattering calculation usually has the characteristics of large-scale calculation, high space-time complexity, and high precision requirement. For the background and objectives of complex environment, it is difficult for a single computer to achieve large-scale electromagnetic scattering calculation and to obtain corresponding large data. Therefore, we use Finite-Difference Time-Domain (FDTD) combined with Internet of Things, cloud computing, and other technologies to solve the above problems. In this paper, we focus on the FDTD method and use it to simulate electromagnetic scattering of electrically large objects. FDTD method has natural parallelism. A computing network cluster based on MPI is constructed. POSIX (Portable Operating System Interface of UNIX) multithreading technology is conducive to enhancing the computing power of multicore CPU and to realize multiprocessor multithreading hybrid parallel FDTD. For two-dimension CPU and memory resources, the Dominant Resource Fairness (DRF) algorithm is used to achieve load balancing scheduling, which guarantees the computing performance. The experimental results show that the hybrid parallel FDTD algorithm combined with load balancing scheduling can solve the problem of low computational efficiency and improve the success rate of task execution.

    The Last Man Standing Technique for Proof-of-Location in IoT Infrastructures at Network Edge

    Marat Zhanikeev
    12页
    查看更多>>摘要:This paper is divided in two parts. The first part is the story of a failure, where an attempt to generate verifiable Proof-of-Location from WiFi scan results has failed, even when scan results were compared with a small time shift within the same trace. In the second part, this paper proposes to conduct Proof-of-Location transactions in a peer-to-peer fashion. Each peer is assisted by the cloud side which plays the role of both the real-time mediator and public transaction ledger. This paper proposes the Last Man Standing (LMS) procedure which is both a means for ensuring a fair transaction and a natural way to close it. Each transaction results in a coin which can be either shared among transaction participants or owned individually by LMS. Analysis using real mobility traces from various types of urban locations shows that the proposal is valid and will ensure that all the locations within the city will gradually be claimed via the proposed type of transactions while providing independently verifiable proofs for each location. The distant goal of this paper is a next generation Location-Based Service (LBS) which takes the form of a location-based resource economy where each location is a coin compatible with traditional blockchain operations.

    Discrete-Time Analysis of Cognitive Radio Networks with Nonsaturated Source of Secondary Users

    Vicent PlaAttahiru S. AlfaJorge Martinez-BausetVicente Casares-Giner...
    12页
    查看更多>>摘要:Sensing is a fundamental aspect in cognitive radio networks and one of the most complex issues. In the design of sensing strategies, a number of tradeoffs arise between throughput, interference to primary users, and energy consumption. This paper provides several Markovian models that enable the analysis and evaluation of sensing strategies under a broad range of conditions. The occupation of a channel by primary users is modeled as alternating idle and busy intervals, which are represented by a Markov phase renewal process. The behavior of secondary users is represented mainly through the duration of transmissions, sensing periods, and idle intervals between consecutive sensing periods. These durations are modeled by phase-type distributions, which endow the model with a high degree of generality. Unlike our previous work, here the source of secondary users is nonsaturated, which is a more practical assumption. The arrival of secondary users is modeled by the versatile Markovian arrival process, and models for both finite and infinite queues are built. Furthermore, the proposed models also incorporate a quite general representation of the resumption policy of an SU transmission after being interrupted by PUs activity. A comprehensive analysis of the proposed models is carried out to derive several key performance indicators in cognitive radio networks. Finally, some numerical results are presented to show that, despite the generality and versatility of the proposed models, their numerical evaluation is perfectly feasible.

    A Heterogeneous Energy Wireless Sensor Network Clustering Protocol

    Mengjia ZengXu HuangBo ZhengXiangxiang Fan...
    11页
    查看更多>>摘要:The Low-Efficiency Adaptive Clustering Hierarchical (LEACH) protocol, a hierarchical routing protocol, has the advantage of simple implementation and can effectively balance network loads. However, to date there has been a lack of consideration for its use in heterogeneous energy network environments. To solve this problem, the Energy-Coverage Ratio Clustering Protocol (E-CRCP) is proposed, which is based on reducing the energy consumption of the system and utilizing the regional coverage ratio. First, the energy model is designed. The optimal number of clusters is determined based on the principle of "minimum energy consumption", and the cluster head selection is based on the principle of "regional coverage maximization". In order to balance the network load as much as possible, in the next iteration of cluster head selection, the cluster head with the lowest residual energy and the highest energy consumption is replaced to prolong the network's life. Our simulated results demonstrate that the proposed method has some advantages in terms of longer network life, load balancing, and overall energy consumption in the environment of a heterogeneous energy wireless sensor network.

    DOA and Polarization Parameters Estimation by Exploiting Canonical Polyadic Decomposition of Tensors

    Ling WangJian XieZhaolin ZhangLong Liu...
    12页
    查看更多>>摘要:A new algorithm to estimate the direction of arrival (DOA) and polarization parameters of signals impinging on an array with electromagnetic (EM) vector-sensors is presented by exploiting the canonical polyadic decomposition (CPD) of tensors. In addition to spatial and temporal diversities, further information from the polarization domain is considered and used in this paper. Estimation errors of these parameters are evaluated by the Cramer-Rao lower bound (CRB) benchmark, in the presence of additive white Gaussian noise (AWGN). The superiority of the proposed algorithm is shown by comparing with the derivative algorithms of MUSIC and ESPRIT. In the proposed algorithm, the parameters can be estimated by virtue of the diversities of the spatial and polarization belonging to the factor matrices, rather than the conventional subspace which is the foundation of MUSIC and ESPRIT. Additionally, the classical CPD algorithm based on Alternating Least Squares (ALS) is introduced to verify the efficacy of the proposed CPD algorithm. Results demonstrate that when the number of snapshots is greater than 50, the proposed algorithm requires a smaller number of snapshots to achieve a high level of performance, compared against the subspace-based algorithms and the ALS-based algorithm. Furthermore, in the matter of the array with a small number of sensors, the discovered advantage concerning the Root Mean Square Error (RMSE) in estimating the DOA and the polarization state of the signal is noteworthy.

    A Novel Resource Deployment Approach to Mobile Microlearning: From Energy-Saving Perspective

    Ruijuan ZhengJunlong ZhuMingchuan ZhangRuoshui Liu...
    15页
    查看更多>>摘要:Mobile Microlearning, a novel fusion form of the mobile Internet, cloud computing, and microlearning, becomes more prevalent in recent years. However, its high deployment and operational costs make energy saving in cloud become a concerning issue. In this paper, to save energy consumption, a resource deployment approach to cloud service provision for Mobile Microlearning is proposed. Chinese Lexical Analysis System and Dynamic Term Frequency-Inverse Document Frequency (D-TF-IDF) are adopted to implement resource classification. Resources are deployed to the 2-tier cloud architecture according to the classification results. Grey Wolf Optimization (GWO) algorithm is used to forecast real-time energy consumption per byte. The simulation results show that, compared to traditional algorithm, the classification accuracy of small sample categories was significantly improved; the forecast energy consumption value and the standard values are 7.67% in private cloud and 2.93% in public cloud; the energy saving reaches 2.22% to 16.23% in 3G and 7.35% to 20.74% in Wi-Fi.

    End-To-End Mobility for the Internet Using ILNP

    Ditchaphong PhoomikiattisakSaleem N. Bhatti
    29页
    查看更多>>摘要:As the use of mobile devices and methods of wireless connectivity continue to increase, seamless mobility becomes more desirable and important. The current IETF Mobile IP standard relies on additional network entities for mobility management, can have poor performance, and has seen little deployment in real networks. We present a host-based mobility solution with a true end-to-end architecture using the Identifier-Locator Network Protocol (ILNP). We show how the TCP code in the Linux kernel can be extended allowing legacy TCP applications that use the standard C sockets API to operate over ILNP without requiring changes or recompilation. Our direct testbed performance comparison shows that ILNP provides better host mobility support than Mobile IPv6 in terms of session continuity, packet loss, and handoff delay for TCP.

    A Construction of High Performance Quasicyclic LDPC Codes: A Combinatoric Design Approach

    Nauman Ali KhanMuhammad AsifWuyang ZhouMuhammad Ajmal...
    10页
    查看更多>>摘要:This correspondence presents a construction of quasicyclic (QC) low-density parity-check (LDPC) codes based on a special type of combinatorial designs known as block disjoint difference families (BDDFs). The proposed construction of QC-LDPC codes gives parity-check matrices with column weight three and Tanner graphs having a girth lower-bounded by 6. The proposed QC-LDPC codes provide an excellent performance with iterative decoding over an additive white Gaussian-noise (AWGN) channel. Performance analysis shows that the proposed short and moderate length QC-LDPC codes perform as well as their competitors in the lower signal-to-noise ratio (SNR) region but outperform in the higher SNR region. Also, the codes constructed are quasicyclic in nature, so the encoding can be done with simple shift-register circuits with linear complexity.

    A Framework for Analyzing Fog-Cloud Computing Cooperation Applied to Information Processing of UAVs

    Milena F. PintoAndre L. M. MarcatoAurelio G. MeloLeonardo M. Honorio...
    14页
    查看更多>>摘要:Unmanned aerial vehicles (UAVs) are a relatively new technology. Their application can often involve complex and unseen problems. For instance, they can work in a cooperative-based environment under the supervision of a ground station to speed up critical decision-making processes. However, the amount of information exchanged among the aircraft and ground station is limited by high distances, low bandwidth size, restricted processing capability, and energy constraints. These drawbacks restrain large-scale operations such as large area inspections. New distributed state-of-the-art processing architectures, such as fog computing, can improve latency, scalability, and efficiency to meet time constraints via data acquisition, processing, and storage at different levels. Under these amendments, this research work proposes a mathematical model to analyze distribution-based UAVs topologies and a fog-cloud computing framework for large-scale mission and search operations. The tests have successfully predicted latency and other operational constraints, allowing the analysis of fog-computing advantages over traditional cloud-computing architectures.

    EEHRT: Energy Efficient Technique for Handling Redundant Traffic in Zone-Based Routing for Wireless Sensor Networks

    Rab Nawaz JadoonWu Yang ZhouIftikhar Ahmed KhanMuhammad Amir Khan...
    12页
    查看更多>>摘要:This paper presents an energy-efficient technique to handle redundant traffic (EEHRT) in the zone-based routing for wireless sensor networks. In this technique, multihop routing is performed based on the remaining energy of the nodes. Afterwards, it performs position-based routing without the need for the nodes to know their respective position. The main objective of this paper is to handle the redundant packets generated in zone-based routing using short beacon messages. Nodes of lower zones route the data of the higher zone to base station (BS) with a minimum number of hops and utilize only those nodes on the path which are energy efficient and located closer to BS. Moreover, the source node is acknowledged by the relaying node using a wireless broadcast advantage (WBA) without sending any special ACK packet to the sender, which reduces the control overhead in the routing process. The EEHRT technique improves the routing against RARZ by ensuring only one copy of the packet is propagated at each hop along the routing path to BS. Simulation results show that EEHRT achieved 28% improvement in energy efficiency, 10% and 25% improvements in data throughput against total and distinct packet reception at BS respectively, 35% increase in overall network lifetime, and 100% reduction in redundant packets generation and propagation in the network against RARZ routing.