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

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.

Energy-Efficient and Disjoint Multipath Using Face Routing in Wireless Sensor Networks

“…Geographic routing is a well-known routing in WSNs in terms of energy efficiency [22][23][24][25][26][27]. When a sensor transmits a data packet using geographic routing, this routing does not use the connection information of the whole network, but uses local information that communicates with each neighbor within its radio range.…”

“…In face routing, this particular graph is called a planar graph. When a node generates a planar graph, this graph selects shorter links to avoid the routing loop state that repeatedly communicates with the same nodes as in previous research [22][23][24][25][26][27]. Since this graph is generated based on a one-hop range for each node, the node does not need to collect information for entire network, and, therefore, it greatly reduces the overheads for graph generation and maintenance.…”

“…The proposed scheme uses the marking process that selects the used candidate nodes of face routing. Face routing exploits local unique graphs, called the planar graph, which consists of adjacent neighbors in a one-hop range of each node [22][23][24][25][26][27]. Using this local graph, face routing can guarantee the connectivity of data transmission [25].…”

“…In WSN, when a node encounters a hole area during multipath generation through a geographic routing, this results in breaking its disjoint feature. Geographic routing generally searches for candidate nodes using greedy forwarding that transmits data packets to neighbor nodes close to a destination node within one-hop range [22][23][24][25][26][27]. When a current node does not find candidate nodes of geographic routing, it uses face routing, which is a famous recovery strategy mode in geographic routing.…”

A Partition-Based Mobile-Crowdsensing-Enabled Task Allocation for Solar Insecticidal Lamp Internet of Things Maintenance

“…Apply right hand rule to find a set of subareas satisfying Eq. (6) based on both the current location of participant u j and the location of task t k ; if d t k j < D j then 16d t k j * ← d t k j ; 17 end 18 return d t k j * , S i *Based on the thought of face-routing[27] while considering the characteristic of partition structure, we propose a partition-based optimal path planning (POPP) algorithm to plan participants' paths. The process of selecting the optimal path planning can be divided into two stages: i) Use the righthand rule to search valid subareas; ii) Plan path based on the searched subareas.…”