Zhaoming Ding
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhaoming Ding has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Lianfeng Shen
National Mobile Communications Research Laboratory, Southeast University, Nanjing, China
5 shared publications - Feng Yan
National Mobile Communications Research Laboratory, Southeast University, Nanjing, China
4 shared publications - Hongyang Chen
Zhejiang Lab
3 shared publications - Nirwan Ansari
New Jersey Institute of Technology, Newark, New Jersey, USA
3 shared publications Feng Yan
National Mobile Communications Research Laboratory Southeast University Nanjing 210096 People's Republic of China
1 shared publicationSong Xing
Department of Information Systems California State University Los Angeles CA 90032 USA
1 shared publication
Latest Publications
- 23 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (15) , 13138-13154
Energy-Efficient Topology Control Mechanism for IoT-Oriented Software-Defined WSNs
In time-varying software-defined wireless sensor networks (SDWSNs) for Internet-of-Things (IoT) applications, the topology may change due to the interference or abnormal events, thus leading to network performance degradation. In this paper, an energy-efficient topology control (TC) mechanism applied for IoT-oriented SDWSNs is proposed to maximize the network energy efficiency (EE) during the dynamic topology maintenance. First, a hierarchical SDWSN architecture consisting of the cluster-based sensing network and the programmable relay network is presented. Second, two TC algorithms based on the link EE are proposed to apply in the cluster and relay sub-networks of SDWSN, respectively. In the cluster sub-network, the proposed distributed TC algorithm enables the link interference mitigation by employing power control and rate allocation in each cluster. In the relay sub-network, the proposed centralized TC algorithm first utilizes a specified model to construct the original topology. During the dynamic topology maintenance, the proposed centralized TC algorithm is realized by the value-iteration learning method based on a Markov decision process (MDP) model, upon which the state-transition probability (STP) of the relay sub-network is obtained, where the relay-network state is composed of the link, the queue, and the residual energy ratio states for all nodes in the relay sub-network. Finally, simulation results show that both two TC algorithms can improve the corresponding sub-network EE of time-varying SDWSN.
- 23 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (15) , 13138-13154
Energy-Efficient Topology Control Mechanism for IoT-Oriented Software-Defined WSNs
In time-varying software-defined wireless sensor networks (SDWSNs) for Internet-of-Things (IoT) applications, the topology may change due to the interference or abnormal events, thus leading to network performance degradation. In this paper, an energy-efficient topology control (TC) mechanism applied for IoT-oriented SDWSNs is proposed to maximize the network energy efficiency (EE) during the dynamic topology maintenance. First, a hierarchical SDWSN architecture consisting of the cluster-based sensing network and the programmable relay network is presented. Second, two TC algorithms based on the link EE are proposed to apply in the cluster and relay sub-networks of SDWSN, respectively. In the cluster sub-network, the proposed distributed TC algorithm enables the link interference mitigation by employing power control and rate allocation in each cluster. In the relay sub-network, the proposed centralized TC algorithm first utilizes a specified model to construct the original topology. During the dynamic topology maintenance, the proposed centralized TC algorithm is realized by the value-iteration learning method based on a Markov decision process (MDP) model, upon which the state-transition probability (STP) of the relay sub-network is obtained, where the relay-network state is composed of the link, the queue, and the residual energy ratio states for all nodes in the relay sub-network. Finally, simulation results show that both two TC algorithms can improve the corresponding sub-network EE of time-varying SDWSN.
- 10 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (6) , 2082-2086
Residual-Energy Aware Modeling and Analysis of Time-Varying Wireless Sensor Networks
In this letter, the residual-energy aware feature of a sensor node in time-varying wireless sensor networks (WSNs) is analyzed and modeled as a Markov chain, upon which the state-transition probability (STP) about the energy level of any node with undetermined and deterministic residual energy can be evaluated. Based on Markov chain and energy-efficient relay search region models, an energy-efficient routing algorithm is proposed to further analyze the impact of STP with known residual energy on extending network lifetime of time-varying WSNs. Simulation results show that the proposed algorithm can effectively extend network lifetime even more than twice while holding a better energy efficiency as compared with the algorithm without considering node-residual energy changes.
- 10 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (6) , 2082-2086
Residual-Energy Aware Modeling and Analysis of Time-Varying Wireless Sensor Networks
In this letter, the residual-energy aware feature of a sensor node in time-varying wireless sensor networks (WSNs) is analyzed and modeled as a Markov chain, upon which the state-transition probability (STP) about the energy level of any node with undetermined and deterministic residual energy can be evaluated. Based on Markov chain and energy-efficient relay search region models, an energy-efficient routing algorithm is proposed to further analyze the impact of STP with known residual energy on extending network lifetime of time-varying WSNs. Simulation results show that the proposed algorithm can effectively extend network lifetime even more than twice while holding a better energy efficiency as compared with the algorithm without considering node-residual energy changes.
- 15 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (9) , 9050-9065
Energy-Efficient Relay-Selection-Based Dynamic Routing Algorithm for IoT-Oriented Software-Defined WSNs
In this paper, a dynamic routing algorithm based on energy-efficient relay selection (RS), referred to as DRA-EERS, is proposed to adapt to the higher dynamics in time-varying software-defined wireless sensor networks (SDWSNs) for internet of things (IoT) applications. First, the time-varying features of SDWSNs are investigated from which the state-transition probability (STP) of the node is calculated based on a Markov chain. Second, a dynamic link weight is designed for DRA-EERS by incorporating both the link reward and the link cost, where the link reward is related to the link energy efficiency (EE) and the node STP, while the link cost is affected by the locations of nodes. Moreover, one adjustable coefficient is used to balance the link reward and the link cost. Last, the energy-efficient routing problem can be formulated as an optimization problem, and DRA-EERS is performed to find the best relay according to the energy-efficient RS criteria derived from the designed link weight. Simulation results demonstrate that the path EE obtained by DRA-EERS through an available coefficient adjustment outperforms that by the Dijkstra’s shortest path algorithm. Again, a tradeoff between the EE and the throughput can be achieved by adjusting the coefficient of the link weight, i.e., increasing the impact of the link reward to improve the EE, and otherwise to improve the throughput.
- 15 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (9) , 9050-9065
Energy-Efficient Relay-Selection-Based Dynamic Routing Algorithm for IoT-Oriented Software-Defined WSNs
In this paper, a dynamic routing algorithm based on energy-efficient relay selection (RS), referred to as DRA-EERS, is proposed to adapt to the higher dynamics in time-varying software-defined wireless sensor networks (SDWSNs) for internet of things (IoT) applications. First, the time-varying features of SDWSNs are investigated from which the state-transition probability (STP) of the node is calculated based on a Markov chain. Second, a dynamic link weight is designed for DRA-EERS by incorporating both the link reward and the link cost, where the link reward is related to the link energy efficiency (EE) and the node STP, while the link cost is affected by the locations of nodes. Moreover, one adjustable coefficient is used to balance the link reward and the link cost. Last, the energy-efficient routing problem can be formulated as an optimization problem, and DRA-EERS is performed to find the best relay according to the energy-efficient RS criteria derived from the designed link weight. Simulation results demonstrate that the path EE obtained by DRA-EERS through an available coefficient adjustment outperforms that by the Dijkstra’s shortest path algorithm. Again, a tradeoff between the EE and the throughput can be achieved by adjusting the coefficient of the link weight, i.e., increasing the impact of the link reward to improve the EE, and otherwise to improve the throughput.
- Open Access
- 1 November 2019
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 13 (18) , 3105-3116
An interference‐aware energy‐efficient routing algorithm with quality of service requirements for software‐defined WSNs
To address the energy‐efficient (EE) routing problem in software‐defined wireless sensor networks (SDWSNs), in this study, a centralised routing algorithm, namely, the interference‐aware EE routing algorithm (IA‐EERA), is proposed to extend the network lifetime (NL) in SDWSNs. Both the link quality of service requirements and the balance between the link energy loads are considered in the proposed IA‐EERA when selecting the EE relays. Concretely, the IA‐EERA comprises the EE relay selection (RS) and the centralised relay scheduling schemes, which are responsible for generating a valid link set with RS priorities and scheduling the eligible relay nodes with expected link rates from the valid link set, respectively. For supporting the network compatibility and scalability, we propose a hierarchical SDWSN based network architecture, upon which the IA‐EERA can be devoted to solving the EE routing problem in the relay layer of SDWSN. Simulation results show that for one data source without interference, the proposed IA‐EERA can significantly improve the NL compared with the traditional routing algorithm utilising the energy efficiency maximisation. For multiple data sources incurring interference at nodes, the IA‐EERA is able to reduce the NL‐dropping rate by adjusting the interference‐aware parameter that affects the RS priorities
- 1 November 2019
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 13 (18) , 3105-3116
Open AccessAn interference‐aware energy‐efficient routing algorithm with quality of service requirements for software‐defined WSNs
To address the energy‐efficient (EE) routing problem in software‐defined wireless sensor networks (SDWSNs), in this study, a centralised routing algorithm, namely, the interference‐aware EE routing algorithm (IA‐EERA), is proposed to extend the network lifetime (NL) in SDWSNs. Both the link quality of service requirements and the balance between the link energy loads are considered in the proposed IA‐EERA when selecting the EE relays. Concretely, the IA‐EERA comprises the EE relay selection (RS) and the centralised relay scheduling schemes, which are responsible for generating a valid link set with RS priorities and scheduling the eligible relay nodes with expected link rates from the valid link set, respectively. For supporting the network compatibility and scalability, we propose a hierarchical SDWSN based network architecture, upon which the IA‐EERA can be devoted to solving the EE routing problem in the relay layer of SDWSN. Simulation results show that for one data source without interference, the proposed IA‐EERA can significantly improve the NL compared with the traditional routing algorithm utilising the energy efficiency maximisation. For multiple data sources incurring interference at nodes, the IA‐EERA is able to reduce the NL‐dropping rate by adjusting the interference‐aware parameter that affects the RS priorities
- 25 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 23 (3) , 534-537
Impact of Optimal Hop Distance on the Network Lifetime for Wireless Sensor Networks With QoS Requirements
- 25 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 23 (3) , 534-537
Impact of Optimal Hop Distance on the Network Lifetime for Wireless Sensor Networks With QoS Requirements