Morteza Biabani

Dr. Morteza Biabani

University of Tehran, Tehran, Iran
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 May 2020 in Sensors
Verified
Journal Article
Open access
PDF file
Morteza BiabaniMorteza Biabani
Morteza Biabani
Hossein FotouhiHossein Fotouhi
Hossein Fotouhi
NYNasser Yazdani
Nasser Yazdani
Wireless Sensor Networks (WSNs) are key elements of Internet of Things (IoT) networks which provide sensing and wireless connectivity. Disaster management in smart cities is classified as a safety-critical application. Thus, it is important to ensure system availability by increasing the lifetime of WSNs. Clustering is one of the routing techniques that benefits energy efficiency in WSNs. This paper provides an evolutionary clustering and routing method which is capable of managing the energy consumption of nodes while considering the characteristics of a disaster area. The proposed method consists of two phases. First, we present a model with improved hybrid Particle Swarm Optimization (PSO) and Harmony Search Algorithm (HSA) for cluster head (CH) selection. Second, we design a PSO-based multi-hop routing system with enhanced tree encoding and a modified data packet format. The simulation results for disaster scenarios prove the efficiency of the proposed method in comparison with the state-of-the-art approaches in terms of the overall residual energy, number of live nodes, network coverage, and the packet delivery ratio.

17 March 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Morteza BiabaniMorteza Biabani
Morteza Biabani
NYNasser Yazdani
Nasser Yazdani
Hossein FotouhiHossein Fotouhi
Hossein Fotouhi
Data gathering using mobile sink (MS) based on rendezvous points (RPs) is a need in several Internet of Things (IoT) applications. However, devising energy-efficient and reliable tour planning strategies for MS is a challenging issue, considering that sensors have finite buffer space and disparate sensing rates. This is even more challenging in delay-tolerant networks, where it is more desirable to select the shortest traveling path. There exist several algorithms on MS scheduling, which are based on hierarchical protocols for data forwarding and data collection. These algorithms are lacking efficient tradeoff between the Quality-of-Service (QoS) requirements in terms of energy efficiency, reliability, and computational cost. Besides, these algorithms have shown high packet losses while jointly performing MS tour planning and buffer overflow management. To address these limitations, we propose EE-MSWSN, an energy-efficient MS wireless sensor network that reliably collects data by implementing efficient buffer management. It forms novel clustered tree-based structures to cover all the network, and select each RP based on 1) hop count; 2) number of accumulated data in each clustered tree; and 3) distance to the stationary sink. The extensive simulation results verify that the EE-MSWSN minimizes tour length for various network configurations and incurs less energy consumption while reliably gathering data without packet losses as compared with existing protocols.

10 March 2021 in IEEE Access
Verified
Journal Article
Open access
Morteza BiabaniMorteza Biabani
Morteza Biabani
NYNasser Yazdani
Nasser Yazdani
Hossein FotouhiHossein Fotouhi
Hossein Fotouhi
There has been tremendous growth in the Internet of Things (IoT) technologies, and many new applications have emerged. However, cascading failure as one of the major issues in such constrained networks have been neglected. In this paper, we apply an effective clustering approach dubbed as REFIT to enhance network topology robustness via nodes’ residual energy. The REFIT protocol divides the network processes into two stages, (i) set-up state and (ii) steady state. The Cluster Head (CH) selection method determines the supreme set of CHs that balances load distribution. The routing method is developed with the modified Particle Swarm Optimization (PSO) algorithm and the objective function to find the supreme set of Relay Nodes (RNs). These complete methods are combined into a set-up state to construct an optimal routing tree that links these CHs to the sink via RNs. In steady state, we model the routing tree to Conditional Directed Acyclic Graph (C-DAG) infrastructure that leads to shortcut routes. Simulation results on MATLAB Simulink have demonstrated that compared with the state-of-the-art works, REFIT can significantly promote network robustness against cascading failure.

26 September 2022 in IEEE Sensors Journal
Verified
Journal Article
Closed access
Morteza BiabaniMorteza Biabani
Morteza Biabani
NYNasser Yazdani
Nasser Yazdani
Hossein FotouhiHossein Fotouhi
Hossein Fotouhi
Employing Mobile Sink (MS) to act as a relay node in Wireless Sensor Networks (WSNs) applications is a promising solution for efficient power saving and data collection. However, establishing long-distance traveling leads to larger latency or inefficient buffer management at Rendezvous Points (RPs), e.g. flying UAVs in disaster management. Moreover, there is no efficient solution to guarantee the completeness of data gathering by considering the waiting time (sojourn) of the MS to receive packets from RPs, in addition to the MS moving time among RPs. This work presents a rate-adaptation and buffer-awareness data gathering for MS scheduling (RBDMS) by constructing grid cells in the monitoring area. In fact, it establishes the shortest path by passing within the communication range of the sensors based on data volume. RBDMS not only has a mechanism for handling emergency packets with low latency but also benefits from Stochastic Integer Programming (SIP) for scheduling the MS sojourn time with lower computational time using Lagrangian relaxation. Simulation results confirm that the proposed RBDMS outperforms comparable state-of-the-art works, in terms of the MS path length, network lifetime, the energy consumption of sensors and MS, as well as buffering performance.

7 September 2023 in Computers
Verified
Journal Article
Open access
PDF file
Morteza BiabaniMorteza Biabani
Morteza Biabani
NYNasser Yazdani
Nasser Yazdani
Hossein FotouhiHossein Fotouhi
Hossein Fotouhi
Virtual Private LAN Services (VPLS) is an ethernet-based Virtual Private Network (VPN) service that provides multipoint-to-multipoint Layer 2 VPN service, where each site is geographically dispersed across a Wide Area Network (WAN). The adaptability and scalability of VPLS are limited despite the fact that they provide a flexible solution for connecting geographically dispersed sites. Furthermore, the construction of tunnels connecting customer locations that are separated by great distances adds a substantial amount of latency to the user traffic transportation. To address these issues, a novel Hierarchical VPLS (H-VPLS) architecture has been developed using 802.1Q tunneling (also known as Q-in-Q) on high-speed and commodity routers to satisfy the additional requirements of new VPLS applications. The Vector Packet Processing (VPP) performs as the router’s data plane, and FRRouting (FRR), an open-source network routing software suite, acts as the router’s control plane. The router is designed to seamlessly forward VPLS packets using the Request For Comments (RFCs) 4762, 4446, 4447, 4448, and 4385 from The Internet Engineering Task Force (IETF) integrated with VPP. In addition, the Label Distribution Protocol (LDP) is used for Multi-Protocol Label Switching (MPLS) Pseudo-Wire (PW) signaling in FRR. The proposed mechanism has been implemented on a software-based router in the Linux environment and tested for its functionality, signaling, and control plane processes. The router is also implemented on commodity hardware for testing the functionality of VPLS in the real world. Finally, the analysis of the results verifies the efficiency of the proposed mechanism in terms of throughput, latency, and packet loss ratio.