Multi-hop Wireless Sensor Networks Research Articles

Cluster Head Election for Energy and Delay Constraint Applications of Wireless Sensor Network

Designing of a multi-hop Wireless Sensor Network (WSN) depends upon the requirements of the underlying sensing application. The main objective of WSNs is to monitor physical phenomenon of interest in a given region of interest using sensors and provide collected data to sink. The WSN is made of a large number of energy, communication, and computational constraint nodes, to overcome energy constrains, replacing or recharging the batteries of the WSN nodes is an impossible task, once they are deployed in a hostile environment. Therefore, to keep the network alive as long as possible, communication between the WSN nodes must be done with load balancing. Time critical applications like forest fire detection, battle field monitoring demands reception of data by the sink with the bounded delay to avoid disasters. Hence, there is a need to design a protocol which enhances the network lifetime and provides information to the sink with a bounded delay. This paper will address this problem and solution. In this paper, a routing algorithm is proposed by introducing Energy Delay Index for Trade-off (EDIT) to optimize both objectives-energy and delay. The EDIT is used to select cluster heads and “next hop” by considering energy and/or delay requirements of a given application. Proposed approach is derived using two different aspects of distances between a node and the sink named Euclidean distance and Hop-count, and further prove using realistic parameters of radio to get data closest to the test bed implementation. The results aspire to give sufficient insights to others before doing test bed implementation.

Distributed Optimal Lexicographic Max-Min Rate Allocation in Solar-Powered Wireless Sensor Networks

Understanding the optimal usage of fluctuating renewable energy in wireless sensor networks (WSNs) is complex. Lexicographic max-min (LM) rate allocation is a good solution but is nontrivial for multihop WSNs, as both fairness and sensing rates have to be optimized through the exploration of all possible forwarding routes in the network. All current optimal approaches to this problem are centralized and offline, suffering from low scalability and large computational complexity—typically solving O(N2) linear programming problems forN-node WSNs. This article presents the first optimal distributed solution to this problem with much lower complexity. We apply it to solar-powered wireless sensor networks (SP-WSNs) to achieve both LM optimality and sustainable operation. Based on realistic models of both time-varying solar power and photovoltaic-battery hardware, we propose an optimization framework that integrates a local power management algorithm with a global distributed LM rate allocation scheme. The optimality, convergence, and efficiency of our approaches are formally proven. We also evaluate our algorithms via experiments on both solar-powered MICAz motes and extensive simulations using real solar energy data and practical power parameter settings. The results verify our theoretical analysis and demonstrate how our approach outperforms both the state-of-the-art centralized optimal and distributed heuristic solutions.

A multi-hop heterogeneous cluster-based optimization algorithm for wireless sensor networks

With the growth of different design goals and application requirements, wireless sensor networks (WSNs) have been increasingly popular for a wide variety of purposes, e.g., image formation of a target field, intrusion detection, surveillance and environmental monitoring. In this paper, a multi-hop heterogeneous cluster-based optimization algorithm (MHCOA) for WSNs is proposed. The motivation to MHCOA for WSNs is that several higher energy sensor nodes act as cluster heads, which are deployed artificially, while some low energy sensor nodes act as cluster members, which are deployed randomly. In order to realize monitoring task, we complete three major works in this paper. First, MHCOA calculates the number of cluster heads and communication radius of low energy sensor nodes; Second, it finishes monitoring task through data packets transmission with higher energy nodes acting as cluster heads in the form of multi-hop heterogeneous WSNs; Finally, simulation results show that compared to its peers in heterogeneous WSNs, MHCOA reduces the number of cluster heads, which saves the network average energy by up to 16.7 % and extends the network life by up to 38 %, while with less end-to-end delay.

An Extension of MAC Protocol for Mobility Detection and Efficient Data Transmission

