Optimal transmission power with delay constraints in 2D and 3D MANETs

Given the mobile node (MN) density and transmission power, this paper estimates the per-hop advancement toward destination with a single transmission, assuming that MNs are uniformly distributed. Based on this esteem, we calculate required hop count between two given MNs. In homogeneous mobile ad hoc networks (MANETs) where all MNs utilize the same transmission power, the hop count between any two MNs is proportional to the distance between them. Given the distance between each pair of MNs, this paper suggests the optimal transmission range (OTR) of MNs, which is the minimum possible power to guarantee end-to-end delay constraints of requested connections in the entire network. Packet collision is also considered in computing the OTR. All problems are investigated in both a two-dimensional (2D) and a three-dimensional (3D) area. Simulation results substantiate the accuracy of proposed estimation methods. The errors of the per-hop advancement estimation are just 0.88% and 2.33% in a 2D and 3D areas.

► The average progress a packet traverses with a transmission in MANETs is accurately estimated using the probability theory.
► The minimum transmission power is defined as the power that can meet delay constraints of real-time applications.
► This paper finds out the minimum transmission power using only the node density information.
► The larger transmission power has a tendency to decrease delay at the cost of energy.
► In a densely deployed MANET, too large transmission power increases the end-to-end delay due to more collisions.