As an important part of industrial application (IA), the wireless sensor network (WSN) has been an active research area over the past few years. Due to the limited energy and communication ability of sensor nodes, it seems especially important to design a routing protocol for WSNs so that sensing data can be transmitted to the receiver effectively. An energy-balanced routing method based on forward-aware factor (FAF-EBRM) is proposed in this paper. In FAF-EBRM, the next-hop node is selected according to the awareness of link weight and forward energy density. Furthermore, a spontaneous reconstruction mechanism for local topology is designed additionally. In the experiments, FAF-EBRM is compared with LEACH and EEUC, experimental results show that FAF-EBRM outperforms LEACH and EEUC, which balances the energy consumption, prolongs the function lifetime and guarantees high QoS of WSN.

An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks

Network lifetime is a crucial performance metric to evaluate data-gathering wireless sensor networks (WSNs) where battery-powered sensor nodes periodically sense the environment and forward collected samples to a sink node. In this paper, we propose an analytic model to estimate the entire network lifetime from network initialization until it is completely disabled, and determine the boundary of energy hole in a data-gathering WSN. Specifically, we theoretically estimate the traffic load, energy consumption, and lifetime of sensor nodes during the entire network lifetime. Furthermore, we investigate the temporal and spatial evolution of energy hole and apply our analytical results to WSN routing in order to balance the energy consumption and improve the network lifetime. Extensive simulation results are provided to demonstrate the validity of the proposed analytic model in estimating the network lifetime and energy hole evolution process.

https://ece.uwaterloo.ca/~j27ren/lifetime.pdf

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks

In this paper, we propose a new constructing approach for a weighted topology of wireless sensor networks (WSNs) based on local-world theory for the Internet of Things (IOT). Based on local-world theory, an uneven clustering weighted evolving model of WSNs is designed. The definitions of edge weight and vertex strength take sensor energy, transmission distance, and flow into consideration. The vertex strengths drive the growth of topology; meanwhile, the edge weights change correspondingly. Experimental data demonstrate that the WSN topology we obtain has the property of weighted networks of the IOT: the edge weight, vertex degree, and strength follow a power-law distribution. Related IOT research work shows that weighted WSNs not only share the robustness and fault tolerance of weight-free networks, but also reduce the probability that successive node breakdowns occur; furthermore, they enhance the synchronization of WSNs.

A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the Internet of Things (IOT)

\nPurpose\nThis study aims to evaluate the direct trust value for each node and calculate the trust value of all nodes satisfying the condition and update the trust value and value each trust update interval for a secure and efficient communication between sender and destination node. Hence, a Trusted Secure Geographic Routing Protocol (TSGRP) has been proposed for detecting attackers (presence of the hacker), considering the trust value for a node produced by combining the location trusted information and the direct trusted information.\n\n\nDesign/methodology/approach\nAmelioration in the research studies related to mobile ad hoc networks (MANETs) and wireless sensor networks has shown greater concern in the presence of malicious nodes, due to which the delivery percentage in any given network can degrade to a larger extent, and hence make the network less reliable and more vulnerable to security.\n\n\nFindings\nTSGRP has outperformed the conventional protocols for detecting attacks in MANET. TSGRP is establishing a trust-based secure communication between the sender and destination node. The evaluated direct trust value is used after the transmission of route-request and route-reply packets, to evaluate the direct trust value of each node and a secure path is established between the sender and the destination node. The effectiveness of the proposed TSGRP is evaluated through NS-2 simulation.\n\n\nOriginality/value\nThe simulation results show the delay of the proposed method is 92% less than PRISM approach and the overhead of the proposed TSGRP approach is 61% less than PRISM approach.\n

Trusted Secure Geographic Routing Protocol: outsider attack detection in mobile ad hoc networks by adopting trusted secure geographic routing protocol

