Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Xiao-Chen Hao is active.

Publication


Featured researches published by Xiao-Chen Hao.


Wireless Personal Communications | 2013

Virtual Game-Based Energy Balanced Topology Control Algorithm for Wireless Sensor Networks

Xiao-Chen Hao; Ya-Xiao Zhang; Nan Jia; Bin Liu

In topology control (TC), game theory is an efficient approach to analyze the conflicting objectives of nodes to enable the topology with certain global properties in the presence of selfish nodes. But in many existing game-based TC algorithms, every node has to make others aware of its changes by transmitting the control information repeatedly, which results in much unnecessary energy waste and network lifetime reduction. To solve the problem, the concept of virtual game is introduced, which virtualizes the game process to avoid the repeated information exchange in the game process. In addition, considering that unbalanced distribution of energy consumption also restricts the network lifetime, a distributed Virtual Game-based Energy Balanced TC algorithm (VGEB) with incomplete information is proposed, which is mathematically analyzed. The analysis results show that the TC virtual game is a potential game and the virtual game algorithm can converge to the state of Nash Equilibrium, which is Pareto Optimal. Moreover, VGEB can easily construct the topology with a low information complexity of O(n) and the induced topology can maintain the network connectivity, where n is the number of nodes in network. Simulation results demonstrate that VGEB can effectively balance the nodes’ energy consumption, greatly reduce the energy waste in the game process and has many other attractive topological features.


Wireless Personal Communications | 2014

Joint Channel Allocation and Power Control Optimal Algorithm Based on Non-cooperative Game in Wireless Sensor Networks

Xiao-Chen Hao; Qian-Qian Gong; Shuang Hou; Bin Liu

In order to reduce the wireless sensor network interference, and balance the network energy consumption, we have established a joint channel allocation and power control optimal game model. The model takes the network interference, and the residual energy of nodes as the parameters. What’s more, the model considers the independent and influencing relation between channel allocation and power control. In addition, we design a joint channel allocation and power control optimal algorithm based on non-cooperative game (JCAPGA), and then prove that JCAPGA converges to Nash equilibrium. Simulation results show that, JCAPGA has a good network performance of lower interference and uniform energy consumption.


Wireless Personal Communications | 2015

Distributed Topology Control and Channel Allocation Algorithm for Energy Efficiency in Wireless Sensor Network: From a Game Perspective

Xiao-Chen Hao; Mei-Qi Wang; Shuang Hou; Qian-Qian Gong; Bin Liu

With the widely use of wireless sensor network (WSN), the network interference, which caused by the rare spectrum resource and the improper topology structure, has greatly hindered the further development of WSN. Due to the vast size of network interference, the retransmission of information and the waste of residual energy of nodes have become a critical concern. Since the energy of WSN is limited, the solution to energy efficiency, interference and network lifetime has become a significant challenge for WSN. In this paper, we design a distributed topology control and channel allocation algorithm from a game perspective in order to alleviate the interference and balance the energy consumption. Firstly, we study the internal relationship between topology control and channel allocation. Based on the relationship, we propose a united game model which considers transmission power, residual energy and node interference. This game model has been proven to guarantee the existence of Nash Equilibrium. Secondly, based on the untied game model, we develop a Distributed Topology Control and Channel Allocation Algorithm (DTCCAA) which ensures network connectivity and converges to Pareto Optimality via adjusting the transmission power and node channel. Thirdly, the simulation results show that the topology obtained by DTCCAA can not only possess the lower inference and more balanced average residual energy, but also have many other attractive network performances such as the stronger robustness, the better real-time and end-to-end delay.


Wireless Personal Communications | 2013

Distributed Cooperative Control Algorithm for Topology Control and Channel Allocation in Multi-radio Multi-channel Wireless Sensor Network: From a Game Perspective

Xiao-Chen Hao; Ya-Xiao Zhang; Bin Liu

