Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.700
JCR 5-Year IF: 0.700
SCOPUS CiteScore: 1.8
Issues per year: 4
Current issue: Aug 2024
Next issue: Nov 2024
Avg review time: 57 days
Avg accept to publ: 60 days
APC: 300 EUR


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

2,990,395 unique visits
1,160,134 downloads
Since November 1, 2009



Robots online now
SemrushBot
bingbot
DotBot
SiteExplorer


SCOPUS CiteScore

SCOPUS CiteScore


SJR SCImago RANK

SCImago Journal & Country Rank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 24 (2024)
 
     »   Issue 3 / 2024
 
     »   Issue 2 / 2024
 
     »   Issue 1 / 2024
 
 
 Volume 23 (2023)
 
     »   Issue 4 / 2023
 
     »   Issue 3 / 2023
 
     »   Issue 2 / 2023
 
     »   Issue 1 / 2023
 
 
 Volume 22 (2022)
 
     »   Issue 4 / 2022
 
     »   Issue 3 / 2022
 
     »   Issue 2 / 2022
 
     »   Issue 1 / 2022
 
 
 Volume 21 (2021)
 
     »   Issue 4 / 2021
 
     »   Issue 3 / 2021
 
     »   Issue 2 / 2021
 
     »   Issue 1 / 2021
 
 
  View all issues  


FEATURED ARTICLE

A Proposed Signal Reconstruction Algorithm over Bandlimited Channels for Wireless Communications, ASHOUR, A., KHALAF, A., HUSSEIN, A., HAMED, H., RAMADAN, A.
Issue 1/2023

AbstractPlus






LATEST NEWS

