Throughput In Wireless Sensor Networks Research Articles

CMIP: Clone Mobile-Agent Itinerary Planning Approach for Enhancing Event-to-Sink Throughput in Wireless Sensor Networks

In order to mitigate the problem of data congestion, increased latency, and high energy consumption in Wireless Sensor Networks (WSNs), Mobile Agent (MA) has been proven to be a viable alternative to the traditional client-server data gathering model. MA has the ability to migrate among network nodes based on an assigned itinerary, which can be formed via Single Itinerary Planning (SIP) or Multiple Itinerary Planning (MIP). MIP-based data gathering approach solves problems associated with SIP in terms of task duration, energy consumption, and reliability. However, the majority of existing MIP approaches focus only on reducing energy consumption and task duration, while the Event-to-sink throughput has not been considered. In this paper, a Clone Mobile-agent Itinerary Planning approach (CMIP) is proposed to reduce task duration while improving the Event-to-sink throughput in real-time applications, especially when the MA is assigned to visit a large number of source nodes. Simulation results show that the CMIP approach outperforms both Central Location-based MIP (CL-MIP) and Greatest Information in Greatest Memory-based MIP (GIGM-MIP) in terms of reducing task duration by about 56% and 16%, respectively. Furthermore, CMIP improves the Event-to-sink throughput by about 93% and 22% as compared to both CL-MIP and GIGM-MIP approaches, respectively.

Energy aware efficient cryptographic approach for securing data in WSN

Wireless Sensor Networks (WSNs) are being used globally in many areas. As the purpose of the WSN is raising at the similar rate the safety intimidation are also rising. Nodes in a WSN are vulnerable to different attacks mainly due to their unguarded communication and nature of exploitation. Therefore, the most important in such networks is to providing security. A vigorous security solution for the networks must also make possible node confirmation. But occasionally it would be an energy utilizing process. So, we require an energy efficient and safe mechanism to protected the entire network. Thus this paper, Energy Aware efficient Cryptographic Approach (EACA) for securing data in WSN is proposed. In this scheme, the dynamic mode and sleep mode of sensor to save the energy consumption in WSN. The sender side and receiver side algorithm provide the data security. Our simulation results demonstrate that improved the residual energy and throughput in WSN.

An approximate bandwidth allocation algorithm for tradeoff between fairness and throughput in WSN

In this paper, we investigate the problem of bandwidth allocation in wireless sensor network (WSN) under signal to noise plus interference ratio interference model, which aims at finding a tradeoff between fairness and network throughput. Specifically, we propose an approximate algorithm to solve this problem since it has been proved to be NP-hard. Different from similar algorithms proposed in previous issues, we maximize two utility functions, which are the newly defined bandwidth utility function for fairness and network throughput, by jointly considering sensor nodes association and resource allocation in WSN. In addition, we formulate a new utility function with respect to bandwidth allocation, with the method of weighted sum of two objectives as one objective function, which will find a tradeoff between fairness and throughput. Consequently, the problem is decomposed into two sub-problems and solved in two stages, which are cluster formation stage and scheduling stage. In the first stage, we let sensor nodes join to cluster head nodes, which can determine the association of sensor nodes; in the second stage, the total utility function is maximized by allocating time slots for tradeoff between fairness and throughput. Finally, simulation results demonstrate that our algorithm can achieve better performance than compared algorithms.

REBTAM: reliable energy balance traffic aware data reporting algorithm for object tracking in multi-sink wireless sensor networks

