A crucial issue for data collection in wireless sensor networks is that the energy consumption of the sensor nodes placed near the sink is very high. This is because the sensors placed near the sink have to forward the data to the sink on behalf of others resulting in the depletion of energy quickly, which will lead to network partitioning and limitation in the network lifetime. In order to sol...

Wireless sensor networks with mobile sink are expected to increase the flexibility for gathering information in the large-scale sensing and detecting environments. The sink can randomly move within the sensing area to collect the sensing data. Energy saving becomes one of the most important features for the sensor nodes to extend their lifetime in such networks. To provide reasonable energy con...

The location information is very important in many wireless sensor network applications where in from which node the data is generated needs to be determined. Therefore it becomes necessary to know the location of each and every sensor that is deployed in the network. In our proposed Localization technique we have deployed static sensors in the geographical area of the network which are used fo...

Most of the existing data gathering strategies are based on the structure of stationary Sink in Wireless Sensor Networks, which will lead to rapidly energy consumption of sensor nodes near the sink for the reason that these nodes burden the data transmission from the whole network. This paper proposes a clustering-based routing algorithm in wireless sensor networks with mobile sink (CRA) to sol...

Improving the efficiency of data dissemination algorithms and protocols to mobile sink remains as an interesting research and engineering issue, especial for large-scale wireless sensor network. As the node energy and resources are limited, theses protocols should meet energyefficiency, low delay and high delivery ratio requirements. Although an energy-efficient dissemination tree (d-tree) can ...

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location thr...

Enforcement of location-aware security policies requires trusted location information in localization of wireless sensor networks. In this paper, we propose to develop a distributed secured localization scheme that validates the reliability of location information associated with event reports. We make the network distributed by including a set of Anchor nodes across each route in the network. ...

In this study, the problem of building Level-based topologies for Wireless Sensor Networks with several sinks is considered. The optimization relies on different levels of decision: choosing which sensors are masters and balancing the load among sinks, in order to prolong the network life time and improve its scalability. In this paper we present an enhancement to the GRPW algorithm for wireles...

This paper addresses the minmax regret 1-sink location problem on dynamic flow path networks with parametric weights. We are given a network consisting of an undirected positive edge lengths, capacities, and nonnegative vertex A can be considered as road, length distance along road weight number people at site. An capacity limits that enter per unit time. consider locating sink in network, to w...