A delay-bound efficient path design algorithm for mobile sink in wireless sensor networks

Mishra, Madhvi; Nitesh, Kumar; Jana, Prasanta K.

doi:10.1109/rait.2016.7507878

Cited by 22 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, several algorithms have been proposed (Gu et al, 2013;Ghafoor et al, 2014b;Mishra et al, 2016;Komal et al, 2016;Almi'ani et al, 2016;Anne and Rajsingh, 2014;Bi et al, 2009) for path design of MS based on random mobility (Xing et al, 2008a) and controlled mobility (Gu et al, 2013). In random mobility, the MS moves randomly through the network, whereas a fixed path is followed in the controlled mobility.…”

Section: Related Workmentioning

confidence: 99%

Convex hull based trajectory design for mobile sink in wireless sensor networks

Kumar

Jana

2019

IJAHUC

Self Cite

View full text Add to dashboard Cite

Data collection through mobile sink (MS) is an efficient solution to solve hotspot or sinkhole problem which is usually caused by data collection using a static sink. In this paper, we propose an algorithm for designing a delay bound path for MS which is based on convex hull and therefore we refer it a concentric convex hull (CCH) algorithm. For a given set of sensor nodes, the CCH generates a set of convex hull as the potential paths and selects one of them as the final path for MS fulfilling certain optimising criteria. Unlike other existing techniques, the proposed technique does not use travelling sales person (TSP) tour. This, in turn, reduces the hop count and restricts the time complexity of the proposed technique to O(n 2) for n sensor nodes. We simulate the proposed algorithm, compare and analyse the results with some of the existing algorithms over diverse network performance metrics.

show abstract

Section: Related Workmentioning

confidence: 99%

Convex hull based trajectory design for mobile sink in wireless sensor networks

Kumar

Jana

2019

IJAHUC

Self Cite

View full text Add to dashboard Cite

show abstract

“…Dividing sensing field into subareas is proposed in [20,21]. Chen et al [20] introduced algorithm to improve the network lifetime considering data transmission delay and number of hops.…”

Section: Related Workmentioning

confidence: 99%

“…In addition, the hop count is estimated using the distance between the sensor nodes and the BS which is not accurate at low node density (node degree less than six). A delay bound path algorithm is proposed in [21]. The algorithm divided the sensing field into hexagonal cells whose centers are considered as the positions of rendezvous point.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

Jerew

Bassam

2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.

show abstract

“…Recently, data collection through MS have gained much attention among researchers . Some researchers have even suggested to use multiple MSs.…”

Section: Related Workmentioning

confidence: 99%

Minimum spanning tree–based delay‐aware mobile sink traversal in wireless sensor networks

Nitesh

Azharuddin

Jana

2017

Int J Communication

Self Cite

View full text Add to dashboard Cite

Energy efficient data collection in a delay-bound application is a challenging issue for mobile sink-based wireless sensor networks. Many researchers have proposed the concept of rendezvous points (RPs) to design the path for the mobile sink. Rendezvous points are the locations in the network where the mobile sink halts and collects data from the nearby sensor nodes. However, the selection of RPs for the design of path has a significant impact on timely data collection from the network. In this paper, we propose an efficient algorithm for selection of the RPs for efficient design of mobile sink trajectory in delay-bound applications of wireless sensor networks. The algorithm is based on a virtual path and minimum spanning tree and shown to maximize network lifetime. We perform extensive simulations on the proposed algorithm and compare results with the existing algorithms to demonstrate the efficiency of the proposed algorithm of various performance metrics. KEYWORDSWireless sensor networks, mobile sink, rendezvous point, minimum spanning tree, delay-bound path, network lifetime 1 Int J Commun Syst. 2017;30:e3270.wileyonlinelibrary.com/journal/dac

show abstract

A delay-bound efficient path design algorithm for mobile sink in wireless sensor networks

Cited by 22 publications

References 17 publications

Convex hull based trajectory design for mobile sink in wireless sensor networks

Convex hull based trajectory design for mobile sink in wireless sensor networks

Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

Minimum spanning tree–based delay‐aware mobile sink traversal in wireless sensor networks

Contact Info

Product

Resources

About