Recently, Multi-sink Wireless Sensor Networks (WSNs) have received more and more attention due to their significant advantages over the single sink WSNs such as improving network throughput, balancing energy consumption, and prolonging network lifetime. Object tracking is regarded as one of the key applications of WSNs due to its wide real-life applications such as wildlife animal monitoring and military area intrusion detection. However, many object tracking researches usually focus on how to track the location of objects accurately, while few researches focus on data reporting. In this work, we propose an efficient data reporting method for object tracking in multi-sink WSNs. Due to the limited energy resource of sensor nodes, it seems especially important to design an energy efficient data reporting algorithm for object tracking in WSNs. Moreover, the reliable data transmission is an essential aspect that should be considered when designing a WSN for object tracking application, where the loss of data packets will affect the accuracy of the tracking and location estimation of a mobile object. In addition, congestion in WSNs has negative impact on the performance, namely, decreased throughput, increased per-packet energy consumption and delay, thus congestion control is an important issue in WSNs. Consequentially, this paper aims to achieve both minimum energy consumption in reporting operation and balanced energy consumption among sensor nodes for WSN lifetime extension. Furthermore, data reliability is considered in our model where the sensed data can reach the sink node in a more reliable way. Finally, this paper presents a solution that sufficiently exerts the underloaded nodes to alleviate congestion and improve the overall throughput in WSNs. This work first formulates the problem as 0/1 Integer Linear Programming problem, and proposes a Reliable Energy Balance Traffic Aware greedy Algorithm in multi-sink WSNs (REBTAM) to solve the optimization problem. Through simulation, the performance of the proposed approach is evaluated and analyzed compared with the previous work which is related to our topic such as DTAR, NBPR, and MSDDGR protocols.

Design of Hierarchical Trust based Efficient Cluster Head Selection in WSN (HTECH)

Objectives: Due to restricted computational power and energy resources, aggregation of data from multiple Sensor Nodes (SNs) secure routing is a significant problem because of highly susceptible in WSNs (Wireless Sensor Networks). Hence ascertaining trustworthiness of data is vital for WSNs. Group-based Trust Management Scheme (GTMS) introduced the trust that depends on direct and indirect monitoring. However, it consumes more energy to communicate the data transmission in WSNs. The main objective of this paper is to transmit the data through the trust node and secure data transmission in WSNs. Methods: The cluster head plays an important role in the cluster-based network. In this paper, we propose Design of Hierarchical Trust based Efficient Cluster Head Selection in WSN (HTECH) which demonstrates the Cluster Head (CH) selection process based on Trust based routing in WSN. This trust is evaluated based on node cooperativeness, Unselfishness, honest and data transmission rate. Findings: The trust evaluation is used to avoid the malicious and selfish node present in the routing path. Thus, this method provides a realistic and secure approach to choose a shortest path in all trusted path. The simulation results shows that the HTECH scheme reduce both packet loss rate, delay, and improve the throughput in WSNs. Improvements: The HTECH trust routing remove the untrustworthy nodes in order to obtain a reliable passage delivery route also reduce the energy consumption when compared to the existing method.

A Novel Approach to Enhance TCP Throughput in Wireless Sensor Networks

Wireless sensor network add a new wireless structure have been designed to improve the performance of the new communications. Performance of wireless sensor network has a vital dependency to the transport protocols. TCP is a connection oriented and reliable protocol of transport protocol which is developed for wired networks because of some unique characteristics of wireless sensor network like poor resources, poor channel bandwidth and noisy channels and node mobility, performance of TCP is degraded. In this paper a simulation based performance analysis is presented in the term of TCP throughput. The throughput decay of TCP are evaluated in wireless sensor networks and discuss a bout problem that cause this degradation. On the other hand TCP wrongly assumes congestion is the main reason of each packet lost, while packet lost may happen because of wireless sensor networks limitations that is mentioned above. The propose model modify TCP congestion detection module to distinguish between congestion and non congestion situation. It evaluated by simulated results and throughput enhancement verified by NS2.

A novel joint spatial-code clustered interference alignment scheme for large-scale wireless sensor networks.

Interference alignment (IA) has been put forward as a promising technique which can mitigate interference and effectively increase the throughput of wireless sensor networks (WSNs). However, the number of users is strictly restricted by the IA feasibility condition, and the interference leakage will become so strong that the quality of service will degrade significantly when there are more users than that IA can support. In this paper, a novel joint spatial-code clustered (JSCC)-IA scheme is proposed to solve this problem. In the proposed scheme, the users are clustered into several groups so that feasible IA can be achieved within each group. In addition, each group is assigned a pseudo noise (PN) code in order to suppress the inter-group interference via the code dimension. The analytical bit error rate (BER) expressions of the proposed JSCC-IA scheme are formulated for the systems with identical and different propagation delays, respectively. To further improve the performance of the JSCC-IA scheme in asymmetric networks, a random grouping selection (RGS) algorithm is developed to search for better grouping combinations. Numerical results demonstrate that the proposed JSCC-IA scheme is capable of accommodating many more users to communicate simultaneously in the same frequency band with better performance.