With the development of wireless communication technology, the spectrum resource is becoming more and more scarce, which results in the increase of network co-interference and then incurs the increase of data retransmission probability. Hence, the single channel based algorithms are facing a myriad of challenges. Moreover, reducing the energy consumption and prolonging the network lifetime is the key issue for wireless sensor network. In order to alleviate the interference while reducing and balancing the energy consumption, we tend to design a multi-radio multi-channel algorithm that joint the topology control and channel allocation. Firstly, we study the interactions between topology control and channel allocation, which lay the basis for the further reduction of transmission power and interference. We take account of the radio power, node residual energy and node interference to construct a cooperative control game model of topology and channel allocation. This game model has proven to guarantee the existence of Nash equilibrium. And then based on this game model, a distributed Cooperative Control Algorithm of Topology and Channel allocation (CCATC) is developed, which can converge to Nash Equilibrium and preserve the network connectivity. Furthermore, the simulation results demonstrate that CCATC can not only greatly reduce the interference but also prolong the network lifetime by balancing the energy consumption of nodes. The reduction of interference comes with the improvement of network throughput. Besides, CCATC has many other attractive features such as the higher channel utilization, the better robustness, the fairer channel allocation and the less end-to-end delay.


Wireless Personal Communications | 2015

EAPOR: A Distributed, Energy-Aware Topology Control Algorithm Based Path---Obstacle---Remove Model for WSN

Xiao-Chen Hao; Min-Jie Xin; Xiao-Yue Ru

The obstacles existing in the propagation path cause shadow fading. As a consequence, signal’s energy is additionally consumed to overcome the influence incurred by the shadow fading. This situation leads to the unpredictable communication environment in practical application. However, most topology control algorithms ignore the additional energy consumption in the process of appraising links’ communication quality. The topologies based on the ideal signal attenuation model are too ideal to meet the requirements of practical application. In order to obtain a more practical description of the real environment, we structure a new model named path–obstacle–remove model. This model aims at erasing the influence of shadow fading. Thus, it transforms the additional attenuation energy into logic distance between nodes. Besides, considering that the excessive energy consumption of lower-energy nodes restricts the network lifetime, a distributed, energy-aware topology control algorithm based on path–obstacle–remove model (EAPOR) is proposed in this paper. The theoretical analysis demonstrates that the topology constructed by EAPOR is connected and bi-directional. Besides, EAPOR can easily construct the topology with a low message complexity of O(n). The simulation result shows that EAPOR has good performance on robustness and sparseness. Moreover, EAPOR reduces the end-to-end delay and prolongs the network lifetime significantly.


Wireless Personal Communications | 2013

Joint Algorithm of Channel Allocation and Power Control in Multi-channel Wireless Sensor Network

Xiao-Chen Hao; Ya-Xiao Zhang; Nan Jia; Bin Liu

In the wireless sensor network, the interference incurred by another transmitter’s transmission may disturb other receivers’ correct receptions of packets, thus, the add of a new transmission must consider its effect on other transmissions. Additionally, in order to reduce the interference and increase QoS, multi-channel technology is introduced into wireless communication, but the energy cost by the channel switch increases with the interval of channels increasing. Based on the above analysis, we consider an energy efficient joint algorithm of channel allocation and power control (JCAPC) for wireless sensor network. In JCAPC, each link firstly establishes its available channel set on which the transmitter of the link can guarantee its transmission successfully and don’t disturb other receivers’ transmissions, and then each link chooses a channel from the available channel set according to the energy cost on anti-interference and channel switch. After that, we formulate power control on each channel as a non-cooperative game with utility function including Signal-to-Interference-and-Noise Ratio (SINR) price. In order to reduce the energy cost of the information exchange during the traditional game, we introduce the thought of game virtual playing, in which each link can decide its own transmission power by imitating the game among links with its once collected information. Consequently, JCAPC can not only increase the transmission efficiency but also reduce the nodes’ energy waste. Moreover, the existence of Nash Equilibrium (NE) is proven based on super-modular game theory, and it’s able to obtain the unique NE by relating this algorithm to myopic best response updates. The introduction of game virtual playing saves the energy cost of network further more by reducing the number of information exchange. Simulation results show that our algorithm can select a channel with good QoS using less energy consumption and provide adequate SINR with less transmit power, which achieves the goal of efficiently reducing energy waste.


ad hoc networks | 2018

Topology control game algorithm based on Markov lifetime prediction model for wireless sensor network

Xiao-Chen Hao; Liyuan Wang; Ning Yao; Dehua Geng; Bai Chen

