Evaluation function effectiveness in Wireless Sensor Network routing using A-star algorithm

Septiana, Risma; Soesanti, Indah; Setiawan, Noor Akhmad

doi:10.1109/citsm.2016.7577519

Cited by 7 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After cluster head is selected, it is optimized by A-Star algorithm. In research [12], the value of h(n) uses estimation, but in in the present research it is in form of real value based on consideration of a number of parameters. In the present research, fuzzy was used to figure out the heuristic value of h(n) so the value accuration of A-Star was no longer an estimation but a certain value from the used parameters in this research.…”

Section: Research Frameworkmentioning

confidence: 99%

“…The result of the simulation indicated that the effectiveness of the new method was related to the random extension of the lifetime of the wireless sensor network with node. Septiana et al [12] concluded that the process of finding the optimum route in Wireless Sensor Networks routing technique using algorithm A-Star is much dependent on heuristic function. Evaluation function will be more effective if the function has more than one heuristic function.…”

Section: Research Frameworkmentioning

confidence: 99%

“…In which the algorithm employs assumption value h(n) as the heuristic value from the sensor node to sink [12]. This research attempted to develop A-Star algorithm from heuristic value assisted by fuzzy algorithm to fill in the weight value of sensor node which had been calculated by fuzzy.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Wireless Sensor Network Energy Efficiency with Fuzzy Improved Heuristic A-Star Method

Soijoyo¹,

Wardoyo²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Energy is a major factor in designing wireless sensor networks (WSNs). In order to extend the network lifetime, researchers should consider energy consumption in routing protocols of WSNs. Routing will serve to facilitate a number of sensors on the technology of WSNs to identify the optimal path and manage energy consumption saving at the time of transmitting data. Current Wireless Sensor Networks efficiency system uses node selection as the main parameter without applying path finding routing. It will not complete the optimization of energy. This research was designed to address the problem of energy optimization by using fuzzy-improved heuristic A-Star. A new algorithm named improved heuristic AStar was developed from previous A-Star algorithm. The result of fuzzy-improved heuristic A-Star indicated node sensor to sink destination saved 0.3698 joule energy dissipation which resulted in longer lifetime.

show abstract

Section: Research Frameworkmentioning

confidence: 99%

Section: Research Frameworkmentioning

confidence: 99%

See 1 more Smart Citation

Wireless Sensor Network Energy Efficiency with Fuzzy Improved Heuristic A-Star Method

Soijoyo¹,

Wardoyo²

2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…Although the A* is an old technique, it is still frequently utilized in WSNs. Septiana et al 21 presented an A*-based WSN routing protocol. First, they studied the impact of tuning the A* evaluation function on selecting shortest route.…”

Section: Related Workmentioning

confidence: 99%

Energy‐aware intelligent hybrid routing protocol for wireless sensor networks

Ibrahim

Ahmed

2021

Concurrency and Computation

View full text Add to dashboard Cite

Designing a wireless sensor network (WSN) energy-aware routing protocol is a thought-provoking mission. Thus, this article presents an energy-saving routing protocol for WSNs. The proposed protocol considers the energy level of sensor nodes and the distance to the base station to optimally determine the best route. It also takes advantage of the inherent complementarity of clustering techniques. The proposed routing scheme also exploits data aggregation to improve energy utilization and reduce communication costs. To choose the flawless route between a source node and the base station, ant colony optimization and A* algorithms are integrated. Finally, the performance of the proposed routing technique is compared with those of other existing up-to-date protocols. The results show that the proposed routing protocol outperforms them in terms of total energy consumption, network lifetime, stability period, and goodput.

show abstract

“…Duchon et al in his research stated that the A-Star algorithm is suitable for use in cases where it is necessary to find a path quickly and well in various environments [4]. Septiana et al in his research explained that the optimal path search process in the WSN routing technique using the A-Star algorithm is very dependent on the heuristic function, so that the effectiveness of the evaluation function is increased by adding a heuristic function when searching [5]. Whereas, Wang et al in his research explained that a good path search algorithm is needed in navigating the path of travel, the A-Star algorithm is used to overcome low computation in map navigation and add a hierarchical mechanism to the path search problem [6].…”

Section: Introductionmentioning

confidence: 99%

Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path

Wayahdi

Ginting

Syahputra

2021

Int. J. Adv. Data Inf. Syst.

View full text Add to dashboard Cite

The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem. The purpose of this study is to analyze the Greedy, A-Star, and Dijkstra algorithms in the process of finding the shortest path. The author wants to compare the effectiveness of the three algorithms in the process of finding the shortest path in a path or graph. From the results of the research conducted, the author can conclude that the Greedy, A-Star, and Dijkstra algorithms can be a solution in determining the shortest path in a path or graph with different results. The Greedy algorithm is fast in finding solutions but tends not to find the optimal solution. While the A-Star algorithm tends to be better than the Greedy algorithm, but the path or graph must have complex data. Meanwhile, Dijkstra's algorithm in this case is better than the other two algorithms because it always gets optimal results.

show abstract

Evaluation function effectiveness in Wireless Sensor Network routing using A-star algorithm

Cited by 7 publications

References 21 publications

Wireless Sensor Network Energy Efficiency with Fuzzy Improved Heuristic A-Star Method

Wireless Sensor Network Energy Efficiency with Fuzzy Improved Heuristic A-Star Method

Energy‐aware intelligent hybrid routing protocol for wireless sensor networks

Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path

Contact Info

Product

Resources

About