Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...

sink location is considered as a basic service in geographic routing in wireless sensor networks. obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. in this paper, a sink location algorithm based on fano plane is proposed. the research challenge is how to ensure the intersection of two slq and sla rou...

Geographic routing for wireless sensor networks requires a source that can encapsulate the location of a sink in each data packet. How a source can obtain the location of a sink with low overhead is a difficult issue. This letter proposes a Quorum Based Sink Location Service (QSLS) which can be exploited by most geographic routing protocols in arbitrary irregular wireless sensor networks. key w...

Sink location protection is critical to the viability of sensor networks as the central point of failure. Most existing work related to sink location protection focuses on local traffic analysis attack. In this paper, we study the sink location protection problem under a more powerful type of attack, the global traffic analysis attack. In order to hide the sink location, a protocol based on pac...

This paper exploits sink mobility to prolong the lifetime of sensor networks while maintaining the data transmission delay relatively low. A location predictive and time adaptive data gathering scheme is proposed. In this paper, we introduce a sink location prediction principle based on loose time synchronization and deduce the time-location formulas of the mobile sink. According to local clock...

This paper considers minimax regret 1-sink location problems in dynamic path networks. A dynamic path network consists of an undirected path with positive edge lengths and constant edge capacity and the vertex supply which is nonnegative value, called weight, is unknown but only the interval of weight is known. A particular assignment of weight to each vertex is called a scenario. Under any sce...

The Maximum static flow problem, in a single-source-single-sink network, deals with finding the maximum amount of from source to sink. Given set possible sinks, identification sink that maximizes is an important optimization problem. In this work, we consider problem when sinks have given capacities. We devise simple network transformation so algorithms uncapacitated case can be used capacitate...

We consider the problem of maximizing the lifetime of a wireless sensor network with a mobile sink. The sink travels at finite speed among a subset of possible sink locations to collect data from a stationary set of sensor nodes. The problem we consider chooses a subset of sink locations for the sink to visit, finds a tour for the sink among the selected sink locations, and prescribes an optima...

This paper addresses the minimax regret sink location problem in dynamic tree networks. In our model, a dynamic tree network consists of an undirected tree with positive edge lengths and uniform edge capacity, and the vertex supply which is a positive value is unknown but only the interval of supply is known. A particular realization of supply to each vertex is called a scenario. Under any scen...

ELECT A mechanism for deploying a minimum number of sensors to cover all targets that are randomly placed in a grid environment is discussed. The sensors are deployed at grid points that do not have targets. In the presented method, condideration is given to a grid point, called the sink, to start deploying the sensors. From the sink location, movement is in one of four possible directions (up,...