This paper introduces an extension of MAC protocol for mobility detection of nodes and efficient data transmission in mobile, multihop wireless sensor network. Here for mobility detection, receiving power of the node is consider by the transmitting node. If gradual degradation in communication link does due to degradation in receiving power, it initiates the switchover of link via the relay node for efficient data transmission. Our present implementation is done by extending the energy efficient IEEE 802.11 MAC protocol because most commonly used standard is IEEE 802.11 in sensor networks consist of small, inexpensive, resource constrained devices that communicate wirelessly in a multihop network. Here the paper shows the performance of extended MAC protocol in terms of average throughput, packet loss and average delay by varied the parameters like mobility of node and size of the packet. General Terms Mobility, Switchover, MAC protocol, Wireless sensor network

OSC-MAC: Duty Cycle with Multi Helpers CT Mode WI-LEM Technology in Wireless Sensor Networks

Recently, Wireless Sensor Networks (WSNs) grow to be one of the dominant technology trends; new needs are continuously emerging and demanding more complex constraints in a duty cycle, such as extend the life time communication . The MAC layer plays a crucial role in these networks; it controls the communication module and manages the medium sharing. In this work we use OSC-MAC tackles combining with the performance of cooperative transmission (CT) in multi-hop WSN and the Wi-Lem technology

Channel Aware Target Localization in Multi-hop Wireless Sensor Networks

摘要: 针对资源有限、存在信道退化的无线传感器网络(Wireless sensor network, WSN),基于最大似然估计(Maximum-likelihood estimation, MLE)提出一种信道感知的目标定位方法. 把传感器观测数据量化为M位二进制序列,经过衰落信道多跳中继到达融合中心. 中继节点采用二元解码-前向中继策略,中继输出是被信道污染的中继信号的估计值. 在Rayleigh信道衰落和高斯信道噪声假设下,结合无线信道衰落的统计知识和解码策略, 推导了观测数据的似然函数,得到目标位置的最大似然估计. 此外,还推导了估计器性能的后验克拉美-罗下界(Cramr-Rao lower bounds, CRLB). 仿真结果表明,信道感知的方法能够减缓由于信道衰落和噪声所带来的定位性能的退化. 关键词: 目标定位 / 无线传感器网络 / 信道感知 / 克拉美-罗下界 / 量化

Data Compression of Structural Seismic Responses via Principled Independent Component Analysis

This paper proposes a novel lossy data compression scheme for structural seismic responses based on principled (truncated) independent component analysis (PICA). It is first shown that independent component analysis (ICA) is able to transform a multivariate data set into a sparse representation space where is optimal for coding and compression, such that both the intradependencies and interdependencies (i.e., redundant information) between the multichannel data are removed for efficient data compression. Two examples are presented to demonstrate the compression performance of PICA, using the real-measured structural seismic responses from the 1994 Northridge earthquake, of the Fire Command Control (FCC) building and the USC hospital building, respectively. It is compared with the popular wavelet transform coding technique, which is only able to handle single-channel data separately. Results show that PICA achieves dramatically higher compression ratio (CR) than the wavelet method while retaining excellent reconstruction accuracy. It is also shown that PICA slightly outperforms the (principled) principal component analysis (PCA) method—which used to be considered optimal multivariate data compression scheme—with respect to both CR and reconstruction accuracy. Equipped with the FastICA algorithm that enjoys a cubic convergence rate, PICA has potential for rapid and reliable data transfer, communication (e.g., multihop wireless sensor network), storage, and retrieval in online or post-disaster (e.g., earthquake) monitoring and assessment applications of civil infrastructures.

DiBA: Distributed Bottleneck Alleviation Scheme in Wireless Multi-Hop Sensor Networks

Wireless multi-hop sensor networks consist of a wired backbone network, gateway nodes and wireless sensor nodes. To resolve the bottleneck problems in the neighborhood of the gateway node, we propose an effective carrier sensing multiple access algorithm based on a distributed bottleneck alleviation (DiBA) scheme. Using the concept of a relay token, we utilize a linear distribution as the probability density functions for the selection of backoff counter value, rather than using a uniform distribution. From simulation results, we show that system throughput and user fairness are remarkably improved in random topology compared with conventional schemes.

