Range‐free intersecting chord‐based geometric localization scheme for wireless sensor networks

Recent advancement in wireless sensor network has contributed greatly to the emerging of low‐cost, low‐powered sensor nodes. Even though deployment of large‐scale wireless sensor network became easier, as the power consumption rate of individual sensor nodes is restricted to prolong the battery lifetime of sensor nodes, hence the heavy computation capability is also restricted. Localization of an individual sensor node in a large‐scale geographic area is an integral part of collecting information captured by the sensor network. The Global Positioning System (GPS) is one of the most popular methods of localization of mobile terminals; however, the use of this technology in wireless sensor node greatly depletes battery life. Therefore, a novel idea is coined to use few GPS‐enabled sensor nodes, also known as anchor nodes, in the wireless sensor network in a well‐distributed manner. Distances between anchor nodes are measured, and various localization techniques utilize this information. A novel localization scheme Intersecting Chord‐Based Geometric Localization Scheme (ICBGLS) is proposed here, which loosely follows geometric constraint‐based algorithm. Simulation of the proposed scheme is carried out for various communication ranges, beacon broadcasting interval, and anchor node traversal techniques using Omnet++ framework along with INET framework. The performance of the proposed algorithm (ICBGLS), Ssu scheme, Xiao scheme, and Geometric Constraint‐Based (GCB) scheme is evaluated, and the result shows the fact that the proposed algorithm outperforms the existing localization algorithms in terms of average localization error. The proposed algorithm is executed in a real‐time indoor environment using Arduino Uno R3 and shows a significant reduction in average localization time than GCB scheme and similar to that of the SSU scheme and Xiao scheme.     

Linear and non‐linear space diversity combining algorithms over fading channels in TDMA systems

This paper investigates the performances of various adaptive algorithms for space diversity combining in time division multiple access (TDMA) digital cellular mobile radio systems. Two linear adaptive algorithms are investigated, the least mean square (LMS) and the square root Kalman (SRK) algorithm. These algorithms are based on the minimization of the mean‐square error. However, the optimal performance can only be obtained using algorithms satisfying the minimum bit error rate (BER) criterion. This criterion can be satisfied using non‐linear signal processing techniques such as artificial neural networks. An artificial neural network combiner model is developed, based on the recurrent neural network (RNN) structure, trained using the real‐time recurrent learning (RTRL) algorithm. It is shown that, for channels characterized by Rician fading, the artificial neural network combiners based on the RNN structure are able to provide significant improvements in the BER performance in comparison with the linear techniques. In particular, improvements are evident in time‐varying channels dominated by inter‐symbol interference. Copyright © 2001 John Wiley & Sons, Ltd.     

基于LSTM神经网络的卫星频谱多门限感知算法

针对在卫星认知通信场景下传统频谱感知算法感知性能低、受通信时延影响大的问题,提出了一种基于长短期记忆(LSTM)神经网络的卫星频谱多门限感知算法。首先构建卫星认知通信模型,其次将仿真数据送入长短期记忆(LSTM)神经网络进行预测感知,采用动量随机梯度下降(SGDM)算法对网络进行更新,然后提出多门限算法对网络输出进行优化,最后与其他神经网络算法作性能对比。该算法无需构建特征值,实验结果表明:在卫星信道条件下,当面对低接收信噪比及低网络迭代次数时,该算法频谱感知性能要优于其他神经网络算法。      

粒子群优化的小波网络在飞参数据压缩中的应用

飞参数据压缩是减少飞参数据的存储空间和传输通信流量的关键。针对飞参数据的特点,提出了一种基于粒子群优化的小波神经网络近无损压缩算法。该算法将小波网络参数作为原始数据的重构信息,在小波神经网络BP算法的基础上,引入粒子群优化算法,克服了粒子群优化算法的早熟收敛,增强了小波神经网络学习算法的全局搜索能力,提高了网络收敛速度;同时将重构误差作为启发信息,在保证较小失真度的情况下,通过粒子的迭代寻求最优的小波神经网络结构。飞参数据压缩仿真实验结果表明了算法的可行性和有效性,可以获得较高的压缩比和较小的重构误差。     

