Nodes In Wireless Networks Research Articles

Truthful Detection of Selfish Malicious Packet Dropping Nodes in Wireless Ad Hoc Network

Truthful Detection of Selfish Malicious Packet Dropping Nodes in Wireless Ad Hoc Network

Relay Selection for Broadcast Underlay Cognitive Radio Networks Using AF and DF Relaying

A degree of cooperative diversity has been achieved with the introduction of relay nodes in wireless networks. However, such approach suffers from spectral efficiency loss. Therefore, different relay selection techniques have been proposed in the literature to mitigate this loss. In this paper, the problem of relay selection for broadcast cognitive radio networks (CRNs) is investigated. The CRN is composed of a primary transmitter and receiver, a secondary source and several destination nodes. It is assumed that the secondary source broadcasts a signal to N secondary destinations. We implicitly split the destination nodes into two sets: reliable nodes having an signal-to-noise ratio (SNR) larger than a predefined threshold (T) and unreliable nodes with SNR lower than T. The paper proposes several relay selection techniques based on the average SNR, instantaneous SNR, and best direct link. Relay selection is performed by a central node taking into account the interference level at primary receiver and channel state information between nodes of the secondary CRN. In addition, the paper provides the mathematical derivation and analysis of the bit error probability (BEP) of relay selection in broadcast CRNs for both amplify and forward and decode and forward relaying. We propose to select a single relay among reliable nodes that verify interference constraints (interference to primary receiver lower than the interference threshold \(\beta \)) to help the remaining unreliable nodes. The threshold T is optimized numerically to yield the lowest BEP. Our theoretical results are confirmed by simulation.

Modeling and prediction primary nodes in wireless networks of cognitive radio using recurrent neural networks

Modeling and prediction primary nodes in wireless networks of cognitive radio using recurrent neural networks

Detection of misbehaving nodes in wireless adhoc networks

Detection of misbehaving nodes in wireless adhoc networks

Securing Locations of Mobile Nodes in Wireless Mesh Network’s

The current deployment of wireless mesh networks requires mobility management to track the current locations of mobile nodes around the network without service interruption. To do so, the Hierarchical Mobile IPv6 protocol has been chosen, which minimises the required signalling by introducing a new entity called the mobile anchor point to act as a local home agent for all visiting mobile nodes in a specific domain. It allows a mobile node to register its local/regional care-of addresses with a mobile anchor point by sending a local binding update message. However, the local binding update is quite sensitive; it modifies the routing to enable mobility in the wireless mesh networks. When a local binding update message is spoofed, an attacker can redirect traffic that is destined for legitimate mobile node either to itself or to another node. This situation leads to an increased risk of attacks. Therefore, this paper contributes to addressing this security issue based on wireless mesh networks by cryptography generation and verification of a mobile node’s local and regional care-of addresses, as well as the application of a novel method to verify the reachability of mobile node at claimed local care-of address. This is called the enhanced mobile anchor point registration protocol. The Scyther tool has been used to ensure the proposed protocol accuracy. Furthermore, the performance, in terms of the mobile anchor point registration delay and signalling overhead, is evaluated by using the OPNET modeller simulator.

Secrecy Analysis of SWIPT-Enabled Cooperative Networks With DF HPTSR Protocol

The simultaneous wireless information and power transfer (SWIPT) technology is recently used to sustain the lifetime of energy-constrained relay nodes in wireless cooperative networks. An example to achieve this technology is the hybridized power-time splitting-based relaying (HPTSR) protocol. However, the information security aspect of wireless cooperative networks is important and needs adequate attention. In this paper, we perform the secrecy analysis of a SWIPT-enabled cooperative network with source–relay link-based decode-and-forward HPTSR protocol, which can enhance the operational lifetime of the relay nodes and the secrecy performance of the entire cooperative network. Specifically, we examine the secrecy performance of the considered network by deriving the analytical expressions for the near-optimal power splitting factor, secrecy outage probability, and secure energy efficiency of the system. All analytical results are confirmed by numerical simulations. Our results show that the SWIPT-enabled cooperative network outperforms the conventional relaying scheme-based network presented in literature at relatively high signal-to-noise ratios.

Algorithm for the most surviving nodes selection based on adaptive forwarding control under the impact of network storm