Maximizing network lifetime is a major objective for designing and deploying a wireless sensor network. Clustering sensor nodes is an effective topology control approach helping achieve this goal. In this paper, we present a new method to prolong the network lifetime based on the improved particle swarm optimization algorithm, which is an optimization method designed to select target nodes. The protocol takes into account both energy efficiency and transmission distance, and relay nodes are used to alleviate the excessive power consumption of the cluster heads. The proposed protocol results in better distributed sensors and a well-balanced clustering system enhancing the network’s lifetime. We compare the proposed protocol with comparative protocols by varying a number of parameters, e.g., the number of nodes, the network area size, and the position of the base station. Simulation results show that the proposed protocol performs well against other comparative protocols in various scenarios.

Clustering Hierarchy Protocol in Wireless Sensor Networks Using an Improved PSO Algorithm

In geographic routing, nodes need to maintain up-to-date positions of their immediate neighbors for making effective forwarding decisions. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes is a popular method used by most geographic routing protocols to maintain neighbor positions. We contend and demonstrate that periodic beaconing regardless of the node mobility and traffic patterns in the network is not attractive from both update cost and routing performance points of view. We propose the Adaptive Position Update (APU) strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. APU is based on two simple principles: 1) nodes whose movements are harder to predict update their positions more frequently (and vice versa), and (ii) nodes closer to forwarding paths update their positions more frequently (and vice versa). Our theoretical analysis, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that APU can significantly reduce the update cost and improve the routing performance in terms of packet delivery ratio and average end-to-end delay in comparison with periodic beaconing and other recently proposed updating schemes. The benefits of APU are further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.

/pdf/adaptive-position-update-for-geographic-routing-in-mobile-ad-1ay9v6ceau.pdf

Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks

The energy expended by sensor nodes in data communication makes up a significant quantum of their total energy consumption. Consequently, a mathematical model that can accurately predict the communication traffic load of a sensor node is critical for designing efficient sensor network protocols. In this paper, we present an analytical model for estimating the per-node traffic load in a multi-hop wireless sensor network. We consider a typical scenario wherein, the sensor nodes periodically sense the environment and forward the collected samples to a sink using greedy geographic routing. The analysis incorporates the idealistic circular coverage radio model as well as a realistic model, log-normal shadowing. Our results confirm that irrespective of the radio model, the traffic load generally increases as a function of the node's proximity to the sink. However, in the immediate vicinity of the sink, the two radio models yield quite contrasting results. The ideal radio model reveals the existence of a volcano region near the sink, where the traffic load drops significantly. On the contrary, with the log-normal shadowing model, the opposite effect is observed, wherein the traffic load actually increases at a much higher rate as one approaches the sink, resulting in the formation of a mountain peak. The results from our analysis are validated by extensive simulations.

Analysis of per-node traffic load in multi-hop wireless sensor networks

In 2003, Federal Communications Commission (FCC) has released a new spectrum policy called ``Interference Temperature model" to improve the channel access opportunities of secondary users. Under this model, the secondary users are allowed to access the licensed spectrum simultaneously with the primary users provided that the interference at the primary receiver meets a certain threshold. We refer the Cognitive Radio Networks that employs this model as ``Whisper CRNs" (since secondary users have to use smaller transmission power to satisfy the interference constraint). In this work, we systematically analyze the performance of whisper CRNs and compare it with the traditional CRNs, where the secondary users are not allowed to transmit when primary users are busy. We aim to answer the fundamental question: what is the performance trade-off by switching to whisper CRNs from traditional CRNs. Based on the performance analysis, we also propose an efficient channel assignment scheme that has a small channel switching overhead. The results show that whisper CRNs can improve the connectivity and end-to-end throughput of secondary users considerably (by more than two times in some scenarios) but at the cost of increasing end-to-end delay. We also show that the node density of secondary users has a significant impact on the performance of whisper CRNs.

/pdf/performance-of-multi-hop-whisper-cognitive-radio-networks-1ozdxobgzr.pdf

Quanjun Chen

Papers

Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks

Analysis of per-node traffic load in multi-hop wireless sensor networks

Performance of Multi-Hop Whisper Cognitive Radio Networks

Analysis of Per-Node Traffi cL oad in Multi-Hop Wireless Sensor Networks