Full metadata record
DC FieldValueLanguage
dc.contributor.authorYen, Li-Hsingen_US
dc.contributor.authorYe, Bo-Rongen_US
dc.date.accessioned2018-08-21T05:56:51Z-
dc.date.available2018-08-21T05:56:51Z-
dc.date.issued2016-01-01en_US
dc.identifier.urihttp://dx.doi.org/10.1109/ICS.2016.95en_US
dc.identifier.urihttp://hdl.handle.net/11536/146730-
dc.description.abstractTo deliver user traffic in a wireless mesh network, mesh stations equipped with multiple wireless interfaces communicate with one another utilizing multiple orthogonal channels. Channel assignment in such an environment is to assign one channel to each interface to minimize co-channel interference among wireless links while preserving link connectivity. The interference and connectivity objectives are generally conflicting. This paper proposes a game-theoretic approach that jointly considers the two objectives with a unified payoff function. We prove that the proposed approach is an exact potential game, which guarantees stability in a finite time. We also prove the link-preserving property of the approach. Simulation results show that the proposed approach generally outperforms counterparts in terms of network interference when a moderate number of channels are available.en_US
dc.language.isoen_USen_US
dc.subjectchannel assignmenten_US
dc.subjectwireless mesh networken_US
dc.subjectinterferenceen_US
dc.subjectconnectivityen_US
dc.subjectgame theoryen_US
dc.titleLink-Preserving Channel Assignment Game for Wireless Mesh Networksen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/ICS.2016.95en_US
dc.identifier.journal2016 INTERNATIONAL COMPUTER SYMPOSIUM (ICS)en_US
dc.citation.spage446en_US
dc.citation.epage451en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000406600300085en_US
Appears in Collections:Conferences Paper