2020 7th International Conference on Computing for Sustainable Global Development (INDIACom) 2020
DOI: 10.23919/indiacom49435.2020.9083710
|View full text |Cite
|
Sign up to set email alerts
|

Computation Termination and Malicious Node Detection using Finite State Machine in Mobile Adhoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…Further survey on various recent approaches related to malicious node detection and termination in MANET leads to a study by authors in [30] that introduced a distinct approach of computation termination of cluster head election mechanism and also employ a security mechanism based on Finite State Machines (FSM) to identify and mitigates threats in MANET. Another approach by the author in [31] also mechanized a security approach which can assist in safeguarding the information during distributed routing of MANET.…”
Section: Global Reputation Systemmentioning
confidence: 99%
“…Further survey on various recent approaches related to malicious node detection and termination in MANET leads to a study by authors in [30] that introduced a distinct approach of computation termination of cluster head election mechanism and also employ a security mechanism based on Finite State Machines (FSM) to identify and mitigates threats in MANET. Another approach by the author in [31] also mechanized a security approach which can assist in safeguarding the information during distributed routing of MANET.…”
Section: Global Reputation Systemmentioning
confidence: 99%
“…The following algorithm depicts the importance of load balancing for deciding the controlling node. Though the controlling node manages the proportionate of load among all the nodes, still the nodes keep on changing its location in the region of high load and low load band, due to this the problems arises in the formation of ring [6][7][8].…”
Section: State-of-the-art Scenariomentioning
confidence: 99%
“…The power cost is given by {(Cx, y) = Qtransmit(nx, ny) + Cost(ny) + Qtransceiver(nx)}nx, ny are nodes (7) The term Qtransmit (nx,ny) is the transmitter power of node x to reach node y and Qtransceiver(nx) selects the route with small quantum of number of hops and is the transceiver power of node j. The cost function at node "nx" is given by cost…”
Section: Least Power Consumption Routingmentioning
confidence: 99%