멀티 홉 무선 센서 네트워크에서 저 지연을 지원하는 MAC 프로토콜

무선 센서 네트워크에서 MAC 프로토콜은 에너지 소모의 감소, QoS 지원, 공평성 지원, 그리고 전송 지연의 감소 등과 같은 많은 해결해야 할 문제들을 가진다. 본 논문에서는 멀티 홉 무선 센서 네트워크에서 저 지연을 지원하는 MAC 프로토콜을 제안한다. 본 논문에서 제안하고 있는 LD-MAC 프로토콜은 전송 지연을 줄이기 위해 RB(rapid beacon) 프레임을 사용한다. RB 프레임은 IEEE 802.15.4의 비콘 프레임의 수정된 형태이다. 송신 노드의 적응적 wakeup을 위해 RB 프레임에는 수신 노드의 wakeup과 관계된 seed 수를 포함한다. 또한 다음 홉 수신 노드의 적응적 wakeup을 위해 RB 프레임에는 남은 데이터 패킷 길이 정보를 포함한다. LD-MAC 프로토콜은 기존에 제안된 다른 프로토콜에 비해 데이터 패킷 전송 지연에서 더 좋은 성능을 보였다. In Wireless Sensor Networks the Medium access control (MAC) protocol has many challenges to solve such as reducing energy consumption, supporting QoS(quality of service) fairness, and reducing delivery delay. This paper proposed a low-delay supporting MAC protocol in multi-hop Wireless Sensor Networks. The proposed protocol uses the RB(rapid beacon) frame for reducing delivery delay. The RB frame is a modified IEEE 802.15.4 beacon frame. For sender adaptive-wakeup, the RB frame includes a seed number for determining of a receiver wakeup time. And for next hop receiver adaptive-wakeup, the RB frame includes the length of remaining data packet information. Results showed that our LD-MAC protocol outperformed other protocol in terms of data packet delivery delay.

A stochastic process model of the hop count distribution in wireless sensor networks

We consider target localization in randomly deployed multi-hop wireless sensor networks, where messages originating from a sensor node are broadcast by flooding and the node-to-node message delays are characterized by independent, exponential random variables. Using asymptotic results from first-passage percolation theory and a maximum entropy argument, we formulate a stochastic jump process to approximate the hop count of a message at distance r from the source node. The resulting marginal distribution of the process has the form of a translated Poisson distribution which characterizes observations reasonably well and whose parameters can be learnt, for example by maximum likelihood estimation. This result is important in Bayesian target localization, where mobile or stationary sinks of known position use the hop count conditioned on the Euclidean distance, to estimate the position of a sensor node or event within the network, based solely on observations of the hop count. For the target localization problem, simulation results show that the proposed model provides reasonably good performance, especially for densely connected networks.

A self-adaptive fault-tolerant systems for a dependable Wireless Sensor Networks

As the size and complexity of Wireless Sensor Networks (WSN) continue to grow, there is a need to develop techniques capable of achieving a level of service with successful operations upon which users can depend on. The routing protocol plays an important role in a multihop WSN as it manages and controls the delivery of the data packets. The function of a WSN can be affected by radio anomalies that may degrade the performance of the network. Unreliable and irregular link qualities, due to interference, are common in WSN as the nodes use the same frequency range as the other radio devices. A self-adaptive fault-tolerant network is required that has ability to maintain the level of service even in the presence of faults. Each node needs to monitor and adapt its routing protocols according to the operating environment. Due to resources constraint in the node, it must be carried out in an energy-efficient way and must be dependable. In this paper, we propose an immune-inspired algorithm that provides a level of "self-healing" in the network, through a combined process of self-detection, self-diagnosis and self-recovery and the Immune-inspired Detection and Recovery Systems (IDRS) is presented. In order to evaluate the performance of IDRS, a trace-based simulation, using traces from the hardware, is proposed to analyse the robustness and scalability. The Systematic Protocol Evaluation Technique (SPET) is applied to measure the dependability of the routing protocol. The proposed solution immune-inspired solution using multi-modal mechanism has achieved a higher dependability than existing reactive routing approaches and can adapt to the current operating environment to achieve the level of service required. Both the hardware and simulation results have validated the accuracy and the performance of the proposed systems. The simulated results have demonstrated that the IDRS can be scaled to a larger networks.

