An Efficient Mobile-Sink Trajectory to Maximize Network Lifetime in Wireless Sensor Network

Habib, Ahsan; Saha, Sajeeb; Nur, Fernaz Narin; Razzaque, Md. Abdur; Mamun-Or-Rashid, Md.

doi:10.1109/ciet.2018.8660848

Cited by 9 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Devising an efficient data collection mechanism is important for increasing the network lifetime and decreasing the end-to-end data collection latency from source nodes to the mobile sink. We have come across a handful of literature works focusing on mobile sink based data collection strategies that are grouped into two categories: direct-contact based [18] (a) Moore-curve [19] (b) Z-curve [20] (c) Spanning-graph [35] (d) VPS [36] (e) LAS [37] (f) Starfish-backbone [38] FIGURE 1: Data collection strategies of a mobile-sink in state-of-the-art works…”

Section: Related Workmentioning

confidence: 99%

“…To mitigate these problems, in rendezvous-node based data collection strategy, a mobile sink collects data from a few rendezvous nodes [22] [23] over a designated tree-like backbone [24] [28], cluster-heads [35] [36] [37] or routing-backbone [29] [38], instead of traveling all source nodes in the network. In the literature, rendezvous-node based strategies have been developed for two varieties of networks: obstacle-free and obstructed-networks.…”

Section: Related Workmentioning

confidence: 99%

“…These works also violate the delay-deadline of realtime applications and increase energy consumption among the sensor nodes significantly. To mitigate these issues, as a preliminary version of this work, we developed the Starfish routing backbone in an obstructed-network [38], as shown in Fig. 1(f).…”

Section: Related Workmentioning

confidence: 99%

“…In [29], we developed a routing backbone following the water vascular process of a sea fish, namely starfish. The work aimed to minimize energy consumption in an obstacle-free sensor network, and later, in our pioneer work [38], it was investigated for an obstructed-network. However, both works have considered the random sink mobility model rather than finding an efficient data collection scheduling based on data arrival rate, sojourn duration at rendezvous nodes, etc.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we offer a novel data collection scheduling for a mobile sink in an obstructed sensor network adopting Starfish routing backbone [29] [38]. The Starfish routing backbone has been developed in our earlier work that spreads backbone nodes throughout the network.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Lifetime Maximization of Sensor Networks Through Optimal Data Collection Scheduling of Mobile Sink

et al. 2020

Self Cite

View full text Add to dashboard Cite

The problem of maximizing lifetime of a sensor network is still challenging mainly due to the stringent delay-deadline of real-time applications and heterogeneity of sensor devices. The problem is further complicated when the network contains many obstacles. In maximizing network lifetime, existing literature works either merely address issues of application delay-deadline and presence of obstacles, or analyze primitive data collection approaches for such an environment. In this paper, we formulate optimal data collection schedule of a mobile sink in an obstructed sensor network as a mixed-integer linear programming (MILP) problem. The proposed data collection scheduling finds an optimal set of rendezvous nodes over a preformed Starfish routing backbone, and corresponding sojourn duration so as to maximize the network lifetime while maintaining delay-deadline constraint in an obstructed network. The proposed Starfish-scheduling ensures a loop-free traveling path for a mobile sink across the network. The results of performance evaluation, performed in network simulator-2, depict the suitability of Starfish scheduling as it outperforms state-of-the-art-works in terms of extending network lifetime and data delivery throughput as well as reducing average end-to-end delay.

show abstract