A tabu search algorithm for routing optimization in mobile ad-hoc networks

Jang, Kil-Woong

doi:10.1007/s11235-011-9428-1

Cited by 13 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several works apply tabu search as a centralized optimization technique to solve different problems arising in MANETs, like network configuration, traffic routing, etc. [28,29]. Concerning packet forwarding, a tabu-based routing protocol for sensor networks is proposed in [30].…”

Section: Related Workmentioning

confidence: 99%

Location Dynamic Tabu Routing Protocol for MANETs

et al. 2021

View full text Add to dashboard Cite

Mobile Ad-Hoc Networks are currently experiencing a second youth in terms of research interest as well as providing benefits to our society. Clearly, this has been fostered by the wide range of applications that have become actually feasible thanks to the pervasive and increasing presence of smartphones, drones, sensors and other small devices with communication and sensing capability. Aiming to deploy solutions able to self-organize without the need for any infrastructure support, packet routing remains an open and critical research problem. Several routing solutions have been conceived to guarantee delivery and low overhead in this context. A promising approach, trying to limit the information needed and stored in the network, is represented by stateless solutions, a class of solutions not relying on topology state information. However, since they exploit local knowledge, the achieved performance in terms of packet delivery and latency is not always up to expectations. To this aim, we propose a dynamic routing protocol based on a tabu search approach, relying on local network knowledge and in-packet short-term memory to alleviate the local minima problem. A through experimental assessment is conducted, measuring protocol performance under different configurations and profiles, evidencing its benefits.

show abstract

Section: Related Workmentioning

confidence: 99%

Location Dynamic Tabu Routing Protocol for MANETs

et al. 2021

View full text Add to dashboard Cite

show abstract

“…In fact, they used the Tabu search method for routing in WSNs to find the near optimal path. In (Ang, 2012) the authors proposed a routing optimization algorithm to determine an optimal path from a source to a destination in mobile ad-hoc networks. The proposed algorithm is designed by using a Tabu search, where two moves are used to find the neighbourhood nodes to determine an optimal path with minimal cost.…”

Section: Related Workmentioning

confidence: 99%

A dynamic heuristic for WSNs routing

Tounsi

2021

Cogent Engineering

View full text Add to dashboard Cite

One of the most important issues in the wireless sensor networks (WSNs) is nodes energy. The routing protocols as well as nodes management are considered as the key elements to improve a network's lifetime. In this research, we have suggested a dynamic heuristic for new nodes selection that manages efficiently the active nodes using a Tabu Node Selection coupled with minimum spanning tree routing protocol (TNS). Minimizing the total energy consumption in WSN, is not enough alone, since some nodes drain their energy faster than others, and may cause network failure. To balance the energy consumption, our strategy is to identify nodes with high-energy depletion and balance data routing on their neighbours. This approach performs nodes energy balancing, by creating lists of Tabu nodes (periodically inactive nodes). Such a scheme will prevent the most used nodes, such as nodes close to the base station to see their energy drain. The nodes in the Tabu lists will dynamically be active according to the energy level of nodes surrounding them. Our new dynamic heuristic has proven to outperform other nodes management approach which does not use Tabu search. The experiments show that Tabu list combined with Minimum Spanning Tree routing protocol extend drastically the network lifetime by balancing optimally the nodes energy.

show abstract

“…DDOR maintains the position information of data destination by unicasting destination discovery mechanism without using any location service. Furthermore, Author in [20] proposed a routing optimization algorithm to efficiently determine an optimal path from a source to a destination.…”

Section: A Vanet Routingmentioning

confidence: 99%

Data Dissemination of Application Service by Using Member-Centric Routing Protocol in a Platoon of Internet of Vehicle (IoV)

2019

View full text Add to dashboard Cite

In this paper, we proposed routing protocols for transmission over VANET in a platoon of vehicles that are driving together on the highway from the same starting point with the same route, and going to the same destination. The purpose of the routing protocols is to have cooperative video streaming service for a specific platoon member, i.e., it belongs to multiple-source to single-destination transmission. We considered two strategies that route data from multiple-source to single-destination. The first one is the severalty strategy in which each data source forwards packets through a route that contains common nodes of other paths as few as possible. The severalty strategy tries to increase the reliability of the route from source to destination and to achieve load balance by Helper-disjoint algorithm. The another strategy is the merged strategy which merges multiple traffic flows passing some specific nodes together. The main purpose of merged strategy tries to reduce the probability of collision while wireless resource are competing to forward data simultaneously and to increase the utilization of DSRC. In this paper, we proposed On-Demand Member-Centric Routing (OMR) protocol using the severalty strategy and Reactive Member-Centric Routing (RMCM) protocol using the merged strategy. Based on the simulation results, our proposed member-centric routing protocols effectively improve the packet delivery ratio and throughput compared with using others in the aforementioned platoon scenario over VANET.INDEX TERMS VANET, routing protocol, on-demand, Internet of Vehicle (IoV), data dissemination.

show abstract

A tabu search algorithm for routing optimization in mobile ad-hoc networks

Cited by 13 publications

References 26 publications

Location Dynamic Tabu Routing Protocol for MANETs

Location Dynamic Tabu Routing Protocol for MANETs

A dynamic heuristic for WSNs routing

Data Dissemination of Application Service by Using Member-Centric Routing Protocol in a Platoon of Internet of Vehicle (IoV)

Contact Info

Product

Resources

About