Time-Domain Greedy Heuristic Approximation Algorithm for Multi-channel Assignment in Wireless Mesh Network

A wireless Mesh network is a multi-radio network with the uncertainty of node heterogeneity. This paper proposed a multi-channel allocation algorithm based on Time-Domain Greedy heuristic approximation algorithm. The main idea of this algorithm is to make use of the characteristics of different chan...

Full description

Saved in:
Bibliographic Details
Published in:CyberC 2017 : proceedings, 2017 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery : Nanjing, China 12-14, October 2017 pp. 113 - 117
Main Authors: Wei-wei, Zhang, Jia-feng, He, Guo-wang, Gao, Li-li, Ren, ShenXuan-jing
Format: Conference Proceeding
Language:English
Published: IEEE 01.10.2017
Subjects:
greedy heuristic approximation algorithm
multi channel allocation algorithm
wireless mesh network
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract A wireless Mesh network is a multi-radio network with the uncertainty of node heterogeneity. This paper proposed a multi-channel allocation algorithm based on Time-Domain Greedy heuristic approximation algorithm. The main idea of this algorithm is to make use of the characteristics of different channels to work at the same time, withoutinterference withanother channel. It considers the different interfaces in the geographically distributed channels. The channel assignmentallows time slot to be allocated in parallel. This not only can improve the overall throughput of the whole network, but also can reduce the other overhead that caused by the time of channel reallocation and channel changes. The simulation results show that the algorithm is improved on the basis of the original, and achieves the desired effect.
AbstractList A wireless Mesh network is a multi-radio network with the uncertainty of node heterogeneity. This paper proposed a multi-channel allocation algorithm based on Time-Domain Greedy heuristic approximation algorithm. The main idea of this algorithm is to make use of the characteristics of different channels to work at the same time, withoutinterference withanother channel. It considers the different interfaces in the geographically distributed channels. The channel assignmentallows time slot to be allocated in parallel. This not only can improve the overall throughput of the whole network, but also can reduce the other overhead that caused by the time of channel reallocation and channel changes. The simulation results show that the algorithm is improved on the basis of the original, and achieves the desired effect.
Author Jia-feng, He
ShenXuan-jing
Guo-wang, Gao
Wei-wei, Zhang
Li-li, Ren
Author_xml – sequence: 1
  givenname: Zhang
  surname: Wei-wei
  fullname: Wei-wei, Zhang
  organization: Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
– sequence: 2
  givenname: He
  surname: Jia-feng
  fullname: Jia-feng, He
  organization: 31693 Troop, PLA, Haerbin, China
– sequence: 3
  givenname: Gao
  surname: Guo-wang
  fullname: Guo-wang, Gao
  organization: Coll. of Electron. Eng., Xi'an Shiyou Univ., Xi'an, China
– sequence: 4
  givenname: Ren
  surname: Li-li
  fullname: Li-li, Ren
  organization: Changchun Normal Univ., Changchun, China
– sequence: 5
  surname: ShenXuan-jing
  fullname: ShenXuan-jing
  organization: Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
BookMark eNotj7FOwzAURY0EErR0ZWHxDyQ823GajFGAFqmFpYixcpLn1iWxK9sV7d8TCaajuxzdMyHX1lkk5IFByhiUT_WlQV-nHNg8LYsrMmFSFDnnUPJbMgvhAACszAsJ_I4cNmbA5NkNyli68IjdhS7x5E2IpqXV8ejd2QwqGmdp1e-cN3E_UO08XZ_6aJJ2r6zFnlYhmJ0d0EY6ir6Mxx5DoGsMe_qO8cf573tyo1UfcPbPKfl8fdnUy2T1sXirq1Vi2FzGpMsLIRRDkFyzrFM47kyD1KUoNOZKdl3LmzYTDWvmLSrkwMc8ITNQqJUUU_L45zWIuD368b6_bAsuQWRS_AJjVVmg
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CyberC.2017.98
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 1538622092
9781538622094
EndPage 117
ExternalDocumentID 8250345
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i175t-d6833a1e052f14dae6834f05f938fe6a5ddc2bc43b1b7ceae2028623540aefa53
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000426448100020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:20:49 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-d6833a1e052f14dae6834f05f938fe6a5ddc2bc43b1b7ceae2028623540aefa53
PageCount 5
ParticipantIDs ieee_primary_8250345
PublicationCentury 2000
PublicationDate 2017-Oct.
PublicationDateYYYYMMDD 2017-10-01
PublicationDate_xml – month: 10
  year: 2017
  text: 2017-Oct.