In order to improve the survivability of wireless network nodes under the impact of network storm to improve the adaptive forwarding performance of network and control the nodes selection optimisation, an algorithm for the most surviving nodes selection based on adaptive forwarding control under the impact of network storm is proposed in this paper. In this algorithm, a node distribution model under the impact of network storm is constructed; the automatic regulation and control method is adopted for optimal localisation and deployment of target nodes; based on node location, an output link forwarding routing protocol is constructed for interference wave filtering and adaptive forwarding control of output package, so as to select the most surviving nodes and improve the survival rate of nodes. The simulation result shows that this method can realise 100% success rate of data forwarding, reduce the average transmission power by 5 kW than that before optimisation, and stabilise the transmission power. The calculation cost and time delay are 5-20 ms lower than that of other methods, which proves the high efficiency of this method.

Algorithm for the most surviving nodes selection based on adaptive forwarding control under the impact of network storm

In order to improve the survivability of wireless network nodes under the impact of network storm to improve the adaptive forwarding performance of network and control the nodes selection optimisation, an algorithm for the most surviving nodes selection based on adaptive forwarding control under the impact of network storm is proposed in this paper. In this algorithm, a node distribution model under the impact of network storm is constructed; the automatic regulation and control method is adopted for optimal localisation and deployment of target nodes; based on node location, an output link forwarding routing protocol is constructed for interference wave filtering and adaptive forwarding control of output package, so as to select the most surviving nodes and improve the survival rate of nodes. The simulation result shows that this method can realise 100% success rate of data forwarding, reduce the average transmission power by 5 kW than that before optimisation, and stabilise the transmission power. The calculation cost and time delay are 5-20 ms lower than that of other methods, which proves the high efficiency of this method.

A Dynamic Addressing Protocol on Code Messages for an Underwater Wireless Half Duplex Networks of Autonomous Sensors

This paper presents the new protocol for the organization of dynamic addressing nodes in the underwater wireless networks. In view of the extremely limited frequency band and significant delays inherent in the underwater acoustic data transmission channel, as well as the nonlinearity of the propagation paths of the acoustic signal in water, an approach is proposed for constructing a dynamic addressing protocol based on avoiding collisions at the receiving point. The protocol takes into account the peculiarities of the physical layer of the data transmission and is designed for servicing the network of autonomous non-synchronized nodes.

A Dynamic Addressing Protocol on Code Messages for an Underwater Wireless Half Duplex Networks of Autonomous Sensors

This paper presents the new protocol for the organization of dynamic addressing nodes in the underwater wireless networks. In view of the extremely limited frequency band and significant delays inherent in the underwater acoustic data transmission channel, as well as the nonlinearity of the propagation paths of the acoustic signal in water, an approach is proposed for constructing a dynamic addressing protocol based on avoiding collisions at the receiving point. The protocol takes into account the peculiarities of the physical layer of the data transmission and is designed for servicing the network of autonomous non-synchronized nodes.

Design and Implementation of the ZigBee Wireless Sensor Network Based on ARM

This paper is intended to design a ZigBee wireless network node based on the advanced RISC machines (ARM), so as to facilitate the network usage process. The performance of the new sensor is subject to antenna test and simulation experiment. The HFSS simulation method is adopted, and the antenna size and scanning frequency are optimized through analyzing the research status of ZigBee technology and the working principle of ZigBee protocol stack based on parameters, such as, the return loss and direction of the antenna, which not only increases the accuracy of analysis and but also reduces the reflection coefficient. The experimental results show that when L2 is 14. 9mm, the effect is the best, and Sll is -26.6 dB. Based on the above findings, it is concluded that the integrated antennas on the printed circuit board (PCB) board can reduce the production cost of the antennas; thus, IFA antennas can meet the requirements of ZigBee based wireless sensor network in term of antenna performance.

Link State Routing Based on Compressed Sensing

In table routing protocols such as link state routing, every node in the network periodically broadcasts its link state and the state of its neighbors. These routing updates result in the transmission of a large number of packets. Some of these packets contain correlated or even redundant data which could be compressed if there is central management in the network. However, in autonomous networks, each node acts as a router, in which case central coordination is not possible. In this paper, compressed sensing is used to reduce routing traffic overhead. This can be done at nodes which have greater processing capabilities and no power consumption limitations such as backbone nodes in wireless mesh networks. A method is proposed to select a subset of nodes and thus a subset of links to probe their state. The sensed states are encoded to generate a low dimension sampled vector. This compressed link state vector is broadcast to the entire network. Nodes can then reconstruct link states from this vector using side information. Performance results are presented which demonstrate accurate anomaly detection while adapting to topology changes. Further, it is shown that a proper choice of weighting coefficients in the sampling process can improve detection performance.

