Area Based Beaconless Reliable Broadcasting in Sensor Networks

IEEE Transactions on Computers, 2005

Sensor networks usually operate under very severe energy restrictions. Therefore, sensor communications should consume the minimum possible amount of energy. White broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in sensor networking. In this paper, we propose an optimized broadcast protocol for sensor networks (BPS). The major novelty of BPS is its adaptive-geometric approach that enables considerable reduction of retransmissions by maximizing each hop length. BPS adapts itself and gets the best out of existing radio conditions. In BPS, nodes do not need any neighborhood information, which leads to low communication and memory overhead. We analyze the worst-case scenario for BPS and show that the number of transmissions in such a scenario is a constant multiple of those required in the ideal case. Our simulation results show that BPS is very scalable with respect to network density. BPS is also resilient to transmission errors.

Conference On Embedded Networked Sensor Systems, 2006

Varying interference levels make broadcasting an unreliable operation in low-power wireless networks. Many routing and resource discovery protocols depend on flooding (repeated per-node broadcasts) over the network. Unreliability at the broadcast-level can result in either incomplete flooding coverage or excessive re-flooding, making path maintenance either unreliable or expensive. We present RBP, a very simple protocol that bolsters the reliability of

2003

This work considers communication among sensorsthat are spread in a geographicregion. Each sensor is a computing device with severe resourceslimitations, low power, slow processingand small memory. The devicesare distrib uted (uniformly) in the geographicregion. In this work we presentself-stabilizing broadcast,flooding and senseof dir ectionproceduresthat fit the specialcharacteristics of the system. Imaginary polygonstilings are presentedas a general schemefor supporting communication in sensornetworks. The broadcastproceduresare usedby a sensorfor distrib uting secretsthat activate the sensorssimultaneouslyat a particular time without revealing the natur eof the upcomingactivity.

IEEE Transactions on Mobile Computing, 2005

We study an efficient broadcast scheme in mobile ad hoc networks (MANETs). The objective is to determine a small set of forward nodes to ensure full coverage. We first study several methods that guarantee coverage when the local view of each node on its neighborhood information is updated in a timely manner. Then we consider a general case where nodes move even during the broadcast process, making it impractical to maintain up-to-date and consistent local views. A formal framework is used to model inaccurate local views in MANETs, where full coverage is guaranteed if three sufficient conditions, connectivity, link availability, and consistency, are met. Three solutions are proposed to satisfy those conditions. First, we give a minimal transmission range that maintains the connectivity of the virtual network constructed from local views. Then, we use two transmission ranges, one for neighborhood information collection and the other for actual data transmission, to form a buffer zone that guarantees the availability of logical links in the physical network. Finally, we propose a mechanism called aggregated local view to ensure consistent local views. By these, we extend Wu and Dai's coverage condition for broadcasting in a network with mobile nodes. The effectiveness of the proposed scheme is confirmed via both performance analysis and simulation study.

Concurrency and Computation: Practice and Experience, 2013

Wireless sensor networks are a new generation of networks that need specific models and algorithms. We are interested specifically in mobile wireless sensor networks that are considered as anonymous asynchronous distributed mobile systems. As broadcast is one of the most important applications for such networks, and as it depends on the communication model, we tried to find the most suitable one to make a distributed broadcast algorithm. We adopted the population protocols, the Angluin's model of pairwise interactions of anonymous finite-state agents, to broadcast an information. We tried to modify this model to avoid the information duplication and then calculated the complexity of the algorithm. Then, we extended the model with the rendezvous one that made the stabilization of the algorithm faster. The implementation, the simulation, and the validation of these algorithms and results have been done with Visidia.

2016

In this paper, we study the Minimum Latency Broadcast Scheduling (MLBS) problem in wireless sensor networks (WSNs). The main issue of the MLBS problem is to compute schedules with the minimum number of timeslots such that a base station can broadcast data to all other sensor nodes with no collisions. Unlike existing works that utilize the traditional omni-directional WSNs, we target the directional WSNs where nodes can collaboratively determine and orientate their antenna directions. We first develop a 7-approximation algorithm, adopting directional WSNs. Our ratio is currently the best, to the best of our knowledge. We then validate the performance of the proposed algorithm through simulation. Keywords—Broadcast, collision-free, directional antenna, approximation, wireless sensor networks.

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04, 2004

Some of the first routing algorithms for geographically aware wireless networks used the Delaunay triangulation among the network's nodes as the underlying connectivity graph [4]. These solutions were considered impractical, however, because in general the Delaunay triangulation may contain arbitrarily long edges, and because calculating the Delaunay triangulation generally requires a global view of the network. Many other algorithms were then suggested for geometric routing, often assuming random placement of network nodes for analysis or simulation [30, 5, 31, 16]. We show that, when the nodes are uniformly placed in the unit disk, the Delaunay triangulation does not contain long edges, it is easy to compute locally and it is in many ways optimal for geometric routing and flooding. In particular, we prove that, with high probability, the

Computer Communications, 2006

Geocasting is the delivery of packets to nodes within a certain geographic area. For many applications in wireless ad hoc and sensor networks, geocasting is an important and frequent communication service. The challenging problem in geocasting is distributing the packets to all the nodes within the geocast region with high probability but with low overhead. According to our study we notice a clear tradeoff between the proportion of nodes in the geocast region that receive the packet and the overhead incurred by the geocast packet especially at low densities and irregular distributions. We present two novel protocols for geocasting that achieve high delivery rate and low overhead by utilizing the local location information of nodes to combine geographic routing mechanisms with region flooding. We show that the first protocol Geographic-Forwarding-Geocast (GFG) has close-to-minimum overhead in dense networks and that the second protocol Geographic-Forwarding-Perimeter-Geocast (GFPG) provides guaranteed delivery without global flooding or global network information even at low densities and with the existence of region gaps or obstacles. An adaptive version of the second protocol (GFPG*) has the desirable property of perfect delivery at all densities and close-to-minimum overhead at high densities. We evaluate our mechanisms and compare them using simulation to other proposed geocasting mechanisms.

Journal of Interconnection Networks, 2005

We present Geometric Broadcast for Heterogeneous Sensor Networks (GBS), a novel broadcasting protocol for heterogeneous wireless sensor and actor networks. While broadcasting is a very energy expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. GBS is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. GBS does not need any neighborhood information and imposes very low communication overhead. GBS is scalable to the change in network size, node type, node density and topology. Furthermore it accommodates seamlessly such network changes, including the presence of actors in heterogeneous sensor networks. Indeed, GBS takes advantage of actor nodes, and uses their resources when possible, thus reducing the energy consumption by sensor nodes. Throu...

Advanced Computing, 2009

- Though beaconless geographic routing protocols get rid of the overhead caused by the periodic beacon messages to be broadcast in case of beacon based approaches. But, most of the existing beaconless routing protocols do not consider remaining energy of nodes ...