On the Optimal Size of Ring-canal in Starfish Routing

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

doi:10.1109/iciev.2019.8858535

Cited by 3 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2(a). To ensure the efficiency of the Starfish routing backbone, an optimal radius of the ring-canal R is estimated proportionally to the maximum number of radialcanals using mixed-integer linear programming (MILP), as explained in Lemma 1, in the light of our another work in [46]. Then the ring-canal nodes Z ⊂ N are selected over the reference circle (having radius R) every r distance interval.…”

Section: (B)mentioning

confidence: 99%

“…}. This choice is motivated by the fact that data collection over the optimal size of the ring-canal (of Starfish routing backbone [29] ) offers minimum energy expenditure in the network, in the light of our earlier work in [46]. Moreover, the computational complexity of finding optimal sojourn locations over ring-canal nodes would be less compared to that when all nodes are explored.…”

Section: Data Collection Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: (B)mentioning

confidence: 99%

Section: Data Collection Schedulingmentioning

confidence: 99%