FYFengqi Yu

Fengqi Yu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Fengqi Yu has a total of 1 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Location Independent and Coverage Efficient Protocol for Wireless Sensor Networks

    by Jing Chen, Fengqi Yu

    In wireless sensor networks (WSN), sensor nodes are powered by batteries. To make efficient use of battery energy is critical to sensor network lifetime. When targets are redundantly covered by multiple sensors, especially in randomly deployed sensor networks, it is possible to save battery energy by organizing sensors into mutually exclusive subsets and alternatively activating only one subset at a time. To solve this problem, the relationship between the desired QoS requirement and the minimum number of active nodes is analyzed in the randomly deployed sensor networks. We propose a location independent and coverage efficient (LICE) protocol for WSN based on our analytical results. The protocol selects the minimum number of active nodes based on their energy and previous working status without using any location information. Simulation and analysis demonstrate that our LICE protocol not only reduces the energy consumption of sensor nodes and increases the network lifetime, but also balances the energy dissipation among nodes.


  • A Uniformly Distributed Adaptive Clustering Hierarchy Routing Protocol

    by Jing Chen, Fengqi Yu

    Energy efficiency is one of the most important considerations in wireless sensor networks. In a clustered sensor network, some of the nodes become cluster heads. They aggregate the data from their cluster members and transmit it to the base station. In this paper, we propose a uniformly distributed adaptive clustering hierarchy routing protocol (UDACH). Unlike LEACH and LEACH-C, our protocol is based on energy equilibrium instead of choosing cluster heads randomly. We divide the protocol into three stages: cluster construction, building a cluster head tree, and sending data. In cluster construction stage, cluster heads are elected and each node identifies its cluster head. In the stage of building a cluster head tree, the tree is created based on the weight of each cluster head. And the weight is inversely proportional to the distance from the base station to the node. In the last stage, each cluster member collects the data and sends it to the base station by its cluster head. Our proposed protocol is simulated and compared with LEACH and LEACH-C. The simulation result shows that UDACH has better performance in network lifetime and energy expense than LEACH and LEACH-C.