Mobile sinks were introduced in wireless sensor networks (WSNs) to mitigate the infamous hotspot problem. However, routing in mobile-sink-based WSNs requires frequent updation of sink location information to all the sensor nodes; which is an energy-expensive process for resource-constrained WSNs. Therefore, it is required to develop a green routing protocol that can minimize the energy overhead in sink location updation as well as reduce the data delivery delay. This article proposes a virtual-infrastructure-based delay-aware green routing protocol (DGRP) that creates multiple rings in the sensor field and limits the updation of mobile sink location information to the nodes belonging to the rings only. Simulation results show that DGRP outperforms existing routing protocols in terms of energy consumption and throughput. In addition to this, DGRP results in $\approx 26$ %, $\approx 39$ %, and $\approx 35$ % improvement in data delivery delay for a varying number of sensor nodes, sink speeds, and network sizes, respectively, when compared with the state of the art.

Shared Sensor Network (SSN) refers to a scenario where the same sensing and communication resources are shared and queried by multiple Internet applications. Due to the burgeoning growth in Internet applications, multiple application queries can exhibit overlapping in their functional requirements, such as the region of interest, sensing attributes, and sensing time duration. This overlapping results in redundant sensing tasks generation leading to the increased overall network traffic and energy consumption. Existing approaches operate on data sharing among various tasks to minimize the upstream traffic. However, no existing work attempts to prevent the redundant task generation to reduce the downstream traffic. Moreover, the allocation of suitable sensor nodes to meet the Quality of Service (QoS) requirements of the queries is still an open issue. This article proposes an end-to-end query processing framework (named, QueryPM) that first, calculates the functional requirements similarity among queries to prevent the redundant task generation. Then, it takes the QoS and functional requirements into account while allocating the tasks on the sensor nodes. Extensive simulations on the proposed approach show that downstream traffic, upstream traffic, and energy consumption reduced to 60%, 20--40%, and 40%, respectively, as compared to state-of-the-art mechanisms.

There are two major challenges in mobile sink based wireless sensor networks (WSNs) concerning to the query-driven scenarios, first, dissemination of queries to their respective region of interests (RoIs), and second, routing the data towards mobile sink. Due to sink mobility, routing of data packets to the sink becomes difficult because sink's query injection location and data collection location (current location of sink) may not be the same. Moreover, advertising mobile sink's location by flooding, introduces extensive burden on sensor nodes. In this paper, we propose a virtual ring infrastructure based query-driven ring routing protocol (QRRP) to reduce the overhead of updating mobile sink location information as well as routing the data towards current location of the sink. QRRP takes the advantage of proposed angle based routing to route the queries from mobile sink to their respective RoIs, and data from sensor nodes to the sink. Simulation results on the proposed approach show that energy consumption and data delivery delay are significantly reduced as compared to state-of-the-art mechanisms.