Heuristic Approach to Select Opportunistic Routing Forwarders (HASORF) to Enhance Throughput for Wireless Sensor Networks

Biological schemes provide useful resources for designing adaptive routing protocols for wireless sensor networks (WSNs). The key idea behind using bioinspired routing is to find the optimal path to the destination. Similarly, the idea of opportunistic routing (OR) is to find the least number of hops to deliver the data to the destination. Numerous routing schemes have been proposed in WSNs while targeting various performance goals, such as throughput, delay, and link quality. Recently, OR schemes have come onto the scene in comparison with the traditional routing algorithms. The performance of OR schemes, however, highly depends on the selection of forwarder nodes. In this paper, we consider a chain network topology, where nodes are separated by an equal distance. The throughput of the chain network is analyzed mathematically, and based on the analysis results, a heuristic algorithm is proposed to choose the forwarder nodes. We evaluate the performance of the proposed Heuristic Approach to Select Opportunistic Routing Forwarders (HASORF) by using the ns-2 simulator and compare it with previous schemes, such as random routing, Extremely Opportunistic Routing (ExOR), and Simple Opportunistic Adaptive Routing (SOAR). The empirical results show that our proposed scheme achieves the best performance among them.

A QoS-aware Routing for Multi-Services in Wireless Sensor Networks

In this paper we propose a new routing algorithm for emergency bound based on multiple services for wireless sensor networks. In this routing algorithm channel conditions are associated with each time unit to provide overall fairness and maximize the total throughput of wireless sensor network. The proposed system model supports multiple users of each sensor, each user may have several service demands, every demand has different characteristics such as emergency bound, etc. How to guarantee the fairness for each user and the emergency bound for each service in wireless sensor network is the problem to be solved. In addition, we investigate the channel condition for each user and provide the maximum throughput for the single channel of each time unit.

A Multicast Algorithm for Wireless Sensor Networks Based on Network Coding

We propose a set of distributed algorithms for improving the multicast throughput in wireless sensor networks. To this end, network coding is applied when exploiting path diversity with two disjoint paths to each multicast group receiver. We depart from the traditional wisdom that the multicast topology from source to receivers needs to be a tree and propose a novel and distributed algorithm to construct a 2-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which network coding is applied. We conduct both analytical and simulation-based studies to evaluate the effectiveness and performance of our algorithm.

Clustering Algorithm of Wireless Sensor Networks Based on Residual Energy

In order to improve the lifetime and throughput of wireless sensor networks under the limited power, an improved clustering algorithm is proposed in this paper on the basis of LEACH protocol. The energy factor is considered in this algorithm. The residual energy of all sensor nodes is referred to select cluster-heads of wireless sensor networks. The new clustering algorithm effectively improves the energy efficiency, throughput and lifetime of wireless sensor networks. The results are proved by simulations.

2A1-O10 センサノード故障時の通信品質維持を目的としたロボット無線センサネットワーク構築手法の提案(サーチ&レスキューロボット・メカトロニクス(1))

The authors have been developing an information-gathering system using mobile robots and WSNs (Wireless Sensor Networks) in underground spaces in post-disaster environments. In our system, mobile robots carry wireless sensor nodes (SN) and deploy them into the environment. This paper describes a design of algorizhm for WSN construction using mobile robots to improve fault tolerance of SNs. SNs are deployed to ensure communication performance of throughput for teleoperation of rescue robot via WSN in underground spaces. If some SNs are in failure, communication path is reconstructed to maintain end-to-end throughput of WSN. Experimental results using a proposed method are presented.

Traffic-Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks

