An enhanced geographical routing protocol based on multi-criteria decision making method in mobile ad-hoc networks

Kim, Beom-Su; Ullah, Sana; Kim, Kyong Hoon; Roh, Byeong‐hee; Ham, Jae-Hyun; Kim, Ki-Il

doi:10.1016/j.adhoc.2020.102157

Cited by 26 publications

(15 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MCDM‐GPR 34 : The MCDM is an operations analysis that specifically seeks maximum outcomes in diverse situations with multiple metrics, overlapping priorities and parameters. The MCDM approach calls for a robust decision‐making mechanism by concurrently weighing multiple variables.…”

Section: Simulation and Resultsmentioning

confidence: 99%

“…Different kind of issues like link loss, congestion loss and network loss were not solved by this existing method like GRP and their variations because they utilize only one metric for routing scheme. So multimetric GRP has been developed by Kim et al 34 to solve those issues. Based on the network conditions, most of the techniques cannot adaptively modify their forwarding schemes because they are not succeeding to define the priorities or relationship among multiple metrics.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Geographic routing with hybrid firefly algorithm and galactic swarm optimization for efficient ‘void’ handling in mobile ad hoc networks

Kaliyamurthi

Anandhakumar

2020

Int J Communication

View full text Add to dashboard Cite

Summary Geographic routing in mobile ad hoc network (MANET) has gained much attention even though it fails to find a route when a node meets a void zone (hole). Therefore, an efficient approach is required to avoid the void issues and to effectively transfer the data packets if a path is available between the source and destination nodes. For such, a hybrid evolutionary algorithm is introduced with geographical routing protocol (GRP) for avoiding the void, which selects the shortest route for routing from the source to the destination by combining firefly (FF) algorithm and galactic swarm optimization (HFFGSO). This proposed algorithm exploits the strengths of both the FF algorithm and galactic swarm mechanisms. In this paper, the cross‐layer design approach is implemented, which contains data link and network layer. The proposed hybrid FFGSO‐GRP algorithm improves the routing process within these layers. The implementation process for this proposed technique is carried out in NS2 simulator. From the simulation results, it is observed that our hybrid protocol when compared with the existing approaches proves its significance in terms of packet delivery ratio (PDR), delay, throughput, energy efficiency, power consumption, routing overhead and hop count.

show abstract

Section: Simulation and Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Geographic routing with hybrid firefly algorithm and galactic swarm optimization for efficient ‘void’ handling in mobile ad hoc networks

Kaliyamurthi

Anandhakumar

2020

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The actual route function determines the probability of previously sending and receiving history direction. The proposed routing protocol is the weighted sum of the node resending and receiving functions works based on the routing protocol and their steps [28] [29] [30] [68].…”

Section: Figure 2 Activities Of Attacker Detection Automation Of Beesmentioning

confidence: 99%

“…The routing protocol of mobile nodes algorithmically mentions late detection. Commonly in the critical situation, mobile nodes share the critical messages over the network by the data-transfer application by using the end-to-end communication [28] [30] [32]. From this consideration, this research takes the survey based on the beneficial two side communication such as node to node communication and node to controller communication.…”

Section: Mechanism Against the Late Detectionmentioning

confidence: 99%

Intelligent route discovery towards rushing attacks in ad hoc wireless networks

Allimuthu

Mahalakshmi

2021

J Ambient Intell Human Comput

View full text Add to dashboard Cite

MANET (Mobile Ad-hoc Networks) are distributed or delegated away from a central server, authoritative location of wireless networks that communicate without pre-existing structure. Ad-hoc networks are compromising the many types of attacks and routing. In MANET, the routing plays a vital role in terms of packets interaction and data transmission. Due to decentralized control, the MANET data transmission becomes insecure because of dispersed routing on the mobile ad-hoc nodes. Since the efficient route on MANET only controls the packets and does not simplify the route between the source to the destination, the maintenance of route interaction becomes a crucial process. Maintain effective data transactions over the MANET network, and it is essential to improve the route and locate the attacker. Nevertheless, MANET allows for route interaction against security threads. In this research article, four processing schemes are suggested to preserve the security measures against routing protocols. Especially in node communication, the rushing attacker has a significant impact on packet-based data transmission in MANET. Also, for this research, an Attacker detection automation of the Bees Colony Optimization (ADABCP) method is used, as a result of which the desired result is brought about in the effective attacker detection on the routing process. Moreover, the proposed Hybrid Random Late Detection (HRLD) routing protocol manages the MANET routing and overcomes the MANET congestion communication. The Swift Implicit Response Round Trip Time (SIRT) mechanism is generated by the Route Finding Manipulation (RFM) to enhance the performance. This RFM scheme helps to find the optimal routing in a secured manner. The proposed (SIRT-ADABCP-HRLD) approach was compared to the existing ESCT, ZRDM-LFPM, and ENM-LAC approaches, found to have improved by routing and data transmission. Compared to the conventional method, the method mentioned above achieves a better ratio for the end-to-end delay, communication overhead, packet delivery ratio, network lifetime, and energy consumption.

show abstract

“…It is high on energy, has less tendency to move out of the anycast region, is located closer to its center, and is circumscribed by a neighbor who generally extends cooperation as far as forwarding packets' activity is concerned. They should be selfless enough to perform area-wide broadcasting 7,13,14 so that the selected destination can conveniently propagate the message it has obtained from the anycast source. Directional flooding with an optimally minimum number of transmissions and invasions has been applied in this article.…”

Section: Introductionmentioning

confidence: 99%

Autoregressive moving average based anycast with support vector machine clustering in mobile ad‐hoc networks

Ghosh¹,

Banerjee

Sufian

et al. 2021

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Nodes in mobile ad-hoc networks (MANETs) are battery-powered, therefore, need energy-efficient techniques to cut down the cost of energy consumption. Energy consumption is directly related to route discovery, which could be reduced through anycasting. Anycast is an operation in MANETs, where the source sends messages to one particular destination node of anycast region.In general, the message transmitted is divided into certain packets, and those are transmitted continuously one after the other through selected routes. If the link from anycast source to destination breaks in between or an anycast destination goes out of the anycast region, in that case, a new anycast destination will have to be selected on a new route to the destination. This will incur huge message costs and energy. In this work, we select desirable anycast destinations based on their eligibility by using autoregressive moving average and support vector machine. Eligibility is modeled as a function of residual energy, location, the relative velocity concerning neighbors, and the number of packets successfully forwarded earlier by those neighbors' locations. Reducing the number of anycast receivers reduces the message cost of protocols significantly. We have compared our protocol's performance with the same of anycast-AODV, anycast-DSR, anycast-FAIR, and MQAR (mobility and QoS-aware anycast routing protocol) results show significant improvement. Collective improvement amounts to 89% more energy preservation and 39% delay on average.

show abstract

An enhanced geographical routing protocol based on multi-criteria decision making method in mobile ad-hoc networks

Cited by 26 publications

References 24 publications

Geographic routing with hybrid firefly algorithm and galactic swarm optimization for efficient ‘void’ handling in mobile ad hoc networks

Geographic routing with hybrid firefly algorithm and galactic swarm optimization for efficient ‘void’ handling in mobile ad hoc networks

Intelligent route discovery towards rushing attacks in ad hoc wireless networks

Autoregressive moving average based anycast with support vector machine clustering in mobile ad‐hoc networks

Contact Info

Product

Resources

About