TSLS and TSLSU: Two Novel Approximation SINR-Based Shortest Link Scheduling Algorithms in Wireless Networks Neda Mohammadi, Bahram Sadeghi Bigham, Mehdi Kadivar IEEE Transactions on Vehicular Technology, 2025 In this paper, we address the fundamental problem of shortest link scheduling (SLS) in wireless networks under the Signal-to-Interference-plus-Noise-Ratio (<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\text{SINR}$</tex-math></inline-formula>) constraints and propose two efficient Triangle-based Shortest Link Scheduling (TSLS and TSLSU) algorithms by assuming both oblivious power control and uniform power assignment scenarios. Many existing algorithms, to solve SLS under the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\text{SINR}$</tex-math></inline-formula> constraints, partition the set of links into classes and for each class, schedule the links by partitioning the link deployment plane into small regions. In this paper, we present a new triangle-based method for plane partitioning, showing that it significantly improves efficiency by increasing the number of simultaneously schedulable same-color regions. Consequently, more links can be activated within a time slot compared to other partitioning methods. Theoretical analysis indicates the correctness and effectiveness of our algorithms. Theoretical analysis demonstrates that our plane partition and approximation ratios are respectively much more efficient and tighter than those of state-of-the-art algorithms' results. In summary, both theoretical analysis and simulation results confirm that our algorithms offer superior performance in terms of efficiency and solution quality compared to the state-of-the-art algorithms.
A LOCAL CORE NUMBER BASED ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM Neda Mohammadi, Mehdi Kadivar Transactions on Combinatorics, 2021 The maximum clique problem (MCP) is to determine a complete subgraph of maximum cardinality in a graph. MCP is a fundamental problem in combinatorial optimization and is noticeable for its wide range of applications. In this paper, we present two branch-and-bound exact algorithms for finding a maximum clique in an undirected graph. Many efficient exact branch and bound maximum clique algorithms use approximate coloring to compute an upper bound on the clique number but, as a new pruning strategy, we show that local core number is more efficient. Moreover, instead of neighbors set of a vertex, our search area is restricted to a subset of the set in each subproblem which speeds up clique finding process. This subset is based on the core of the vertices of a given graph. We improved the MCQ and MaxCliqueDyn algorithms with respect to the new pruning strategy and search area restriction. Experimental results demonstrate that the improved algorithms outperform the previous well-known algorithms for many instances when applied to DIMACS benchmark and random graphs.
An Adaptive Yao-based topology control algorithm for wireless ad-hoc networks Mehdi Kadivar 2020 10h International Conference on Computer and Knowledge Engineering Iccke 2020, 2020 In this paper, a proactive topology control algorithm for mobile ad-hoc networks (MANETs) is presented which is an extension of Yao topology. Each node divides the plane into k separated cones centered at u and then selects its transmission range such that it can reach the nearest neighbors in each cone. It is assumed that the route information of each node is exchanged among its neighbors. Based on such information, the proposed algorithm can proactively adapt to the network changes caused by mobile nodes or nodes that left or joined the network. This adaptation relies on no beacon messages. Differing the previous algorithms, the presented method preserves connectivity during network's lifespan. Simulation experiments are conducted to measure the performance benefits. The results confirm the effectiveness of the algorithm. Keywords: Topology control algorithm, energy-efficient proto-col, ad-hoc networks.
NK-maxclique and MMCQ: Tow new exact branch and bound algorithms for the maximum clique problem Neda Mohammadi, Mehdi Kadivar IEEE Access, 2020 The maximum clique problem (MCP) is a fundamental problem in combinatorial optimization which finds important applications in real-word. This paper describes two new efficient branch-and-bound maximum clique algorithms NK-MaxClique and MMCQ, designed for solving MCP. We define some pruning conditions based on core numbers and vertex ordering to efficiently remove many of the search space. With respect to this ordering, the algorithms consider the vertices respectively to find the corresponding maximum clique in subproblems. Simulation results demonstrate that the algorithms outperform the previous well-known algorithms for many instances when applied to DIMACS benchmark and random graphs.
Hybrid interactions in pervasive computing settings Forough al Sadat Sahafipour, Hamed Vahdat-Nejad, Reza Javidan, Mehdi Kadivar 2011 11th International Conference on ITS Telecommunications Itst 2011, 2011 There are so many interactions in pervasive computing environments that should be done automatically. Sometimes even users don't know about some interactions that are done in his/her devices. It refers to a concept based on a vision described by Mark Weiser. “The most profound technologies are those that disappear. They weave themselves into the fabric of everyday life until they are indistinguishable from it”. In this paper, interactions in pervasive computing environment and some classifications of interactions are discussed. Hybrid interaction initiated by users and hybrid interaction initiated by smart object are two sub set of interactions in the classifications that are explained in this paper by two concrete examples: an event interaction system, and a Location information sending system. These interaction patterns are analyzed in such a pervasive computing setting where information about user's context is derived by combination of active and passive tags present in user's environment. In this route, pervasive RFID technology and Bluetooth-enabled active tags that are augmented to everyday objects are used.
An adaptive MST-based topology connectivity control algorithm for wireless ad-hoc networks Mehdi Kadivar, M.E. Shiri, Mehdi Dehghan International Journal of Communication Networks and Distributed Systems, 2011 In this paper, an adaptive minimum spanning tree based topology control algorithm for mobile ad-hoc networks (MANETs) is presented. Logically, mobile nodes know their source, destination and trajectory. Therefore, every node can inform the nodes around it about its trajectory. Equipped with this knowledge, the node will then be able to compute the relocations of its neighbours and determines the time points at which it must adjust its transmission radius. At each time point, node u establishes a minimum spanning tree and considers the nodes which are its neighbours in the tree as its neighbours in the final topology. In contrast to the existing algorithms, we analytically prove that at each time point of network lifespan, connectivity is preserved. The algorithm can proactively adapt the network changes without relying on periodic beacons. In addition, message overhead is put to the network locally and occurs only if the nodes change their trajectories or lose/discover a neighbour(s). Simulation experiments are conducted to measure performance benefits with reference to three metrics, namely: node degree, transmission radius, packet loss ratio.
A Maximal Clique Based Approximation Algorithm for Shortest Link Scheduling Problem in Wireless Networks under the SINR Model N Mohammadi, M Kadivar, A Amirkhani Computer Networks, https://doi.org/10.1016/j.comnet.2025.11 , 2025 2025
TSLS and TSLSU: Two Novel Approximation -Based Shortest Link Scheduling Algorithms in Wireless Networks N Mohammadi, BS Bigham, M Kadivar IEEE Transactions on Vehicular Technology , 2025 2025
PDSLS: An approximation SINR-based Shortest Link Scheduling algorithm with power control N Mohammadi, BS Bigham, M Kadivar Computer Communications 236, 108137 , 2025 2025 Citations: 3
Modeling and Addressing Resource Allocation for Fairness in Cellular networks M Kadivar Journal of Operational Research In Its Applications (Applied Mathematics … , 2025 2025
Optimizing droplet coalescence dynamics in microchannels: A comprehensive study using response surface methodology and machine learning algorithms SM Javadpour, E Kadivar, ZH Zarneh, E Kadivar, M Gheibi Heliyon 11 (1) , 2025 2025 Citations: 1
NK-PMC: A new exact branch and bound parallel algorithm for the maximum clique problem M Kadivar, N Mohammadi 2023
A maximum clique based approximation algorithm for wireless link scheduling under SINR model M Kadivar, N Mohammadi Journal of Computer and System Sciences 129, 72-89 , 2022 2022 Citations: 8
A local core number based algorithm for the maximum clique problem N Mohammadi, M Kadivar Transactions on Combinatorics 10 (3), 149-163 , 2021 2021 Citations: 2
An Adaptive Yao-based topology control algorithm for wireless ad-hoc networks M Kadivar 2020 10th International Conference on Computer and Knowledge Engineering … , 2020 2020 Citations: 4
NK-MaxClique and MMCQ: tow new exact branch and bound algorithms for the maximum clique problem N Mohammadi, M Kadivar IEEE Access 8, 180045-180053 , 2020 2020 Citations: 2
Designing and production of a software for cattle reproductive ultrasonography. A Kadivar, V Najafzadeh, NS Esfandabadi, M Kadivar, S Banitalebi, ... 2018
A new algorithm to find the shortest paths in acyclic digraphs M Kadivar Transactions on Combinatorics 5 (3), 23-31 , 2016 2016 Citations: 3
A constitutive model for unsaturated soil–structure interfaces A Lashkari, M Kadivar International Journal for Numerical and Analytical Methods in Geomechanics … , 2016 2016 Citations: 63
CHARACTRIZETION OF Z3-CONNECTED AND NON-Z3-CONNECTIVITY OF GRAPHS S BABADI, M KADIVAR, MR RISMANCHIAN 2013
An adaptive MST-based topology connectivity control algorithm for wireless ad-hoc networks M Kadivar, ME Shiri, M Dehghan International Journal of Communication Networks and Distributed Systems 6 (1 … , 2011 2011 Citations: 3
Distributed topology control algorithm based on one-and two-hop neighbors’ information for ad hoc networks M Kadivar, ME Shiri, M Dehghan Computer Communications 32 (2), 368-375 , 2009 2009 Citations: 35
MOST CITED SCHOLAR PUBLICATIONS
A constitutive model for unsaturated soil–structure interfaces A Lashkari, M Kadivar International Journal for Numerical and Analytical Methods in Geomechanics … , 2016 2016 Citations: 63
Distributed topology control algorithm based on one-and two-hop neighbors’ information for ad hoc networks M Kadivar, ME Shiri, M Dehghan Computer Communications 32 (2), 368-375 , 2009 2009 Citations: 35
A maximum clique based approximation algorithm for wireless link scheduling under SINR model M Kadivar, N Mohammadi Journal of Computer and System Sciences 129, 72-89 , 2022 2022 Citations: 8
An Adaptive Yao-based topology control algorithm for wireless ad-hoc networks M Kadivar 2020 10th International Conference on Computer and Knowledge Engineering … , 2020 2020 Citations: 4
PDSLS: An approximation SINR-based Shortest Link Scheduling algorithm with power control N Mohammadi, BS Bigham, M Kadivar Computer Communications 236, 108137 , 2025 2025 Citations: 3
A new algorithm to find the shortest paths in acyclic digraphs M Kadivar Transactions on Combinatorics 5 (3), 23-31 , 2016 2016 Citations: 3
An adaptive MST-based topology connectivity control algorithm for wireless ad-hoc networks M Kadivar, ME Shiri, M Dehghan International Journal of Communication Networks and Distributed Systems 6 (1 … , 2011 2011 Citations: 3
A local core number based algorithm for the maximum clique problem N Mohammadi, M Kadivar Transactions on Combinatorics 10 (3), 149-163 , 2021 2021 Citations: 2
NK-MaxClique and MMCQ: tow new exact branch and bound algorithms for the maximum clique problem N Mohammadi, M Kadivar IEEE Access 8, 180045-180053 , 2020 2020 Citations: 2
Optimizing droplet coalescence dynamics in microchannels: A comprehensive study using response surface methodology and machine learning algorithms SM Javadpour, E Kadivar, ZH Zarneh, E Kadivar, M Gheibi Heliyon 11 (1) , 2025 2025 Citations: 1
A Maximal Clique Based Approximation Algorithm for Shortest Link Scheduling Problem in Wireless Networks under the SINR Model N Mohammadi, M Kadivar, A Amirkhani Computer Networks, https://doi.org/10.1016/j.comnet.2025.11 , 2025 2025
TSLS and TSLSU: Two Novel Approximation -Based Shortest Link Scheduling Algorithms in Wireless Networks N Mohammadi, BS Bigham, M Kadivar IEEE Transactions on Vehicular Technology , 2025 2025
Modeling and Addressing Resource Allocation for Fairness in Cellular networks M Kadivar Journal of Operational Research In Its Applications (Applied Mathematics … , 2025 2025
NK-PMC: A new exact branch and bound parallel algorithm for the maximum clique problem M Kadivar, N Mohammadi 2023
Designing and production of a software for cattle reproductive ultrasonography. A Kadivar, V Najafzadeh, NS Esfandabadi, M Kadivar, S Banitalebi, ... 2018
CHARACTRIZETION OF Z3-CONNECTED AND NON-Z3-CONNECTIVITY OF GRAPHS S BABADI, M KADIVAR, MR RISMANCHIAN 2013
