DBDC: A Distributed Bus-Based Data Collection Mechanism for Maximizing Throughput and Lifetime in WSNs

Using the mobile sink for data collection from all sensors is the most highly effective way to prolong the network lifetime of wireless sensor networks(WSNs). Many studies focused on the anchors selection, aiming to reduce the path length of mobile sink and prolong the network lifetime. However, the appropriateness and the number of the selected anchors, which significantly impact the network lifetime of the entire WSNs, still can be improved. This paper proposes a Dynamic Anchor Points Mechanism for data collection, called DAM, aiming to select appropriate anchors under the path length constraint for prolonging the network lifetime. The experimental results show that the proposed DAM outperforms existing data collection mechanisms in term of network lifetime and fairness index.

Maximization of lifetime of wireless sensor network (WSN) is an emerging area of research in present scenario. Many authors are performing their research work, so that they could achieve lower energy consumption for the sensor network which leads to increase in lifetime of network. Our work focuses on sink mobility in a fixed trajectory within a wireless sensor network while sensed data are required to be collected. We divide the whole sensor network into two different regions as direct communication area (DCA) and multi-hop communication area (MCA). Sensors node that lies in DCA is at one hop count distance from the sink node trajectory while sensors within MCA are at more than one hop count from the trajectory. We considered all the sensors that are within DCA as subsink nodes. During sink mobility, whenever a subsink is closer to the mobile sink node, then it starts transmitting its data to the sink node. But those sensors that are within MCA needs to search an appropriate sink node for sending its sensed data to the subsink so that on further stage, that subsink could provide those data to the sink node whenever it is in nearest proximity of that subsink. Basically, a sink node is the ultimate destination for the data while a subsink node acts as a relay node for the nodes that are within MCA. So our work is to find out the appropriate subsink node from a given set of subsinks. For doing so, we used location-aided routing on global positioning system (GPS)-enabled sensors and sink node. Our work is validated through simulation experiments using NS-2.

This paper proposes a framework to maximize the lifetime of the wireless sensor networks (WSNs) by using a mobile sink when the underlying applications tolerate delayed information delivery to the sink. Within a prescribed delay tolerance level, each node does not need to send the data immediately as it becomes available. Instead, the node can store the data temporarily and transmit it when the mobile sink is at the most favorable location for achieving the longest WSN lifetime. To find the best solution within the proposed framework, we formulate optimization problems that maximize the lifetime of the WSN subject to the delay bound constraints, node energy constraints, and flow conservation constraints. We conduct extensive computational experiments on the optimization problems and find that the lifetime can be increased significantly as compared to not only the stationary sink model but also more traditional mobile sink models. We also show that the delay tolerance level does not affect the maximum lifetime of the WSN.

Wireless sensor networks with the mobile sink can help to prevent the hot-spot problem and improve the network lifetime. However, in practice, the trajectories of the sink can not ideally change due to the obstacle of the environment or the requirement of the application. The constraint on trajectory of the mobile sink causes the different connection time between the mobile sink and the sensor node, which might result in the imbalance depletion of energy. We propose here an efficient data gathering policy to jointly consider the constrained mobility of the sink and the different connection time at the sensor node. The policy increases the network lifetime in wireless sensor networks with path-constrained mobile sink by optimizing the assignment sensor node. In addition, we also propose the policy to cope with the overlapped connection time of the sink and sensor node due to the movement of the sink. The simulation results demonstrate the effectiveness of the proposed policy: by carefully considering the trajectory of the sink and effectively assigning the sensor node, the network lifetime is increased.

