Shortest Path Discovery for Area Coverage (SPDAC) Using Prediction-Based Clustering in WSN

Abhilash, C. N.; Manjula, S H; Tanuja, R; Venugopal, K. R.

doi:10.1007/978-981-15-3514-7_101

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors contend that the suggested method provides a better quality of service than existing algorithms, which while improving network lifetime and other parameters, do not provide a good quality of service. The paper [18] proposes a method SPDAC (Shortest Path Discovery for Area Coverage).The proposed method uses the concept of strategic node deployment to reduce the routing trajectory of mobile relay nodes.Aside from that, the authors have developed a prediction-based clustering strategy for energy usage as an addition (PCP-EC). The proposed algorithms, according to the authors, extend the node's life.…”

Section: Related Workmentioning

confidence: 99%

Optimization of sink sojourn time for enhancing the lifetime of wireless sensor network

Vagini¹,

Kumar²

2022

ijhs

View full text Add to dashboard Cite

Reducing the energy holes by using multiple mobile sinks and reducing the one hop sensor energy consumption is one of the important research issues in wireless sensor network. The proposed work focus on deploying multiple mobile sinks to move across a predetermined trajectory for data collection. The network area is divided into triangular partitions and the mobile sinks are allowed to move along triangular partitions. The work proposes a clustering protocol to form data collection trees. The contribution is extended further by formulation an optimization model for improvising the sensor network lifetime. The mobile sinks are allowed to travel along the predetermined trajectory and stop at each sojourn location for an optimal time location. The optimization model considers the one hop residual energy and energy consumption of the individual sensor. Simulation experiments showcase better performance of the proposed work in comparison with existing model.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimization of sink sojourn time for enhancing the lifetime of wireless sensor network

Vagini¹,

Kumar²

2022

ijhs

View full text Add to dashboard Cite

show abstract

“…This process is energy starving, time-consuming and costly for the resource-limited networks specifically WSNs and IoTs. A greedy approach enabled algorithm was used to develop a uniform load balancing to spread the traffic uniformly and enhances overall lifetime of the networks [16]. In the same way, Zheng et al, [17,18], proposed a new scheme by computing the transmission capabilities for every sensing device Ci by their neighboring devices based on processing cost, hop count Hc, residual energy Er and round trip time (RTTi).…”

Section: Related Workmentioning

confidence: 99%

An Efficient Smart Weighted and Neighborhood-enabled Load Balancing Scheme for Constraint Oriented Networks

Almaiah¹

2020

IJACSA

View full text Add to dashboard Cite

In Wireless Sensor Networks (WSNs), uniform load or traffic distribution strategy is one of the main challenging issues, which is tightly coupled with the resource-limited networks. To address this problem, various mechanisms have been developed and presented in the literature. However, these approaches were either application specific that is designed for a specific application area such as smart building or overlay complex. Therefore, a simplified and energy efficient loadbalancing scheme is always needed for the resource-limited networks. In this paper, an efficient and neighborhood-enabled load-balancing scheme is presented to resolve the aforementioned issues specifically with available resources. For this purpose, the proposed scheme bounds every member node to collect various information about neighboring nodes i.e., those nodes resides in its communication range. Moreover, if residual energy Er of sensor node is less than the defined threshold value then it shares this information with neighboring nodes. In the proposed neighborhood-enabled load balancing scheme, every sensor node Ci prefers to route packets through the optimal paths particularly those paths where probability of critical nodes is negligible i.e., path where critical node(s) are not deployed. Simulation results showed that the proposed neighborhoodenabled load-balancing scheme is better than existing approaches in terms of network lifetime (both individual node and whole WSNs), throughput, and average packet delivery ratio and endto-end delay performance metrics.

show abstract

A distributed energy-efficient coverage holes detection and recovery method in wireless sensor networks using the grasshopper optimization algorithm

Hallafi

Barati

2022

J Ambient Intell Human Comput

View full text Add to dashboard Cite

Shortest Path Discovery for Area Coverage (SPDAC) Using Prediction-Based Clustering in WSN

Cited by 3 publications

References 18 publications

Optimization of sink sojourn time for enhancing the lifetime of wireless sensor network

Optimization of sink sojourn time for enhancing the lifetime of wireless sensor network

An Efficient Smart Weighted and Neighborhood-enabled Load Balancing Scheme for Constraint Oriented Networks

A distributed energy-efficient coverage holes detection and recovery method in wireless sensor networks using the grasshopper optimization algorithm

Contact Info

Product

Resources

About