The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Improving route discovery in on-demand routing protocols using local topology information in MANETs
Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks
| Hi-index | 0.00 |
In an ad-hoc network, we need to find the path to the destination prior to the start of transmission between two users. In such an environment, proactive routing protocols, such as AODV and DSR, are widely used to discover a suitable routing path for two ends. However, without taking other issues, such as energy, jitter and so on, into account, the chosen relay nodes in these routing protocol is optimal from the viewpoints of energy and jitter. In this work, we address a distributed ad-hoc passive Routing Path Selection Algorithm (DPPA) to select the relay nodes. The concept of DPPA is derived from Power-Aware Source Routing protocol (PSR)[2] and AODV. In DPPA, we prioritize the broadcasting order of co-located nodes according to the energy level and dynamically adjust the broadcasting jitter according to the relative energy levels of co-located nodes. In addition, the listening delay is also dynamically adjusted according to the broadcasting jitter time. Adopting these mechanism, the route initial delay could be greatly reduced. Meanwhile, we propose a novel relay node selection metric, which utilizes the information of the reverse path. Based on this information, we are able to have semiglobal non-realtime network information to choose the optimal routing path. Though simulation, it has shown that the proposed mechanism outperforms PSR in terms of initial delay and energy.