2008
Kastrinogiannis, T.; Karyotis, V.; Papavassiliou, S.
On the problem of joint power and rate control in CDMA ad hoc networks Conference
Santorini, 2008, ISBN: 9781424416530, (cited By 1; Conference of 3rd International Symposium on Wireless Pervasive Computing, ISWPC 2008 ; Conference Date: 7 May 2008 Through 9 May 2008; Conference Code:73424).
Abstract | Links | BibTeX | Tags: Ad hoc networks, Boolean functions; Code division multiple access; Computer networks; Game theory; Image coding; Throughput; Wireless telecommunication systems, International symposium; Joint power and rate control
@conference{Kastrinogiannis200878,
title = {On the problem of joint power and rate control in CDMA ad hoc networks},
author = {T. Kastrinogiannis and V. Karyotis and S. Papavassiliou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-51649112462&doi=10.1109%2fISWPC.2008.4556170&partnerID=40&md5=4be2c70b1102cb3ab7c14bbc71e714ab},
doi = {10.1109/ISWPC.2008.4556170},
isbn = {9781424416530},
year = {2008},
date = {2008-01-01},
journal = {3rd International Symposium on Wireless Pervasive Computing, ISWPC 2008, Proceedings},
pages = {78-82},
address = {Santorini},
abstract = {In this work, the problem of joint power and rate control (PRC) in CDMA-based ad hoc networks is considered and analyzed. We propose a game theoretic framework for performing efficient power and rate allocation in CDMA ad hoc networks and develop a distributed PRC algorithm for dynamically selecting the optimal neighboring destination, power and rate values. The objective is to maximize properly-defined node utility functions that reflect a tradeoff between actual achieved throughput and power consumption. The PRC algorithm selects opportunistically the destination nodes, by exploiting current channel state information, as expressed by the experienced SINR of the receivers, while it assures the convergence at the game's unique Nash Equilibrium point in terms of power and rate transmission vectors. We demonstrate the performance of the proposed algorithm in two different network scenarios with respect to the allocated transmission power, received node performance satisfaction, actual achieved throughput and the convergence of the non-cooperative game. © 2008 IEEE.},
note = {cited By 1; Conference of 3rd International Symposium on Wireless Pervasive Computing, ISWPC 2008 ; Conference Date: 7 May 2008 Through 9 May 2008; Conference Code:73424},
keywords = {Ad hoc networks, Boolean functions; Code division multiple access; Computer networks; Game theory; Image coding; Throughput; Wireless telecommunication systems, International symposium; Joint power and rate control},
pubstate = {published},
tppubtype = {conference}
}
Kastrinogiannis, T.; Karyotis, V.; Papavassiliou, S.
An opportunistic combined power and rate allocation approach in CDMA ad hoc networks Conference
Princeton, NJ, 2008, ISBN: 1424418437; 9781424418435, (cited By 3; Conference of 2008 IEEE Sarnoff Symposium, SARNOFF ; Conference Date: 28 April 2008 Through 30 April 2008; Conference Code:72891).
Abstract | Links | BibTeX | Tags: Ad hoc networks, Code division multiple access; Game theory; Mobile telecommunication systems; Wireless telecommunication systems, Distributed power; Generic frameworks; Good put; Nash equilibrium point; Non-cooperative games; Physical limitations; Power consumption; Rate allocation; Rate Control; Utility functions; Wireless CDMA ad hoc networks
@conference{Kastrinogiannis2008,
title = {An opportunistic combined power and rate allocation approach in CDMA ad hoc networks},
author = {T. Kastrinogiannis and V. Karyotis and S. Papavassiliou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-49049084291&doi=10.1109%2fSARNOF.2008.4520063&partnerID=40&md5=c888c8b990338c4a5b0e820a185b7a52},
doi = {10.1109/SARNOF.2008.4520063},
isbn = {1424418437; 9781424418435},
year = {2008},
date = {2008-01-01},
journal = {Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF},
address = {Princeton, NJ},
abstract = {In this paper, we address the problem of joint power and rate allocation in wireless CDMA ad hoc networks. A generic framework for efficiently assigning power and rate is proposed, in order to minimize power consumption and interference, and maximize overall goodput under the imposed physical limitations. The problem is formulated as a non-cooperative game where users selfishly aim at maximizing their performance by means of a utility function. Allowing only one receiver per transmitter at a time we reduce the problem to a special case of a generic game, namely point-to-point game (PTPG). The existence of a Nash equilibrium point of the PTPG is shown and a novel opportunistic and distributed power and rate control (PRC) algorithm is proposed for achieving PTPG's equilibrium.},
note = {cited By 3; Conference of 2008 IEEE Sarnoff Symposium, SARNOFF ; Conference Date: 28 April 2008 Through 30 April 2008; Conference Code:72891},
keywords = {Ad hoc networks, Code division multiple access; Game theory; Mobile telecommunication systems; Wireless telecommunication systems, Distributed power; Generic frameworks; Good put; Nash equilibrium point; Non-cooperative games; Physical limitations; Power consumption; Rate allocation; Rate Control; Utility functions; Wireless CDMA ad hoc networks},
pubstate = {published},
tppubtype = {conference}
}
Karyotis, V.; Kakalis, A.; Papavassiliou, S.
Malware-propagative mobile ad hoc networks: Asymptotic behavior analysis Journal Article
In: Journal of Computer Science and Technology, vol. 23, no. 3, pp. 389-399, 2008, ISSN: 10009000, (cited By 25).
Abstract | Links | BibTeX | Tags: Ad hoc networks, Closed queuing networks; Infection efficiency; Multiple attackers, Computer software; Mathematical models; Parameter estimation; Queueing networks
@article{Karyotis2008389,
title = {Malware-propagative mobile ad hoc networks: Asymptotic behavior analysis},
author = {V. Karyotis and A. Kakalis and S. Papavassiliou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-44649129992&doi=10.1007%2fs11390-008-9141-z&partnerID=40&md5=1404069b5474265cb5c3f551cfc609c6},
doi = {10.1007/s11390-008-9141-z},
issn = {10009000},
year = {2008},
date = {2008-01-01},
journal = {Journal of Computer Science and Technology},
volume = {23},
number = {3},
pages = {389-399},
abstract = {In this paper, the spreading of malicious software over ad hoc networks, where legitimate nodes are prone to propagate the infections they receive from either an attacker or their already infected neighbors, is analyzed. Considering the Susceptible-Infected-Susceptible (SIS) node infection paradigm we propose a probabilistic model, on the basis of the theory of closed queuing networks, that aims at describing the aggregated behavior of the system when attacked by malicious nodes. Because of its nature, the model is also able to deal more effectively with the stochastic behavior of attackers and the inherent probabilistic nature of the wireless environment. The proposed model is able to describe accurately the asymptotic behavior of malware-propagative large scale ad hoc networking environments. Using the Norton equivalent of the closed queuing network, we obtain analytical results for its steady state behavior, which in turn is used for identifying the critical parameters affecting the operation of the network. Finally, through modeling and simulation, some additional numerical results are obtained with respect to the behavior of the system when multiple attackers are present, and regarding the time-dependent evolution and impact of an attack. © 2008 Science Press, Beijing, China and Springer Science + Business Media, LLC, USA.},
note = {cited By 25},
keywords = {Ad hoc networks, Closed queuing networks; Infection efficiency; Multiple attackers, Computer software; Mathematical models; Parameter estimation; Queueing networks},
pubstate = {published},
tppubtype = {article}
}
2007
Karyotis, V.; Grammatikou, M.; Papavassiliou, S.
On the asymptotic behavior of malware-propagative mobile ad hoc networks Conference
Pisa, 2007, ISBN: 1424414555; 9781424414550, (cited By 3; Conference of 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS ; Conference Date: 8 October 2007 Through 11 October 2007; Conference Code:73246).
Abstract | Links | BibTeX | Tags: Ad hoc networks, Asymptotic analysis; Computer crime; Probability; Queueing networks; Queueing theory; Sensors; Stochastic models; Switching circuits; Telecommunication networks; Wireless networks; Wireless telecommunication systems
@conference{Karyotis2007,
title = {On the asymptotic behavior of malware-propagative mobile ad hoc networks},
author = {V. Karyotis and M. Grammatikou and S. Papavassiliou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-50249169440&doi=10.1109%2fMOBHOC.2007.4428662&partnerID=40&md5=b4dae755dc5ed6d0015834da1dd02d25},
doi = {10.1109/MOBHOC.2007.4428662},
isbn = {1424414555; 9781424414550},
year = {2007},
date = {2007-01-01},
journal = {2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS},
address = {Pisa},
abstract = {In this paper we study the spreading of malicious software over ad hoc networks, where legitimate nodes are prone to propagate the infections they receive from an attacker or their already infected neighbors. Considering the Susceptible-Infected-Susceptible (SIS) node infection paradigm we propose a probabilistic model, based on the theory of closed queueing networks, that aims at describing the aggregated behavior of the system when attacked by a malicious node. Due to its nature the model is able to deal more effectively with the stochastic behavior of the attacker and the inherent probabilistic nature of the wireless environment. The proposed model is able to describe accurately the asymptotic behavior of malware-propagative ad hoc networking environments, where the number of nodes is large. Using the Norton equivalent of the closed queueing network, we obtain analytical results for its steady state behavior, which in turn can be used to identify the critical parameters affecting the operation of the network. ©2007 IEEE.},
note = {cited By 3; Conference of 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS ; Conference Date: 8 October 2007 Through 11 October 2007; Conference Code:73246},
keywords = {Ad hoc networks, Asymptotic analysis; Computer crime; Probability; Queueing networks; Queueing theory; Sensors; Stochastic models; Switching circuits; Telecommunication networks; Wireless networks; Wireless telecommunication systems},
pubstate = {published},
tppubtype = {conference}
}
Karyotis, V.; Papavassiliou, S.
On the malware spreading over non-propagative wireless ad hoc networks: The attacker's perspective Conference
Chania, Crete Island, 2007, ISBN: 9781595938060, (cited By 4; Conference of Q2SWinet'07: 3rd ACM Workshop on Q2S and Security for Wireless and Mobile Networks ; Conference Date: 22 October 2007 Through 22 October 2007; Conference Code:71773).
Abstract | Links | BibTeX | Tags: Ad hoc networks, Attack strategies; Malware spreading, Computer crime; Optimization; Parameter estimation; Queueing networks
@conference{Karyotis2007156,
title = {On the malware spreading over non-propagative wireless ad hoc networks: The attacker's perspective},
author = {V. Karyotis and S. Papavassiliou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-42149094983&doi=10.1145%2f1298239.1298268&partnerID=40&md5=d22b4d7ed501e1c1818bf98805ea6ba6},
doi = {10.1145/1298239.1298268},
isbn = {9781595938060},
year = {2007},
date = {2007-01-01},
journal = {Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks},
pages = {156-159},
address = {Chania, Crete Island},
abstract = {In this paper, we adopt a probabilistic framework for malware spreading and propose a closed queueing network model that is able to describe analytically the aggregated behavior of an ad hoc network attacked by multiple malicious nodes, In our framework, the attackers are assumed to be capable of initially adapting their transmission radii and thus employing different attack strategies, We take on the attacker's perspective and formulate various optimization problems with respect to the development of different attack strategies, that address the attackers' objective to harm the network and identify the system parameters that can be exploited to achieve this purpose more effectively. Copyright 2007 ACM.},
note = {cited By 4; Conference of Q2SWinet'07: 3rd ACM Workshop on Q2S and Security for Wireless and Mobile Networks ; Conference Date: 22 October 2007 Through 22 October 2007; Conference Code:71773},
keywords = {Ad hoc networks, Attack strategies; Malware spreading, Computer crime; Optimization; Parameter estimation; Queueing networks},
pubstate = {published},
tppubtype = {conference}
}
Karyotis, V.; Papavassiliou, S.
Risk-based attack strategies for mobile ad hoc networks under probabilistic attack modeling framework Journal Article
In: Computer Networks, vol. 51, no. 9, pp. 2397-2410, 2007, ISSN: 13891286, (cited By 7).
Abstract | Links | BibTeX | Tags: Ad hoc networks, Algorithms; Computer simulation; Probabilistic logics; Quality of service; Security of data; Topology, Attack modeling; Probabilistic attack modeling; Topology control
@article{Karyotis20072397,
title = {Risk-based attack strategies for mobile ad hoc networks under probabilistic attack modeling framework},
author = {V. Karyotis and S. Papavassiliou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-34247478945&doi=10.1016%2fj.comnet.2007.01.028&partnerID=40&md5=3b4a5a51628b08d67a280b66e916e260},
doi = {10.1016/j.comnet.2007.01.028},
issn = {13891286},
year = {2007},
date = {2007-01-01},
journal = {Computer Networks},
volume = {51},
number = {9},
pages = {2397-2410},
abstract = {In this paper, we introduce and design a modeling framework that allows for the study and analysis of attack propagation in mobile ad hoc networks. The choice of a statistical approach for the problem is motivated by the dynamic characteristics of the ad hoc topology and the stochastic nature of threat propagation. Based on this probabilistic modeling framework, we study the impact of topology and mobility in the propagation of software threats over ad hoc networks. We design topology control algorithms that indicate how to properly adjust an attacker's transmission radius, according to the measured topological characteristics and availability of its resources, in the process of infecting a network more effectively. Then based on these topology control algorithms we develop different attack strategies that may range from independent attacks to cooperative scenarios in order to increase the negative impact of an attack on the network. Our performance evaluation results demonstrate that the proposed topology control algorithms and respective attack strategies effectively balance the tradeoffs between the potential network damage and the attackers' lifetime, and as a result significantly outperform any other flat and threshold-based approaches. © 2007 Elsevier B.V. All rights reserved.},
note = {cited By 7},
keywords = {Ad hoc networks, Algorithms; Computer simulation; Probabilistic logics; Quality of service; Security of data; Topology, Attack modeling; Probabilistic attack modeling; Topology control},
pubstate = {published},
tppubtype = {article}
}