default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIyad F. Jafar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Khalid A. Darabkh, Muna Al-Akhras, Ala' F. Khalifeh, Iyad F. Jafar, Fahed Jubair
:
An innovative RPL objective function for broad range of IoT domains utilizing fuzzy logic and multiple metrics. Expert Syst. Appl. 205: 117593 (2022)- [j18]Iyad F. Jafar, Khalid A. Darabkh, Fahed Jubair:
Separable High Capacity Reversible Data Hiding Algorithm for Encrypted Images. Int. Arab J. Inf. Technol. 19(5): 812-821 (2022)
2010 – 2019
- 2019
- [c4]Iyad F. Jafar, Hamzah Maghaydah, Khalid A. Darabkh:
Employing Unsharp Masking for Contrast Enhancement in Reversible Data Hiding. ISSPIT 2019: 1-6 - 2018
- [j17]Khalid A. Darabkh, Noor J. Al-Maaitah, Iyad F. Jafar, Alá F. Khalifeh:
EA-CRP: A Novel Energy-aware Clustering and Routing Protocol in Wireless Sensor Networks. Comput. Electr. Eng. 72: 702-718 (2018) - [j16]Raed T. Al-Zubi, Khalid A. Darabkh, Mohammed Hawa, Iyad F. Jafar:
RSP-WRAN: Resource sharing protocol for inter/intra WRAN communications. J. High Speed Networks 24(1): 31-47 (2018) - 2017
- [j15]Ramzi R. Saifan, Iyad F. Jafar, Ghazi M. Al-Sukkar:
Optimized Cooperative Spectrum Sensing Algorithms in Cognitive Radio Networks. Comput. J. 60(6): 835-849 (2017) - [j14]Sawsan A. Hiary, Iyad F. Jafar:
An efficient multi-predictor reversible data hiding algorithm based on performance evaluation of different prediction schemes. Multim. Tools Appl. 76(2): 2131-2157 (2017) - [j13]Khalid A. Darabkh, Wijdan Y. Albtoush, Iyad F. Jafar:
Improved clustering algorithms for target tracking in wireless sensor networks. J. Supercomput. 73(5): 1952-1977 (2017) - 2016
- [j12]Mohammed Hawa, Dia I. Abu-Al-Nadi, Othman M.-K. Alsmadi, Iyad F. Jafar:
On Using Spectrum History to Manage Opportunistic Access in Cognitive Radio Networks. IEEE Access 4: 5293-5308 (2016) - [j11]Iyad F. Jafar, Khalid A. Darabkh, Raed T. Al-Zubi, Rami A. Al Namneh:
Efficient Reversible Data Hiding Using Multiple Predictors. Comput. J. 59(3): 423-438 (2016) - [j10]Iyad F. Jafar, Khalid A. Darabkh, Ramzi R. Saifan:
SARDH: A novel sharpening-aware reversible data hiding algorithm. J. Vis. Commun. Image Represent. 39: 239-252 (2016) - [j9]Iyad F. Jafar, Khalid A. Darabkh, Raed T. Al-Zubi, Ramzi R. Saifan:
An efficient reversible data hiding algorithm using two steganographic images. Signal Process. 128: 98-109 (2016) - [j8]Khalid A. Darabkh, Huda Ibeid, Iyad F. Jafar, Raed T. Al-Zubi:
A generic buffer occupancy expression for stop-and-wait hybrid automatic repeat request protocol over unstable channels. Telecommun. Syst. 63(2): 205-221 (2016) - [i1]Enas N. Jaara, Iyad F. Jafar:
Efficient Reversible Data Hiding Algorithms Based on Dual Prediction. CoRR abs/1605.02605 (2016) - 2015
- [j7]Khalid A. Darabkh, Iyad F. Jafar, Raed T. Al-Zubi, Mohammed Hawa:
A New Image Steganographic Approach for Secure Communication Based on LSB Replacement Method. Inf. Technol. Control. 44(3): 315-328 (2015) - 2014
- [c3]Iyad F. Jafar, Sawsan A. Hiary, Khalid A. Darabkh:
An improved reversible data hiding algorithm based on modification of prediction errors. ICDIP 2014: 91591U - [c2]Khalid A. Darabkh, Iyad F. Jafar, Raed T. Al-Zubi, Mohammed Hawa:
An improved image least significant bit replacement method. MIPRO 2014: 1182-1186 - 2013
- [j6]Iyad F. Jafar, Rami A. Al Namneh, Khalid A. Darabkh:
Efficient Improvements on the BDND Filtering Algorithm for the Removal of High-Density Impulse Noise. IEEE Trans. Image Process. 22(3): 1223-1232 (2013) - 2012
- [j5]Iyad F. Jafar, Khalid A. Darabkh, Ghazi M. Al-Sukkar:
A Rule-Based Fuzzy Inference System for Adaptive Image Contrast Enhancement. Comput. J. 55(9): 1041-1057 (2012) - [j4]Khalid A. Darabkh, Iyad F. Jafar, Ghazi M. Al-Sukkar, Gheith A. Abandah, Raed T. Al-Zubi:
An improved queuing model for packet retransmission policy and variable latency decoders. IET Commun. 6(18): 3315-3328 (2012) - [j3]Rami A. Al Namneh, Khalid A. Darabkh, Iyad F. Jafar:
Efficient Bit Reversal Algorithms in Parallel Computers. Int. J. Comput. Their Appl. 19(3): 154-165 (2012) - [j2]Khalid A. Darabkh, Shereen Ismail, Mohammad Al-Shurman, Iyad F. Jafar, Eman Alkhader, Mamoun F. Al-Mistarihi:
Performance evaluation of selective and adaptive heads clustering algorithms over wireless sensor networks. J. Netw. Comput. Appl. 35(6): 2068-2080 (2012) - [c1]Iyad F. Jafar, Rami A. Al Namneh:
Improving the filtering performance of the BDND algorithm in impulse noise removal. SSD 2012: 1-6 - 2011
- [j1]Khalid A. Darabkh, Baker N. Abu-Jaradeh, Iyad F. Jafar:
Incorporating automatic repeat request and thresholds with variable complexity decoding algorithms over wireless networks: queuing analysis. IET Commun. 5(10): 1377-1393 (2011)
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-10-18 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