2024-Jun-20
Clarivate Analytics published the InCites Journal Citations Report for 2023. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.700 (0.700 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.600.

2023-Jun-28
Clarivate Analytics published the InCites Journal Citations Report for 2022. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.800 (0.700 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 1.000.

2023-Jun-05
SCOPUS published the CiteScore for 2022, computed by using an improved methodology, counting the citations received in 2019-2022 and dividing the sum by the number of papers published in the same time frame. The CiteScore of Advances in Electrical and Computer Engineering for 2022 is 2.0. For "General Computer Science" we rank #134/233 and for "Electrical and Electronic Engineering" we rank #478/738.

2022-Jun-28
Clarivate Analytics published the InCites Journal Citations Report for 2021. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.825 (0.722 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.752.

2022-Jun-16
SCOPUS published the CiteScore for 2021, computed by using an improved methodology, counting the citations received in 2018-2021 and dividing the sum by the number of papers published in the same time frame. The CiteScore of Advances in Electrical and Computer Engineering for 2021 is 2.5, the same as for 2020 but better than all our previous results.

Read More »


    
 

  2/2012 - 1
View TOC | « Previous Article | Next Article »

Performance Analysis of Cell-Phone Worm Spreading in Cellular Networks through Opportunistic Communications

YAHUI, W. See more information about YAHUI, W. on SCOPUS See more information about YAHUI, W. on IEEExplore See more information about YAHUI, W. on Web of Science, DENG, S. See more information about  DENG, S. on SCOPUS See more information about  DENG, S. on SCOPUS See more information about DENG, S. on Web of Science, HUANG, H. See more information about  HUANG, H. on SCOPUS See more information about  HUANG, H. on SCOPUS See more information about HUANG, H. on Web of Science, DENG, Y. See more information about DENG, Y. on SCOPUS See more information about DENG, Y. on SCOPUS See more information about DENG, Y. on Web of Science
 
Extra paper information in View the paper record and citations in Google Scholar View the paper record and similar papers in Microsoft Bing View the paper record and similar papers in Semantic Scholar the AI-powered research tool
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (720 KB) | Citation | Downloads: 1,532 | Views: 5,095

Author keywords
opportunistic communications, delay tolerant network, 3G networks, Markov process, cell-phone worms

References keywords
mobile(14), networks(10), malware(10), sarkar(5), khouzani(5), infocom(5), infcom(5), worm(4), network(4), delay(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2012-05-30
Volume 12, Issue 2, Year 2012, On page(s): 3 - 8
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2012.02001
Web of Science Accession Number: 000305608000001
SCOPUS ID: 84865306374

Abstract
Quick view
Full text preview
Worms spreading directly between cell-phones over short-range radio (Bluetooth, WiFi, etc.) are increasing rapidly. Communication by these technologies is opportunistic and has very close relation with the social characteristics of the phone carriers. In this paper, we try to evaluate the impact of different characteristics on the spreading performance of worms. On the other hand, the behaviors of worms may have certain impact, too. For example, worms may make phones be completely dysfunctional and these phones can be seen as killed. We study the impact of the killing speed. Using the Markov model, we propose some theoretical models to evaluate the spreading performance in different cases. Simulation results show the accuracy of our models. Numerical results show that if users do not believe the data coming from others easily, the worms may bring less damage. Surprisingly, if the users are more willing to install the anti-virus software, the worms may bring bigger damage when the software becomes to be outdated with high probability. Though the worms can bring big damage on the network temporarily by killing phones rapidly, numerical results show that this behavior may decrease the total damage in the long time. Therefore, killing nodes more rapidly may be not optimal for worms.


References | Cited By  «-- Click to see who has cited this paper

[1] Z. Zhu, G. Cao, S. Zhu, S. Ranjan, A. Nucci, "A social network based patching scheme for worm containment in cellular networks," in Proc. IEEE INFOCOM, 2009.
[CrossRef] [Web of Science Times Cited 42] [SCOPUS Times Cited 89]


[2] F. Li, Y. Yang, and J. Wu, "CPMC: an efficient proximity malware coping scheme in Smartphone-based mobile networks," in Proc. IEEE INFOCOM, 2010.
[CrossRef] [SCOPUS Times Cited 52]


[3] K. Fall, "A delay-tolerant network architecture for challenged internets," in Proc. ACM SIGCOMM, 2003.
[CrossRef]


[4] G. Papastergious, I. Psaras, and V. Tsaoussidis, "Deep-space transport protocol: a novel transport scheme for space DTNs," Computer Communications, vol.32, no. 16, 2009.
[CrossRef] [Web of Science Times Cited 49] [SCOPUS Times Cited 63]


[5] J. Ott, E. Hyytiä, P. Lassila, T. Vaegs, and J. Kangasharju, "Floating content: information sharing in urban areas," in Proc. IEEE Int. Conf. PerCom, Mar. 2011.
[CrossRef] [SCOPUS Times Cited 109]


[6] B. Oh, Y. Na, J. Yang, S. Park, J. Nang, and J. Kim, "Genetic algorithm-based dynamic vehicle route search using car-to-car communications," Advances in Electrical and Computer Engineering, vol. 10, no. 4, pp. 81-86, 2010.
[CrossRef] [Full Text] [Web of Science Times Cited 16] [SCOPUS Times Cited 17]


[7] T. Spyropoulos, T. Turletti, and K. Obrazcka, "Routing in delay tolerant networks comprising heterogeneous populations of nodes," IEEE Trans. Mobile Computing, vol.8, no. 8, Aug. 2009.
[CrossRef] [Web of Science Times Cited 123] [SCOPUS Times Cited 161]


[8] E. Bulut, Z. Wang, and B. Szymanski, "Cost effective multi-period spraying for routing in delay tolerant networks," IEEE/ACM Trans. Networking, Vol. 8, no. 5, Oct. 2010.
[CrossRef] [Web of Science Times Cited 64] [SCOPUS Times Cited 97]


[9] J. Omic, A. Orda, and P. V. Mieghem, "Protecting against network infections: a game theoretic perspective," in Proc. IEEE INFOCOM, 2009.
[CrossRef] [Web of Science Times Cited 55] [SCOPUS Times Cited 80]


[10] MHR. Khouzani and S. Sarkar, "Dynamic malware attack in energy-constrained mobile wireless networks." in Proc. Fifth Symposium on Information Theory and Applications, 2010.
[CrossRef] [SCOPUS Times Cited 14]


[11] J. Su, K. Chan, A. Miklas, K. Po, A. Akhavan, S. Saroiu, E. de Lara, and A. Goel, "A preliminary investigation of worm infections in a Bluetooth environment," in Proc. ACM WORM, 2006.
[CrossRef] [SCOPUS Times Cited 83]


[12] A. Bose and K. Shin, " On mobile viruses exploiting messaging and Bluetooth services," in Proc. ICST Securecomm, 2006.
[CrossRef] [SCOPUS Times Cited 55]


[13] S. Cheng, W. C. Ao, P. Chen, and K. Chen, "On modeling malware propagation in generalized social networks," IEEE Comm. Lett., vol. 15, no. 1, Jan. 2011.
[CrossRef] [Web of Science Times Cited 75] [SCOPUS Times Cited 94]


[14] N. Husted and S. Myers, "Why mobile-to-mobile wireless malware won't cause a storm," in Proc. USENIX Workshop on Large-scale Exploits and Emergent Threats, 2011.

[15] J. Tang, C. Mascolo, M. Musolesi, and V. Latora, "Exploiting temporal complex network metrics in mobile malware containment," in Proc. WOWMOM, Jue. 2011.
[CrossRef] [SCOPUS Times Cited 35]


[16] G. Yan, L. Cuellar, and S. Eidenbenz, "Blue-watchdog: detecting Bluetooth worm propagation in public areas," in Proc. DSN, 2009.
[CrossRef] [Web of Science Times Cited 6] [SCOPUS Times Cited 10]


[17] J. Cheng, S. H. Y. Wong, H. Yang, and S. Lu, "SmartSiren: virus detection and alert for smart phones," in Proc. Mobisys, Jue. 2007.
[CrossRef] [SCOPUS Times Cited 156]


[18] MHR. Khouzani, E. Altman, and S. Sarkar, "Optimal quarantining of wireless malware through power control," in Proc. Fourth Symposium on Information Theory and Applications, University of California, San Diego, Feb. 2009.
[CrossRef]


[19] MHR. Khouzani, E. Altman, and S. Sarkar, "Maximum damage malware attack in mobile wireless networks," in Proc. IEEE INFOCOM, 2010.
[CrossRef] [SCOPUS Times Cited 36]


[20] MHR. Khouzani, S. Sarkar, and E. Altman, "Dispatch then stop: optimal dissemination of security patches in mobile wireless networks," in Proc. IEEE CDC, 2010.
[CrossRef] [Web of Science Times Cited 18] [SCOPUS Times Cited 27]


[21] MHR. Khouzani, S. Sarkar, and E. Altman, "A dynamic game solution to malware attack," in Proc. IEEE INFOCOM, Shanghai, China, Apr. 2011.
[CrossRef] [SCOPUS Times Cited 28]


[22] Y. Li, P. Hui, D. Jin, L. Su, and L. Zeng, "An optimal distributed malware defense system for mobile networks with heterogamous devices," in Proc. IEEE SECON, Jun. 2011.
[CrossRef] [SCOPUS Times Cited 9]


[23] A. P. Felt, M. Finifter, E. Chin, S. Hanna, and D. Wagner, " A survey of mobile malware in the wild," in Proc. ACM Workshop on Security and Privacy in Mobile Devices (SPSM), 2011.
[CrossRef] [SCOPUS Times Cited 588]


[24] R. Groenevelt, P. Nain, and G. Koole, "The message delay in mobile ad hoc networks," Performance Evaluation, 2005.
[CrossRef] [Web of Science Times Cited 330] [SCOPUS Times Cited 503]


[25] T. Karagiannis, J. -Y. L. Boudec, and M. Zojnovic, "Power law and exponential decay of inter contact times between mobile devices," in Proc. ACM MOBICOM, 2007.
[CrossRef] [SCOPUS Times Cited 355]


[26] A. Keranen, J. Ott, and T. Karkkainen, "The ONE simulator for DTN protocol evaluation," in Proc. SIMUTOOLS, 2009.
[CrossRef] [SCOPUS Times Cited 2101]




References Weight

Web of Science® Citations for all references: 778 TCR
SCOPUS® Citations for all references: 4,762 TCR

Web of Science® Average Citations per reference: 29 ACR
SCOPUS® Average Citations per reference: 176 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2024-11-19 11:31 in 169 seconds.




Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania


All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.




Website loading speed and performance optimization powered by: 


DNS Made Easy