The congestion problem in Wireless Sensor Networks (WSNs) is quite different from that in traditional networks. Most current congestion control algorithms try to alleviate the congestion by reducing the rate at which the source nodes inject packets into the network. However, this traffic control scheme always decreases the throughput so as to violate fidelity level required by the applications. In this paper, we present a solution that sufficiently exerts the idle or underloaded nodes to alleviate congestion and improve the overall throughput in WSNs. To achieve this goal, a traffic-aware dynamic routing (TADR) algorithm is proposed to route packets around the congestion areas and scatter the excessive packets along multiple paths consisting of idle and underloaded nodes. Utilizing the concept of potential in classical physics, our TADR algorithm is designed through constructing a hybrid virtual potential field using depth and normalized queue length to force the packets to steer clear of obstacles created by congestion and eventually move toward the sink. The simulation results show that the proposed solution improves the overall throughput by around 370 percent as compared to MintRoute, which is one of benchmark routing protocols. Furthermore, TADR scheme has low overhead suitable for large-scale, dense sensor networks.

Multi-Channel Distributed Coordinated Function over Single Radio in Wireless Sensor Networks

Multi-channel assignments are becoming the solution of choice to improve performance in single radio for wireless networks. Multi-channel allows wireless networks to assign different channels to different nodes in real-time transmission. In this paper, we propose a new approach, Multi-channel Distributed Coordinated Function (MC-DCF) which takes advantage of multi-channel assignment. The backoff algorithm of the IEEE 802.11 distributed coordination function (DCF) was modified to invoke channel switching, based on threshold criteria in order to improve the overall throughput for wireless sensor networks (WSNs) over 802.11 networks. We presented simulation experiments in order to investigate the characteristics of multi-channel communication in wireless sensor networks using an NS2 platform. Nodes only use a single radio and perform channel switching only after specified threshold is reached. Single radio can only work on one channel at any given time. All nodes initiate constant bit rate streams towards the receiving nodes. In this work, we studied the impact of non-overlapping channels in the 2.4 frequency band on: constant bit rate (CBR) streams, node density, source nodes sending data directly to sink and signal strength by varying distances between the sensor nodes and operating frequencies of the radios with different data rates. We showed that multi-channel enhancement using our proposed algorithm provides significant improvement in terms of throughput, packet delivery ratio and delay. This technique can be considered for WSNs future use in 802.11 networks especially when the IEEE 802.11n becomes popular thereby may prevent the 802.15.4 network from operating effectively in the 2.4 GHz frequency band.

An Application-Oriented Network Model for Wireless Sensor Networks

Wireless sensor networks (WSNs) are energy-constrained networks. The residual energy real-time monitoring (RERM) is very important for WSNs. Moreover, network model is an important foundation of RERM research at personal area network (PAN) level. Because RERM is inherently application-oriented, the network model adopted should also be application-oriented. However, many factors of WSNs applications such as link selected probability and ACK mechanism etc. were neglected by current network models. These factors can introduce obvious influence on throughput of WSNs. Then the energy consumption of nodes will be influenced greatly. So these models cannot characterize many real properties of WSNs, and the result of RERM is not consistent with the real-world situation. In this study, these factors neglected by other researchers are taken into account. Furthermore, an application-oriented general network model (AGNM) for RERM is proposed. Based on the AGNM, the dynamic characteristics of WSNs are simulated. The experimental results show that AGNM can approximately characterize the real situation of WSNs. Therefore, the AGNM provides a good foundation for RERM research.

The novel communication algorithm and the throughput analysis for wireless sensor networks

Aiming at the significance of the energy controls of wireless sensor networks, an economical energy consumption algorithm for wireless communicating in Wireless Sensor Networks (WSN) is presented. Based on the algorithm, the maximal system throughput of WSN is analyzed, and the upper bound of throughput of WSN is proposed and proved. Some numerical simulations are conducted and analyzed. The conclusions include that the transmitting radius of sensor node and the parameters of the energy cost function have significant influence upon the throughput, but the monitoring region radius has little influence. For the same transmitting distance, the more the hopping of information transmitting, the better the throughput of WSN. On the other hand, for the energy optimization of the whole WSN, the trade-off problem between the throughput capacity and the relay nodes is proposed, and the specific expression of relay hops that minimized the energy consumptions and the maximal throughput of WSN under the specific situation is derived.