In this paper we investigate the benefits of a heterogeneous architecture for wireless sensor networks composed of a few resource rich mobile nodes and a large number of simple static nodes. These mobile nodes can either act as mobile relays or mobile sinks. To investigate the performance of these two options and the trade-offs associated with these two options, we first consider a finite network. We then compute the lifetime for different routing algorithms for three cases (i) when the network is all static (ii) when there is one mobile sink and (iii) when there is one mobile relay. We find that using the mobile node as a sink results in the maximum improvement in lifetime. We contend however that in hostile terrains, it might not always be possible for the sink to be mobile. We then investigate the performance of a large dense network with one mobile relay and show that the improvement in network lifetime over an all static network is upper bounded by a factor of four. Also, the proof implies that the mobile relay needs to stay only within a two hop radius of the sink. We then construct a joint mobility and routing algorithm which comes close to the upper bound. However this algorithm requires all the nodes in the network to be aware of the location of the mobile node. We then proposed an alternative algorithm, which achieves the same performance, but requires only a limited number of nodes in the network to be aware of the location of the mobile. We finally compare the performance of the mobile relay and mobile sink and show that for a densely deployed sensor field of radius R hops, we require O(R) mobile relays to achieve the same performance as the mobile sink.

In wireless sensor networks (WSNs), sensor nodes near static sink will have more traffic load to forward and the network lifetime will get largely reduced. This problem is referred to as the hotspot problem. Recently, adopting sink mobility has been considered as a good strategy to overcome the hotspot problem. Despite its many advantages, due to the dynamic network topology caused by sink mobility, data transmission to the mobile sink is a challenging task. To achieve efficient data dissemination, nodes need to reconstruct their routes toward the latest location of the mobile sink, which weakens the energy conservation aim. In this paper, we proposed an energy-efficient cluster-based dynamic routes adjustment approach (EECDRA) which aims to minimize the routes reconstruction cost of the sensor nodes while maintaining nearly optimal routes to the latest location of the mobile sinks. The network is divided into several equal clusters and cluster heads are selected within each cluster. We also set some communication rules that manage routes reconstruction process accordingly requiring only a limited number of nodes to readjust their data delivery routes toward the mobile sinks. Simulation results show that the mobile sinks for reducing reconstruction of route have improved the energy efficiency and prolonged lifetime of wireless sensor network.

Mobile sink has been a significant means to prolong the lifetime of Wireless Multimedia Sensor Networks (WMSNs). However, the mobility of the sink makes the modeling of the WMSNs lifetime a more complex issue. Considering the new properties introduced by a mobile sink, this paper proposed a novel model to define the lifetime of WMSNs with a mobile sink based on energy by taking into account the heterogeneity, network delay, delay jitter, data rate, and data accuracy. Tunable coefficients were introduced into the model for the balance of energy consumption and functions in the network. Both theoretical analysis and numerical simulation validate the correctness and effectiveness of the proposed model.

Extensive research is being done on Wireless sensor Networks (WSNs) in present decade. WSNs consist of large number of sensor nodes which perform sensing of certain phenomena and send the sensed data to the sinks. This operation consumes energy of sensor nodes which effects the lifetime of a network. To prolong the lifetime of WSNs various strategies and routing algorithms have been proposed. Use of mobile sinks has proved effective in this respect. In this paper we are analyzing the impact of multiple mobile sinks with proactive hierarchical clustering protocols LEACH and network reactive hierarchical protocol TEEN. This paper will give simulation based analysis of using multiple mobile sinks in network and their effect on lifetime of a network. Performance analysis will be done on basis of dead nodes, alive nodes, throughput and residual energy.

ODT: Optimal deadline-based trajectory for mobile sinks in WSN: A decision tree and dynamic programming approach

Approximation algorithms for vehicle-aided periodic data collection from mobile sensors with obstacle avoidance in WSNs