A SURVEY OF CONTENTION BASED MEDIUM ACCESS CONTROL (MAC) PROTOCOLS IN WIRELESS LAN

In wireless network, all radio nodes are tuned to the same frequency to interconnect and establish communication between each other. All nodes in the network broadcasts their packets over a common medium and in such scenario collisions are considered as instinctive attribute. Therefore, a proper method/regulation known as Medium Access Control (MAC) protocol is required to regulate and manage an efficient access to the common channel. The protocol is designed to allow radio nodes in wireless network to broadcast their packets in an orderly and efficient manner to eliminate the collision among them. It also provides a fair bandwidth sharing to all contending nodes in the network. To date, various MAC protocols was developed to regulate the communication access among all radio nodes in wireless network. This article presents an exhaustive survey of existing contention based MAC protocols, their operations, advantages and disadvantages. Other than that, a typical MAC protocol used in IEEE 802.11 wireless networks standard, such as Carrier Sense Multiple Access (CSMA) and Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) also explained and presented in this article.

A bridging VPN for connecting wireless sensor networks to data centers

Most wireless networks are specified as layer 2 (L2), or data link protocol. Recently, IoT and big data processing have promoted the use of wireless sensor networks to connect and send data to data center applications using the Internet. To do so, the implementation of an IP stack on the wireless node, or the gateway of the IP and wireless L2 network, has been proposed. Both approaches are developed to allow the application on the IP network to access L2 wireless network nodes. However, since wireless sensor networks do not require any network protocol, an IP is not essential for collecting data. Therefore, we propose a novel bridging VPN for connecting wireless networks, in which the application and wireless end nodes are not required to acknowledge an IP address or network protocol. In this way, the IP network merely serves to transport the data link frames of wireless networks. We believe that this is another style of IoT, and recommend a small IoT businesses and institutions for use of this VPN as a test bed before they start to implement an IP stack on their systems.

Deployment optimization for a long-distance wireless backhaul network in industrial cyber physical systems

Industrial wireless networks are an important component of industrial cyber physical systems, and their transmission performance directly determines the quality of the entire system. During deployment, the nodes of an industrial wireless network can be deployed in only some specific regions due to physical environment restrictions in the factory; thus, occlusions are not always effectively circumvented and network performance is reduced. Therefore, this article focuses on the layout problem of the industrial backhaul network: a WiFi long-distance, multi-hop network. The optimization objectives were network throughput and construction cost, and the network delay was used as a constraint. For small networks, we propose a hierarchical traversal method to obtain the optimal solution, whereas for a large network, we used a hierarchical heuristic method to obtain an approximate solution, and for extremely large networks, we used a parallel interactive local search algorithm based on dynamic programming. Then, if the original network layout cannot meet the transmission demands due to traffic bursts, we propose a network bandwidth recovery method based on the Steiner tree to recover the network’s performance. Finally, the results of a simulation showed that the algorithms proposed in this article obtain an effective solution and that the heuristic algorithm requires less computing time.

A current-reuse dual-channel bio-signal amplifier for WBAN nodes

This paper presents a dual-channel low-noise bio-signal amplifier for the low-power wireless body area network (WBAN) nodes. A dual-channel three-input current-reuse (DTCR) structure is proposed to optimize the noise performance of amplifier. The chopper-stabilized technique is employed to reduce 1/f noise and the offset voltage. Moreover, a high input impedance is achieved by using the pre-charge technique. In addition, a DC offset canceling loop is employed to suppress the electrode offset. The proposed amplifier is implemented in a standard 0.18 μm CMOS process with an active area of about 0.68 × 0.73 mm2. The experimental results demonstrate that an input referred noise of 1.12 μVrms has been achieved over a bandwidth from 0.35 Hz to 150 Hz. The total power consumption of each channel is about 1.44 μW at the supply voltage of 1.2 V. And the amplifier achieves an input impedance of about 200 MΩ, a CMRR of 111 dB at 50 Hz and a PSRR of 87.5 dB at 50 Hz.

MOCA: Multiobjective Cell Association for Device-to-Device Communications

