Routing Protocol Based on Tabu Search for Wireless Sensor Networks

Semchedine, Fouzi; Bouallouche-Medjkoune, Louiza; Bennacer, Leila; Aber, Naim; Aı̈ssani, Djamil

doi:10.1007/s11277-011-0367-7

Cited by 20 publications

(9 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [10], the authors propose a new routing protocol called the Tabu Search-based Routing Protocol (TSRP), which introduces an implementation of the Tabu search meta-heuristic to avoid nodes previously selected in the routing process of the data from the sensor (that has previously sensed the event) to the sink. TSRP is based on maximizing the cost function, which considers the energy and the visibility of that sensor compared to the sink.…”

Section: Related Workmentioning

confidence: 99%

“…Contrary to the implementation of [10] that uses one bit for each node of the network in the tabu list, in our tabu search, every packet carries the entire ID of a limited number of nodes in the tabu list τ (the last ones, e.g., the last three ones). The number of nodes in a VANET is very dynamic and relatively big, so it is not practical nor possible to use a 0/1 string to encode all of the nodes of a VANET.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Geographical Heuristic Routing Protocol for VANETs

Urquiza-Aguiar

Tripp-Barba

Igartua

2016

Sensors

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation).

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Geographical Heuristic Routing Protocol for VANETs

Urquiza-Aguiar

Tripp-Barba

Igartua

2016

Sensors

View full text Add to dashboard Cite

show abstract

“…In [8], authors use the mechanism of the meta-heuristic Tabu search to select the next hop for routing data based on a cost function that considers the energy and the visibility of the sensor compared to the sink. In [4], authors derive the set of paths to be used by each sensor node and the associated weights that maximize WSNs lifetime by developing a mathematical model for load-balanced systems.…”

Section: Related Workmentioning

confidence: 99%

“…In order to ensure the energy consumption balancing, multi-path routing protocols have been proposed (see for example [4][5][6][7][8]). We have noticed, from literature survey, that this multi-path approach is not really sufficient to balance the energy consumption.…”

mentioning

confidence: 99%

A Cross-Layer Routing Protocol for Balancing Energy Consumption in Wireless Sensor Networks

Yessad

Bouallouche-Medjkoune

Aı̈ssani

2014

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

Energy efficiency and load balancing are known to be critical design concerns in routing protocols in wireless sensor networks. We can achieve the first concern by finding the minimum energy path, while the latter, can be achieved by using multiple sub-optimal paths. In this paper, and for this purpose, we propose a routing protocol that exploits interaction between the MAC layer and the network layer. Our proposal is a simple cross-layer routing protocol that enhances the wireless sensor network lifetime by balancing the energy consumption in the forwarding task. To do so, the MAC layer informs the network layer about all the overheard communications of the neighboring nodes. According to this information, and in order to balance the energy consumption of the forwarding nodes, a node chooses its next hop among the less-used ones. Hence, the choice of the next hop is, contrary to existing multi-path routing protocols, not probabilistic and leads to better energy consumption balancing. We have used a mathematical model and simulations to evaluate the performance of our proposal. The final results have shown that our cross-layer routing protocol uses all forwarding nodes in an equitable manner compared to other routing protocols. This enables to avoid the network partitioning and to enhance the network lifetime.

show abstract

“…For instance, the 2-Opt [6] algorithm improves the current solution by replacing two edges with two new ones to reduce the tour length. Other examples are given by Tabu [7], [8] and Genetic [9], [10] algorithms. In this paper, we will compare the solutions provided by the 2-Opt algorithm, a Genetic algorithm and an Hybridation of these last two algorithms, with the optimal one for various configurations.…”

Section: Related Workmentioning

confidence: 99%

Optimized trajectory of a robot deploying wireless sensor nodes

Khoufi

Livolant

Minet

et al. 2014

2014 IFIP Wireless Days (WD)

View full text Add to dashboard Cite

Mobile robots can be used to deploy static wireless sensor nodes to achieve the coverage and connectivity requirements of the applications considered. Many solutions have been provided in the literature to compute the set of locations where the sensor nodes should be placed. In this paper, we show how this set of locations can be used by a mobile robot to optimize its tour to deploy the sensor nodes to their right locations. In order to reduce both the energy consumed by the robot, its exposure time to a hostile environment, as well as the time at which the wireless network becomes operational, the optimal tour of the robot is this minimizing the delay. This delay must take into account not only the time needed by the robot to travel the tour distance but also the time spent in the rotations performed by the robot each time it changes its direction. This problem is called the Robot Deploying Sensor nodes problem, in short RDS. We first show how this problem differs from the well-known traveling salesman problem. We then propose an integer linear program formulation of the RDS problem. We propose various algorithms relevant to iterative improvement by exchanging tour edges, genetic approach and hybridization. The solutions provided by these algorithms are compared and their closeness to the optimal is evaluated in various configurations.

show abstract

Routing Protocol Based on Tabu Search for Wireless Sensor Networks

Cited by 20 publications

References 17 publications

A Geographical Heuristic Routing Protocol for VANETs

A Geographical Heuristic Routing Protocol for VANETs

A Cross-Layer Routing Protocol for Balancing Energy Consumption in Wireless Sensor Networks

Optimized trajectory of a robot deploying wireless sensor nodes

Contact Info

Product

Resources

About