Addressing space‐constraint driven selfishness in smart opportunistic environment

A smart opportunistic environment is a physical space, which allows the smart physical objects to communicate in the presence of disruption in connectivity. Because, the objects in such an environment are buffer constrained, some of the objects will not participate in data forwarding, when there is scarcity of storage (buffer) space. In this paper, we focus on such selfish behavior of objects triggered by space constraints in a smart opportunistic environment. We propose a novel data forwarding algorithm, selfishness and buffer‐aware routing (SBR), in which a node is chosen as a relay, based on its capability, which is a function of its available buffer space and past encounter history (delivery predictability) with the destination. SBR can efficiently utilize the limited buffer space in a node with a buffer management scheme, WSD. It can also detect space constraint driven selfish behavior of nodes and resolve it using a reputation‐based technique, MSD. We have conducted simulation using both synthetic and real‐world traces for evaluating our proposed SBR algorithm. For analyzing the performance of the algorithm in real‐time, a smart vehicular test‐bed is developed. Simulation results and test‐bed implementation show that our algorithm performs better in terms of higher delivery ratio, lower overhead ratio, and lower delivery delay, compared with existing opportunistic data forwarding algorithms.     

Network‐coded multiple‐source cooperation aided relaying for free‐space optical transmission

A network‐coded cooperative relaying aided free‐space optical (FSO) transmission scheme is designed. The resultant multiple‐source cooperation diversity is exploited by the relay to mitigate the strong turbulence‐induced fading experienced in FSO channels. At the destination, an iterative multiple source detection algorithm is proposed in conjunction with a chip‐level soft network decoding method. Our performance evaluation results using simulation analysis demonstrate that the proposed FSO multiple source detection is capable of approaching the single‐user‐bound for transmission over Gamma–Gamma turbulence channels. Also, the network‐coded cooperative FSO scheme can achieve a significant BER improvement in comparison with conventional noncooperation schemes. Copyright © 2012 John Wiley & Sons, Ltd.     

ElectroBlocks: A blockchain‐based energy trading scheme for smart grid systems

Smart grid systems are widely used across the world for providing demand response management between users and service providers. In most of the energy distributions scenarios, the traditional grid systems use the centralized architecture, which results in large transmission losses and high overheads during power generation. Moreover, owing to the presence of intruders or attackers, there may be a mismatch between demand and supply between utility centers (suppliers) and end users. Thus, there is a need for an automated energy exchange to provide secure and reliable energy trading between users and suppliers. We found, from the existing literature, that blockchain can be an effective solution to handle the aforementioned issues. Motivated by these facts, we propose a blockchain‐based smart energy trading scheme, ElectroBlocks, which provides efficient mechanisms for secure energy exchanges between users and service providers. In ElectroBlocks, nodes in the network validate the transaction using two algorithms that are cost aware and store aware. The cost‐aware algorithm locates the nearest node that can supply the energy, whereas the store‐aware algorithm ensures that the energy requests go to the node with the lowest storage space. We evaluated the performance of the ElectroBlocks using performance metrics such as mining delay, network exchanges, and storage energy. The simulation results obtained demonstrate that ElectroBlocks maintains a secure trade‐off between users and service providers when using the proposed cost‐aware and store‐aware algorithms.     

A middleware approach for reliable resource selection on Internet‐of‐Things

Decision making plays a vital role in the selection of resources so that they actively participate for communication and computation on the Internet‐of‐Things platform. For the same, they require the elimination of the challenges related to knowledge representation, discovery, trust, and security due to continuously changing mobility patterns, heterogeneity, interoperability, and scalability on the network. To address the challenges, a novel three‐layered approach, namely, middleware approach for reliable resource selection on Internet‐of‐Things (MARRS‐IoT), is proposed. It performs a search through neighbor discovery algorithm and evaluates trust score of the discovered resources, both locally and globally using fuzzy‐decision algorithm and performs efficient communication among resources via hybrid M‐gear protocol. The approach is simulated and compared against algorithms, namely, particle swarm optimization, ants colony optimization, and binary genetic to evaluate its performance. The obtained results support the efficacy of the MARRS‐IoT with respect to throughput and execution time.     

