Hop count optimal position based packet routing algorithms for ad hoc wireless networks with a realistic physical layer

Existing routing and broadcasting protocols for ad hoc networks assume an ideal physical layer model. We apply the log normal shadow fading model to represent a realistic physical layer and propose a MAC layer protocol to produce the optimal shortest hop count routing scheme. We then study the optimal packet forwarding distance to minimize the hop count. A hop count optimal, greedy, localized routing algorithm (referred as ideal hop count routing (IHCR)) is then presented. We also present another algorithm called expected progress routing with acknowledgements (referred as aEPR) and then propose a projection progress scheme. In conclusion, we propose a tR-greedy routing scheme, where the packet is forwarded to the neighbor closest to the destination, among neighbors that are within distance tR. All described schemes are implemented, and their performances are evaluated and compared.