Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Performance analysis of wireless ad hoc networks
The handbook of ad hoc wireless networks
Hi-index | 0.00 |
This paper proposes an improved algorithm that can replace the existing algorithms that use the unidirectional link. The proposed algorithm allows a first sink node of the unidirectional link to detect the unidirectional link and its reverse route and provide information regarding the reverse route to other sink nodes, thereby minimizing unnecessary flows and effectively using the unidirectional link. This paper also proposes a redirection process that actively supports a unidirectional link generated during data transmission to deal with a topology change due to the movement of node. Further, this paper proves the superiority of the proposed algorithm to the existing algorithms in terms of a delay in data transmission and throughput through a simulation in which the performance of the proposed algorithm is compared with those of the existing algorithms.