An adaptive end‐to‐end RTO calculation framework for DTNs with scheduled connectivity

In this work, we propose an end‐to‐end retransmission framework for dynamically calculating efficient retransmission time‐out intervals in delay‐tolerant networks (DTNs) with scheduled connectivity. The proposed framework combines deterministic and statistical information about the network state to calculate worst‐case estimates about the expected round trip times. Such information includes connectivity schedules, convergence layer protocols specifics, communication link characteristics, and network statistics about the maximum expected packet error rates and storage congestion. We detail the implementation of the proposed framework within the end‐to‐end application data conditioning layer proposed for the DTN architecture, realized by the Delay‐Tolerant Payload Conditioning protocol, as part of the Interplanetary Overlay Network–DTN reference implementation, and evaluate its performance in a complex deep‐space emulation scenario in our DTN testbed. Our results show that our approach achieves great accuracy in round‐trip time estimations and, therefore, faster retransmissions of lost data, in comparison to the statically configured retransmission mechanism of the original Delay‐Tolerant Payload Conditioning protocol. As a result, in‐order data reception rate and storage requirements on the receiver side are significantly improved, at minimum or even zero extra cost in transmission overhead due to duplicate transmissions.     

Tree‐based channel assignment schemes for multi‐channel wireless sensor networks

Many sensor node platforms used for establishing wireless sensor networks (WSNs) can support multiple radio channels for wireless communication. Therefore, rather than using a single radio channel for whole network, multiple channels can be utilized in a sensor network simultaneously to decrease overall network interference, which may help increase the aggregate network throughput and decrease packet collisions and delays. This method, however, requires appropriate schemes to be used for assigning channels to nodes for multi‐channel communication in the network. Because data generated by sensor nodes are usually delivered to the sink node using routing trees, a tree‐based channel assignment scheme is a natural approach for assigning channels in a WSN. We present two fast tree‐based channel assignment schemes (called bottom up channel assignment and neighbor count‐based channel assignment) for multi‐channel WSNs. We also propose a new interference metric that is used by our algorithms in making decisions. We validated and evaluated our proposed schemes via extensive simulation experiments. Our simulation results show that our algorithms can decrease interference in a network, thereby increasing performance, and that our algorithms are good alternatives for static channel assignment in WSNs. Copyright © 2015 John Wiley & Sons, Ltd.     

Reconstruction of chaotic signals with application to channel equalization in chaos‐based communication systems

A number of schemes have been proposed for communication using chaos over the past years. Regardless of the exact modulation method used, the transmitted signal must go through a physical channel which undesirably introduces distortion to the signal and adds noise to it. The problem is particularly serious when coherent‐based demodulation is used because the necessary process of chaos synchronization is difficult to implement in practice. This paper addresses the channel distortion problem and proposes a technique for channel equalization in chaos‐based communication systems. The proposed equalization is realized by a modified recurrent neural network (RNN) incorporating a specific training (equalizing) algorithm. Computer simulations are used to demonstrate the performance of the proposed equalizer in chaos‐based communication systems. The Hénon map and Chua's circuit are used to generate chaotic signals. It is shown that the proposed RNN‐based equalizer outperforms conventional equalizers as well as those based on feedforward neural networks for noisy, distorted linear and non‐linear channels. Copyright © 2004 John Wiley & Sons, Ltd.     

Optimization of an RFID location identification scheme based on the neural network

An indoor localization technology is increasingly critical as location‐aware applications evolve. Researchers have proposed several indoor localization technologies. Because most of the proposed indoor localization technologies simply involve using the received signal strength indicator value of radio‐frequency identification (RFID) for indoor localization, radio‐frequency interference, and environmental factors often limit the accuracy of localization results. Therefore, this study proposes an accurate RFID localization based on the neural network (ARL‐N²), a passive RFID indoor localization scheme for identifying tag positions in a room, combining a location identification based on dynamic active RFID calibration algorithm with a backpropagation neural network (BPN). The proposed scheme composed of two phases: in the training phase, an appropriate BPN architecture is constructed using the training data derived from the coordinates of reference tags and the coordinates obtained using the localization algorithm. By contrast, the online phase involves calculating the tracking tag coordinates and using these values as BPN inputs, thereby enhancing the estimated location. A performance evaluation of the ARL‐N² schemes confirms its high localization accuracy. The proposed method can be used to locate critical objects in difficult‐to‐find areas by creating minimal errors and applying and economical technique. Copyright © 2013 John Wiley & Sons, Ltd.     