Design and Implementation of AIRF: A Anycast-Based Integrated Routing Framework for WSNs

In wireless sensor networks (WSNs), asynchronous sleep wake scheduling protocols can significantly reduce energy consumption without incurring the communication overhead. However, the savings could come at a significant cost in delay performance. In this paper, we consider anycast-based integrated routing framework (AIRF) to reduce the cost in delay performance of communications in multihop WSNs. Without tight time synchronization or known geographic information, AIRF provides low-delay cost route. We implement a low-overhead AIRF module in TinyOS kernel by modifying BLIP protocol stack, i.e., the Berkeley Low-power IP stack; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. We describe in detail the format of AIRF message, the dynamic updating process of mapping record information, and anycast data flow under TinyOS. And then, we present the anycast group management system. Finally, we analyze the application performance of AIRF in balancing network load, network lifetime, and delay performance.

Estimation of hop count in multi-hop wireless sensor networks with arbitrary node density

In multi-hop wireless sensor networks, the number of hops between the source and the destination has a significant impact on network performance and has been extensively identified in the literature. However, the methods most commonly used significantly underestimate the number of hops for sparse networks. The impact of node density is significant, and this factor is not adequately addressed. In effect, many schemes to calculate hop count imply geographic routing, even if they intend to consider the shortest path routes. Therefore, we propose a new technique for estimating hop count. We consider the hop progress when the network nodes are uniformly deployed and the shortest path between the source and the destination is selected. We determine a distribution of the remaining distance to destination. In order to correctly capture the situation for a sparse network, we examine the selection of the next neighbour node as a relaying node for the next hop. The analytical model is verified by simulation.

BHAR: a bidirectional hierarchy-based anycast routing protocol for wireless sensor networks

This paper presents a bidirectional hierarchy-based anycast routing (BHAR) protocol to facilitate data collection in multi-hop wireless sensor networks (WSNs). In contrast to existing HAR mechanisms (Thepvilojanapong et al., 2005), the proposed BHAR is able to prolong network lifetime as it constructs hierarchical trees and repairs routes faster. BHAR is unique in letting sinks and sources initialise the construction of a hierarchical tree. Whenever a node knows its own parent and neighbour nodes, it can join a tree, exchange/refresh the routing table, and perform route repair without the aid of geographical information or being controlled remotely. As simulation results have demonstrated, such a design makes BHAR a faster and better protocol in constructing trees and repairing routes than HAR.

Realistic Analysis of Energy Efficiency in Multihop Wireless Sensor Networks

Realistic Analysis of Energy Efficiency in Multihop Wireless Sensor Networks

New route discovery design for routing misbehaviour prevention in multi-hop wireless sensor networks

This paper proposes a new secure route discovery protocol design for multi-hop wireless sensor networks (WSNs). It mainly prevents hidden channel and worm hole attacks. These two attacks are the main causes for non-plausible route setups. So far, no one has attempted to address the hidden channel attack in WSNs. Here, we use authentic neighbourhood and common authentic neighbours to prevent hidden channel and worm hole attacks. The requirement for the use of bandwidth is optimised through limited broadcasting design of the route discovery process. The correctness of the proposed protocol has been tested by AVISPA model checker. Simulation results of the proposed routing design ensures the effectiveness of the approach.

Compressed Sensing Based Protocol for Interfering Data Recovery in Multi-Hop Sensor Networks

