Abstract
Face-routing is one of the reliable recovery schemes when geographic routing fails to transmit data packets. Although studies on face-routing can overcome the failure of the data transmission, they lead to much energy consumption due to frequent data transmissions between adjacent nodes for carrying out the rule of face-routing. To avoid the frequent data transmissions, several face-routing schemes have been recently proposed to transmit data packets to the farthest-neighbor node. However, they happen with many data retransmissions because the farthest-neighbor node has a relatively low transmission success ratio. To solve this problem, we propose a new face-routing scheme that determines the most appropriate neighbor node to balance the trade-off between energy efficiency and transmission reliability with two viewpoints. The first viewpoint focuses on how to increase the distance progress of the data delivery in one-hop range to enhance energy efficiency. After that, the second viewpoint focuses on how to increase the success ratio of the data delivery to enhance the transmission reliability. As a result of the simulation, it was confirmed that the proposed method achieves better performance in terms of energy efficiency than existing face-routing research, and it is better than recent face-routing research in terms of reliability and retransmission.
Highlights
In wireless networks, many researchers have paid attention to geographic routing, which is one of the efficient routing methods because it does not use the topology information of the entire network but it only uses the location information of the neighbors [1,2,3,4,5,6]
The simulation results show that the proposed scheme has better performance than greedy perimeter stateless routing (GPSR) and Transfer-efficient face-routing (TEF) in terms of energy efficiency by increasing the transmission distance of face-routing, and it has better transmission reliability when it compares with TEF by decreasing the amount of data retransmission and the delay between nodes by selecting neighbor nodes with better link qualities
GPSR usually has the largest number of data transmissions compared with the other two face-routing techniques and it results in the highest average energy consumption
Summary
Many researchers have paid attention to geographic routing, which is one of the efficient routing methods because it does not use the topology information of the entire network but it only uses the location information of the neighbors [1,2,3,4,5,6]. Sensors 2021, 21, 2746 face-routing (EELFR) [19], another of recent studies finds the farthest-neighbor node in one-hop range by using a search message at first This scheme searches the candidate node of face-routing based on planar graphs and it transmits the search message instead of the data message. The simulation results show that the proposed scheme has better performance than GPSR and TEF in terms of energy efficiency by increasing the transmission distance of face-routing, and it has better transmission reliability when it compares with TEF by decreasing the amount of data retransmission and the delay between nodes by selecting neighbor nodes with better link qualities.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
