A load-balancing scheme for IEEE 802.11 WLANs based on cooperative game theory is presented.A coalition among the access points（APs） with overlapping coverage is formed to share the network load through a game.First...A load-balancing scheme for IEEE 802.11 WLANs based on cooperative game theory is presented.A coalition among the access points（APs） with overlapping coverage is formed to share the network load through a game.Firstly, the candidate APs submit their load-competing strategies（i.e., the amount of user traffic they can admit in an AC/game period） to the control AP.Secondly, the control AP solves the game by the method of shapley value, which is the maximum traffic allocated to each AP in an AC/game period.Finally, the game is repeated periodically to distribute the traffic load among the APs.Simulation results show that the proposed game can balance the network load effectively compared with the IEEE 802.11 standard balancing solution.展开更多
Discrete Hopfield neural network with delay is an extension of discrete Hopfield neural network.As it is well known,the stability of neural networks is not only the most basic and important problem but also foundation...Discrete Hopfield neural network with delay is an extension of discrete Hopfield neural network.As it is well known,the stability of neural networks is not only the most basic and important problem but also foundation of the network's applications.The stability of discrete HJopfield neural networks with delay is mainly investigated by using Lyapunov function.The sufficient conditions for the networks with delay converging towards a limit cycle of length 4 are obtained.Also,some sufficient criteria are given to ensure the networks having neither a stable state nor a limit cycle with length 2.The obtained results here generalize the previous results on stability of discrete Hopfield neural network with delay and without delay.展开更多
基金supported by the Aviation Science Fund (20080196005)
文摘A load-balancing scheme for IEEE 802.11 WLANs based on cooperative game theory is presented.A coalition among the access points（APs） with overlapping coverage is formed to share the network load through a game.Firstly, the candidate APs submit their load-competing strategies（i.e., the amount of user traffic they can admit in an AC/game period） to the control AP.Secondly, the control AP solves the game by the method of shapley value, which is the maximum traffic allocated to each AP in an AC/game period.Finally, the game is repeated periodically to distribute the traffic load among the APs.Simulation results show that the proposed game can balance the network load effectively compared with the IEEE 802.11 standard balancing solution.
基金supported by China Postdoctoral Science Foundation(2003033516)partly supported by Open Founda-tion of University Key Lab of Information Sciences and Engineering,Dalian University,
文摘Discrete Hopfield neural network with delay is an extension of discrete Hopfield neural network.As it is well known,the stability of neural networks is not only the most basic and important problem but also foundation of the network's applications.The stability of discrete HJopfield neural networks with delay is mainly investigated by using Lyapunov function.The sufficient conditions for the networks with delay converging towards a limit cycle of length 4 are obtained.Also,some sufficient criteria are given to ensure the networks having neither a stable state nor a limit cycle with length 2.The obtained results here generalize the previous results on stability of discrete Hopfield neural network with delay and without delay.