PublicationDecade 2010
PublicationTitle CyberC 2017 : proceedings, 2017 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery : Nanjing, China 12-14, October 2017
PublicationTitleAbbrev CYBERC
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001968502
Score 1.6474317
Snippet A wireless Mesh network is a multi-radio network with the uncertainty of node heterogeneity. This paper proposed a multi-channel allocation algorithm based on...
SourceID ieee
SourceType Publisher
StartPage 113
SubjectTerms greedy heuristic approximation algorithm
multi channel allocation algorithm
wireless mesh network
Title Time-Domain Greedy Heuristic Approximation Algorithm for Multi-channel Assignment in Wireless Mesh Network
URI https://ieeexplore.ieee.org/document/8250345
WOSCitedRecordID wos000426448100020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07b8IwELYAdehEW0B9y0PHGkIc5zEiWtShRQytxIb8uEAqCFUIVfn3PScpqFKXbnGGRLqzz9_Z33dHyJ3rBm5sqToQCYd5oaeZ8oVgIccJpBGhy7Jk_nMwHofTaTSpkfu9FgYACvIZdO1jcZdv1nprj8p6mM043BN1Ug8Cv9RqHc5TIj8UlqzTqcpo9oY7BdnQsreCbhT-6p5SbB6j5v9-e0LaBxUenez3l1NSg_SMNH_aMNBqVbbIu5VxsIf1CpN8ank0ZkefYFuWYKYDWzT8KykVinSwnK-zJF-sKIJVWqhvmdX-prCk6KlkXpADKH7I0mKXGAbpC2wWdFyyxdvkbfT4OnxiVQsFliAuyJnx0eiyD45w475nJODYix0RRzyMwZfCGO0q7XHVV4EGCS7iDUREiOMkxFLwDmmk6xTOCQWuMBaGygSxzQK9yFdcG1zvkisMe_EFaVnTzT7KKhmzymqXf7--IsfWMSUt7po08mwLN-RIf-bJJrstXPsNqBGnyQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8JAEN0gmugJFYjf7sGjhdLu9uNIUIIRGg6YcCO77RRqoDWlGPn3zrYVYuLFW7eHNpnZnX2z-94MIQ-GYRuhouqAy3WNOczXpMW55pg4gXxE6KIomT-0Pc-ZTt1xhTzutDAAkJPPoKUe87v8IPE36qisjdmMbjJ-QA45Y4ZeqLX2Jyqu5XBF12mWhTTbva2EtKf4W3bLdX71T8m3j37tfz8-JY29Do-OdzvMGalAfE5qP40YaLku6-RdCTm0p2SFaT5VTJpgSwewKYow064qG_4VFRpF2l3OkzTKFiuKcJXm-ltNqX9jWFL0VTTP6QEUP6SIsUsMhHQE6wX1Cr54g7z1nye9gVY2UdAiRAaZFlhodtEBnRthhwUCcMxCnYeu6YRgCR4EviF9ZsqOtH0QYCDiQEyESE5AKLjZJNU4ieGCUDAlRkNHBnao8kDmWtL0A1zxwpQY-MJLUlemm30UdTJmpdWu_n59T44Hk9FwNnzxXq_JiXJSQZK7IdUs3cAtOfI_s2id3uVu_gaKl6sQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=CyberC+2017+%3A+proceedings%2C+2017+International+Conference+on+Cyber-Enabled+Distributed+Computing+and+Knowledge+Discovery+%3A+Nanjing%2C+China+12-14%2C+October+2017&rft.atitle=Time-Domain+Greedy+Heuristic+Approximation+Algorithm+for+Multi-channel+Assignment+in+Wireless+Mesh+Network&rft.au=Wei-wei%2C+Zhang&rft.au=Jia-feng%2C+He&rft.au=Guo-wang%2C+Gao&rft.au=Li-li%2C+Ren&rft.date=2017-10-01&rft.pub=IEEE&rft.spage=113&rft.epage=117&rft_id=info:doi/10.1109%2FCyberC.2017.98&rft.externalDocID=8250345