AoI-based Multicast Routing over Voronoi Overlays with Minimal Overhead

The increasing pervasive and ubiquitous presence of devices at the edge of the Internet is creating new scenarios for the emergence of novel services and applications. This is particularly true for location- and context-aware services. These services call for new decentralized, self-organizing communication schemes that are able to face issues related to demanding resource consumption constraints, while ensuring efficient locality-based information dissemination and querying. Voronoi-based communication techniques are among the most widely used solutions in this field. However, when used for forwarding messages inside closed areas of the network (called Areas of Interest, AoIs), these solutions generally require a significant overhead in terms of redundant and/or unnecessary communications. This fact negatively impacts both the devices' resource consumption levels, as well as the network bandwidth usage. In order to eliminate all unnecessary communications, in this paper we present the MABRAVO (Multicast Algorithm for Broadcast and Routing over AoIs in Voronoi Overlays) protocol suite. MABRAVO allows to forward information within an AoI in a Voronoi network using only local information, reaching all the devices in the area, and using the lowest possible number of messages, i.e., just one message for each node included in the AoI. The paper presents the mathematical and algorithmic descriptions of MABRAVO, as well as experimental findings of its performance, showing its ability to reduce communication costs to the strictly minimum required.Comment: Submitted to: IEEE Access; CodeOcean: DOI:10.24433/CO.1722184.v1; code: https://github.com/michelealbano/mabrav

Transport mechanism for wireless micro sensor network

Wireless sensor network (WSN) is a wireless ad hoc network that consists of very large number of tiny sensor nodes communicating with each other with limited power and memory constrain. WSN demands real-time routing which requires messages to be delivered within their end-to-end deadlines (packet lifetime). This report proposes a novel real-time with load distribution (RTLD) routing protocol that provides real time data transfer and efficient distributed energy usage in WSN. The RTLD routing protocol ensures high packet throughput with minimized packet overhead and prolongs the lifetime of WSN. The routing depends on optimal forwarding (OF) decision that takes into account of the link quality, packet delay time and the remaining power of next hop sensor nodes. RTLD routing protocol possesses built-in security measure. The random selection of next hop node using location aided routing and multi-path forwarding contributes to built-in security measure. RTLD routing protocol in WSN has been successfully studied and verified through simulation and real test bed implementation. The performance of RTLD routing in WSN has been compared with the baseline real-time routing protocol. The simulation results show that RTLD experiences less than 150 ms packet delay to forward a packet through 10 hops. It increases the delivery ratio up to 7 % and decreases power consumption down to 15% in unicast forwarding when compared to the baseline routing protocol. However, multi-path forwarding in RTLD increases the delivery ratio up to 20%. In addition, RTLD routing spreads out and balances the forwarding load among sensor nodes towards the destination and thus prolongs the lifetime of WSN by 16% compared to the baseline protocol. The real test bed experiences only slight differences of about 7.5% lower delivery ratio compared to the simulation. The test bed confirms that RTLD routing protocol can be used in many WSN applications including disasters fighting, forest fire detection and volcanic eruption detection

Minimum energy transmission forest-based Geocast in software-defined wireless sensor networks

© 2021 The Authors. Published by Wiley. This is an open access article available under a Creative Commons licence. The published version can be accessed at the following link on the publisher’s website: https://doi.org/10.1002/ett.4253Wireless Sensor Networks (WSNs)-based geographic addressing and routing have many potential applications. Geocast protocols should be made energy efficient to increase the lifetime of nodes and packet delivery ratio. This technique will increase the number of live nodes, reduce message costs, and enhance network throughput. All geocast protocols in the literature of WSN apply mostly restricted flooding and perimeter flooding, which is why still the redundancy they produce significantly high message transmission costs and unnecessarily eats up immense energy in nodes. Moreover, perimeter flooding cannot succeed in the presence of holes. The present article models wireless sensor networks with software-defined constructs where the network area is divided into some zones. Energy-efficient transmission tree(s) are constructed in the geocast area to organize the flow of data packets and their links. Therefore, redundancy in the transmission is eliminated while maintaining network throughput as good as regular flooding. This proposed technique significantly reduces energy cost and improves nodes' lifetime to function for higher time duration and produce a higher data packet delivery ratio. To the best of the author's knowledge, this is the first work on geocast in SD-WSNs

Dealing with Non-Uniformity in Wireless Sensor Networks

In this thesis, we step inside an unexplored region of Wireless Sensor Networks (WSNs) research. Nowadays, almost all WSNs research relies upon a hidden uniformity assumption. This assumption involves deployment, distribution and radio transmissions. Unfortunately, the real world is not uniform. In the thesis, we break the uniformity assumption and study the non-uniformity influence in WSNs. In particular, we show that addressing common WSN problems taking non-uniformity into account can provide results that are sensibly different from the ones achieved in a uniform world. In our work, we focus on the influence of non-uniformity on a particular aspect of WSNs: data management. First of all, we point out that even widely accepted solutions based on the uniformity assumption are not able to survive inside an non-uniform world. Then, we propose our approach to data management and detail a solution able to deal successfully with non-uniformity. This allows us to catch out the fundamental aspects of non-uniformity influence in WSNs and to cope with non-uniformity. Results, discussed in the thesis, show that models and solutions we propose are competitive in a uniform scenario and continue to work properly in a non-uniform world

Efficient and robust geocasting protocols for sensor networks

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. The results show the significant improvement in delivery rate (up to 63 % higher delivery percentage in low density networks) and reduction in overhead (up to 80 % reduction) achieved by our mechanisms. We hope for our protocols to become building block mechanisms for dependable sensor network architectures that require robust efficient geocast services