A Greedy Algorithm Based Overlapping Channel Allocation Method for Wireless Sensor Networks
The wireless sensor network has new nodes joining and nodes leaving at any time,which will lead to frequent changes of net-work topology,inability to obtain complete network topology in advance,overlapping channels,and susceptibility to link conflict prob-lems,resulting in mutual signal interference,thus affecting network transmission performance and data quality.A greedy algorithm based overlapping channel allocation method is proposed for wireless sensor networks.The network topology structure is analyzed,an overlap-ping channel interference model is constructed,and the channel link interference domain is determined.Based on the determined inter-ference domain,constraint conditions are established,and greedy algorithms are used to allocate channels between nodes in the interfer-ence domain.Without changing the allocated channels,unallocated channels are allocated to the interfaces to be allocated,thus achie-ving the overall allocation of overlapping channels in wireless sensor networks.The simulation results show that the maximum average throughput of the proposed method is 225 bit/s,the maximum channel delay is 0.4 s,and the maximum channel utilization is 97.6％.The feasibility of this method has been verified through examples.
wireless sensor networkoverlapping channel allocationgreedy algorithminterference model
万方数据
维普
