EDR: efficient data routing in wireless sensor networks

Wireless sensor networks are generally composed of densely deployed sensor nodes that collaboratively sense, compute and communicate the sensed information. Routing in sensor networks is based on energy optimisation and quality of service. In this paper, a meta-heuristic technique comprising particle swarm optimisation and Tabu search (TS) is used for energy efficient routing in sensor network. The hybrid approach has better network performance compared with the traditional approaches, simple particle swarm algorithm and TS, respectively. Experimental results penlight the efficacy of the proposed approach.

This paper proposes a clustering technique, called ELECT, to provide an energy efficient and reliable routing in wireless sensor networks. The ELECT considers node status and link condition, and introduces a clustering metric, called predicted transmission count (PTX), to evaluate the qualification of nodes for clusterheads and gateways. Each clusterhead or gateway candidate depends on the PTX to derive a priority. The clusterhead or gateway candidate with the highest priority will become the clusterhead or gateway. Simulation results show that the proposed ELECT significantly outperforms the clustering technique using a random selection and considering only link quality and remaining energy in packet delivery ratio and energy consumption.

Energy efficiency is a critical problem for wireless sensor networks. In past decades, network coding has been proved as a promising technology to reduce the number of transmissions, save energy, and improve network throughput, especially suitable for the wireless network that motivates the emergence of network coding aware routings. However, existing network coding aware routings have the failure decoding problem, because of defective network coding conditions. On the other hand, existing network coding aware routings usually consider the ideal traffic scheduling and neglect nodes’ energy and load which are important to wireless sensor networks. Therefore, it is not appropriate to directly apply existing network coding aware routings in wireless sensor networks. Regarding the problems above problems, this paper proposes traffic-shaped network coding aware routing (TSCAR) for wireless sensor networks. In the TSCAR, a universal network coding condition is presented to solve the false decoding problem. And traffic shaping mechanism is proposed to shape the traffic of different flows to create more coding actions when coding opportunities exist. In addition, network calculus is used to analyze the delay of the TSCAR. Besides, a coding, load, and energy aware routing metrics are proposed to evaluate the discovered paths. Extensive simulation results demonstrate that the TSCAR increases the number of coding opportunities and the proportion of coded packets, improves network throughput, and extends the network lifetime of wireless sensor networks.

Landmark-based routing (LR) provides a promising approach for scalable point-to-point routing in wireless sensor networks (WSNs). Though various approaches have been proposed for landmark-based routing, they either introduce significant computational complexity or are inefficient in realistic, dynamic environments. In this paper, we identify three design principles that could form the basis of efficiency: algorithmic simplicity, update efficiency, and application awareness. Motivated by these principles, we present XLR, a new, flexible and comprehensive framework that tackles the inefficiency of landmark-based routing. XLR consists of four components: Relay Selection (RS), Parametric P-Norm distance function (PPN), Efficient Update with Coordinate Difference (EUCD) and General Forwarding (GF). The key advantage of XLR is that any subset of XLR's components can be independently incorporated into most landmark-based routing protocols.We perform extensive simulations to demonstrate that: (i) RS, a simple method, yields good performance comparable with previous methods, (ii) PPN increases LR performance considerably, (iii) EUCD reduces coordinate update overhead by up to 39%, and (iv) our GF outperforms previous approaches that consider factors such as link quality, delay and power consumption independently.

The objective of the research work is to examine energy-efficient routing in wireless sensor networks for moving nodes by contrasting new evolutionary algorithms with the Particle Swarm Optimization (PSO) Algorithm. Comparative analysis of energy efficient routing is performed by a novel genetic algorithm where there are several samples (N = 10) and a PSO algorithm where there are several samples (N = 10) techniques with pre-test power of 80% using NS2. When routing wireless sensor networks with moving nodes, Various metrics, including delay, energy use, and packet delivery ratio, are used to compare PSO and genetic algorithms. The evolutionary algorithm outperforms the PSO algorithm in these ways in terms of packet delivery ratio, energy usage, and delay. (p < 0.05) indicates a statistically significant difference. The research's findings comprised the three metrics of delay, energy consumption and packet delivery ratio. The method shows that the novel Genetic algorithm outperforms the PSO algorithm for wireless sensor network energy-efficient routing for moving nodes by identifying a set of routes that can satisfy the delay restrictions.KeywordsNovel genetic algorithmParticle Swarm Optimization (PSO)Wireless sensor networkDelayEnergy consumptionPacket delivery ratio

In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications.Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station.But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime.In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network.The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station.GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value.Also, GCR uses a greedy route finding strategy for balancing energy consumption.Experimental results show that GCR achieves significant energy savings and prolong network lifetime.

