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

In geographical network systems, face routing is the unique recovery solution for local minimum problem. A node in local minimum could not choose its neighbor node closer to the destination. Since the face routing is based on novel graph named planar graph, the nodes search a link between adjacent nodes in the graph and send their data via the link. During… (More)