Two‐Microphone Generalized Sidelobe Canceller with Post‐Filter Based Speech Enhancement in Composite Noise

This paper describes an algorithm to suppress composite noise in a two‐microphone speech enhancement system for robust hands‐free speech communication. The proposed algorithm has four stages. The first stage estimates the power spectral density of the residual stationary noise, which is based on the detection of nonstationary signal‐dominant time‐frequency bins (TFBs) at the generalized sidelobe canceller output. Second, speech‐dominant TFBs are identified among the previously detected nonstationary signal‐dominant TFBs, and power spectral densities of speech and residual nonstationary noise are estimated. In the final stage, the bin‐wise output signal‐to‐noise ratio is obtained with these power estimates and a Wiener post‐filter is constructed to attenuate the residual noise. Compared to the conventional beamforming and post‐filter algorithms, the proposed speech enhancement algorithm shows significant performance improvement in terms of perceptual evaluation of speech quality.     

Manifold‐based canonical correlation analysis for wireless sensor network localization

Signal‐strength‐based location estimation in wireless sensor networks is to locate the physical positions of unknown sensors via the received signal strengths. In this field, there are few localization researches sufficiently exploiting topology structures of the network in both signal space and physical space. The goal of this paper is to first establish two effective localization models based on specific manifold (or local) structures of both signal space and physical (location) space by using our previous locality preserving canonical correlation analysis (LPCCA) model and a newly‐proposed locality correlation analysis (LCA) model, and then develop their corresponding novel location algorithms, called location estimation—LPCCA (LE—LPCCA) and location estimation—LCA (LE—LCA). Since both LPCCA and LCA relatively sufficiently take into account locality characteristics of the manifold structures in both the spaces, our localization algorithms developed from them consequently achieve better localization accuracy than other publicly available advanced algorithms. Copyright © 2011 John Wiley & Sons, Ltd.     

Compressed sensing channel estimation for STBC‐SM based hybrid MIMO‐OFDM system for visible light communication

This paper presents the idea of sparse channel estimation using compressed sensing (CS) method for space–time block coding (STBC), and spatially multiplexing (SM) derived hybrid multiple‐input multiple‐output (MIMO) Asymmetrically clipped optical‐orthogonal frequency division multiplexing (ACO‐OFDM) optical wireless communication system. This hybrid system accounts multiplexing gain of SM and diversity gain of STBC technique. We present a new variant of sparsity adaptive matching pursuit (SaMP) algorithm called dynamic step‐size SaMP (DSS‐SaMP) algorithm. It makes use of the inherent and implicit structure of SaMP, along with dynamic adaptivity of step‐size feature which is compatible with the energy of the input signal, thus the name dynamic step size. Existing CS‐based recovery algorithms like orthogonal matching pursuit, SaMP, adaptive step‐size SaMP, and proposed DSS‐SaMP were compared for hybrid MIMO‐ACO‐OFDM visible light communication system. The performance analysis is demonstrated through simulation results with respect to bit error rate, symbol error rate, mean square error, computational complexity, and peak‐to‐average power ratio. Simulation results show that the proposed technique gives improved performance and lesser computational complexity in comparison with conventional estimation algorithms.     

Multiobjective optimization‐based DV‐hop localization using NSGA‐II algorithm for wireless sensor networks

Localization is one of the important requirements in wireless sensor networks for tracking and analyzing the sensor nodes. It helps in identifying the geographical area where an event occurred. The event information without its position information has no meaning. In range‐free localization techniques, DV‐hop is one of the main algorithm which estimates the position of nodes using distance vector algorithm. In this paper, a multiobjective DV‐hop localization based Non‐Sorting Genetic Algorithm‐II (NSGA‐II) is proposed in WSNs. Here, we consider six different single‐objective functions to make three multiobjective functions as the combination of two each. Localization techniques based on proposed multiobjective functions has been evaluated on the basis of average localization error and localization error variance. Simulation results demonstrate that the localization scheme based on proposed multiobjective functions can achieve good accuracy and efficiency as compared to state‐of‐the‐art single‐ and multiobjective GA DV‐hop localization scheme.     