To overcome the limitations of traditional data collection methods in large-scale farmland wireless sensor network, in this study, we introduce a mobile sink and propose a virtual potential field-based strategy for mobile sink path planning. Virtual potential field-based strategy constructs a virtual field based on the residual energy, data generation rate, location information and cache urgency of nodes in the monitoring area. The stronger the virtual field, the more attractive it will be to mobile sink, which consequently affects the mobile path of sink node. Rendezvous points are selected in accordance with the maximum-farthest criterion, and the shortest path connecting all rendezvous points is taken as the mobile path of sink. Furthermore, the monitoring nodes employ the distance probability transmission strategy to have the transmission moment selected and the energy consumption optimized with reference to the path control information sent by the sink. The virtual potential fields and the rendezvous points are recalculated periodically according to the dynamic changes of both the node residual energy and the real-time cache. The simulation results showed that excellent transmission efficiency and network lifetime, and the combination of virtual potential field-based strategy and distance probability transmission strategy can have the fairness and real time of nodes guaranteed, thus it may meet the needs of large-scale farmland data collection.

This paper exploits sink mobility to prolong the network lifetime in wireless sensor networks where the information delay caused by moving the sink should be bounded. Due to the combinational complexity of this problem, most previous proposals focus on heuristics and provable optimal algorithms remain unknown. In this paper, we build a unified framework for analyzing this joint sink mobility, routing, delay, and so on. We discuss the induced subproblems and present efficient solutions for them. Then, we generalize these solutions and propose a polynomial-time optimal algorithm for the origin problem. In simulations, we show the benefits of involving a mobile sink and the impact of network parameters (e.g., the number of sensors, the delay bound, etc.) on the network lifetime. Furthermore, we study the effects of different trajectories of the sink and provide important insights for designing mobility schemes in real-world mobile WNNs.

Data collection is the basic purpose of deploying in heterogeneous WSNs for Internet of things, and the problem of data collection is the key problem that needs to be solved in heterogeneous WSNs. How to collect energy-efficient and reliable data is one of the key technologies of heterogeneous WSNs. Collecting the sensor node data by mobile sink is an effective measure to solve data collection efficiency. To this end, a data collection strategy of mobile sink for heterogeneous WSNs based on pigeon-inspired optimization by PSO algorithm is proposed. The proposed algorithm uses the improved pigeon-inspired optimization by particle swarm optimization algorithm to select the best dwell point and then regards the construction of the moving path based on the dwell point as a traveling salesman problem to optimize the moving path and solve the optimal moving path. The experimental analysis and simulation results show that, compared with other algorithms, the algorithm proposed in this paper can effectively prolong the lifetime of the network and reduce the delay of data collection, increasing the amount of data collection.

The benefits of utilising mobile sinks have been well accepted in various recent research papers. Mobile sinks are entities used for data collection from the sensor nodes in the network. Rather than placing the sink as static which may lead to an earlier demise of the network the mobile sinks in contrast are made to move along the network area. In this paper, we propose usage of multiple mobile sinks that changes their location accordingly to our proposed pathway. The pathway is engineered in a way so that it tries to distribute the load fairly among the sensor nodes in the network thereby intensively increasing the network lifetime. We have considered both constant and adaptive stopping time for sinks and have also formulated a linear programming model which optimises the sensor network lifetime.

Wireless sensor networks (WSNs) are formed using a cluster of sensor nodes (SNs), deployed randomly to perform sensing operations in an area under observation. Due to the unavailability of an external power source, the energy efficiency considered as one of the critical issues in WSNs. Selection of a sensor node (SN) from a wireless sensor network (WSN) cluster to serve as an aggregator or cluster head (CH), considered as an efficient method to increase the lifetime of wireless sensor network (WSN). In this paper, we have proposed an energy efficient CH selection scheme for WSN, to enhance the lifetime and average residual energy of a single WSN cluster. The proposed strategy nominates a group SNs as CHs, based on their channel condition with the base station (BS) and their residual energy. The proposed algorithm is helpful in solving the problem of unbalanced energy consumption in WSNs. Furthermore, the mechanism of using mobile sink during the hand-off stage helps to overcome the delay in data transmission. Moreover, the incorporation of energy harvesting significantly increases the lifetime of WSN. In comparison to a state-of-art technique available in the literature, our scheme shows a 33% increase in lifetime and presents a steady decrease in residual energy for the same rounds of data transmission.