It is widely accepted that device-to-device (D2D) communication is envisaged to become the key enabler of direct localized communication between mobile nodes in future wireless networks. However, little attention has been paid to an important aspect that can potentially affect both the performance of D2D and cellular transmissions, which is that of the D2D cell association. In this paper, a multiobjective cell association (MOCA) optimization framework for orchestrating a large number of D2D links in a multicell network is introduced. To this end, and without loss of generality, a differentiated Fractional Frequency Reuse (FFR) scheme is considered as the interference-limiting method, especially for cell-edge users, and we assume the provision of different resource pools for D2D and cellular users, which can vary according to their location. Under this assumption, we develop a set of integer linear programming optimization formulations for D2D links, part of which fall within the coverage area of different neighboring base stations. The main purpose is to achieve improved network traffic balancing via an efficient cell association scheme. Furthermore, we provide an iterative randomized resource allocation algorithm ( i-RRA ), which roots its logic on the differentiated FFR model in order to increase the overall network throughput. A wide set of numerical investigations demonstrate the benefits offered by MOCA, as well as the throughput gains that can be achieved through i-RRA , compared to existing solutions.

Adaptive MCFL: An adaptive multi-clustering algorithm using fuzzy logic in wireless sensor network

In the past, numerous algorithms were tasked with clustering nodes in wireless sensors networks. Each of these algorithms has its own advantages and disadvantages. The common denominator of all these approaches is the constancy of the algorithm in all the rounds of network lifetime that causes the selection of cluster heads in each round. Failing to select the best nodes as cluster heads leads to holding elections in each round. By comparing the chance of each node to be selected as a cluster head using a random number, the majority of these clustering approaches, both fuzzy and non-fuzzy, destroy the chance of selecting the most eligible node as cluster head. As a result, all these approaches require the selection of cluster heads in each round. Selecting cluster heads in each round increases the amount of received and sent messages such that in networks with large number of nodes, it causes some problems such as energy reduction, collision increase, and network traffic. However, by selecting the most eligible nodes as cluster heads and trusting them for at least a few rounds, the amount of sent and received messages is reduced. In this article, an adaptive multiclustering algorithm using fuzzy logic in wireless sensor network (Adaptive MCFL) is presented. In addition to clustering nodes in different rounds using different clustering algorithms, the proposed algorithm avoids selecting new cluster heads by trusting previous cluster heads leading to a reduction in the number of messages and saving energy. The proposed approach is compared with other approaches in three different scenarios using indices such as remaining energy, the number of dead nodes, first node dies (FND), half of nodes die (HND), and last node dies (LND). Results reveal that Adaptive MCFL has as advantage over other approaches.

A cloud-assisted handover optimization strategy for mobile nodes in industrial wireless networks

Connectivity restoration is an important aspect of the survivability strategies of wireless networks. In industrial wireless networks, especially with mobile nodes, connectivity restoration and maintenance directly determines the overall performance of the network. Handover strategies are research hotspots in this field. However, current common handover strategies have many disadvantages, such as frequent handover requests, latency and the lack of consideration of the network performance. These drawbacks are harmful to IoT (Internet of Things) networks. Although studies on wireless networks have proposed many solutions, the proposed schemes are not intended to meet the demands of industrial wireless applications, where real-time and stable performance are required. Therefore, this paper proposes a novel fixed-path mobile node handover strategy (CAFP), which is assisted by cloud services and an ants-colony algorithm. Our approach uses optimization for industrial wireless node handover sequences, execution and handover schemes in different cases. Compared to other traditional handover strategies, our simulation results show that the CAFP has advantages in terms of handover times, latency and the network's average payload. Additionally, this algorithm can decrease the processing capacity of mobile wireless nodes.

Enhanced domination set based routing in mobile ad hoc networks with reliable nodes

Mobile Ad hoc Network (MANET) is having a wide variety of applications, thanks to the flexibility in the architecture and current state of technology. MANET is a network of wireless nodes with no predefined fixed infrastructure or centralized administration. Nodes in the network are highly mobile and the topology change is dynamic. On account of the frequent movement of the nodes the topology is unpredictable, thereby disturbing the stable routing in MANET. In order to make the routing process efficient, this paper proposes to enhance the utilization of Domination nodes. The proposed method, Reliable Dominating set Based Routing (RDBR), selects the best Dominating set based on the packet delivery ratio (PDR) and the residual energy of the nodes, thereby ensuring the stability in routing. Simulation study demonstrates the efficiency of the RDBR algorithm in terms of PDR, packet drop, throughput, overhead and delay compared to other on demand routing algorithms AODV and DSR.