The significant impact of a set of topologies on wireless sensor networks

Lutful Karim,Qusay H Mahmoud,Nidal Nasser,Tarek El Salti

doi:10.1186/1687-1499-2012-120

Abstract

Routing and topology control for Wireless Sensor Networks (WSNs) is significantly important to achieve energy efficiency in resource-constrained WSNs, and high-speed packet delivery. In this article, we introduce a framework for WSN that combines three design approaches: (1) clustering, (2) routing, and (3) topology control. In this framework, we implement an energy-efficient zone-based topology and routing protocol. The framework features a new set of graphs referred to as the Mini Gabriel (MG) graphs. The simulation results demonstrate that the framework with the MG graphs and without these graphs are generally 28% better than the framework with an existing geometric graph. This is in terms of the total network energy consumptions. In addition, the proposed framework is 10, 25, 26, and 46% better than the proposed work with an existing geometric graph in terms of the end-to-end data transmission delay, the transmission energy consumptions, the number of hops in established paths and the routing delay, respectively. Moreover, the MG demonstrates that it achieves the connectivity property, which is critical for WSNs.

Highlights

Wireless Sensor Networks (WSNs) have many interesting applications such as disaster detection and monitoring
The Mini Gabriel (MG) demonstrates that it achieves the connectivity property
Conclusion and future work In this article, we introduced a framework for WSN that combines clustering, routing, and topology control approaches

Summary

Introduction

Wireless Sensor Networks (WSNs) have many interesting applications such as disaster detection and monitoring. This is because the active node of the neighboring square of g1 fully covers g1 Using this topological structure, there is a high probability that no sensing hole exists in the network if (see Figure 5). This enables the sensor nodes to transmit the data to the BS through active nodes in their neighboring zones This is because Rc >Rs and there is a defined relationship between those ranges [1]. A set of topology control algorithms We introduce a new set of graphs referred to as the MG geometric graphs These graphs are sub-graphs of the UDGs. Each sensor node, u, running these graphs chooses the nearest neighboring node, v. We show the simulation results for the proposed CRTCA and its variant with Gabriel (GG) and MG graphs

Energy model

Findings

Conclusion and future work