A novel semi-permanent geographic routing

An ETT(expected transmission time)-based semi-permanent geographic routing algorithm (ESGR) is proposed to solve the localization problem and time delay caused by hop by hop route. The algorithm first establishes a set of virtual neighbor nodes, then chooses the forwarding node using a greedy method and maps links from the semi-permanent route table. ESGR maps boundary node set to boundary link set and the localization problem is solved. This saves time of protocol switching and path searching. Once the semi-permanent routing table is formulated, the ETT is used as a measure to optimize the links, so that a better link condition for data transmission is provided. Simulation results show that ESGR effectively deals with the localization problem, reduces the delay and improves the network performance.