Applying simulated annealing to joint routing, scheduling and variable-width channel allocation for multi-hop WMNs

Chun-Cheng Lin, Wan Yu Liu, Chun Hung Chou, Der Jiunn Deng

Research output: Contribution to journalConference articlepeer-review

Abstract

This pager studies the joint routing, scheduling, and channel assignment problem in single-radio multi-channel WMNs. All the three subproblems are related to the packet transmission rate: the routing problem is to find the transmission paths for packets; the scheduling problem is to plan the transmission order of packets; the channel assignment problem is related to signal interference and synchronization. The joint problem has been studied in the past, but they can only solve small-scale problems and did not consider the effect of signal interference, so that their methods are not efficient and do not meet the practical scenario. With regards to this, we propose a simulated annealing approach with a new coding scheme that divides time into a number of time slots to model the dynamic process of packets. In addition, this paper demonstrates a variable-bandwidth channel allocation method that achieves a good balance between higher synchronization and better control of interference. Experimental results show that our proposed simulated annealing approach can find the same or similar solutions with the exact methods for the cases with a small number of nodes and low traffic load.

Original languageEnglish
Article number6618620
Number of pages5
JournalInternational Symposium on Wireless Personal Multimedia Communications, WPMC
StatePublished - 24 Jun 2013
Event2013 16th International Symposium on Wireless Personal Multimedia Communications, WPMC 2013 - Co-located with Global Wireless Summit 2013 - Atlantic City, NJ, United States
Duration: 24 Jun 201327 Jun 2013

Fingerprint

Dive into the research topics of 'Applying simulated annealing to joint routing, scheduling and variable-width channel allocation for multi-hop WMNs'. Together they form a unique fingerprint.

Cite this