On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
ACM SIGMOBILE Mobile Computing and Communications Review
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Optimal Transmit Power in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
On the capacity of mobile ad hoc networks with delay constraints
IEEE Transactions on Wireless Communications
Principles and protocols for power control in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.