We consider a multi-hop wireless sensor network that measures sparse events and propose a novel protocol based on Compressed Sensing (CS) as an alternative to traditional Media Access Control (MAC) scheduling and routing protocol. Instead of avoiding collisions, our CS-based protocol exploits interferences by superimposing the data measurements over-the-air, simultaneously received at any node. Thanks to our protocol design, each node is able to recover and forward only new data towards the sink. Our protocol achieves near zero reconstruction errors at the sink, while greatly reducing overhead and delays compared to conventional methods. These results reveal a new and promising approach to protocol design through CS.

Finding the Best Sink Location in WSNs with Reliability Route Analysis

Wireless Sensor Network (WSN) became one of the emerged networks that are used in many critical applications. One of the challenges of the network is the energy source of its sensors since sensors depends, in most of the cases, on a double AA batteries and they are supposed to live for long time. One of the important methods to save sensors energy is to reduce the messages flow transferred to the sink node in a multi-hop wireless sensor networks. To do so, this paper investigates the best location to the sink node to maximize the reliability of a message delivery before it is being received and processed by a sink. The paper introduces the optimal location solution through utilizing the Mixed Integer Linear Programming (MILP) solution to the problem in small- scale WSNs. Consequently, maximum reliability of a path may lead to the minimum energy consumed for retransmission along the routing path. However, in large-scale networks, the paper introduces the Genetic Algorithm (GA) as one of the heuristics solution. The Fitness function of the GA calculates the negative value of the log of the reliability of a path and the GA tries to find the sink position with the minimum fitness value to minimize the energy spent by each sensor in the routing towards the sink. An extensive set of experiments are introduced and the MILP solution results are compared to GA approach for the GA performance measure. The comparison showed that the GA have found near optimal solution in reasonable time. In addition, GA is utilized in large-scale problems as well.

A New Cooperative MIMO Scheme Based on SM for Energy-Efficiency Improvement in Wireless Sensor Network

Improving the energy efficiency in wireless sensor networks (WSN) has attracted considerable attention nowadays. The multiple-input multiple-output (MIMO) technique has been proved as a good candidate for improving the energy efficiency, but it may not be feasible in WSN which is due to the size limitation of the sensor node. As a solution, the cooperative multiple-input multiple-output (CMIMO) technique overcomes this constraint and shows a dramatically good performance. In this paper, a new CMIMO scheme based on the spatial modulation (SM) technique named CMIMO-SM is proposed for energy-efficiency improvement. We first establish the system model of CMIMO-SM. Based on this model, the transmission approach is introduced graphically. In order to evaluate the performance of the proposed scheme, a detailed analysis in terms of energy consumption per bit of the proposed scheme compared with the conventional CMIMO is presented. Later, under the guide of this new scheme we extend our proposed CMIMO-SM to a multihop clustered WSN for further achieving energy efficiency by finding an optimal hop-length. Equidistant hop as the traditional scheme will be compared in this paper. Results from the simulations and numerical experiments indicate that by the use of the proposed scheme, significant savings in terms of total energy consumption can be achieved. Combining the proposed scheme with monitoring sensor node will provide a good performance in arbitrary deployed WSN such as forest fire detection system.

Scheduling multi-channel and multi-timeslot in time constrained wireless sensor networks via simulated annealing and particle swarm optimization

Timely communication in wireless multihop sensor networks requires high throughput and low delay, which can be achieved by exploiting multiple channels and time slots. Efficient scheduling becomes indispensable if multiple channels and time slots are utilized. Optimum scheduling of multiple channels and time slots in multihop networks is an NP-complete problem. We apply metaheuristic approaches to solve the scheduling problem because of the fact that not only the global solution but near-optimal solutions can satisfy a given end-to-end delay bound. We adopt simulated annealing (SA) and particle swarm optimization (PSO) to schedule the resources. Different measures and stopping conditions are explored to validate the feasibility of scheduling via SA and PSO, and to compare the performance of the two metaheuristics in satisfying the desired end-to-end delay. Although the purpose of this article is to compare SA and PSO, the simulation results demonstrate that PSO-based scheduling outperforms SA-based scheduling in terms of end-to-end delay.