Learn More
—we propose in this paper an efficient void-avoidance scheme based on a novel approach to prevent data packets from meeting boundaries of voids. In our approach, the choice of the forwarding region around a discovered void is based on the locations of the sender node, of the void center and of the destination node. The first stuck node which detects a void(More)
To bypass voids in sensor networks, most existing geographic routing protocols tend to route packets along the boundary nodes. Generally, a packet will be either forwarded along a void boundary by the right-hand rule or pushed back to find another route when it encounters the void. The two techniques consume more energy of boundary nodes, drop many packets(More)
—To avoid the negative impact of void areas on real-time routing efficiency, we propose in this paper an oriented void avoidance scheme for wireless sensor networks. To select the forwarding region around a void (either clockwise or anticlockwise), the proposed scheme is guided by the target location with respect to the center of the void. Our scheme uses(More)
We have conducted a performance study of the DSR protocol, in particular, for scenarios where it presents poor performance compared to that of AODV protocol. We have also carried out two optimizations on DSR, namely: generalized salvaging mechanism and cache update of the intermediate nodes with source routes discovered during the route request packets(More)