A Rendezvous-Based Approach Enabling Energy-Efficient Sensory Data Collection with Mobile Sinks

Konstantopoulos, Charalampos; Pantziou, Grammati; Gavalas, Damianos; Mpitziopoulos, Aristides; Mamalis, Basilis

doi:10.1109/tpds.2011.237

Cited by 155 publications

(113 citation statements)

References 29 publications

Supporting

Mentioning

113

Contrasting

Order By: Relevance

“…The hotspot problem is minimized as the mobile sink moves higher energy cluster heads. Other numerous techniques, such as multi-hop, virtual MIMO, public transportation marginal value theorem and heuristic algorithms are used for the case when clustering and mobile sink methods are applied to gather data in WSNs [19][20][21][22][23][24].…”

Section: Related Workmentioning

confidence: 99%

An Optimal Data Gathering Method for Mobile Sinks in WSNs

Djuraev

Ahn

2017

Wireless Pers Commun

View full text Add to dashboard Cite

In Wireless Sensor Networks (WSN), energy is one of the most important resources since each node collects, processes and transmits data to its base station. Most of the traditional works in WSNs are consisted of static nodes and one base station. Recently, some mobile data gathering methods are proposed to prolong the operation time of sensor networks. One or more mobile collectors are used to gather sensed data from sensor nodes at short transmission ranges. This paper presents to find optimal visiting points and data gathering path for a mobile sink within clusters. With defining an optimal clustering and data gathering path, this method improves the data collection performance as well as the network lifetime extension of sensor networks. The network lifetime is increased to 20% when sensor nodes are divided into from 4 clusters to 15 clusters.

show abstract

Section: Related Workmentioning

confidence: 99%

An Optimal Data Gathering Method for Mobile Sinks in WSNs

Djuraev

Ahn

2017

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…The parameters of choosing the meeting points are based on [24]. After the reception of candidacies, the mobile sink calculates the cost value of each candidate node according to the algorithm below and sorts it in an increasing order.…”

Section:  Second Trip (Election Of Meeting Points)mentioning

confidence: 99%

Mobility for an Optimal Data Collection in Wireless Sensor Networks

Ez-Zaidi¹,

Rakrak²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Sensor nodes located in the vicinity of a static sink drain rapidly their batteries since they have to carry more traffic burden. This situation results in network partition, holes as well as data losses. To mitigate this issue, many research proposed the use of mobile sink in data collection as a potential solution. However, due to its speed, the mobile sink has very short communication time to pick up all data from the sensor nodes within the network, therefore the sink is forced to return back to gather the remaining data. In this paper, we propose a new data collection scheme that aims to decrease the latency and enlarge the staying time between the mobile sink and the meeting points that buffer data originated from the other sensor nodes. We have also handled the case of urgent data so that they can be delivered without any delay. Our proposed scheme is validated via extensive simulations using NS2 simulator. Our approach significantly decreases the latency and prolongs the contact time between the mobile sink and sensor nodes.

show abstract

“…They claim that simulations show the advantages of using a mobile sink and its influence of the factors like delay and number of nodes. In [10] the authors aim to reduce the energy consumption in multihop data retrieval and balance the energy among the entire sensor nodes which leads to lifetime elongation. Here the cluster heads filter out the redundant data and passes to nodes with residual energy close to mobile sinks.…”

Section: Review Of Literaturementioning

confidence: 99%