Circle Path Based Sink Location Service for Geographic Routing Scheme

Abstract

Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure local location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of sinks. Most existing geographic routing protocols merely assume that source nodes are aware of the locations of sinks or can get the locations of sinks by some service. How can source nodes get the locations of sinks was not addressed in detail. In this paper, we propose a Circle Path Based Sink Location Service for Geographic Routing in wireless sensor networks. In this scheme, a source node sends a Sink Location Query (SLQ) message to the predefined Base Node and sends another SLQ message to a node on the edge of the sensor network, thus generating a SLQ path; a sink node sends a Sink Location Announcement (SLA) message along a circle path, the centre of the circle path is the predefined Base Node. By this way we can guarantee the SLQ path and SLA path have at least one crossing point. The node located on the crossing point of the two paths informs the source node the sink location. How to achieve this procedure in any irregular profile sensor network is another challenge of this paper. Simulation results show that our protocol is significantly superior to other protocols in terms of energy consumption and control overhead.

General Sink Location Service Based on Circle and Line Paths in Wireless Sensor Networks

“…In wireless sensor networks, many sink location service schemes have been proposed, including schemes [4,5] for unicast, one [6] for anycast, one [7] for manycast, and one [8] for multicast. For unicast, the schemes [4,5] exploit a crossing point between a path of Sink Location Announcement (SLA) message of a sink and a path of Sink Location Query (SLQ) message of a source node.…”

“…For unicast, the schemes [4,5] exploit a crossing point between a path of Sink Location Announcement (SLA) message of a sink and a path of Sink Location Query (SLQ) message of a source node. They use a crossing point between x-axis and y-axis paths of SLA and SLQ messages on the grid [4] and a crossing point between a circle path of a SLA message and a line path of a SLQ message [5]. For anycast, the scheme [6] exploits Voronoi scoping that each sink only updates its location to the grid nodes closer to it than to any other sinks.…”

“…We proposed a sink location service scheme for unicast communication mode in the previous paper [5]. The scheme provides sink location service through a crossing point between a path of Sink Location Announcement (SLA) message of a sink and a path of Sink Location Query (SLQ) message of a source node.…”

“…Figure 1 shows a basic idea of the sink location service scheme [5]. A sink sends a SLA message to a circle path consisting sensor nodes with same height from the predetermined Base Node, thus generating a SLA circle path, whereas a source node sends a SLQ message to the predetermined Base Node and sends another SLQ message to a node on the edge of the sensor network, thus generating a SLQ line path.…”

“…Therefore, we propose a general sink location service scheme for efficiently supporting all of unicast, anycast, manycast, and multicast communication modes. For the proposed scheme, we borrow the basic idea from the previous scheme [5] proposed for unicast communication mode, which guarantees at least crossing point between a circle path of a Sink Location Announcement (SLA) message and a line path of a Sink Location Query (SLQ) message. The proposed scheme modifies the basic idea of the scheme for unicast communication mode and extends it for anycast, manycast, and multicast communication modes.…”