A novel energy‐aware routing mechanism for SDN‐enabled WSAN

Energy consumption is one of the most important design constraints when building a wireless sensor and actuator network since each device in the network has a limited battery capacity, and prolonging the lifetime of the network depends on saving energy. Overcoming this challenge requires a smart and reconfigurable network energy management strategy. The Software‐Defined Networking (SDN) paradigm aims at building a flexible and dynamic network structure, especially in wireless sensor networks. In this study, we propose an SDN‐enabled wireless sensor and actuator network architecture that has a new routing discovery mechanism. To build a flexible and energy‐efficient network structure, a new routing decision approach that uses a fuzzy‐based Dijkstra's algorithm is developed in the study. The proposed architecture can change the existing path during data transmission, which is the key property of our model and is achieved through the adoption of the SDN approach. All the components and algorithms of the proposed system are modeled and simulated using the Riverbed Modeler software for more realistic performance evaluation. The results indicate that the proposed SDN‐enabled structure with fuzzy‐based Dijkstra's algorithm outperforms the one using the regular Dijkstra's and the ZigBee‐based counterpart, in terms of the energy consumption ratio, and the proposed architecture can provide an effective cluster routing while prolonging the network lifetime.     

An efficient communication relay placement algorithm for content‐centric wireless mesh networks

In this paper, we investigate a communication relay placement problem to optimize the network throughput in a content‐centric wireless mesh networks (WMN), in which the WMN is enhanced by including a small set of communication relays and a subset of wireless mesh routers serving as storage nodes. Specifically, we first define the communication relay placement problem in content‐centric WMNs. We then model the problem as a mathematical programming and propose a linear programming approach for calculating the achievable network throughput when the positions of communication relays are fixed. Next, to optimally placing the communication relays, we formulate an integer linear programming problem and we develop an efficient near‐optimal approximation algorithm based on linear programming relaxation. Finally, extensive simulation experiments have been conducted, and the results demonstrate the effectiveness of the proposed algorithms. Copyright © 2013 John Wiley & Sons, Ltd.     

Adaptive quality of service‐based routing approaches: development of neuro‐dynamic state‐dependent reinforcement learning algorithms

In this paper, we propose two adaptive routing algorithms based on reinforcement learning. In the first algorithm, we have used a neural network to approximate the reinforcement signal, allowing the learner to take into account various parameters such as local queue size, for distance estimation. Moreover, each router uses an online learning module to optimize the path in terms of average packet delivery time, by taking into account the waiting queue states of neighbouring routers. In the second algorithm, the exploration of paths is limited to N‐best non‐loop paths in terms of hops number (number of routers in a path), leading to a substantial reduction of convergence time. The performances of the proposed algorithms are evaluated experimentally with OPNET simulator for different levels of traffic's load and compared with standard shortest‐path and Q‐routing algorithms. Our approach proves superior to classical algorithms and is able to route efficiently even when the network load varies in an irregular manner. We also tested our approach on a large network topology to proof its scalability and adaptability. Copyright © 2006 John Wiley & Sons, Ltd.     

Network planning for mobile multi‐hop relay networks

In this paper, the coverage problem of network planning in mobile multi‐hop relay networks is defined on the basis of integer linear programming. In order to provide desired utilities and also meet deployment limitations for network planning, we propose a supergraph tree algorithm to place base stations and relay stations at the lowest cost position. Furthermore, another algorithm for avoiding the interference between base stations, which is called interference aware tree algorithm is also proposed. Both the proposed algorithms are formulated on the basis of a graph theoretic technique and analyzed in the simulation results. The results show that the supergraph tree algorithm provides the lowest construction cost with different network scenarios, and the interference aware tree algorithm provides the highest communication quality for mobile multi‐hop relay infrastructure‐based communication network planning. Copyright © 2013 John Wiley & Sons, Ltd.