A wireless sensor network is an enormous assortment of sensor nodes with inadequate power supply and self-conscious computational competence. Due to the circumscribed communication range and high density of sensor nodes, packet dispatching in sensor networks is usually performed through multi-hop data transmission. For that reason, routing in wireless sensor networks has been deliberated as an imperative field of research over the past decade. These days, multipath routing techniques is widely used in wireless sensor networks to improve network performance over and done with efficient utilization of accessible network resources. Consequently, the main intention of this review is to present the conception of the various routing approaches and its fundamental experiments, as well as the basic motivations for exploiting these techniques in wireless sensor networks. Routing procedures for WSNs are responsible for selecting and maintaining the routes in the network and ensure reliable and effective communication in inadequate periods. The energy constriction of WSNs make energy saving become the most significant objective of various routing algorithms. In this paper, a review of routing protocols and algorithms used in WSNs is presented with energy efficiency as the main goalmouth.

With the advancement of wireless sensor networks (WSNs) and technology, applicability of WSNs as a system is touching new heights. The development of multimedia nodes has led to the creation of another intelligent distributed system, which can transfer real-time multimedia traffic, ubiquitously. Wireless multimedia sensor networks (WMSNs) are applicable in a wide range of areas including area monitoring and video surveillance. But due to unreliable error-prone communication medium and application specific quality of service (QoS) requirements, routing of real-time multimedia traffic in WMSNs poses a serious problem. The paper discusses various existing routing strategies in WMSNs, with their properties and limitations which lead to open research issues. Further, detailed classification and analytical comparison of discussed protocols are also presented.

Wireless sensor networks (WSNs) struggle with energy efficiency because of limited node power. This paper presents an approach that uses evolutionary algorithms to choose the Cluster Head (CH) and optimize routing in wireless sensor networks (WSNs) using grid-based topologies. The proposed method repeatedly develops solutions based on criteria for node density, distance, and energy level by using the evolutionary capabilities of the genetic algorithm. A fitness function that considers latency, coverage, and energy efficiency is used to evaluate the solutions. The process selects CHs dynamically and uses GA-guided optimization to construct paths. Simulation results indicate improved network performance and energy efficiency over existing protocols. Evolutionary algorithm integration enables flexibility and optimization for energy-efficient CH selection and routing in WSNs with a grid-based design.

With rapid development of wireless communication, sensor, micro power system and electronic technology, the research on wireless sensor network has attracted more and more attention. The work proposed routing algorithm in wireless sensor network based on ant colony optimization by analyzing routing protocol and utilizing advanced idea. Ant colony optimization algorithm has advantages in implementing local work, supporting multiple paths and integrating link quality into pheromone formation. In routing selection, the work calculated probability that node is selected as the next hop according to pheromone concentration on the path. With characteristics including self-organization, dynamic and multipath, ant colony optimization algorithm is suitable for routing in wireless sensor network. With low routing cost, good adaptability and multipath, the algorithm balanced energy consumption to prolong network lifetime. In terms of simulation and experiments, ant colony algorithm was proved to be suitable for finding optimal routing in wireless sensor network, thus achieving design goal of routing algorithm.

Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

Scalable routing in wireless sensor network (WSN) is required for future applications to provide high-quality and robust transmission. In this paper we propose a Polychromatic Sets based scalable Routing (PSR) scheme for WSNs. PSR is a hierarchical routing scheme designed to scale to the network size. This scheme firstly partitions the network into multiple clusters which are organized as a multilevel hierarchical model. Then intra-cluster or inter-cluster routing is applied to increase the scalability. The clustering techniques and routing scheme are validated by comparing with existing protocols. Simulation results clearly show the superior throughput and considerable low packets delay of PSR against AODV and FSR in terms of scalability and robustness to network size.

The rumor routing is a method extracted from the random movement of software agents basis. This paper presents a model based on the mentioned principal for routing in wireless sensor networks. First in this article we will present a model based on query agents dispatch which is called Serial Directional Rumor Routing (SDRR.) Then we will examine the advantages and disadvantages of this model compared to Directional Rumor Routing (DRR) which is an other model based on parallel agent dispatch. Next will propose a method to improve SDRR so that by removing some of shortcomings such as delays and path lengths, model can gain and edge over other models. The obtained results show a considerable improvement over Directional Rumor Routing (DRR).

In this paper, we propose a non-cooperative, dynamic and extensive game model for routing in a wireless sensor network (WSN). We treat each sensor node as a player who has a strategy to choose from in order to find the route that meets certain objective functions. A multi-hop routing is performed concurrently between multiple source and multiple destination nodes considering signal-to-noise-interference ratio (SINR) as the constraint. The goal to be achieved by each of the player in the game is to minimize the (i) energy consumption and (ii) delay in routing towards the sink nodes. The players choose their strategies independently and selfishly to optimize the energy and delay in routing through the optimal routing path that is guided by SINR values. An experimental study on the SINR values manifests the effect of noise and integrity in communication with varying network conditions. With varying node density, we study the performance of our proposed routing game in terms of packet reception ratio (PRR) and network lifetime. The effectiveness of the dynamic routing game in its extensive regime is also highlighted and the self-imposed Nash equilibrium is ascertained.

International audience