Research Area: Wireless Sensor Networks
In Wireless Multimedia Sensor Networks, source nodes send intense multimedia traffic, under strict quality-of-service requirements, to the base station via resource-limited relay nodes. To satisfy such requirements, all discoverable routing paths must be concurrently utilized. The shorter the paths are, the lower the energy consumption and the shorter the packet delay are, resulting in an enhanced network lifespan and higher rates of data delivery. Optimizing the number and the deployment strategy of relay nodes has been a vital problem to solve. Focusing mainly on single source node scenarios, previous theoretical studies assumed that either a deterministic or a random uniform distribution of relay nodes is to be used. Recent studies, however, have proven that when practical deployment strategies are used, controllable Gaussian distributions of relay nodes can be achieved, and both network resources and routing performance can otherwise be optimized. This paper presents an analytical framework for the optimal deployment of relay nodes using a two-dimensional Gaussian distribution. Given the network parameters (such as number of sources nodes, communication range and number of routing paths needed) both the theoretical minimum number of relay nodes needed and the optimal standard deviation can be exactly determined. To validate the mathematical model and evaluate its performance, a simulation study has been conducted. Statistical analysis revealed that when optimal Gaussian distribution was used, instead of a uniform distribution, routing performance increased by at least twofold. That is sufficiently close to the ideal deterministic distribution. Additionally, the average path length and the number of control packets were considerably reduced, which can potentially improve energy consumption, packet delay, network lifetime and data delivery.
Keywords:
Author(s) Name: Fahed H.Awad
Journal name: Computer Networks
Conferrence name:
Publisher name: ELSEVIER
DOI: 10.1016/j.comnet.2018.08.021
Volume Information: Volume 145, 9 November 2018, Pages 96-106
