default search action
Nastooh Taheri Javan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Nastooh Taheri Javan, Zahra Yaghoubi:
To Code or Not to Code: When and How to Use Network Coding in Energy Harvesting Wireless Multi-Hop Networks. IEEE Access 12: 22608-22623 (2024) - [j6]Nastooh Taheri Javan, Majid Mohammadpour, Seyedakbar Mostafavi:
Enhancing Malicious Code Detection With Boosted N-Gram Analysis and Efficient Feature Selection. IEEE Access 12: 147400-147421 (2024) - 2023
- [j5]Hanieh Malekijou, Vesal Hakami, Nastooh Taheri Javan, Amirhossein Malekijoo:
Q-learning-based algorithms for dynamic transmission control in IoT equipment. J. Supercomput. 79(1): 75-108 (2023) - 2020
- [j4]Vesal Hakami, Seyedakbar Mostafavi, Nastooh Taheri Javan, Zahra Rashidi:
An optimal policy for joint compression and transmission control in delay-constrained energy harvesting IoT devices. Comput. Commun. 160: 554-566 (2020)
2010 – 2019
- 2019
- [j3]Nastooh Taheri Javan, Masoud Sabaei, Mehdi Dehghan:
To overhear or not to overhear: a dilemma between network coding gain and energy consumption in multi-hop wireless networks. Wirel. Networks 25(7): 4097-4113 (2019) - [i4]Nastooh Taheri Javan, Masoud Sabaei, Vesal Hakami:
IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach. CoRR abs/1909.06640 (2019) - 2018
- [j2]Nastooh Taheri Javan, Masoud Sabaei, Mehdi Dehghan:
To-send-or-not-to-send: An optimal stopping approach to network coding in multi-hop wireless networks. Int. J. Commun. Syst. 31(2) (2018) - [i3]Nastooh Taheri Javan, Masoud Sabaei, Mehdi Dehghan:
To overhear or not to overhear: a dilemma between network coding gain and energy consumption in multi-hop wireless networks. CoRR abs/1805.01050 (2018) - 2017
- [i2]Nastooh Taheri Javan, Masoud Sabaei, Mehdi Dehghan:
To Send or Not to Send: An Optimal Stopping Approach to Network Coding in Multi-hop Wireless Networks. CoRR abs/1710.08534 (2017) - 2013
- [c5]Nastooh Taheri Javan, Masoud Sabaei, Mehdi Dehghan:
Energy & throughput tradeoff in WSN with network coding. ICTC 2013: 304-309 - [i1]Hassanali Nasehi, Nastooh Taheri Javan, Amir Bagheri Aghababa, Yasna Ghanbari Birgani:
Improving Energy Efficiency in MANETs by Multi-Path Routing. CoRR abs/1303.1635 (2013) - 2011
- [j1]Arash Nasiri Eghbali, Nastooh Taheri Javan, Mehdi Dehghan:
EDAP: An Efficient Data-Gathering Protocol for Wireless Sensor Networks. Int. J. Ad Hoc Ubiquitous Comput. 7(1): 12-24 (2011)
2000 – 2009
- 2009
- [c4]Nastooh Taheri Javan, Reza Kiaeifar, Bahram Hakhamaneshi, Mehdi Dehghan:
ZD-AOMDV: A New Routing Algorithm for Mobile Ad-Hoc Networks. ACIS-ICIS 2009: 852-857 - [c3]Nastooh Taheri Javan, Amir Dareshoorzade, Saeed Soltanali, Yasna Ghanbari Birgani:
IZM-DSR: A New Zone-Disjoint Multi-path Routing Algorithm for Mobile Ad-Hoc Networks. EMS 2009: 511-516 - [c2]Ali Asghar Khavasi, Nastooh Taheri Javan:
Using zone-disjoint multi-path routing algorithm for video transmission over ad-hoc networks. ICIS 2009: 877-882 - 2007
- [c1]Nastooh Taheri Javan, Mehdi Dehghan:
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks. MSN 2007: 715-724
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint