Nastooh Taheri Javan

Prof. Dr. Nastooh Taheri Javan

Imam Khomeini International University, Qazvīn, Iran
orcid
PhD, SMIEEE

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
13 September 2019 in IEEE Sensors Journal
Verified
Journal Article
Closed access
Nastooh Taheri JavanNastooh Taheri Javan
Nastooh Taheri Javan
MSMasoud Sabaei
Masoud Sabaei
VHVesal Hakami
Vesal Hakami
In TSCH, which is a MAC mechanism set of the IEEE 802.15.4e amendment, calculation, construction, and maintenance of the packet transmission schedules are not defined. Moreover, to ensure optimal throughput, most of the existing scheduling methods are based on the assumption that instantaneous and accurate Channel State Information (CSI) is available. However, due to the inevitable errors in the channel estimation process, this assumption cannot be materialized in many practical scenarios. In this paper, we propose two alternative and realistic approaches. In our first approach, we assume that only the statistical knowledge of CSI is available a priori. Armed with this knowledge, the average packet rate on each link is computed and then, using the results, the throughput-optimal schedule for the assignment of (slotframe ) cells to links can be formulated as a max-weight bipartite matching problem, which can be solved efficiently using the well-known Hungarian algorithm. In the second approach, we assume that no CSI knowledge (even statistical) is available at the design stage. For this zeroknowledge setting, we introduce a machine learning-based algorithm by formally modeling the scheduling problem in terms of a combinatorial multi-armed bandit (CMAB) process. Our CMAB-based scheme is widely applicable to many real operational environments, thanks to its reduced reliance on design-time knowledge. Simulation results show that the average throughput obtained by the statistical CSIbased method is within the margin of 15% from the theoretical upper bound associated with perfect instantaneous CSI. The aforesaid margin is around 18our learning-theoretic solution.

6 September 2021 in IEEE Sensors Journal
Verified
Journal Article
Closed access
Nastooh Taheri JavanNastooh Taheri Javan
Nastooh Taheri Javan
MSMasoud Sabaei
Masoud Sabaei
VHVesal Hakami
Vesal Hakami
In IEEE 802.15.4 standard for low-power low-range wireless communications, only one channel is employed for transmission which can result in increased energy consumption, high network delay and poor packet delivery ratio (PDR). In the subsequent IEEE 802.15.4-2015 standard, a Time-slotted Channel Hopping (TSCH) mechanism has been developed which allows for a periodic yet fixed frequency hopping pattern over 16 different channels. Unfortunately, however, most of these channels are susceptible to high-power coexisting Wi-Fi signal interference and to possibly some other ISM-band transmissions. This interference manifests itself in the form of the presence/absence of other devices with either or both static and dynamic channel selection policies. In order to isolate channels with undesirable conditions, blacklisting mechanisms are defined to adapt the channel hopping process. However, the existing solutions which form blacklists unrealistically assume that the statistical model of the external interference remains fixed, and do not vary over time. In this paper, we realistically assume that the impact of external interferes on 802.15.4 may generally follow a non-stationary pattern, and accordingly formulate the adaptive channel hopping problem as a Dynamic Multi-Armed Bernoulli Bandit (Dynamic MABB) process from the machine learning theory. We then propose an online learning algorithm with track-ability properties for computing an adaptive hopping policy. Simulations confirm that when the statistics of the external interference has a switching regime, the proposed solution outperforms the previous schemes in terms of both energy efficiency as well as two important KPIs for TSCH-based networks, i.e., PDR and latency.

1 July 2020 in Computer Communications
Verified
Journal Article
Closed access
VHVesal Hakami
Vesal Hakami
SMSeyedakbar Mostafavi
Seyedakbar Mostafavi
Nastooh Taheri JavanNastooh Taheri Javan
Nastooh Taheri Javan
ZRZahra Rashidi
Zahra Rashidi

27 November 2007
Verified
Book Chapter
Closed access
PDF file
Nastooh Taheri JavanNastooh Taheri Javan
Nastooh Taheri Javan
MDMehdi Dehghan
Mehdi Dehghan

1 August 2008
Verified
Conference Paper
Closed access
ADAmir Darehshoorzadeh
Amir Darehshoorzadeh
Nastooh Taheri JavanNastooh Taheri Javan
Nastooh Taheri Javan
MDMehdi Dehghan
Mehdi Dehghan
MKMohammad Khalily-Dermany
Mohammad Khalily-Dermany
An ad hoc network is comprised of mobile hosts without any wired infrastructure support. Multipath routing allows the establishment of multiple paths between a source and a destination. It distributes traffic among multiple paths instead of routing all the traffics along a single path. In this paper, we propose a new multipath routing protocol that uses all discovered paths simultaneously for transmitting data, by using this approach data packets are balanced over discovered paths and energy consumption is distributed across many nodes through network.

1 January 2009
Verified
Conference Paper
Closed access
Nastooh Taheri JavanNastooh Taheri Javan
Nastooh Taheri Javan
RKReza Kiaeifar
Reza Kiaeifar
BHBahram Hakhamaneshi
Bahram Hakhamaneshi
MDMehdi Dehghan
Mehdi Dehghan
A common characteristic of all popular multi-path routing algorithms in mobile ad-hoc networks, such as AOMDV, is that the end to end delay is reduced by utilization of parallel paths. The competition between the neighboring nodes for obtaining a common channel in those parallel paths is the reason for end to end delay increment. In fact, due to medium access mechanism in wireless networks, such as CSMA/CA, data transmissions even through two node-disjoint paths are not completely independent and each path will affect the other one. In this paper we have modified the AODV protocol which results in selection of zone-disjoint paths, to the extent feasible, and as a result we achieve less end to end delay. The efficiency of the proposed protocol has been evaluated on different scenarios and there has been a noticeable improvement in the packet delivery ratio and also in the reduction of end-to-end delay comparing to AOMDV.