Energy-efficient lookahead face routing using coverage range in wireless networks

Energy-Efficient and Reliable Face-Routing Scheme in Wireless Networks

“…Greedy mode, called greedy forwarding, is a scheme that can select the closest neighbor nodes to the destination in its one-hop range. As the previous studies of face-routing assumed a radio range shape as an ideal circle surface and dealt with each method [ 7 , 8 , 9 , 10 , 11 , 12 , 13 , 18 , 19 ], we also proceed based on their studies that assume a radio range as an ideal circle shape. After the current node calculates a circle based on the virtual line from this node to the destination node, it finds the closest candidate node to the destination node in the intersection area between this circle and its radio range.…”

“…There are various perimeter modes in geographic routing and, among them, face-routing is one of the well-known perimeter modes. Unlike greedy forwarding, face-routing searches for candidate nodes according to the determined searching direction by using a local graph generated within one hop, it can greatly improve a reliability of data transmission in geographic routing [ 7 , 8 , 9 , 10 , 11 , 12 , 13 , 18 , 19 ].…”

“…However, since face-routing uses the planar graph, it frequently results in unnecessary packet transmission in one-hop range [ 18 , 19 ]. As mentioned above, the planar graph consists of the shortest and adjacent links with neighbor nodes in one-hop range to avoid the routing problem.…”

“…Thus, TEF can reduce the node energy consumption by transmitting a data packet to the farthest candidate node in one-hop range. In addition, energy-efficient lookahead 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 then, it transmits the search message instead of the data message.…”

“…However, although TEF and EELFR [ 18 , 19 ] can reduce the number of data transmissions by transmitting the farthest-neighbor node, they may not be efficient in face-routing. To reduce overall data transmission from the source node to the destination node, all of studies search the farthest-neighbor node in one-hop range and transmit data packets to the farthest one.…”