In　this　paper　we　have　considered　the　determined　scheduling　problem　for　channel　access　in　wireless　mesh　networks.　The　problem　is　to　assign　time-slots　for　each　node　in　the　network　to　access　the　control　channels　so　that　it　is　guaranteed　that　each　node　can　broadcast　the　control　packet　to　any　one-hop　neighbor　in　one　scheduling　cycle.　The　abjective　is　to　minimize　the　total　number　of　different　time-slots　in　the　scheduling　cycle.　In　the　single-channel　ad　hoc　networks,　the　known　best　result　for　this　problem　is　proved　to　be　(K　2+l)　in　arbitrary　graphs　[2]　and　25K　in　unit　disk　graphs　[16]　with　K　as　the　maximum　node　degree.　In　this　paper　we　have　proposed　two　fully　distributed　algorithms　for　the　determined　scheduling　problem,　namely,　the　One　Neighbor　per　Cycle　(ONPC)　algorithm　and　the　All　Neighbors　per　Cycle　(ANPC)　algorithm.　We　prove　that　the　number　of　time-slots　by　the　second　algorithm　is　upper-bounded　by　2K　in　some　special　case.　The　fully　distributed　versions　of　these　algorithms　are　given　in　this　paper.　Simulation　results　also　show　that　the　performance　of　ANPC　is　rather　better　than　ONPC.