NBgossip: An Energy-Efficient Gossip Algorithm for Wireless Sensor Networks (original) (raw)
Related papers
Efficiency of the gossip algorithm for wireless sensor networks
2007
Gossip is a well-known technique for distributed computing in an arbitrarily connected network of nodes. The gossip algorithm, which is very simple to implement, takes into account strong limitations in computational, communication and energy resources that usually characterize nodes in sensor networks. In gossip, the computational burden is distributed among the nodes, and computation and communication are managed in a very quick and efficient way: in essence, each node acquires its own measure and, starting from it, exchanges information with its neighbors, according with a connection probability distribution. In this paper, we study the performance of gossip algorithms, aiming to test the agreement between analytical results on the averaging time and the actual convergence time for specific scenarios, estimated through numerical simulations. Furthermore, we apply an optimization technique, recently appeared in the literature, that theoretically allow to accelerate convergence. Numerical simulations permit to assess the effects of optimization in real cases, thus evaluating the actual improvement in performance it achieves.
EAGP: An Energy-Aware Gossip Protocol for Wireless Sensor Networks
2020 International Conference on Software, Telecommunications and Computer Networks (SoftCOM), 2020
In Wireless Sensor Networks (WSN), typically composed of nodes with resource constraints, leveraging efficient processes is crucial to enhance the network lifetime and, consequently, the sustainability in ultra-dense and heterogeneous environments, such as smart cities. Particularly, balancing the energy required to transport data efficiently across such dynamic environments poses significant challenges to routing protocol design and operation, being the trade-off of reducing data redundancy while achieving an acceptable delivery rate a fundamental research topic. In this way, this work proposes a new energy-aware epidemic protocol that uses the current state of the network energy to create a dynamic distribution topology by self-adjusting each node forwarding behavior as eager or lazy according to the local residual battery. Simulated evaluations demonstrate its efficiency in energy consumption, delivery rate, and reduced computational burden when compared with classical gossip protocols as well as with a directional protocol.
An energy-efficient gossiping protocol for wireless sensor networks using Chebyshev distance
Procedia Computer Science, 2019
As the use of Wireless Sensor Networks grows, many challenging issues with these networks arise. The utilization of power consumption is one of the most significant issue due to the limited energy constraints of the individual sensor nodes. This limitation imposes a challenge to design the best energy-efficient routing mechanism. This work presented an Energy-Efficient Gossiping protocol (EEGossip) that routes data to the sink by choosing the optimal next node. EEGossip uses Chebyshev distance, residual energy and the sink distance as factors when determining the optimal next node. The result of the proposed work has shown that the proposed protocol improves the total energy consumption of the network and leverages the network lifetime since it decreases the computational overhead and ensures that the best next node is chosen.
Gossiping using the energy map in wireless sensor networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems, 2007
A gossip protocol randomly decides the set of nodes that will forward a packet it received. Gossiping was proposed to be used in dynamic topology networks such as Wireless Sensor Networks (WSNs). This work proposes Gossiping using the Energy Map (GEM), a new gossiping-based protocol to perform energy-aware broadcasting in WSNs. The key idea is to change the random selection of neighbors in a way that the selection process uses the energy map. In our protocol, the routing flow is directed to the nodes with the greatest energy reserves, balancing the network energy and preserving nodes localized inside low energy regions to perform sensing tasks.
Efficiency of Unicast and Broadcast Gossip Algorithms for Wireless Sensor Networks
Journal of Communications Software and Systems, 2008
Gossip is a well-known technique for distributed computing in an arbitrarily connected network, that can be adopted effectively in wireless sensor networks. Gossip algorithms have been widely studied in previous literature, but mostly from a theoretical point of view. The aim of this paper isto verify the behavior of the gossip approach in practicalscenarios, through the analysis and interpretation of simulated results. So, we investigate the impact of optimizing the neighbor selection probabilities, the effect of multiple link failures and that of limited transmission radius. The possibility to use broadcast-like algorithms to increase the rate of convergence in averaging problems is also discussed and its advantage estimated.
Performance of Gossip Algorithms in Wireless Sensor Networks
Lecture Notes in Electrical Engineering, 2011
The goal of this chapter is to evaluate the efficiency of three versions of the well known gossip algorithm, namely: basic gossip, push-sum and broadcast, for the distributed solution of averaging problems. The main focus is on the impact of link failures that, reducing the network connectivity, decrease the convergence speed. As a similar effect occurs in non-fully-meshed networks, because of a limited coverage radius of the nodes, a comparison is made between these two scenarios. The considered algorithms can require optimization of some share factors; to this purpose, we resort to simulations, but the conclusions achieved are confirmed through analytical arguments, exploiting the concept of potential function.
ArXiv, 2019
This paper proposes a novel asynchronous consensus algorithm which is based on a continuous update rule and an energy efficient event triggered duty (wake-sleep) cycle based on a discrete Markov chain model. The system model of the proposed algorithm is formulated and analyzed. The conditions for convergence and stability of the algorithm are derived and the algorithm is proved to converge to an average consensus. Numerical simulations on random, circular, chain and star graphs show stability in consensus and convergence to network global state average.
A Fitness-Gossip Routing Protocol for Saving Energy in Wireless Sensor Networks
Abstract - Gossiping is traditional routing scheme commonly used in WSNs to transport data in a multi hop manner because of limited radio range and energy constraints. Gossiping protocol is simple and do not involve additional devices, but at the same time it faces several deficiencies when it used in WSNs. This paper describes an efficient technique to transmit the message to the sink node. The main idea behind the new protocol which is called (Fitness-Gossiping Protocol FGP) which is a modification of Gossiping protocol by using a fitness function to select the optimum next node, when the optimum next node is selected the data is transmitted to the next node. We discussed how the new approach saved the energy of the network and to achieve maximize the network lifetime in comparison with its counterparts. In the same time, the Fitness-Gossiping protocol provides the balanced energy between nodes. Index Terms— Gossping, Fitness- Gossip, network lifetime, routing, wireless sensor networks (WSNs). https://sites.google.com/site/ijcsis/
A Novel Energy Efficient Routing Protocol in Wireless Sensor Networks
Wireless Sensor Network, 2011
Wireless sensor networks are employed in several applications, including military, medical, environmental and household. In all these applications, energy usage is the determining factor in the performance of wireless sensor networks. Consequently, methods of data routing and transferring to the base station are very important because the sensor nodes run on battery power and the energy available for sensors is limited. In this paper we intend to propose a new protocol called Fair Efficient Location-based Gossiping (FELGossiping) to address the problems of Gossiping and its extensions. We show how our approach increases the network energy and as a result maximizes the network life time in comparison with its counterparts. In addition, we show that the energy is balanced (fairly) between nodes. Saving the nodes energy leads to an increase in the node life in the network, in comparison with the other protocols. Furthermore, the protocol reduces propagation delay and loss of packets.
Improvement on Gossip Routing Protocol using TOSSIM in Wireless Sensor Networks
Multicast routing protocols in the networks are inefficient to handle high priority traffic, network congestion, excessive processing of control information and retransmission procedures. Gossiping routing protocol is suitable and controlled form of reducing the overhead of routing protocols for forwarding a message. Gossiping protocol is characterized by each node randomly choosing to exchange information with another node. Modified Gossip has been considered as a scalable broadcast solution, considering destination node in wireless network. In this paper, we analyse Gossiping protocol and compare the performance of Gossiping and Modified Gossiping protocol, using new operating system TOSSIM, is a widely used operating system for modern wireless sensors. The protocols are simulated by TOSSIM and comparison results between the protocols are shown by different graphs