Abstract Since the wireless sensor network (WSN) consists of large number of sensors with limited energy resource, how to prolong the network lifetime is an inherent problem in wireless sensor network topology control. Motivated with this problem, we present a novel Markov lifetime prediction model (MLPM) for each single node to forecast their lifetime from a mode transition perspective. MLPM realizes the real-time prediction of node lifetime until the node died. Besides, on the basis of this model, this paper proposes TCAMLPM, a distributed topology control game algorithm for WSN which ensures the algorithm to converge to Nash Equilibrium by making use of the best response strategy. With TCAMLPM, energy conservation is accomplished by adjusting transmitting power of the nodes. The comparison results of our algorithm with the other algorithm that also aims at maximizing the network lifetime show that TCAMLPM not only extends the network lifetime, but also performs better in guaranteeing the network connectivity and robustness.


Wireless Personal Communications | 2016

Joint Game Algorithm of Power Control and Channel Allocation Considering Channel Interval and Relay Transmission Obstacle for WSN

Xiao-Chen Hao; Xiao-Yue Ru; Xi-Da Li; Min-Jie Xin

In order to effectively reduce network interference and decrease extra energy consumption, a joint power control and multi-channel game model is established in Wireless sensor network. The game model considers the interactions between power control and channel allocation. It has been proved the existence of Nash equilibrium. Based on this game model, a joint game algorithm of power control and channel allocation considering channel interval and relay transmission obstacle (JACIRT) is proposed. The theoretical analysis demonstrates that JACIRT can converge to the Pareto Optimal. The simulation results show that JACIRT can easily construct a topology which is connected and greatly reduces the interference. Besides, it decreases the channel interval, reduces the time of extra channel switching and energy consumption.


Wireless Personal Communications | 2017

Topology Control Game Algorithm of Multi-performance Cooperative Optimization with Self-Maintaining for WSN

Hao-Ran Liu; Min-Jie Xin; Wei-Jing Liu; Bai Chen; Xiao-Chen Hao; Xi-Da Li; Xiao-Yue Ru

Wireless sensor network is the key technology to extend the covering area of Internet in the future. It has a range of application values. A network with a lot of good performance could meet more demands of practical applications. Therefore, topology control whose main goal is to prolong lifetime faces a new challenge. Although good link quality can’t improve some performance such as robustness and sparseness, it could decrease the probability of data retransmission. So if links have good quality, the energy is saved and the delay is reduced. But most existing topology control optimization algorithms ignore the importance of link quality. Hence, a bi-directional link communication quality evaluation indicator is designed firstly. Then, connectivity, link weight, interference among nodes, equilibrium of surplus energy, node degree, the transmitting power of nodes and node’s current surplus energy are integrated into utility function to structure a game model named MPOGM. Finally, on the basis of MPOGM, a topology control game algorithm of multi-performance cooperative optimization with self-maintaining (MPCOSM) is proposed. The theoretical analysis demonstrates that MPCOSM could converge to Pareto Optimal Nash Equilibrium. The simulation results show that MPCOSM could achieve the cooperative optimization of multiple performance.


Wireless Personal Communications | 2016

Multi-Channel Allocation Algorithm for Anti-interference and Extending Connected Lifetime in Wireless Sensor Network

Xiao-Chen Hao; Ning Yao; Xi-Da Li; Wei-Jing Liu

In wireless sensor network, the large interference makes some nodes prematurely fail. And the premature failure of any important node will accelerate the network to be disconnected and even paralyzed. Due to the limited energy and topology connectivity, three factors should be considered in channel allocation: path gain, residual energy and importance of node. Path gain more accurately describes the node interference. The consideration of residual energy enables the node select an available channel to protect the less residual energy node. In the same way, the node importance protects the network topology. In this paper, the path gain, residual energy and node importance are mathematically formulated as an optimization problem with the Game Theory. A channel allocation algorithm called ACBR is proposed. The theoretical analyses prove that for the ACBR algorithm, Nash Equilibrium (NE) exists at least once and the sub-optimality of NE is also analyzed. Simulation results demonstrate that ACBR significantly reduces the interference and dramatically improves the network performance in terms of energy consumption, network connected lifetime, channel fairness and convergence speed.

Collaboration


Dive into the Xiao-Chen Hao's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge