Contact Information

Department of Computer Engineering
Middle East Technical University
İnönü Bulvarı No:1, 06800, Ankara, Turkey
E-mail: eronur@metu.edu.tr (PGPKey)
Web: https://eonur.ceng.metu.edu.tr
Mobile: +90 (553) 772 6589
Office: +90 (312) 210 5534
Fax: +90 (312) 210 5544
Google scholar profile

Biography

Ertan Onur received the BSc degree in computer engineering from Ege University, Izmir, Turkey in 1997, and the MSc and PhD degrees in computer engineering from Bogazici University, Istanbul, Turkey in 2001 and 2007, respectively. After the BSc degree, he worked for LMS Durability Technologies GmbH, Kaiserslautern, Germany. During the MSc and PhD degrees, he worked as a project leader at Global Bilgi, Istanbul and as an R&D project manager at Argela Technologies, Istanbul. He developed and managed many commercial telecommunications applications, and has a patent. After obtaining his PhD degree, he worked as an assistant professor at Delft University of Technology, the Netherlands. From 2014 on, he is with Middle East Technical University, Turkey. He was the editor/convenor of the Personal Networks Group of Ecma International Standardization Body. Dr. Onur’s research interests are in the area of computer and wireless networks and their security. He is the founder of the Wireless systems, Networks and Cybersecurity Laboratory (WINS Lab). He is a member of IEEE.

Türkçe Biyografi

5G VE ÖTESİ LİSANSÜSTÜ DESTEKLEME PROGRAMI ile ilgilenen ODTÜ Bilgisayar Mühendisliği Bölümü lisansüstü öğrencileri e-posta yoluyla benden bilgi alabilirler. Başvurular her dönem açılacak.

Education and degrees

May 2013	Associate Prof. Degree	Turkey, CS
2001-2007	Bogazici University, Turkey	PhD, CmpE
1998-2001	Bogazici University, Turkey	MSc, CmpE
1993-1997	Ege University, Turkey	BSc, CmpE

Work Experience

2014-	Middle East Technical University	Assoc. Prof.
2009-2013	Delft University of Technology	Asst. Prof.
2007-2008	Delft University of Technology	Postdoc
2003-2007	Argela Technologies, Turkey	Project Manager
2000-2003	Global Bilgi, Turkey	Project Leader
1999-2000	Bogazici University, Turkcell project	Researcher
1997-1999	LMS Durability Technologies, Germany	Trainee, Soft. Eng.

Teaching

CENG435 Data Communications and Networking
CENG513 Wireless Communications and Networks
CENG530 Computer Networks and Communications
CENG781 Network Security
CENG559 Data Security and Protection
CENG532 Distributed Computing Systems

Completed PhD Theses Guided by Ertan Onur

Shahram Mollahasani, A density-aware, energy- and spectrum-efficient scheduling model for dynamic networks, 2019
Yunus Durmus, Autonomous Cooperation in the IoT, TUDelft, 2016 (Promoter: Prof. K. Langendoen)
Zulkuf Genc, Future Home Networks over 60GHz, TUDelft, 2014 (Promoter: Prof. I. Niemegeers)

Completed MS Theses Guided by Ertan Onur

A. Ömer Yamaç, Dynamically determining RAT for energy efficiency in 5G mobile networks, 04 September 2019
Negin Tabrizi, An ad hoc networking testbed using software-defined radios, 04 September 2019
Doğanalp Ergenç, Control and User Plane Separation in Ad-hoc Networks, METU, 03 September 2018.
Mert Çalık, Joint Optimization of Cell Zooming, Scheduling and User Association, METU, 02 February 2018.
Talha Koruk, Bio-inspired Solutions for Bandwidth Packing, METU, 19 January 2018.
Aybike Şimşek Dilbaz, Design and Implementation of a Smart Greenhouse, METU, 08 September 2017.
Adnan Kılıç, Revisiting Shamir’s No-key Protocol: Lightweight Key Transportation, METU, 05 September 2017 (Co-advisor: Cansu Betin Onur, Atılım University, Department of Mathematics).
Can Mehteroğlu, Semantic Prefetching and Caching in 5G, METU, 11 August 2017.
Alperen Eroglu, Esimating Density in Large Scale Sensor Networks, METU, 29 January 2015 (Co-advisor: Halit Oguztuzun)
Tariqul Islam, Statistical Modeling of Intelligent Transportation Systems Communication Channels, TUDelft, 22 May 2013 (Co-advisor B.Boltjes, TNO)
Praveen Kalyasunadram, Cooperative Spectrum Sensing Algorithms in WBAN, TUDelft, 24 October 2012 (Co-advisor: H. Li (IMEC-NL))
Mihai Constantinescu, Cooperative Networks: The Mobile Tethering Game, TUDelft, 27 August 2012 (Co-advisor: M. Djurica (TNO), Y. Durmus)
Yuning Liu, Green Routing Protocols Employing Dual-Radio Cooperation, TUDelft, 30 June 2011 (Co-advisor: M. G. Hawas)
Khashayar Kotobi, Energy Conservation of Cooperative Communication over Composite Channels, TUDelft, 21 June 2011 (Co-advisor: Dr. U.H. Rizvi) Presently, PhD Student @Pennsylvania State University
Arash Khatibi, Event-driven MAC Protocol For Dual-Radio Cooperation, TUDelft, 21 June 2011 (Co-advisor: Y. Durmus) Presently, PhD Student @University of Illinois at Urbana-Champaign
Tamas Veres, Information Dissemination in Vehicular Networks, TUDelft, 31 May 2011 (Co-advisor: Franck Legendre, Idea League, ETH Switzerland)
Santiago Alvarez Alvarez, Cognitive Control Plane for Wireless Networks, TUDelft, 31 May 2010 (Co-advisor: Z. Genc)
Gencay Olcer, Future home networks: Connectivity in 60 GHz Home Networks, TUDelft, 26 April 2010 (Co-advisor: Z. Genc)
Ilir Bojaxhiu, MSc, Mitigation Techniques for the Energy-Hole Problem in Wireless Sensor Networks, Bogazici University, 2009 (Advisor: Prof. Cem Ersoy)

Projects

2019 ULAK 5G New Radio Resource Allocation Strategies
2019 LNL Cellular Mobile Communication Component Development
2018 MILSOFT HvBS-NATO ACCS Bütünleşmesi Projesi
2017-2018 ASELSAN Cross-layer Clustered Ad Hoc Networks
2016-2018 TÜBİTAK-1001 215E127 Density-adaptive Wireless Networks, 427.478 TL
2017, TCKK Güvenlik Araştırması, Akademik Görevlendirme
2015-2017 TÜBİTAK 2232 115C064 Bilici Makine Olarak lnternet (Internet as the Oracle), 29.000TL (Proposer)
2014-2015 BAP-08-11-2014-025 Software Development Platform for Heterogeneous Internet of Things, 30.000 TL (Proposer)
2009-2013 Trans Project, Cognitive Collaborative Networked Systems, TUDelft, 400.000 Euro (Co-proposer)
2007-2008 Freeband, PNP2008: Development of a user centric ambient communication environment, 8M (postdoctoral researcher)
2006-2007 TUBITAK, Performance Evaluation and Design of Wireless Sensor Networks, $165K (researcher)
2004-2006 Bogazici University Research Fund, Wireless Sensor Networks, $9K (researcher)
2004-2005 State Planning Organization of Turkey, Wireless Ad Hoc and Sensor Networks, $140K (researcher)
2003-2004 Turkcell Inc., Replanning of Cell Capacities in Cellular Wireless Networks, $100K (researcher)
2003-2004 State Planning Org. of Turkey, Multimedia Communications over Wireless Networks, $263K (researcher)

Publications

	Demirpolat, Ahmed, Ergenç, Doğanalp, Ozturk, Esref, Ayar, Yusuf, Onur, Ertan Software-Defined Network Security Book Chapter Enabling Technologies and Architectures for Next-Generation Networking Capabilities, pp. 232–253, IGI Global, 2019. BibTeX @inbook{demirpolat2019software, title = {Software-Defined Network Security}, author = {Demirpolat, Ahmed and Ergen{ç}, Do{ğ}analp and Ozturk, Esref and Ayar, Yusuf and Onur, Ertan}, year = {2019}, date = {2019-01-01}, booktitle = {Enabling Technologies and Architectures for Next-Generation Networking Capabilities}, pages = {232--253}, publisher = {IGI Global}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } Close
	Kaya, Muhammed Cagri and Eroglu, Alperen and Karamanlioglu, Alper and Onur, Ertan and Tekinerdogan, Bedir and Dogru, Ali H. Runtime Adaptability of Ambient Intelligence Systems Based on Component-Oriented Approach Book Chapter Mahmood, Zaigham (Ed.): Guide to Ambient Intelligence in the IoT Environment: Principles, Technologies and Applications, pp. 69–92, Springer International Publishing, Cham, 2019, ISBN: 978-3-030-04173-1. Abstract \| Links \| BibTeX @inbook{Kaya2019, title = {Runtime Adaptability of Ambient Intelligence Systems Based on Component-Oriented Approach}, author = {Kaya, Muhammed Cagri and Eroglu, Alperen and Karamanlioglu, Alper and Onur, Ertan and Tekinerdogan, Bedir and Dogru, Ali H.}, editor = {Mahmood, Zaigham}, url = {https://doi.org/10.1007/978-3-030-04173-1_4}, doi = {10.1007/978-3-030-04173-1_4}, isbn = {978-3-030-04173-1}, year = {2019}, date = {2019-01-01}, booktitle = {Guide to Ambient Intelligence in the IoT Environment: Principles, Technologies and Applications}, pages = {69--92}, publisher = {Springer International Publishing}, address = {Cham}, abstract = {Technological improvements of the Internet and connected devices cause increased user expectations. People want to be offered different services in nearly every aspect of their lives. It is a key point that these services can be reached seamlessly and should be dynamically available conforming to the active daily life of today's people. This can be achieved by having intelligent environments along with smart appliances and applications. The concept of ambient intelligence arises from this need to react with users at runtime and keep providing real-time services under changing conditions. This chapter introduces a component-oriented ontology-based approach to develop runtime adaptable ambient intelligenceAmbient Intelligence (AmI)systems. In this approach, the adaptability mechanism is enabled through a component-oriented method with variability-related capabilities. The outcome supports the find-and-integrate method from the idea formation to the executable system, and thus reducing the need for heavy processes for development. Intelligence is provided through ontology modeling that supports repeatability of the approach in different domains, especially when used in interaction with component variability. In this context, an example problem exploiting the variability in the density of a smart stadium network is used to illustrate the application of the component-driven approach.}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } Close Technological improvements of the Internet and connected devices cause increased user expectations. People want to be offered different services in nearly every aspect of their lives. It is a key point that these services can be reached seamlessly and should be dynamically available conforming to the active daily life of today's people. This can be achieved by having intelligent environments along with smart appliances and applications. The concept of ambient intelligence arises from this need to react with users at runtime and keep providing real-time services under changing conditions. This chapter introduces a component-oriented ontology-based approach to develop runtime adaptable ambient intelligenceAmbient Intelligence (AmI)systems. In this approach, the adaptability mechanism is enabled through a component-oriented method with variability-related capabilities. The outcome supports the find-and-integrate method from the idea formation to the executable system, and thus reducing the need for heavy processes for development. Intelligence is provided through ontology modeling that supports repeatability of the approach in different domains, especially when used in interaction with component variability. In this context, an example problem exploiting the variability in the density of a smart stadium network is used to illustrate the application of the component-driven approach. Close https://doi.org/10.1007/978-3-030-04173-1_4 doi:10.1007/978-3-030-04173-1_4 Close
	Mollahasani, Shahram, Onur, Ertan Density-Aware, Energy-and Spectrum-Efficient Small Cell Scheduling Journal Article IEEE Access, 7 , pp. 65852–65869, 2019. BibTeX @article{mollahasani2019density, title = {Density-Aware, Energy-and Spectrum-Efficient Small Cell Scheduling}, author = {Mollahasani, Shahram and Onur, Ertan}, year = {2019}, date = {2019-01-01}, journal = {IEEE Access}, volume = {7}, pages = {65852--65869}, publisher = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close
	Eroğlu, Alperen, Yaman, Okan, Onur, Ertan Density-aware cellular coverage control: Interference-based density estimation Journal Article Computer Networks, 165 , pp. 106922, 2019. BibTeX @article{erouglu2019density, title = {Density-aware cellular coverage control: Interference-based density estimation}, author = {Ero{ğ}lu, Alperen and Yaman, Okan and Onur, Ertan}, year = {2019}, date = {2019-01-01}, journal = {Computer Networks}, volume = {165}, pages = {106922}, publisher = {Elsevier}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close
	Ergenç, Doğanalp, Onur, Ertan iSDR: SDR-in-the-loop Simulation Inproceedings IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1037–1038, IEEE 2019. BibTeX @inproceedings{ergencc2019isdr, title = {iSDR: SDR-in-the-loop Simulation}, author = {Ergen{ç}, Do{ğ}analp and Onur, Ertan}, year = {2019}, date = {2019-01-01}, booktitle = {IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)}, pages = {1037--1038}, organization = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close
	Simsek, Goksel, Alemdar, Hande, Onur, Ertan Multi-Connectivity Enabled User Association Inproceedings 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1–6, IEEE 2019. BibTeX @inproceedings{simsek2019multi, title = {Multi-Connectivity Enabled User Association}, author = {Simsek, Goksel and Alemdar, Hande and Onur, Ertan}, year = {2019}, date = {2019-01-01}, booktitle = {2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)}, pages = {1--6}, organization = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close
	Ergenç, Doǧanalp, Eksert, Levent, Onur, Ertan Dependability-based Clustering in Mobile Ad-Hoc Networks Journal Article Ad Hoc Networks, pp. 101926, 2019. BibTeX @article{ergencc2019dependability, title = {Dependability-based Clustering in Mobile Ad-Hoc Networks}, author = {Ergen{ç}, Doǧanalp and Eksert, Levent and Onur, Ertan}, year = {2019}, date = {2019-01-01}, journal = {Ad Hoc Networks}, pages = {101926}, publisher = {Elsevier}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close
	Cavit Kara, Ertan Onur A Software-defined Network Based Lightweight Cluster Inproceedings Proc. of the IEEE Signal Processing and Communication Applications (SIU), İzmir, Turkey, 2018. BibTeX @inproceedings{Kara2018SIU, title = {A Software-defined Network Based Lightweight Cluster}, author = {Cavit Kara and Ertan Onur}, year = {2018}, date = {2018-05-02}, booktitle = {Proc. of the IEEE Signal Processing and Communication Applications (SIU)}, address = {İzmir, Turkey}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close
	Shahram Mollahasani, Ertan Onur Density-Aware Power Allocation in Mobile Networks Using Edge Computing Inproceedings İzmir, Turkey, 2018. BibTeX @inproceedings{Mollahasan2018SIU, title = {Density-Aware Power Allocation in Mobile Networks Using Edge Computing}, author = {Shahram Mollahasani and Ertan Onur}, year = {2018}, date = {2018-05-02}, journal = {Proc. of the IEEE Signal Processing and Communication Applications (SIU) }, address = {İzmir, Turkey}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close
	Alperen Eroglu, Ertan Onur, Mehmet Turan Density-aware Outage in Clustered Ad Hoc Networks Inproceedings NTMS'2018 - Mobility & Wireless Networks Track (NTMS 2018 Mobility & Wireless Track), Paris, France, 2018. Abstract \| BibTeX @inproceedings{Erog1802:Density, title = {Density-aware Outage in Clustered Ad Hoc Networks}, author = {Alperen Eroglu and Ertan Onur and Mehmet Turan}, year = {2018}, date = {2018-01-01}, booktitle = {NTMS'2018 - Mobility & Wireless Networks Track (NTMS 2018 Mobility & Wireless Track)}, address = {Paris, France}, abstract = {Density of ad hoc networks may vary in time and space because of mobile stations, sleep scheduling or failure of nodes. Resources such as spectrum will be wasted if the network is not density-aware and -adaptive. Towards this aim, distributed and robust network density estimators are required. In this paper, we propose a novel cluster density estimator in random ad hoc networks by employing distance matrix. Monte-Carlo simulation results validate the proposed estimator in addition to comparison with two different estimators. The accuracy of the estimator is impressive even under a high amount of distance measurement errors. We also demonstrate impact of density on network outage and transmission power adaption via proposing 2-D analytic models based on density and validating these models with the proposed density estimator.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Density of ad hoc networks may vary in time and space because of mobile stations, sleep scheduling or failure of nodes. Resources such as spectrum will be wasted if the network is not density-aware and -adaptive. Towards this aim, distributed and robust network density estimators are required. In this paper, we propose a novel cluster density estimator in random ad hoc networks by employing distance matrix. Monte-Carlo simulation results validate the proposed estimator in addition to comparison with two different estimators. The accuracy of the estimator is impressive even under a high amount of distance measurement errors. We also demonstrate impact of density on network outage and transmission power adaption via proposing 2-D analytic models based on density and validating these models with the proposed density estimator. Close
	Okan Yaman, Alperen Eroglu, Ertan Onur Density-aware Cell Zooming Inproceedings 2018 21st Conference on Innovation in Clouds, Internet and Networks (ICIN) (ICIN 2018), Paris, France, 2018. Abstract \| BibTeX @inproceedings{Erog1802:Densityb, title = {Density-aware Cell Zooming}, author = {Okan Yaman and Alperen Eroglu and Ertan Onur}, year = {2018}, date = {2018-01-01}, booktitle = {2018 21st Conference on Innovation in Clouds, Internet and Networks (ICIN) (ICIN 2018)}, address = {Paris, France}, abstract = {Ultra-dense deployments and mobile cells significantly change cellular networking paradigm. Infrastructure and topology of cellular networks become dynamic as opposed to legacy systems where the infrastructure is assumed to be stationary. As topology morphs, base station or user density of networks also change impacting the performance in terms of resource utilization and quality of service. To increase network capacity, preserve coverage and conserve energy, network density should be considered in communication stacks to make the network density-aware, and -adaptive. In this work, we analyze the impact of density on network outage in cellular networks. We propose a novel cell zooming technique at run-time considering network outage and density jointly with a three-dimensional base station density estimator.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Ultra-dense deployments and mobile cells significantly change cellular networking paradigm. Infrastructure and topology of cellular networks become dynamic as opposed to legacy systems where the infrastructure is assumed to be stationary. As topology morphs, base station or user density of networks also change impacting the performance in terms of resource utilization and quality of service. To increase network capacity, preserve coverage and conserve energy, network density should be considered in communication stacks to make the network density-aware, and -adaptive. In this work, we analyze the impact of density on network outage in cellular networks. We propose a novel cell zooming technique at run-time considering network outage and density jointly with a three-dimensional base station density estimator. Close
	Doğanalp Ergenç, Levent Eksert, Ertan Onur Density-aware Probabilistic Clustering in Ad hoc Networks Inproceedings 2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) (IEEE BlackSeaCom 2018), Batumi, Georgia, 2018. Abstract \| BibTeX @inproceedings{Erge1806:Density, title = {Density-aware Probabilistic Clustering in Ad hoc Networks}, author = {Doğanalp Ergenç and Levent Eksert and Ertan Onur}, year = {2018}, date = {2018-01-01}, booktitle = {2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) (IEEE BlackSeaCom 2018)}, address = {Batumi, Georgia}, abstract = {Clustering makes an ad hoc network scalable forming easy-to-manage local groups. However, it brings an extra control overhead to create and maintain clustered network topology. In this paper, we propose Probabilistic Clustering Algorithm that is a simple and efficient clustering algorithm with minimal overhead. In this algorithm, cluster heads are determined probabilistically in a distributed fashion. An analytic model is introduced for nodes to compute the probability of declaring themselves as cluster heads. We validate the analytic model by Monte-Carlo simulations. Furthermore, we propose a cross-layer clustered stack and simulate simple applications in stationary and dynamic topologies using OMNeT++. Discrete event simulation results show that Probabilistic Clustering Algo- rithm eliminates a significant amount of control overhead and the performance of the algorithm is considerably better compared to its opponent, Identity-based Clustering Algorithm in both uniform and nonuniform network deployments.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Clustering makes an ad hoc network scalable forming easy-to-manage local groups. However, it brings an extra control overhead to create and maintain clustered network topology. In this paper, we propose Probabilistic Clustering Algorithm that is a simple and efficient clustering algorithm with minimal overhead. In this algorithm, cluster heads are determined probabilistically in a distributed fashion. An analytic model is introduced for nodes to compute the probability of declaring themselves as cluster heads. We validate the analytic model by Monte-Carlo simulations. Furthermore, we propose a cross-layer clustered stack and simulate simple applications in stationary and dynamic topologies using OMNeT++. Discrete event simulation results show that Probabilistic Clustering Algo- rithm eliminates a significant amount of control overhead and the performance of the algorithm is considerably better compared to its opponent, Identity-based Clustering Algorithm in both uniform and nonuniform network deployments. Close
	Doganalp Ergenc, Ertan Onur Cross-layer Stack Design Framework in OMNeT++ Inproceedings Förster, Anna; Udugama, Asanga; Virdis, Antonio; Nardini, Giovanni (Ed.): Proceedings of the 5th International OMNeT++ Community Summit, pp. 11–22, EasyChair, 2018, ISSN: 2398-7340. Links \| BibTeX @inproceedings{OMNeT2018:Cross_layer_Stack_Design_Framework, title = {Cross-layer Stack Design Framework in OMNeT++}, author = {Doganalp Ergenc and Ertan Onur}, editor = {Anna Förster and Asanga Udugama and Antonio Virdis and Giovanni Nardini}, url = {https://easychair.org/publications/paper/Sklb}, doi = {10.29007/45sr}, issn = {2398-7340}, year = {2018}, date = {2018-01-01}, booktitle = {Proceedings of the 5th International OMNeT++ Community Summit}, volume = {56}, pages = {11--22}, publisher = {EasyChair}, series = {EPiC Series in Computing}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close https://easychair.org/publications/paper/Sklb doi:10.29007/45sr Close
	Mert Çalık, Shahram Mollahasani, Ertan Onur Density-aware Joint Optimization of Cell Scheduling and User Association Conference IEEE WCNC FLEXNETS 2018, Paris, France, 2018. BibTeX @conference{Calik2018, title = {Density-aware Joint Optimization of Cell Scheduling and User Association}, author = {Mert Çalık and Shahram Mollahasani and Ertan Onur}, year = {2018}, date = {2018-01-01}, booktitle = {IEEE WCNC FLEXNETS 2018}, address = {Paris, France}, keywords = {}, pubstate = {published}, tppubtype = {conference} } Close
	Adnan Kılıç, Cansu Betin Onur, Ertan Onur Revisiting Shamir's No-key Protocol: Lightweight Key Transport Inproceedings Forthcoming 15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC), Orlando Florida, Forthcoming. BibTeX @inproceedings{KilicDASC2017, title = {Revisiting Shamir's No-key Protocol: Lightweight Key Transport}, author = {Adnan Kılıç and Cansu Betin Onur and Ertan Onur}, year = {2017}, date = {2017-11-10}, booktitle = {15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC)}, address = {Orlando Florida}, keywords = {}, pubstate = {forthcoming}, tppubtype = {inproceedings} } Close
	Shahram Mollahasani, Alperen Eroğlu, Ömer Yamaç, Ertan Onur Simulators, Test Beds and Prototypes of 5G mobile Networking Architectures Book Chapter Forthcoming Elkhodr, Mahmoud; Hassan, Qusay; Shahrestani, Seyed (Ed.): Chapman and Hall/CRC, Networks of the Future: Architectures, Technologies, and Implementations, Forthcoming, ISBN: 9781498783972. Abstract \| BibTeX @inbook{Mollahasani2017, title = {Simulators, Test Beds and Prototypes of 5G mobile Networking Architectures}, author = {Shahram Mollahasani and Alperen Eroğlu and Ömer Yamaç and Ertan Onur}, editor = {Mahmoud Elkhodr and Qusay Hassan and Seyed Shahrestani}, isbn = {9781498783972}, year = {2017}, date = {2017-09-15}, publisher = {Chapman and Hall/CRC}, edition = {Networks of the Future: Architectures, Technologies, and Implementations}, series = {Chapman & Hall/CRC Computer and Information Science Series}, abstract = {There will be a big leap in mobile communications in the coming years. Heterogeneous infrastructures, including ubiquitous solutions such as the Internet of Things, Machine to Machine Communication, and Intelligent Transportation Systems will be an integral part of mobile communication networks. Cloudification, softwarization and visualization will be the major paradigm changes in the design of networks to achieve flexible and efficient systems providing a high capacity with minimal delay. To materialize this vision, many research challenges have to be addressed and validated on simulators or test beds. Prior to deployment of developed features in 5G systems, experimentations of the proposals under realistic and practical operating circumstances are required. Well-designed simulators and test beds for 5G experimentation are needed towards this aim. This chapter explains and analyzes some of the 5G simulators, federations, test beds, and their prototypes by considering some research and design issues. The joint requirements and the comparison criteria for 5G test beds are explained and presented. This chapter also explains and compares the reviewed 5G simulators in terms of some shared design and research properties. }, keywords = {}, pubstate = {forthcoming}, tppubtype = {inbook} } Close There will be a big leap in mobile communications in the coming years. Heterogeneous infrastructures, including ubiquitous solutions such as the Internet of Things, Machine to Machine Communication, and Intelligent Transportation Systems will be an integral part of mobile communication networks. Cloudification, softwarization and visualization will be the major paradigm changes in the design of networks to achieve flexible and efficient systems providing a high capacity with minimal delay. To materialize this vision, many research challenges have to be addressed and validated on simulators or test beds. Prior to deployment of developed features in 5G systems, experimentations of the proposals under realistic and practical operating circumstances are required. Well-designed simulators and test beds for 5G experimentation are needed towards this aim. This chapter explains and analyzes some of the 5G simulators, federations, test beds, and their prototypes by considering some research and design issues. The joint requirements and the comparison criteria for 5G test beds are explained and presented. This chapter also explains and compares the reviewed 5G simulators in terms of some shared design and research properties. Close
	Hüsnü Yıldız, Adnan Kılıç, Ertan Onur Lightweight Cryptography in 5G Machine-type Communication Book Chapter Forthcoming Elkhodr, Mahmoud; Hassan, Qusay; Shahrestani, Seyed (Ed.): Chapman and Hall/CRC, Networks of the Future: Architectures, Technologies, and Implementations, Forthcoming, ISBN: 9781498783972. Abstract \| BibTeX @inbook{Yildiz2017, title = {Lightweight Cryptography in 5G Machine-type Communication}, author = {Hüsnü Yıldız and Adnan Kılıç and Ertan Onur}, editor = {Mahmoud Elkhodr and Qusay Hassan and Seyed Shahrestani}, isbn = {9781498783972}, year = {2017}, date = {2017-09-06}, publisher = {Chapman and Hall/CRC}, edition = {Networks of the Future: Architectures, Technologies, and Implementations}, series = {Chapman & Hall/CRC Computer and Information Science Series}, abstract = {The number of connected devices is expected to reach 50 billion, varying from sensors to industry-grade servers by 2020. These devices will communicate with each other using 5G technologies supporting high-capacity and longer ranges through massive machine-to-machine and human-to-machine communication. Security will still be a major concern in future networks. Conventional cryptographic algorithms may not be appropriate for constrained devices since they have limited CPU, power and memory. Lightweight cryptographic algorithms have been proposed to provide confidentiality, integrity and availability especially for constrained devices. In this chapter, we elaborate on constrained devices and security of machine-type communication, lightweight cryptographic algorithms, their features and related attack types. }, keywords = {}, pubstate = {forthcoming}, tppubtype = {inbook} } Close The number of connected devices is expected to reach 50 billion, varying from sensors to industry-grade servers by 2020. These devices will communicate with each other using 5G technologies supporting high-capacity and longer ranges through massive machine-to-machine and human-to-machine communication. Security will still be a major concern in future networks. Conventional cryptographic algorithms may not be appropriate for constrained devices since they have limited CPU, power and memory. Lightweight cryptographic algorithms have been proposed to provide confidentiality, integrity and availability especially for constrained devices. In this chapter, we elaborate on constrained devices and security of machine-type communication, lightweight cryptographic algorithms, their features and related attack types. Close
	Talha Koruk, Ertan Onur Bio-inspired Bandwidth Packing Inproceedings Forthcoming Proc. of the IEEE Consumer Communications & Networking Conference (CCNC), IEEE, Las Vegas, Nevada, Forthcoming. BibTeX @inproceedings{Koruk2017, title = {Bio-inspired Bandwidth Packing}, author = {Talha Koruk and Ertan Onur}, year = {2017}, date = {2017-05-06}, booktitle = {Proc. of the IEEE Consumer Communications & Networking Conference (CCNC)}, publisher = {IEEE}, address = {Las Vegas, Nevada}, keywords = {}, pubstate = {forthcoming}, tppubtype = {inproceedings} } Close
	Can Mehteroğlu, Ertan Onur Semantic Edge Caching and Prefetching in 5G Inproceedings Forthcoming Proc. of the IEEE Consumer Communications & Networking Conference (CCNC), IEEE Las Vegas, Nevada, Forthcoming. BibTeX @inproceedings{Mehteroglu2017, title = {Semantic Edge Caching and Prefetching in 5G}, author = {Can Mehteroğlu and Ertan Onur}, year = {2017}, date = {2017-05-06}, booktitle = {Proc. of the IEEE Consumer Communications & Networking Conference (CCNC)}, address = {Las Vegas, Nevada}, organization = {IEEE}, keywords = {}, pubstate = {forthcoming}, tppubtype = {inproceedings} } Close
	Shaharam Mollahasani, Ertan Onur Evaluation of Terahertz Channel in Data Centers Inproceedings NOMS 2016 (), Istanbul, Turkey, 2016. Abstract \| Links \| BibTeX @inproceedings{150457, title = {Evaluation of Terahertz Channel in Data Centers}, author = {Shaharam Mollahasani and Ertan Onur}, doi = {10.1109/NOMS.2016.7502886}, year = {2016}, date = {2016-04-01}, booktitle = {NOMS 2016 ()}, address = {Istanbul, Turkey}, abstract = {Designing data center network topologies with the objective of minimizing cost, increasing bisection bandwidth and decreasing latency is a difficult problem. The solutions in the literature mainly concentrate on wired networks and minimizing wiring costs thereof. Only a few proposals address the benefit of employing wireless communications in data centers due to spectrum and bandwidth limitations of current wireless communication technologies. By using terahertz communication in data centers as a complementary technology, the performance of a data center can be enhanced and substantial savings in cabling costs can be achieved without any throughput concession. Terahertz (THz) band can overcome bandwidth limitations and satisfy a wide range of applications from classical networking to board-to-board communication. In this paper, we evaluate the terahertz channel in data centers by considering atmospheric absorption. Based on the results, we recommend employing 190-310 GHz range with a bandwidth of 120 GHz. Keeping the relative humidity level at 40% will reduce atmospheric absorption while proving a healthy environmental regime for the equipment in a data center.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Designing data center network topologies with the objective of minimizing cost, increasing bisection bandwidth and decreasing latency is a difficult problem. The solutions in the literature mainly concentrate on wired networks and minimizing wiring costs thereof. Only a few proposals address the benefit of employing wireless communications in data centers due to spectrum and bandwidth limitations of current wireless communication technologies. By using terahertz communication in data centers as a complementary technology, the performance of a data center can be enhanced and substantial savings in cabling costs can be achieved without any throughput concession. Terahertz (THz) band can overcome bandwidth limitations and satisfy a wide range of applications from classical networking to board-to-board communication. In this paper, we evaluate the terahertz channel in data centers by considering atmospheric absorption. Based on the results, we recommend employing 190-310 GHz range with a bandwidth of 120 GHz. Keeping the relative humidity level at 40% will reduce atmospheric absorption while proving a healthy environmental regime for the equipment in a data center. Close doi:10.1109/NOMS.2016.7502886 Close
	Seyyit Ali Sert, Ertan Onur, Adnan Yazıcı Security attacks and countermeasures in Surveillance Wireless Sensor Networks Inproceedings Application of Information and Communication Technologies (AICT), 2015 9th International Conference on, pp. 201-205, 2015. Abstract \| Links \| BibTeX @inproceedings{7338546, title = {Security attacks and countermeasures in Surveillance Wireless Sensor Networks}, author = {Seyyit Ali Sert and Ertan Onur and Adnan Yazıcı}, doi = {10.1109/ICAICT.2015.7338546}, year = {2015}, date = {2015-10-01}, booktitle = {Application of Information and Communication Technologies (AICT), 2015 9th International Conference on}, pages = {201-205}, abstract = {Surveillance has always been an important task for human beings either for protecting a precious asset or gathering information from the surrounding environment. However, things to be monitored are increasing with a huge rate due to the changing requirements day by day. As a result, it becomes nearly impossible for individuals to do this task manually. To be able to fulfill such requirements, Surveillance Wireless Sensor Networks (SWSNs) have emerged. An SWSN is comprised of tiny nodes geared with various sensor types from a few of them to hundreds or even thousands, where each node is connected to several surrounding nodes. Most SWSNs operate by sensing at the node-level and conveying the sensed data to the sink (base station) for decision making processes such as object classification, localization, or event detection. In this respect, secure transmission of the sensed data is crucial since decision making is performed according to the received data. In this study, we primarily discuss the security attacks and defense mechanisms in surveillance wireless sensor networks. Moreover, security requirements of SWSNs, how accuracy and efficiency aspects of SWNSs are affected from each attack type, and evaluation criteria of defense mechanisms are presented in detail.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Surveillance has always been an important task for human beings either for protecting a precious asset or gathering information from the surrounding environment. However, things to be monitored are increasing with a huge rate due to the changing requirements day by day. As a result, it becomes nearly impossible for individuals to do this task manually. To be able to fulfill such requirements, Surveillance Wireless Sensor Networks (SWSNs) have emerged. An SWSN is comprised of tiny nodes geared with various sensor types from a few of them to hundreds or even thousands, where each node is connected to several surrounding nodes. Most SWSNs operate by sensing at the node-level and conveying the sensed data to the sink (base station) for decision making processes such as object classification, localization, or event detection. In this respect, secure transmission of the sensed data is crucial since decision making is performed according to the received data. In this study, we primarily discuss the security attacks and defense mechanisms in surveillance wireless sensor networks. Moreover, security requirements of SWSNs, how accuracy and efficiency aspects of SWNSs are affected from each attack type, and evaluation criteria of defense mechanisms are presented in detail. Close doi:10.1109/ICAICT.2015.7338546 Close
	Alperen Eroglu, Ertan Onur, Halit Oguztuzun Estimating density of wireless networks in practice Inproceedings Personal, Indoor, and Mobile Radio Communications (PIMRC), 2015 IEEE 26th Annual International Symposium on, pp. 1476-1480, 2015. Abstract \| Links \| BibTeX @inproceedings{7343531, title = {Estimating density of wireless networks in practice}, author = {Alperen Eroglu and Ertan Onur and Halit Oguztuzun}, doi = {10.1109/PIMRC.2015.7343531}, year = {2015}, date = {2015-08-01}, booktitle = {Personal, Indoor, and Mobile Radio Communications (PIMRC), 2015 IEEE 26th Annual International Symposium on}, pages = {1476-1480}, abstract = {Density of a wireless network drastically impacts its performance. Adapting the networking protocols at run-time to density changes, which may not be predictable in advance, may improve the network performance. Estimating the density of a wireless network is the challenge we address in this paper. A wireless node may locally estimate the network density by measuring the received signal strength (RSS) of packets sent by its neighbours. However, RSS is prone to large- and small-scale fading, and this phenomenon negatively affects the accuracy of density estimators. In this study, we validate the existing RSS-based density estimators by controlled laboratory experiments conducted in the FIT IoT-LAB test-bed located in Lille, France. Further, we propose a new density estimator that is a fusion of existing estimators. Controlled laboratory experiments showed that the average absolute percentage deviation of the new density estimator is around 1 to 10 percent and the fusion approach overcomes the deficiencies of the existing RSS-based estimators.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Density of a wireless network drastically impacts its performance. Adapting the networking protocols at run-time to density changes, which may not be predictable in advance, may improve the network performance. Estimating the density of a wireless network is the challenge we address in this paper. A wireless node may locally estimate the network density by measuring the received signal strength (RSS) of packets sent by its neighbours. However, RSS is prone to large- and small-scale fading, and this phenomenon negatively affects the accuracy of density estimators. In this study, we validate the existing RSS-based density estimators by controlled laboratory experiments conducted in the FIT IoT-LAB test-bed located in Lille, France. Further, we propose a new density estimator that is a fusion of existing estimators. Controlled laboratory experiments showed that the average absolute percentage deviation of the new density estimator is around 1 to 10 percent and the fusion approach overcomes the deficiencies of the existing RSS-based estimators. Close doi:10.1109/PIMRC.2015.7343531 Close
	Yunus Durmuş, Ertan Onur Service Knowledge Discovery in Smart Machine Networks Journal Article Wireless Personal Communications, 81 (4), pp. 1455–1480, 2015, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{durmus2015service, title = {Service Knowledge Discovery in Smart Machine Networks}, author = {Yunus Durmuş and Ertan Onur}, doi = {10.1007/s11277-015-2483-2}, issn = {0929-6212}, year = {2015}, date = {2015-01-01}, journal = {Wireless Personal Communications}, volume = {81}, number = {4}, pages = {1455--1480}, publisher = {Springer US}, abstract = {The devices surrounding us become smarter and can autonomously form a network without requiring our intervention. However, our needs can be even better accommodated when the networked devices cooperate and complement each otherÃ¢â‚¬â„¢s capabilities. One of the initial steps towards achieving a cooperative platform of smart devices is the discovery of resources and capabilities within the network. TodayÃ¢â‚¬â„¢s operational service discovery protocols carry simple text-based uniform resource identifiers that are not expressive enough. Machines cannot comprehend the meaning of a new service that is not in their knowledge base. In addition to being more expressive, service discovery protocols must compensate the diversity to improve cooperation between the devices that use different application protocols and operate on different communication interfaces. In this paper, we propose the Smart Discovery Protocol (SDP) which outperforms the operational service discovery protocols with three main features: (1) more expressive semantic representation of the services, (2) operating in the network layer to deal with diversity, and (3) unifying existing service discovery protocols. SDP represents services with ontologies as some recently proposed semantic service discovery protocols. It further enhances the success of semantic representations by creating a unified platform that can carry legacy discovery services. In this respect, the novelties of SDP are as follows: firstly, it operates in the network layer and consequently abstracts both the application layer and communication interfaces. Secondly, SDP unifies the legacy service discovery protocols by integrating their simple text-based service representations in one message. The underlying transport mechanism of SDP is designed as an add-on to the Neighbor Discovery Protocol (NDP) of the IPv6 standard. The metadata is carried in the payload of ICMPv6 packets. Simple text-based representations of other service discovery protocols are embedded in type-length-value options of NDP. Authenticity of the devices is ensured by the IPv6 Secure Neighbor Discovery protocol. Unlike previous semantic approaches on service discovery, we have implemented our protocol on real hardware. The results demonstrate the feasibility of carrying semantic representations of the services and integration of other service discovery protocols.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close The devices surrounding us become smarter and can autonomously form a network without requiring our intervention. However, our needs can be even better accommodated when the networked devices cooperate and complement each otherÃ¢â‚¬â„¢s capabilities. One of the initial steps towards achieving a cooperative platform of smart devices is the discovery of resources and capabilities within the network. TodayÃ¢â‚¬â„¢s operational service discovery protocols carry simple text-based uniform resource identifiers that are not expressive enough. Machines cannot comprehend the meaning of a new service that is not in their knowledge base. In addition to being more expressive, service discovery protocols must compensate the diversity to improve cooperation between the devices that use different application protocols and operate on different communication interfaces. In this paper, we propose the Smart Discovery Protocol (SDP) which outperforms the operational service discovery protocols with three main features: (1) more expressive semantic representation of the services, (2) operating in the network layer to deal with diversity, and (3) unifying existing service discovery protocols. SDP represents services with ontologies as some recently proposed semantic service discovery protocols. It further enhances the success of semantic representations by creating a unified platform that can carry legacy discovery services. In this respect, the novelties of SDP are as follows: firstly, it operates in the network layer and consequently abstracts both the application layer and communication interfaces. Secondly, SDP unifies the legacy service discovery protocols by integrating their simple text-based service representations in one message. The underlying transport mechanism of SDP is designed as an add-on to the Neighbor Discovery Protocol (NDP) of the IPv6 standard. The metadata is carried in the payload of ICMPv6 packets. Simple text-based representations of other service discovery protocols are embedded in type-length-value options of NDP. Authenticity of the devices is ensured by the IPv6 Secure Neighbor Discovery protocol. Unlike previous semantic approaches on service discovery, we have implemented our protocol on real hardware. The results demonstrate the feasibility of carrying semantic representations of the services and integration of other service discovery protocols. Close doi:10.1007/s11277-015-2483-2 Close
	Durmus, Yunus, Loukas, Andreas, Onur, Ertan, Langendoen, Koen Sybil-Resistant Meta Strategies for the Forwarder's Dilemma Inproceedings Proc. of the IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 90-99, 2014. Abstract \| Links \| BibTeX @inproceedings{7001004, title = {Sybil-Resistant Meta Strategies for the Forwarder's Dilemma}, author = {Durmus, Yunus and Loukas, Andreas and Onur, Ertan and Langendoen, Koen}, doi = {10.1109/SASO.2014.21}, year = {2014}, date = {2014-09-01}, booktitle = {Proc. of the IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO)}, pages = {90-99}, abstract = {Cooperation is the foundation of wireless ad hoc networks with nodes forwarding their neighbors' packets for the common good. However, energy and bandwidth constraints combined with selfish behaviour lead to collapsed networks where all nodes defect. Researchers have tried to incentivize or enforce the nodes for cooperation in various ways. However, these techniques do not consider the heterogeneous networks in which a diverse set of nodes with different cognitive capabilities exist. Furthermore, in ad hoc networks identity is a fuzzy concept. It is easy to forge multiple identities and hide defective behaviour. Moreover, the nature of the wireless medium is always ambiguous due to collisions, interference and asymmetric links. In all this uncertainty, having complete information about the intentions of the nodes and acting on it is not straightforward. Backed by evolutionary game theory and multi-agent systems research, we adapt and modify two meta strategies to embrace this uncertainty. These modified meta strategies, Win Stay Loose Shift and Stochastic Imitate Best Strategy, do not require strict identity information and only depend on nodes' own capabilities. Nodes monitor the traffic in their neighbourhood by using a two-hop overhearing method, and decide whether they should be cooperative or defective. We show that nodes are able to discover and use the best strategy in their locality and protect themselves against the exploitation by free riders who devise Sybil attacks by changing their identities.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Cooperation is the foundation of wireless ad hoc networks with nodes forwarding their neighbors' packets for the common good. However, energy and bandwidth constraints combined with selfish behaviour lead to collapsed networks where all nodes defect. Researchers have tried to incentivize or enforce the nodes for cooperation in various ways. However, these techniques do not consider the heterogeneous networks in which a diverse set of nodes with different cognitive capabilities exist. Furthermore, in ad hoc networks identity is a fuzzy concept. It is easy to forge multiple identities and hide defective behaviour. Moreover, the nature of the wireless medium is always ambiguous due to collisions, interference and asymmetric links. In all this uncertainty, having complete information about the intentions of the nodes and acting on it is not straightforward. Backed by evolutionary game theory and multi-agent systems research, we adapt and modify two meta strategies to embrace this uncertainty. These modified meta strategies, Win Stay Loose Shift and Stochastic Imitate Best Strategy, do not require strict identity information and only depend on nodes' own capabilities. Nodes monitor the traffic in their neighbourhood by using a two-hop overhearing method, and decide whether they should be cooperative or defective. We show that nodes are able to discover and use the best strategy in their locality and protect themselves against the exploitation by free riders who devise Sybil attacks by changing their identities. Close doi:10.1109/SASO.2014.21 Close
	Constantinescu, Mihai, Onur, Ertan, Durmus, Yunus, Nikou, Shahrokh, De Reuver, Mark, Bouwman, Harry, Djurica, Miodrag, Maria Glatz, Philipp Mobile tethering: overview, perspectives and challenges Journal Article Info, 16 (3), pp. 40–53, 2014, ISSN: 1463-6697. Abstract \| Links \| BibTeX @article{constantinescu2014mobile, title = {Mobile tethering: overview, perspectives and challenges}, author = {Constantinescu, Mihai and Onur, Ertan and Durmus, Yunus and Nikou, Shahrokh and De Reuver, Mark and Bouwman, Harry and Djurica, Miodrag and Maria Glatz, Philipp}, doi = {10.1108/info-05-2013-0033}, issn = {1463-6697}, year = {2014}, date = {2014-01-01}, journal = {Info}, volume = {16}, number = {3}, pages = {40--53}, publisher = {Emerald Group Publishing Limited}, abstract = {Purpose: The purpose of this paper is to analyze mobile tethering from technological and social perspectives. Mobile tethering allows us to share cellular data connection with others over WiFi, Bluetooth or USB. Although the technology is ready and has promising outcomes, service providers and the users still keep their distance. Therefore, the incentives for the users and service providers should be identified. Design/methodology/approach: Technical challenges in terms of energy and bandwidth consumption are explored using an application specifically developed for mobile tethering. Usage: issues are studied through conjoint analysis, in which we analyze the importance of technical aspects as well as social conditions for sharing data connection with others. Findings: The research shows that although energy, bandwidth and security are important technical challenges, users are mainly concerned about social aspects, such as with whom the connection will be shared, rather than monetary issues. Mobile tethering is a viable cooperative service, only when users are familiar with the person with whom the data connection is being shared. Research limitations/implications In the technical evaluation of the mobile tethering application, only Android operating systems are being used. Other operating systems (e.g. iOS) may perform differently. Moreover, only a small fraction of smartphones and tablets has been tested. Practical implications: Service providers tend to block mobile tethering technology, as they do not have control and do not expect to gain revenues. However, service providers have the abilities to satisfy the security and privacy concerns of the users and can create secure femtocells for their customers. Social implications: Mobile tethering performance results indicate that more people can access the Internet while they are mobile even if they do not have cellular data subscription. More Internet-based services can be offered to people while they roam in other countries. Originality/value: For technology developers, both the key technical issues and the concerns of the consumers are highlighted. Future applications must contain reliable security and privacy protocols in their design. Moreover, the significance of the social networks is shown in the decision-making of the use of mobile tethering, especially with respect to the credit exchange.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Purpose: The purpose of this paper is to analyze mobile tethering from technological and social perspectives. Mobile tethering allows us to share cellular data connection with others over WiFi, Bluetooth or USB. Although the technology is ready and has promising outcomes, service providers and the users still keep their distance. Therefore, the incentives for the users and service providers should be identified. Design/methodology/approach: Technical challenges in terms of energy and bandwidth consumption are explored using an application specifically developed for mobile tethering. Usage: issues are studied through conjoint analysis, in which we analyze the importance of technical aspects as well as social conditions for sharing data connection with others. Findings: The research shows that although energy, bandwidth and security are important technical challenges, users are mainly concerned about social aspects, such as with whom the connection will be shared, rather than monetary issues. Mobile tethering is a viable cooperative service, only when users are familiar with the person with whom the data connection is being shared. Research limitations/implications In the technical evaluation of the mobile tethering application, only Android operating systems are being used. Other operating systems (e.g. iOS) may perform differently. Moreover, only a small fraction of smartphones and tablets has been tested. Practical implications: Service providers tend to block mobile tethering technology, as they do not have control and do not expect to gain revenues. However, service providers have the abilities to satisfy the security and privacy concerns of the users and can create secure femtocells for their customers. Social implications: Mobile tethering performance results indicate that more people can access the Internet while they are mobile even if they do not have cellular data subscription. More Internet-based services can be offered to people while they roam in other countries. Originality/value: For technology developers, both the key technical issues and the concerns of the consumers are highlighted. Future applications must contain reliable security and privacy protocols in their design. Moreover, the significance of the social networks is shown in the decision-making of the use of mobile tethering, especially with respect to the credit exchange. Close doi:10.1108/info-05-2013-0033 Close
	Islam, T., Yongchang Hu, Onur, E., Boltjes, B., de Jongh, J.F.C.M. Realistic simulation of IEEE 802.11p channel in mobile Vehicle to Vehicle communication Inproceedings Proc. of the IEEE Conference on Microwave Techniques (COMITE), pp. 156-161, 2013. Abstract \| Links \| BibTeX @inproceedings{Islam2013, title = {Realistic simulation of IEEE 802.11p channel in mobile Vehicle to Vehicle communication}, author = {Islam, T. and Yongchang Hu and Onur, E. and Boltjes, B. and de Jongh, J.F.C.M.}, doi = {10.1109/COMITE.2013.6545061}, year = {2013}, date = {2013-04-01}, booktitle = {Proc. of the IEEE Conference on Microwave Techniques (COMITE)}, pages = {156-161}, abstract = {Intelligent Transportation Systems (ITS) is becoming an important paradigm, because of its ability to enhance safety and to mitigate congestion on road traffic scenarios. Realizing the fact that data collection scheme from in-situ test beds for large number of vehicles is always expensive and time consuming, before being employed in large scale, such safety critical system should be tested narrowing down the gap between real circumstances and analytical models in a simulation platform. It is evident that underlying radio wave propagation models can comprise the validity of large scale vehicular network simulation results. Vehicle-to-Vehicle (V2V) channels have higher dynamics due to rapidly varying topologies and environments which have significant impact on performance study of upper layer protocols and applications. In spite of the fact that few measurement based empirical channel models are present in the literature, they are not tested for large scale vehicular networks. In this study, we simulate suburban scenarios with hundreds of IEEE802.11p nodes in the OPNET simulation environment with more realistic channel models. The standard OPNET propagation model was replaced by Nakagami-m fading channel. For the sake of modeling, changing relative velocity attribute and separation distance, power spectrum and fading parameter-m were defined as function of velocity and separation distance respectively. Then statistics were collected to evaluate performance of physical and higher layers. Primarily we have found all the vehicles within the standard requirement for Dedicated Short Range Communications (DSRC) range of 1 kilometer may not receive packets, which was also found in several earlier publications.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Intelligent Transportation Systems (ITS) is becoming an important paradigm, because of its ability to enhance safety and to mitigate congestion on road traffic scenarios. Realizing the fact that data collection scheme from in-situ test beds for large number of vehicles is always expensive and time consuming, before being employed in large scale, such safety critical system should be tested narrowing down the gap between real circumstances and analytical models in a simulation platform. It is evident that underlying radio wave propagation models can comprise the validity of large scale vehicular network simulation results. Vehicle-to-Vehicle (V2V) channels have higher dynamics due to rapidly varying topologies and environments which have significant impact on performance study of upper layer protocols and applications. In spite of the fact that few measurement based empirical channel models are present in the literature, they are not tested for large scale vehicular networks. In this study, we simulate suburban scenarios with hundreds of IEEE802.11p nodes in the OPNET simulation environment with more realistic channel models. The standard OPNET propagation model was replaced by Nakagami-m fading channel. For the sake of modeling, changing relative velocity attribute and separation distance, power spectrum and fading parameter-m were defined as function of velocity and separation distance respectively. Then statistics were collected to evaluate performance of physical and higher layers. Primarily we have found all the vehicles within the standard requirement for Dedicated Short Range Communications (DSRC) range of 1 kilometer may not receive packets, which was also found in several earlier publications. Close doi:10.1109/COMITE.2013.6545061 Close
	Huaizhou, Shi, Venkatesha, R, Onur, Ertan, Niemegeers, Ignas Fairness in wireless networks: Issues, measures and challenges Journal Article IEEE Communications Surveys &amp;amp; Tutorials, 16 (1), pp. 5–24, 2013, ISSN: 1553-877X. Abstract \| Links \| BibTeX @article{huaizhou2013fairness, title = {Fairness in wireless networks: Issues, measures and challenges}, author = {Huaizhou, Shi and Venkatesha, R and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/SURV.2013.050113.00015}, issn = {1553-877X}, year = {2013}, date = {2013-01-01}, journal = {IEEE Communications Surveys &amp;amp; Tutorials}, volume = {16}, number = {1}, pages = {5--24}, abstract = {The pervasiveness of wireless technology has indeed created massive opportunity to integrate almost everything into the Internet fabric. This can be seen with the advent of Internet of Things and Cyber Physical Systems, which involves cooperation of massive number of intelligent devices to provide intelligent services. Fairness amongst these devices is an important issue that can be analysed from several dimensions, e.g., energy usage, achieving required quality of services, spectrum sharing, and so on. This article focusses on these viewpoints while looking at fairness research. To generalize, mainly wireless networks are considered. First, we present a general view of fairness studies, and pose three core questions that help us delineate the nuances in defining fairness. Then, the existing fairness models are summarized and compared. We also look into the major fairness research domains in wireless networks such as fair energy consumption control, power control, topology control, link and flow scheduling, channel assignment, rate allocation, congestion control and routing protocols. We make a distinction amongst fairness, utility and resource allocation to begin with. Later, we present their inter-relation. At the end of this article, we list the common properties of fairness and give an example of fairness management. Several open research challenges that point to further work on fairness in wireless networks are also discussed. Indeed, the research on fairness is entangled with many other aspects such as performance, utility, optimization and throughput at the network and node levels. While consolidating the contributions in the literature, this article tries to explain the niceties of all these aspects in the domain of wireless networking.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close The pervasiveness of wireless technology has indeed created massive opportunity to integrate almost everything into the Internet fabric. This can be seen with the advent of Internet of Things and Cyber Physical Systems, which involves cooperation of massive number of intelligent devices to provide intelligent services. Fairness amongst these devices is an important issue that can be analysed from several dimensions, e.g., energy usage, achieving required quality of services, spectrum sharing, and so on. This article focusses on these viewpoints while looking at fairness research. To generalize, mainly wireless networks are considered. First, we present a general view of fairness studies, and pose three core questions that help us delineate the nuances in defining fairness. Then, the existing fairness models are summarized and compared. We also look into the major fairness research domains in wireless networks such as fair energy consumption control, power control, topology control, link and flow scheduling, channel assignment, rate allocation, congestion control and routing protocols. We make a distinction amongst fairness, utility and resource allocation to begin with. Later, we present their inter-relation. At the end of this article, we list the common properties of fairness and give an example of fairness management. Several open research challenges that point to further work on fairness in wireless networks are also discussed. Indeed, the research on fairness is entangled with many other aspects such as performance, utility, optimization and throughput at the network and node levels. While consolidating the contributions in the literature, this article tries to explain the niceties of all these aspects in the domain of wireless networking. Close doi:10.1109/SURV.2013.050113.00015 Close
	Khatibi, Arash, Durmus, Yunus, Onur, Ertan, Niemegeers, Ignas Event-Driven MAC Protocol for Dual-Radio Cooperation Inproceedings Proc. of the IEEE Vehicular Technology Conference (VTC Fall), pp. 1-5, 2012, ISSN: 1090-3038. Abstract \| Links \| BibTeX @inproceedings{khatibi2012, title = {Event-Driven MAC Protocol for Dual-Radio Cooperation}, author = {Khatibi, Arash and Durmus, Yunus and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/VTCFall.2012.6399143}, issn = {1090-3038}, year = {2012}, date = {2012-09-01}, booktitle = {Proc. of the IEEE Vehicular Technology Conference (VTC Fall)}, pages = {1-5}, abstract = {One of the sources of the energy waste in wireless sensor networks is idle listening, the time in which a node monitors the free channel. In applications where the events occur sporadically, energy consumption due to idle listening can be further reduced by dual-radio cooperation. In dual- radio cooperation, nodes in the network have two stacks. One stack makes use of a low-power wake-up radio for event-driven communication over the main radio. The other stack may employ any sensor networking medium access control protocol only over the main radio. One of the two stacks can be dynamically operational depending on the rate of the events or the packet arrival rate. When the event rate becomes small, the event-driven stack takes over the operation. If the event rate increases, it could be more efficient to operate the legacy single radio stack. In this paper, we investigate the performance of the dual-radio cooperation in wireless sensor networks. A medium access control protocol is proposed for the dual- radio cooperation to maximize the energy efficiency of the wireless network. We define the critical event rate as the event rate threshold above which the single-radio stack performs better than the dual- radio stack. We analyzed and validated the critical event rate by simulations. We show that 70-97% energy conservation is possible by employing the dual-radio cooperation.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close One of the sources of the energy waste in wireless sensor networks is idle listening, the time in which a node monitors the free channel. In applications where the events occur sporadically, energy consumption due to idle listening can be further reduced by dual-radio cooperation. In dual- radio cooperation, nodes in the network have two stacks. One stack makes use of a low-power wake-up radio for event-driven communication over the main radio. The other stack may employ any sensor networking medium access control protocol only over the main radio. One of the two stacks can be dynamically operational depending on the rate of the events or the packet arrival rate. When the event rate becomes small, the event-driven stack takes over the operation. If the event rate increases, it could be more efficient to operate the legacy single radio stack. In this paper, we investigate the performance of the dual-radio cooperation in wireless sensor networks. A medium access control protocol is proposed for the dual- radio cooperation to maximize the energy efficiency of the wireless network. We define the critical event rate as the event rate threshold above which the single-radio stack performs better than the dual- radio stack. We analyzed and validated the critical event rate by simulations. We show that 70-97% energy conservation is possible by employing the dual-radio cooperation. Close doi:10.1109/VTCFall.2012.6399143 Close
	Durmus, Yunus, Onur, Ertan Imitation as the simplest strategy for cooperation Inproceedings Proc. of the IEEE 23rd International Symposium on Personal Indoor and Mobile Radio Communications, pp. 863-869, 2012, ISSN: 2166-9570. Abstract \| Links \| BibTeX @inproceedings{6362905, title = {Imitation as the simplest strategy for cooperation}, author = {Durmus, Yunus and Onur, Ertan}, doi = {10.1109/PIMRC.2012.6362905}, issn = {2166-9570}, year = {2012}, date = {2012-09-01}, booktitle = {Proc. of the IEEE 23rd International Symposium on Personal Indoor and Mobile Radio Communications}, pages = {863-869}, abstract = {Ad hoc networks comprise independent cooperative nodes which work together to constitute a system having a value greater than the sum of the values of the individual components. The nodes cooperate to gain access to the medium or to establish a messaging infrastructure by relaying foreign packets. However, when nodes in an ad hoc network operate autonomously without a central authority, they tend to defect, e.g., do not forward each other's packets following the game theoretic analysis. External mechanisms may preserve and enforce cooperation in network in return of additional operational costs or security overheads. However, low power devices may lack computational power that is required to implement the system. Recent works in evolutionary game theory have shown that cooperation may survive in a lattice structured biological network without any enforcement. The spatial structure of the network may allow the survival of the cooperative nodes when they imitate the dominant surrounding strategy. Imitating strategy helps low power devices adapt dynamically to the environment rather than giving deterministic and static decisions. In this work, we apply the imitation strategy to ad hoc networks which have geometric random network structure different from the lattice structured networks. Simulations show that simple imitation strategy allows cooperation to be spread over the network.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Ad hoc networks comprise independent cooperative nodes which work together to constitute a system having a value greater than the sum of the values of the individual components. The nodes cooperate to gain access to the medium or to establish a messaging infrastructure by relaying foreign packets. However, when nodes in an ad hoc network operate autonomously without a central authority, they tend to defect, e.g., do not forward each other's packets following the game theoretic analysis. External mechanisms may preserve and enforce cooperation in network in return of additional operational costs or security overheads. However, low power devices may lack computational power that is required to implement the system. Recent works in evolutionary game theory have shown that cooperation may survive in a lattice structured biological network without any enforcement. The spatial structure of the network may allow the survival of the cooperative nodes when they imitate the dominant surrounding strategy. Imitating strategy helps low power devices adapt dynamically to the environment rather than giving deterministic and static decisions. In this work, we apply the imitation strategy to ad hoc networks which have geometric random network structure different from the lattice structured networks. Simulations show that simple imitation strategy allows cooperation to be spread over the network. Close doi:10.1109/PIMRC.2012.6362905 Close
	Zhou, Jinglong, Jacobsson, Martin, Onur, Ertan, Niemegeers, Ignas An investigation of link quality assessment for mobile multi-hop and multi-rate wireless networks Journal Article Wireless personal communications, 65 (2), pp. 405–423, 2012, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{zhou2012investigation, title = {An investigation of link quality assessment for mobile multi-hop and multi-rate wireless networks}, author = {Zhou, Jinglong and Jacobsson, Martin and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1007/s11277-011-0263-1}, issn = {0929-6212}, year = {2012}, date = {2012-01-01}, journal = {Wireless personal communications}, volume = {65}, number = {2}, pages = {405--423}, publisher = {Springer US}, abstract = {Wireless ad hoc networks will be an important component in future communication systems. The performance of wireless ad hoc networks can be improved by link quality-aware applications. Wireless link quality is dynamic in nature, especially in mobile scenarios. Therefore, accurate and fast packet delivery ratio estimation is a prerequisite to good performance in mobile, multi-hop and multi-rate wireless ad hoc networks. In this paper, we propose a novel packet delivery ratio estimation method that improves the accuracy and responsiveness of the packet delivery ratio estimation. The proposed link quality estimation components are implemented in a IEEE 802.11b/g test-bed. The experiment results show that the accuracy of the packet delivery ratio estimation can improve up to 50% in mobile scenarios without introducing overhead. We also show the end-to-end performance impact of this improved estimation on route selection using different routing metrics and configurations. The measurement results show that our packet delivery ratio method leads to better route selection in the form of increased end-to-end throughput compared to traditional methods, which respond slowly to the link dynamics.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Wireless ad hoc networks will be an important component in future communication systems. The performance of wireless ad hoc networks can be improved by link quality-aware applications. Wireless link quality is dynamic in nature, especially in mobile scenarios. Therefore, accurate and fast packet delivery ratio estimation is a prerequisite to good performance in mobile, multi-hop and multi-rate wireless ad hoc networks. In this paper, we propose a novel packet delivery ratio estimation method that improves the accuracy and responsiveness of the packet delivery ratio estimation. The proposed link quality estimation components are implemented in a IEEE 802.11b/g test-bed. The experiment results show that the accuracy of the packet delivery ratio estimation can improve up to 50% in mobile scenarios without introducing overhead. We also show the end-to-end performance impact of this improved estimation on route selection using different routing metrics and configurations. The measurement results show that our packet delivery ratio method leads to better route selection in the form of increased end-to-end throughput compared to traditional methods, which respond slowly to the link dynamics. Close doi:10.1007/s11277-011-0263-1 Close
	Onur, Ertan, Durmus, Yunus, Niemegeers, Ignas Cooperative density estimation in random wireless ad hoc networks Journal Article IEEE Communications Letters, 16 (3), pp. 331–333, 2012, ISSN: 1089-7798. Abstract \| Links \| BibTeX @article{onur2012cooperative, title = {Cooperative density estimation in random wireless ad hoc networks}, author = {Onur, Ertan and Durmus, Yunus and Niemegeers, Ignas}, doi = {10.1109/LCOMM.2012.011312.112140}, issn = {1089-7798}, year = {2012}, date = {2012-01-01}, journal = {IEEE Communications Letters}, volume = {16}, number = {3}, pages = {331--333}, publisher = {IEEE}, abstract = {Density estimation is crucial for wireless ad hoc networks for adequate capacity planning. Protocols have to adapt their operation to the density since the throughput in an ad hoc network approaches asymptotically to zero as the density increases. A wireless node can estimate the global density by using local information such as the received power from neighbors. In this paper, we propose a cross layer protocol to compute the density estimate. The accuracy of the estimate can be enhanced and its variance can be reduced through cooperation among the nodes. Nodes share the received power measurements with each other. Based on the collected observations, the maximum likelihood estimate is computed. It is shown that cooperative density estimation has better accuracy with less variance than the individual estimation. When nodes share received power measurements from further away neighbors, the variance of the estimate is further reduced.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Density estimation is crucial for wireless ad hoc networks for adequate capacity planning. Protocols have to adapt their operation to the density since the throughput in an ad hoc network approaches asymptotically to zero as the density increases. A wireless node can estimate the global density by using local information such as the received power from neighbors. In this paper, we propose a cross layer protocol to compute the density estimate. The accuracy of the estimate can be enhanced and its variance can be reduced through cooperation among the nodes. Nodes share the received power measurements with each other. Based on the collected observations, the maximum likelihood estimate is computed. It is shown that cooperative density estimation has better accuracy with less variance than the individual estimation. When nodes share received power measurements from further away neighbors, the variance of the estimate is further reduced. Close doi:10.1109/LCOMM.2012.011312.112140 Close
	Genc, Zulkuf, Thillo, WV, Bourdoux, Andre, Onur, Ertan 60 GHz PHY performance evaluation with 3D ray tracing under human shadowing Journal Article IEEE Wireless Communications Letters, 1 (2), pp. 117–120, 2012, ISSN: 2162-2337. Abstract \| Links \| BibTeX @article{genc201260, title = {60 GHz PHY performance evaluation with 3D ray tracing under human shadowing}, author = {Genc, Zulkuf and Thillo, WV and Bourdoux, Andre and Onur, Ertan}, doi = {10.1109/WCL.2012.022012.120033}, issn = {2162-2337}, year = {2012}, date = {2012-01-01}, journal = {IEEE Wireless Communications Letters}, volume = {1}, number = {2}, pages = {117--120}, publisher = {IEEE}, abstract = {This work evaluates the system-level performance of 60 GHz channels by simulating a realistic living room scenario with various numbers of humans and three different antenna configurations. In the first step, a comprehensive ray tracing study with a 3D ray tracing tool is performed to determine the channel impulse responses. Feeding our PHY simulator with the collected channel responses, the performance figures are generated over received SNR. It was observed that for a satisfactory BER performance, a directional antenna with the minimum of 10 dB antenna gain should be used at least in the receiver side when there is human shadowing in the environment.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close This work evaluates the system-level performance of 60 GHz channels by simulating a realistic living room scenario with various numbers of humans and three different antenna configurations. In the first step, a comprehensive ray tracing study with a 3D ray tracing tool is performed to determine the channel impulse responses. Feeding our PHY simulator with the collected channel responses, the performance figures are generated over received SNR. It was observed that for a satisfactory BER performance, a directional antenna with the minimum of 10 dB antenna gain should be used at least in the receiver side when there is human shadowing in the environment. Close doi:10.1109/WCL.2012.022012.120033 Close
	Constantinescu, Mihai Marius, Onur, Ertan, Bouwman, Harry, Djurica, Miodrag, De Reuver, Mark, Durmus, Yunus Cooperative Networks: The Mobile Tethering Game Inproceedings Proc. of the Seventh ACM International Workshop on Mobility in the Evolving Internet Architecture, pp. 41–42, ACM, Istanbul, Turkey, 2012, ISBN: 978-1-4503-1526-5. Abstract \| Links \| BibTeX @inproceedings{Constantinescu2012, title = {Cooperative Networks: The Mobile Tethering Game}, author = {Constantinescu, Mihai Marius and Onur, Ertan and Bouwman, Harry and Djurica, Miodrag and De Reuver, Mark and Durmus, Yunus}, doi = {10.1145/2348676.2348687}, isbn = {978-1-4503-1526-5}, year = {2012}, date = {2012-01-01}, booktitle = {Proc. of the Seventh ACM International Workshop on Mobility in the Evolving Internet Architecture}, pages = {41--42}, publisher = {ACM}, address = {Istanbul, Turkey}, series = {MobiArch '12}, abstract = {We propose an analysis of cooperation for data sharing and the behavioral aspects involved in the process of decision making. Starting with the tethering capabilities of recent devices we apply game theoretical principles and models, inquire what makes the cooperation work, and what are the economical implications required to build a cooperative network. Aggregating the game theory with the results of the market inquiry of a questionnaire and with a developed android application, will give us an idea of why and how people share.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close We propose an analysis of cooperation for data sharing and the behavioral aspects involved in the process of decision making. Starting with the tethering capabilities of recent devices we apply game theoretical principles and models, inquire what makes the cooperation work, and what are the economical implications required to build a cooperative network. Aggregating the game theory with the results of the market inquiry of a questionnaire and with a developed android application, will give us an idea of why and how people share. Close doi:10.1145/2348676.2348687 Close
	Venkatesha Prasad, Ranga Rao, Onur, Ertan, Durmus, Yunus, Biswas, Abdurrahim, Niemegeers, Ignas Approximate service provisioning in an invisible network of the future Miscellaneous 27th Meeting of Wireless World Research Forum, 2011. BibTeX @misc{PrasadWWRF, title = {Approximate service provisioning in an invisible network of the future}, author = {Venkatesha Prasad, Ranga Rao and Onur, Ertan and Durmus, Yunus and Biswas, Abdurrahim and Niemegeers, Ignas}, year = {2011}, date = {2011-11-01}, howpublished = {27th Meeting of Wireless World Research Forum}, keywords = {}, pubstate = {published}, tppubtype = {misc} } Close
	Onur, Ertan, Durmus, Yunus, Hawas, Mohamed Gamal, de Groot, Sonia Marcela Heemstra, Niemegeers, Ignas GMM Collaborative and cognitive network platforms: Vision and research challenges Journal Article Wireless Personal Communications, 58 (1), pp. 71–93, 2011, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{onur2011collaborative, title = {Collaborative and cognitive network platforms: Vision and research challenges}, author = {Onur, Ertan and Durmus, Yunus and Hawas, Mohamed Gamal and de Groot, Sonia Marcela Heemstra and Niemegeers, Ignas GMM}, doi = {10.1007/s11277-011-0289-4}, issn = {0929-6212}, year = {2011}, date = {2011-01-01}, journal = {Wireless Personal Communications}, volume = {58}, number = {1}, pages = {71--93}, publisher = {Springer US}, abstract = {In this paper, we present a visionary concept referred to as Collaborative and Cognitive Network Platforms (CCNPs) as a future-proof solution for creating a dependable, self-organizing and self-managing communication substrate for effective ICT solutions to societal problems. CCNP creates a cooperative communication platform to support critical services across a range of business sectors. CCNP is based on the personal network (PN) technology which is an inherently cooperative environment prototyped in the Dutch Freeband PNP2008 and the European Union IST MAGNET projects. In CCNP, the cognitive control plane strives to exploit the resources to better satisfy the requirements of networked applications. CCNP facilitates collaboration inherently. Through cognition in the cognitive control plane, CCNP becomes a self-managed substrate. The self-managed substrate, in this paper, is defined as cognitive and collaborative middleware on which future applications run without user intervention. Endemic sensor networks may be incorporated into the CCNP concept to feed its cognitive control plane. In this paper, we present the CCNP concept and discuss the research challenges related to collaboration and cognition.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close In this paper, we present a visionary concept referred to as Collaborative and Cognitive Network Platforms (CCNPs) as a future-proof solution for creating a dependable, self-organizing and self-managing communication substrate for effective ICT solutions to societal problems. CCNP creates a cooperative communication platform to support critical services across a range of business sectors. CCNP is based on the personal network (PN) technology which is an inherently cooperative environment prototyped in the Dutch Freeband PNP2008 and the European Union IST MAGNET projects. In CCNP, the cognitive control plane strives to exploit the resources to better satisfy the requirements of networked applications. CCNP facilitates collaboration inherently. Through cognition in the cognitive control plane, CCNP becomes a self-managed substrate. The self-managed substrate, in this paper, is defined as cognitive and collaborative middleware on which future applications run without user intervention. Endemic sensor networks may be incorporated into the CCNP concept to feed its cognitive control plane. In this paper, we present the CCNP concept and discuss the research challenges related to collaboration and cognition. Close doi:10.1007/s11277-011-0289-4 Close
	Kosar, Rabun, Bojaxhiu, Ilir, Onur, Ertan, Ersoy, Cem Lifetime extension for surveillance wireless sensor networks with intelligent redeployment Journal Article Journal of network and computer applications, 34 (6), pp. 1784–1793, 2011, ISSN: 1068-9605. Abstract \| Links \| BibTeX @article{kosar2011lifetime, title = {Lifetime extension for surveillance wireless sensor networks with intelligent redeployment}, author = {Kosar, Rabun and Bojaxhiu, Ilir and Onur, Ertan and Ersoy, Cem}, doi = {10.1016/j.jnca.2010.12.010}, issn = {1068-9605}, year = {2011}, date = {2011-01-01}, journal = {Journal of network and computer applications}, volume = {34}, number = {6}, pages = {1784--1793}, publisher = {Academic Press}, abstract = {For wireless sensor networks (WSNs), uneven energy consumption is a major problem. A direct consequence of this is the energy hole problem, formation of sensing voids within the network field due to battery depleted sensors in the corresponding region. Hole formations are inherent in the network topology, yet it is possible to develop strategies to delay the hole formations to later stages of the network operation and essentially extend the network lifetime without sensing quality loss. In this work, we initially propose and analyze an approach that can be used to mitigate the hole problem. The approach is presented in detail and the effects on the sustained surveillance quality are presented. The results are based on simulations with different network configurations with realistic sensor models, MAC and routing protocols. By using the proposed approach, sustaining a sensing quality above a given threshold and more than doubling the network lifetime are possible. The results clearly indicate the suitability of the approach for especially demanding WSNs such as the ones used for border surveillance tasks.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close For wireless sensor networks (WSNs), uneven energy consumption is a major problem. A direct consequence of this is the energy hole problem, formation of sensing voids within the network field due to battery depleted sensors in the corresponding region. Hole formations are inherent in the network topology, yet it is possible to develop strategies to delay the hole formations to later stages of the network operation and essentially extend the network lifetime without sensing quality loss. In this work, we initially propose and analyze an approach that can be used to mitigate the hole problem. The approach is presented in detail and the effects on the sustained surveillance quality are presented. The results are based on simulations with different network configurations with realistic sensor models, MAC and routing protocols. By using the proposed approach, sustaining a sensing quality above a given threshold and more than doubling the network lifetime are possible. The results clearly indicate the suitability of the approach for especially demanding WSNs such as the ones used for border surveillance tasks. Close doi:10.1016/j.jnca.2010.12.010 Close
	Vazifehdan, Javad, Prasad, R Venkatesha, Onur, Ertan, Niemegeers, Ignas Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies Journal Article Computer Networks, 55 (15), pp. 3256–3274, 2011, ISSN: 1389-1286. Abstract \| Links \| BibTeX @article{vazifehdan2011energy, title = {Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies}, author = {Vazifehdan, Javad and Prasad, R Venkatesha and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1016/j.comnet.2011.06.015}, issn = {1389-1286}, year = {2011}, date = {2011-01-01}, journal = {Computer Networks}, volume = {55}, number = {15}, pages = {3256--3274}, publisher = {Elsevier}, abstract = {Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into a framework in which the route selection is formulated as a bi-criteria decision making problem. Minimizing the energy cost for end-to-end packet transfer and minimizing the hop count are the two criteria in this framework. Various algorithms that we propose differ in the way they define the energy cost for end-to-end packet traversal or the way they solve the bi-criteria decision making problem. Some of them consider the energy consumed to transmit and receive packets, while others also consider the residual battery energy of battery-enabled nodes. The proposed algorithms use either the weighted sum approach or the lexicographic method to solve the bi-criteria decision making problem. We evaluate the performance of our algorithms in static and mobile ad hoc networks, and in networks with and without transmission power control. Through extensive simulations we show that our algorithms can significantly enhance the lifetime of battery-powered nodes while the hop count is kept close to its optimal value. We also discuss the scenarios and conditions in which each algorithm could be suitably deployed.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into a framework in which the route selection is formulated as a bi-criteria decision making problem. Minimizing the energy cost for end-to-end packet transfer and minimizing the hop count are the two criteria in this framework. Various algorithms that we propose differ in the way they define the energy cost for end-to-end packet traversal or the way they solve the bi-criteria decision making problem. Some of them consider the energy consumed to transmit and receive packets, while others also consider the residual battery energy of battery-enabled nodes. The proposed algorithms use either the weighted sum approach or the lexicographic method to solve the bi-criteria decision making problem. We evaluate the performance of our algorithms in static and mobile ad hoc networks, and in networks with and without transmission power control. Through extensive simulations we show that our algorithms can significantly enhance the lifetime of battery-powered nodes while the hop count is kept close to its optimal value. We also discuss the scenarios and conditions in which each algorithm could be suitably deployed. Close doi:10.1016/j.comnet.2011.06.015 Close
	Olcer, Gencay Mutlu, Genc, Zulkuf, Onur, Ertan Smart neighbor scanning with directional antennas in 60 GHz indoor networks Inproceedings Proc. of the IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), pp. 2393-2398, 2010. Abstract \| Links \| BibTeX @inproceedings{Olcer2010, title = {Smart neighbor scanning with directional antennas in 60 GHz indoor networks}, author = {Olcer, Gencay Mutlu and Genc, Zulkuf and Onur, Ertan}, doi = {10.1109/PIMRC.2010.5671720}, year = {2010}, date = {2010-09-01}, booktitle = {Proc. of the IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC)}, pages = {2393-2398}, abstract = {The 60 GHz technology has an immense potential to provide wireless communication at multi-gigabit rates. At 60 GHz frequency band, severe attenuation of the signals can significantly degrade communication performance. To cope with the attenuation problem, directional antennas with high directive gains can be utilized. When network nodes use directional antennas, the neighbor discovery process becomes more complicated and time consuming. To reduce the neighbor discovery time, we propose a smart neighbor scanning algorithm in this paper. It is observed that the proposed strategy discovers 70% of the links 81% faster and 90% of the links 15% faster than random scanning strategy.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close The 60 GHz technology has an immense potential to provide wireless communication at multi-gigabit rates. At 60 GHz frequency band, severe attenuation of the signals can significantly degrade communication performance. To cope with the attenuation problem, directional antennas with high directive gains can be utilized. When network nodes use directional antennas, the neighbor discovery process becomes more complicated and time consuming. To reduce the neighbor discovery time, we propose a smart neighbor scanning algorithm in this paper. It is observed that the proposed strategy discovers 70% of the links 81% faster and 90% of the links 15% faster than random scanning strategy. Close doi:10.1109/PIMRC.2010.5671720 Close
	Vazifehdan, Javad, Venkatesha Prasad, Ranga Rao, Onur, Ertan, Niemegeers, Ignas Energy-aware routing in wireless ad hoc networks with mains-powered nodes Inproceedings Future Network and Mobile Summit, 2010, pp. 1-12, 2010. Abstract \| BibTeX @inproceedings{5722377, title = {Energy-aware routing in wireless ad hoc networks with mains-powered nodes}, author = {Vazifehdan, Javad and Venkatesha Prasad, Ranga Rao and Onur, Ertan and Niemegeers, Ignas}, year = {2010}, date = {2010-06-01}, booktitle = {Future Network and Mobile Summit, 2010}, pages = {1-12}, abstract = {Energy-aware routing is an effective way to prolong the lifetime of nodes with scarce battery power in ad hoc networks. The proposed energy-aware routing schemes so far do not consider the energy supply of nodes in route selection. They only consider the residual battery capacity of nodes. This paper proposes energy-aware routing algorithms for ad hoc networks with both battery-powered and mains-powered nodes. The proposed algorithms direct the traffic load to mains-powered nodes to avoid using battery-powered nodes as relay. By tuning some tunable coefficients, these algorithms can provide a trade-off between the operational lifetime of the network and the hop count of the selected routes. We compare the performance of the proposed algorithms with other algorithms which do not differentiate explicitly between mains-powered and battery-powered nodes. We show that when most of the nodes in the network are mains-powered, the use of only the type of power supply of nodes in route selection results in a higher network lifetime compared to using the residual battery capacity of nodes. This implies that in such cases, the routing overhead can be reduced, since there is no need to repeatedly propagate the residual battery capacity of nodes (as needed in so-far proposed energy-aware routing algorithms), while even the network lifetime increases.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Energy-aware routing is an effective way to prolong the lifetime of nodes with scarce battery power in ad hoc networks. The proposed energy-aware routing schemes so far do not consider the energy supply of nodes in route selection. They only consider the residual battery capacity of nodes. This paper proposes energy-aware routing algorithms for ad hoc networks with both battery-powered and mains-powered nodes. The proposed algorithms direct the traffic load to mains-powered nodes to avoid using battery-powered nodes as relay. By tuning some tunable coefficients, these algorithms can provide a trade-off between the operational lifetime of the network and the hop count of the selected routes. We compare the performance of the proposed algorithms with other algorithms which do not differentiate explicitly between mains-powered and battery-powered nodes. We show that when most of the nodes in the network are mains-powered, the use of only the type of power supply of nodes in route selection results in a higher network lifetime compared to using the residual battery capacity of nodes. This implies that in such cases, the routing overhead can be reduced, since there is no need to repeatedly propagate the residual battery capacity of nodes (as needed in so-far proposed energy-aware routing algorithms), while even the network lifetime increases. Close
	Genc, Zulkuf, Olcer, Gencay Mutlu, Onur, Ertan, Niemegeers, Ignas Improving 60 GHz Indoor Connectivity with Relaying Inproceedings Proc. of the IEEE International Conference on Communications, pp. 1-6, 2010, ISSN: 1550-3607. Abstract \| Links \| BibTeX @inproceedings{5502707, title = {Improving 60 GHz Indoor Connectivity with Relaying}, author = {Genc, Zulkuf and Olcer, Gencay Mutlu and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/ICC.2010.5502707}, issn = {1550-3607}, year = {2010}, date = {2010-05-01}, booktitle = {Proc. of the IEEE International Conference on Communications}, pages = {1-6}, abstract = {The 60 GHz technology has a great potential to provide wireless communication at multi-gigabit rates in future home networks. To maintain the network connectivity with 60 GHz links, which are highly susceptible to propagation and penetration losses, is a major challenge. The quality and the robustness of the 60 GHz links can be improved by employing relay nodes in the network. In this paper, the contribution of relaying to the connectivity and the quality of the 60 GHz radio links is studied by modeling three indoor scenarios. It is analytically and through simulations shown that having a relay node in a 60 GHz network decreases the average freespace path loss 33% in the worst case scenario. The effects of relay device position and the obstacle density on the improvement of the average received signal level are investigated with a verified 3D ray tracing tool. A comparative simulation study on the performance of different relay configurations under various network conditions is conducted. The results yield that even a single relay device positioned at the height of other nodes can improve 50% of the links in considerable levels in a 60 GHz indoor network. It is also shown that additional relay nodes do not contribute to 60 GHz indoor connectivity significantly, if there are two properly positioned relay devices in a network which is moderately populated.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close The 60 GHz technology has a great potential to provide wireless communication at multi-gigabit rates in future home networks. To maintain the network connectivity with 60 GHz links, which are highly susceptible to propagation and penetration losses, is a major challenge. The quality and the robustness of the 60 GHz links can be improved by employing relay nodes in the network. In this paper, the contribution of relaying to the connectivity and the quality of the 60 GHz radio links is studied by modeling three indoor scenarios. It is analytically and through simulations shown that having a relay node in a 60 GHz network decreases the average freespace path loss 33% in the worst case scenario. The effects of relay device position and the obstacle density on the improvement of the average received signal level are investigated with a verified 3D ray tracing tool. A comparative simulation study on the performance of different relay configurations under various network conditions is conducted. The results yield that even a single relay device positioned at the height of other nodes can improve 50% of the links in considerable levels in a 60 GHz indoor network. It is also shown that additional relay nodes do not contribute to 60 GHz indoor connectivity significantly, if there are two properly positioned relay devices in a network which is moderately populated. Close doi:10.1109/ICC.2010.5502707 Close
	Genc, Zulkuf, Rizvi, Umar Hasan, Onur, Ertan, Niemegeers, Ignas Robust 60 GHz Indoor Connectivity: Is It Possible with Reflections? Inproceedings Proc. of the 2010 IEEE 71st Vehicular Technology Conference (VTC 2010-Spring), pp. 1-5, 2010, ISSN: 1550-2252. Abstract \| Links \| BibTeX @inproceedings{5493722, title = {Robust 60 GHz Indoor Connectivity: Is It Possible with Reflections?}, author = {Genc, Zulkuf and Rizvi, Umar Hasan and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/VETECS.2010.5493722}, issn = {1550-2252}, year = {2010}, date = {2010-05-01}, booktitle = {Proc. of the 2010 IEEE 71st Vehicular Technology Conference (VTC 2010-Spring)}, pages = {1-5}, abstract = {In this paper, we investigate the robustness of the 60 GHz connectivity in typical indoor environments by analyzing the outage probability. We define three realistic indoor scenarios which may host the 60 GHz networks in the future and perform simulations with a verified 3D ray tracing tool on them. In the first set of simulations, we show the impact of access unit position on the connectivity. In the next step, we show that increasing the obstacle density linearly decreases the outage probability of the 60 GHz network and this decrease is found to be sharper for certain positions of the access point. In the last step, we demonstrate the direct effect of reflective surface availability on the connectivity. A 60 GHz indoor network relying solely on the reflections in the absence of line-of-sight path is very vulnerable to outages even in moderately populated indoor environments.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close In this paper, we investigate the robustness of the 60 GHz connectivity in typical indoor environments by analyzing the outage probability. We define three realistic indoor scenarios which may host the 60 GHz networks in the future and perform simulations with a verified 3D ray tracing tool on them. In the first set of simulations, we show the impact of access unit position on the connectivity. In the next step, we show that increasing the obstacle density linearly decreases the outage probability of the 60 GHz network and this decrease is found to be sharper for certain positions of the access point. In the last step, we demonstrate the direct effect of reflective surface availability on the connectivity. A 60 GHz indoor network relying solely on the reflections in the absence of line-of-sight path is very vulnerable to outages even in moderately populated indoor environments. Close doi:10.1109/VETECS.2010.5493722 Close
	Vazifehdan, Javad, Onur, Ertan, Niemegeers, Ignas On the resilience of personal networks Inproceedings Proc. of the 2010 5th IEEE International Symposium on Wireless Pervasive Computing (ISWPC), pp. 198-203, 2010. Abstract \| Links \| BibTeX @inproceedings{5483758, title = {On the resilience of personal networks}, author = {Vazifehdan, Javad and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/ISWPC.2010.5483758}, year = {2010}, date = {2010-05-01}, booktitle = {Proc. of the 2010 5th IEEE International Symposium on Wireless Pervasive Computing (ISWPC)}, pages = {198-203}, abstract = {A personal network (PN) is a network of devices belonging to a person. It may consist of a number of ad hoc sub-networks, referred to as clusters. Clusters of a PN could be linked together through the Internet. In this paper, we study the resilience of clusters in a PN, when nodes fail due to battery depletion. A cluster is resilient until a given pair of source-destination nodes can communicate in a multi-hop fashion in the presence of failed nodes. The communication between two nodes stops, if either there is no route between them, or one of the two nodes fails. We derive a closed-form expression for the expected duration that a PN cluster remains resilient. The derived expression determines how and to what extend different parameters such as node density, transmission range, network deployment area, packet length and rate, and energy consumption characteristics of the wireless interface can affect this duration. We verify the accuracy of our analysis using simulation.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close A personal network (PN) is a network of devices belonging to a person. It may consist of a number of ad hoc sub-networks, referred to as clusters. Clusters of a PN could be linked together through the Internet. In this paper, we study the resilience of clusters in a PN, when nodes fail due to battery depletion. A cluster is resilient until a given pair of source-destination nodes can communicate in a multi-hop fashion in the presence of failed nodes. The communication between two nodes stops, if either there is no route between them, or one of the two nodes fails. We derive a closed-form expression for the expected duration that a PN cluster remains resilient. The derived expression determines how and to what extend different parameters such as node density, transmission range, network deployment area, packet length and rate, and energy consumption characteristics of the wireless interface can affect this duration. We verify the accuracy of our analysis using simulation. Close doi:10.1109/ISWPC.2010.5483758 Close
	Alvarez, Santiago, Genc, Zulkuf, Onur, Ertan Cognitive engine for neighbor discovery scheduling in 60 GHz home net- works Miscellaneous Proc. of the WIC Symposium on Information Theory in the Benelux, 2010. BibTeX @misc{Alvarez2010, title = {Cognitive engine for neighbor discovery scheduling in 60 GHz home net- works}, author = {Alvarez, Santiago and Genc, Zulkuf and Onur, Ertan}, year = {2010}, date = {2010-05-01}, howpublished = {Proc. of the WIC Symposium on Information Theory in the Benelux}, keywords = {}, pubstate = {published}, tppubtype = {misc} } Close
	Genc, Zulkuf, Rizvi, Umar H, Onur, Ertan, Niemegeers, Ignas Cooperative communications in future home networks Journal Article Wireless personal communications, 53 (3), pp. 349–364, 2010, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{gencc2010cooperative, title = {Cooperative communications in future home networks}, author = {Genc, Zulkuf and Rizvi, Umar H and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1007/s11277-010-9951-5}, issn = {0929-6212}, year = {2010}, date = {2010-01-01}, journal = {Wireless personal communications}, volume = {53}, number = {3}, pages = {349--364}, publisher = {Springer US}, abstract = {The basic idea behind cooperative communications is that mobile terminals collaborate to send data to each other. This effectively adds diversity in the system and improves the overall performance. In this paper, we investigate the potential gains of cooperative communication in future home networks. We derive analytical expressions for the error probability of binary phase shift keying (BPSK) signals over Nakagami-m fading channels in a multi relay communication network. Following to the analytical study, we analyze the contribution of cooperative relaying to the 60GHz network connectivity through simulations using a realistic indoor environment model. We compare the performance of different relay configurations under variable obstacle densities. We show that a typical 60GHz indoor network should employ either a multi-relay configuration or a single-relay configuration with a smart relay selection mechanism to achieve acceptable outage rates. In the use of multiple-relay configuration, both analytical and simulation studies indicate that increasing the number of cooperative relays does not improve the system performance significantly after a certain threshold.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close The basic idea behind cooperative communications is that mobile terminals collaborate to send data to each other. This effectively adds diversity in the system and improves the overall performance. In this paper, we investigate the potential gains of cooperative communication in future home networks. We derive analytical expressions for the error probability of binary phase shift keying (BPSK) signals over Nakagami-m fading channels in a multi relay communication network. Following to the analytical study, we analyze the contribution of cooperative relaying to the 60GHz network connectivity through simulations using a realistic indoor environment model. We compare the performance of different relay configurations under variable obstacle densities. We show that a typical 60GHz indoor network should employ either a multi-relay configuration or a single-relay configuration with a smart relay selection mechanism to achieve acceptable outage rates. In the use of multiple-relay configuration, both analytical and simulation studies indicate that increasing the number of cooperative relays does not improve the system performance significantly after a certain threshold. Close doi:10.1007/s11277-010-9951-5 Close
	Onur, Ertan, Ersoy, Cem, Delic, Hakan, Akarun, Lale Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours Journal Article Computer Networks, 54 (3), pp. 428–441, 2010, ISSN: 1389-1286. Abstract \| Links \| BibTeX @article{onur2010surveillance, title = {Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours}, author = {Onur, Ertan and Ersoy, Cem and Delic, Hakan and Akarun, Lale}, doi = {10.1016/j.comnet.2009.09.006}, issn = {1389-1286}, year = {2010}, date = {2010-01-01}, journal = {Computer Networks}, volume = {54}, number = {3}, pages = {428--441}, publisher = {Elsevier}, abstract = {For surveillance applications of wireless sensor networks, analysis of sensing coverage and quality of sensing is crucial. For rough terrains where obstacles block the sensing capability, region-based approaches must be employed to determine the sensing quality. In this paper, we present a method to determine the breach paths and the deployment quality defined as the minimum of the maximum detection probabilities on the breach paths in the presence of obstacles. We propose the utilization of watershed segmentation on the iso-sensing map that reveals the equally-sensed regions of the field-of-interest in a surveillance application. Probabilistic sensor models are utilized to produce the iso-sensing map considering the sensing coverage degree and reliability level as the design criteria. The watershed segmentation algorithm is applied on the iso-sensing map to identify the possible breach paths. An algorithm is proposed to convert the watershed segmentation to an auxiliary graph which is then employed to determine the deployment quality measure (DQM). The effects of the sensor count and coverage degree on the DQM are analyzed.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close For surveillance applications of wireless sensor networks, analysis of sensing coverage and quality of sensing is crucial. For rough terrains where obstacles block the sensing capability, region-based approaches must be employed to determine the sensing quality. In this paper, we present a method to determine the breach paths and the deployment quality defined as the minimum of the maximum detection probabilities on the breach paths in the presence of obstacles. We propose the utilization of watershed segmentation on the iso-sensing map that reveals the equally-sensed regions of the field-of-interest in a surveillance application. Probabilistic sensor models are utilized to produce the iso-sensing map considering the sensing coverage degree and reliability level as the design criteria. The watershed segmentation algorithm is applied on the iso-sensing map to identify the possible breach paths. An algorithm is proposed to convert the watershed segmentation to an auxiliary graph which is then employed to determine the deployment quality measure (DQM). The effects of the sensor count and coverage degree on the DQM are analyzed. Close doi:10.1016/j.comnet.2009.09.006 Close
	Aguiar, Rui L, Onur, Ertan, Skouby, Knud Erik, Aguayo-Torres, Mari Carmen, Toftegaard, Thomas Skjodeberg Users, Economics, Technology: Unavoidable Interdynamics Journal Article Wireless personal communications, 53 (3), pp. 437–442, 2010, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{aguiar2010users, title = {Users, Economics, Technology: Unavoidable Interdynamics}, author = {Aguiar, Rui L and Onur, Ertan and Skouby, Knud Erik and Aguayo-Torres, Mari Carmen and Toftegaard, Thomas Skjodeberg}, doi = {10.1007/s11277-010-9956-0}, issn = {0929-6212}, year = {2010}, date = {2010-01-01}, journal = {Wireless personal communications}, volume = {53}, number = {3}, pages = {437--442}, publisher = {Springer US}, abstract = {This paper briefly presents some conclusions of a brainstorming session on the way technology is evolving in ICT. Technology advances have overcome society ability to answer, both in economic and in human aspects. The current design paradigms, of agnostic technology development, need to be reconsidered, and the user needs to be repositioned at the center of future developments.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close This paper briefly presents some conclusions of a brainstorming session on the way technology is evolving in ICT. Technology advances have overcome society ability to answer, both in economic and in human aspects. The current design paradigms, of agnostic technology development, need to be reconsidered, and the user needs to be repositioned at the center of future developments. Close doi:10.1007/s11277-010-9956-0 Close
	Olcer, Gencay Mutlu, Genc, Zulkuf, Onur, Ertan Sector scanning attempts for non-isolation in directional 60 GHz networks Journal Article IEEE Communications Letters, 14 (9), pp. 845–847, 2010, ISSN: 1089-7798. Abstract \| Links \| BibTeX @article{olcer2010sector, title = {Sector scanning attempts for non-isolation in directional 60 GHz networks}, author = {Olcer, Gencay Mutlu and Genc, Zulkuf and Onur, Ertan}, doi = {10.1109/LCOMM.2010.09.100779}, issn = {1089-7798}, year = {2010}, date = {2010-01-01}, journal = {IEEE Communications Letters}, volume = {14}, number = {9}, pages = {845--847}, publisher = {Institute of Electrical and Electronics Engineers, Inc., 3 Park Avenue, 17 th Fl New York NY 10016-5997 USA}, abstract = {Large path losses of millimeter waves restrain the acceptance of 60 GHz technology in future networks. Directional antennas can be exploited in 60 GHz networks to mitigate the detrimental impact of fading. Employing fully directional antennas complicates the neighbor discovery process where each sector must be probed individually to discover neighbors located in that sector. In random scanning strategy, nodes select to-be-scanned sector randomly. In this letter, we analyze the minimum number of random sector scanning attempts during neighbor discovery process to have a non-isolated network. We present an analytical model to study the isolation probability defined as probability of having at least one isolated node in the network. Based on the isolation probability, we derive the minimum number of sector scanning attempts in a 60 GHz ad hoc network with arbitrary number of nodes. Although 60 GHz directional network is studied, this analysis is applicable to any directional wireless network.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Large path losses of millimeter waves restrain the acceptance of 60 GHz technology in future networks. Directional antennas can be exploited in 60 GHz networks to mitigate the detrimental impact of fading. Employing fully directional antennas complicates the neighbor discovery process where each sector must be probed individually to discover neighbors located in that sector. In random scanning strategy, nodes select to-be-scanned sector randomly. In this letter, we analyze the minimum number of random sector scanning attempts during neighbor discovery process to have a non-isolated network. We present an analytical model to study the isolation probability defined as probability of having at least one isolated node in the network. Based on the isolation probability, we derive the minimum number of sector scanning attempts in a 60 GHz ad hoc network with arbitrary number of nodes. Although 60 GHz directional network is studied, this analysis is applicable to any directional wireless network. Close doi:10.1109/LCOMM.2010.09.100779 Close
	PN Editing Group, Personal Networks (PNs) - Overview and Standardisation Needs Technical Report Ecma International (tc32-pnf-2010-021), 2010. Abstract \| BibTeX @techreport{EcmaPN, title = {Personal Networks (PNs) - Overview and Standardisation Needs}, author = {PN Editing Group,}, editor = {Ertan Onur}, year = {2010}, date = {2010-01-01}, number = {tc32-pnf-2010-021}, institution = {Ecma International}, abstract = {Personal Networks (PNs) - Overview and standardisation Needs PNs make it easy and secure to interconnect a person''s electronic devices. They enable the usage of personal devices and applications in a completely new way. Imagine users controlling their front door using their mobile phones or seamlessly accessing files stored on their office PC with their personal Internet tablet from home. Today, most users of electronic devices, including mobile phones, struggle with setting up both wired and wireless networking between their devices even though several network technologies, such as WiFi and Bluetooth, are available in most devices. However, there is no reason why it should be like this. We believe that connecting your electronic devices and using them together should be both easy and secure. PNs make secure and ubiquitous communication using personal devices over any network technology a reality by providing automatic configuration of networking and security, and offering users access to their Services across their PNs. PNs can run with existing hardware, including embedded systems, and use any communication technology, such as Ethernet, WiFi, Bluetooth, WiMedia, 3G/LTE, and WiMAX. With PNs, applications and services on people's devices can start to interact with each other allowing for telecommunications, access and synchronization of documents, remote monitoring and control, multimedia, as well as medical applications. It can also connect with wireless sensor networks and cloud-based services. For instance, it becomes possible to build a single personal virtual file system that contains all storage on all a person's devices as well as cloud-based storage.}, keywords = {}, pubstate = {published}, tppubtype = {techreport} } Close Personal Networks (PNs) - Overview and standardisation Needs PNs make it easy and secure to interconnect a person''s electronic devices. They enable the usage of personal devices and applications in a completely new way. Imagine users controlling their front door using their mobile phones or seamlessly accessing files stored on their office PC with their personal Internet tablet from home. Today, most users of electronic devices, including mobile phones, struggle with setting up both wired and wireless networking between their devices even though several network technologies, such as WiFi and Bluetooth, are available in most devices. However, there is no reason why it should be like this. We believe that connecting your electronic devices and using them together should be both easy and secure. PNs make secure and ubiquitous communication using personal devices over any network technology a reality by providing automatic configuration of networking and security, and offering users access to their Services across their PNs. PNs can run with existing hardware, including embedded systems, and use any communication technology, such as Ethernet, WiFi, Bluetooth, WiMedia, 3G/LTE, and WiMAX. With PNs, applications and services on people's devices can start to interact with each other allowing for telecommunications, access and synchronization of documents, remote monitoring and control, multimedia, as well as medical applications. It can also connect with wireless sensor networks and cloud-based services. For instance, it becomes possible to build a single personal virtual file system that contains all storage on all a person's devices as well as cloud-based storage. Close
	Onur, Ertan, Niemegeers, Ignas, Snijders, Fred Duurzaam Draadloos Book Chapter Croes, Roel (Ed.): Duurzame ICT, pp. 83–91, Sdu Uitgevers bv, Den Haag, 2010, ISBN: 978 90 12 5 8 2 2 8 5. Abstract \| BibTeX @inbook{Onur-DuurzameICT, title = {Duurzaam Draadloos}, author = {Onur, Ertan and Niemegeers, Ignas and Snijders, Fred}, editor = {Roel Croes}, isbn = {978 90 12 5 8 2 2 8 5}, year = {2010}, date = {2010-01-01}, booktitle = {Duurzame ICT}, pages = {83--91}, publisher = {Sdu Uitgevers bv, Den Haag}, abstract = {Voorspellingen van het Wireless World Research Forum geven aan dat er rond het jaar 2017 ongeveer 1000 draadloze apparaten per persoon op aarde zullen zijn. Deze apparaten kunnen zeer uiteenlopende kenmerken hebben van zeer eenvoudige sensoren tot gesofistikeerde â€œsmartphonesâ€. Zeker is dat deze apparaten voornamelijk draadloos en mobiel zullen zijn en de voornaamste elementen vormen van het â€œInternet of Thingsâ€. Toekomstige applicaties en diensten die hier gebruik van maken, zijn te vinden in alle geledingen van de maatschappij, in het bijzonder in kritische toepassingen zoals gezondheid en zorg waar veel vitale functies gemeten moeten worden en de betrouwbaarheidseisen hoog zijn. Energie en straling spelen hierbij in toenemende mate een rol en zijn cruciaal voor de betrouwbaarheid van de diensten en de veiligheid van de gebruiker. De rol van de infrastructuur en de daarmee samenhangende energieconsumptie ter ondersteuning van mobiliteit zal sterk toenemen tenzij passende maatregelen worden getroffen in de draadloze systemen. Cruciaal hierbij is beperking van de afstand tussen basisstation en de mobiele terminal bijvoorbeeld door gebruik van femto-cellen als extensie van cellulaire netwerken of van multi-hop netwerkconcepten. Bij de eerste variant gebruikt men het vaste (optische) netwerk voor de bulk van het dataverkeer naar kleine basisstations dicht bij de abonnees en in de tweede variant de tussenkomst van andere mobiele apparaten voor het doorgeven van de boodschappen. In dit hoofdstuk worden de uitdagingen die ons wachten, uitgediept en de mogelijke oplossingsrichtingen voor verduurzaming van mobiele communicatie besproken.}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } Close Voorspellingen van het Wireless World Research Forum geven aan dat er rond het jaar 2017 ongeveer 1000 draadloze apparaten per persoon op aarde zullen zijn. Deze apparaten kunnen zeer uiteenlopende kenmerken hebben van zeer eenvoudige sensoren tot gesofistikeerde â€œsmartphonesâ€. Zeker is dat deze apparaten voornamelijk draadloos en mobiel zullen zijn en de voornaamste elementen vormen van het â€œInternet of Thingsâ€. Toekomstige applicaties en diensten die hier gebruik van maken, zijn te vinden in alle geledingen van de maatschappij, in het bijzonder in kritische toepassingen zoals gezondheid en zorg waar veel vitale functies gemeten moeten worden en de betrouwbaarheidseisen hoog zijn. Energie en straling spelen hierbij in toenemende mate een rol en zijn cruciaal voor de betrouwbaarheid van de diensten en de veiligheid van de gebruiker. De rol van de infrastructuur en de daarmee samenhangende energieconsumptie ter ondersteuning van mobiliteit zal sterk toenemen tenzij passende maatregelen worden getroffen in de draadloze systemen. Cruciaal hierbij is beperking van de afstand tussen basisstation en de mobiele terminal bijvoorbeeld door gebruik van femto-cellen als extensie van cellulaire netwerken of van multi-hop netwerkconcepten. Bij de eerste variant gebruikt men het vaste (optische) netwerk voor de bulk van het dataverkeer naar kleine basisstations dicht bij de abonnees en in de tweede variant de tussenkomst van andere mobiele apparaten voor het doorgeven van de boodschappen. In dit hoofdstuk worden de uitdagingen die ons wachten, uitgediept en de mogelijke oplossingsrichtingen voor verduurzaming van mobiele communicatie besproken. Close
	Onur, Ertan, Sfakianakis, E., Papagianni, C., Karagiannis, G., Kontos, T., Niemegeers, I., Chochliouros, I.P., de Groot, S.H., Sjodin, P., Hidell, M., Cinkler, T., Maliosz, M., Kaklamani, D.I., Carapinha, J., Belesioti, M., Fytros, E. Intelligent End-To-End Resource Virtualization Using Service Oriented Architecture Inproceedings Proc. of the 2009 IEEE GLOBECOM Workshops, pp. 1-6, 2009. Abstract \| Links \| BibTeX @inproceedings{5360701, title = {Intelligent End-To-End Resource Virtualization Using Service Oriented Architecture}, author = {Onur, Ertan and Sfakianakis, E. and Papagianni, C. and Karagiannis, G. and Kontos, T. and Niemegeers, I. and Chochliouros, I.P. and de Groot, S.H. and Sjodin, P. and Hidell, M. and Cinkler, T. and Maliosz, M. and Kaklamani, D.I. and Carapinha, J. and Belesioti, M. and Fytros, E.}, doi = {10.1109/GLOCOMW.2009.5360701}, year = {2009}, date = {2009-11-01}, booktitle = {Proc. of the 2009 IEEE GLOBECOM Workshops}, pages = {1-6}, abstract = {Service-oriented architecture can be considered as a philosophy or paradigm in organizing and utilizing services and capabilities that may be under the control of different ownership domains. Virtualization provides abstraction and isolation of lower level functionalities, enabling portability of higher level functions and sharing of physical resources. However, dynamics, environmental conditions and increasing complexity / heterogeneity of underlying resources call for adaptive resource handling. In this view an intelligent distributed architecture that enables dynamic user management and control on network-wide resource sharing by using the service oriented architecture concept is presented. Additionally, the proposed architecture supports trading of resources that will enable the transformation of traditional business models.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Service-oriented architecture can be considered as a philosophy or paradigm in organizing and utilizing services and capabilities that may be under the control of different ownership domains. Virtualization provides abstraction and isolation of lower level functionalities, enabling portability of higher level functions and sharing of physical resources. However, dynamics, environmental conditions and increasing complexity / heterogeneity of underlying resources call for adaptive resource handling. In this view an intelligent distributed architecture that enables dynamic user management and control on network-wide resource sharing by using the service oriented architecture concept is presented. Additionally, the proposed architecture supports trading of resources that will enable the transformation of traditional business models. Close doi:10.1109/GLOCOMW.2009.5360701 Close

Reference Letter Requests

Please read, fill in and -if you satisfy the constraints- send me by email the Reference Letter Request Form.

	Demirpolat, Ahmed, Ergenç, Doğanalp, Ozturk, Esref, Ayar, Yusuf, Onur, Ertan Software-Defined Network Security Book Chapter Enabling Technologies and Architectures for Next-Generation Networking Capabilities, pp. 232–253, IGI Global, 2019. BibTeX @inbook{demirpolat2019software, title = {Software-Defined Network Security}, author = {Demirpolat, Ahmed and Ergen{ç}, Do{ğ}analp and Ozturk, Esref and Ayar, Yusuf and Onur, Ertan}, year = {2019}, date = {2019-01-01}, booktitle = {Enabling Technologies and Architectures for Next-Generation Networking Capabilities}, pages = {232--253}, publisher = {IGI Global}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } Close
	Kaya, Muhammed Cagri and Eroglu, Alperen and Karamanlioglu, Alper and Onur, Ertan and Tekinerdogan, Bedir and Dogru, Ali H. Runtime Adaptability of Ambient Intelligence Systems Based on Component-Oriented Approach Book Chapter Mahmood, Zaigham (Ed.): Guide to Ambient Intelligence in the IoT Environment: Principles, Technologies and Applications, pp. 69–92, Springer International Publishing, Cham, 2019, ISBN: 978-3-030-04173-1. Abstract \| Links \| BibTeX @inbook{Kaya2019, title = {Runtime Adaptability of Ambient Intelligence Systems Based on Component-Oriented Approach}, author = {Kaya, Muhammed Cagri and Eroglu, Alperen and Karamanlioglu, Alper and Onur, Ertan and Tekinerdogan, Bedir and Dogru, Ali H.}, editor = {Mahmood, Zaigham}, url = {https://doi.org/10.1007/978-3-030-04173-1_4}, doi = {10.1007/978-3-030-04173-1_4}, isbn = {978-3-030-04173-1}, year = {2019}, date = {2019-01-01}, booktitle = {Guide to Ambient Intelligence in the IoT Environment: Principles, Technologies and Applications}, pages = {69--92}, publisher = {Springer International Publishing}, address = {Cham}, abstract = {Technological improvements of the Internet and connected devices cause increased user expectations. People want to be offered different services in nearly every aspect of their lives. It is a key point that these services can be reached seamlessly and should be dynamically available conforming to the active daily life of today's people. This can be achieved by having intelligent environments along with smart appliances and applications. The concept of ambient intelligence arises from this need to react with users at runtime and keep providing real-time services under changing conditions. This chapter introduces a component-oriented ontology-based approach to develop runtime adaptable ambient intelligenceAmbient Intelligence (AmI)systems. In this approach, the adaptability mechanism is enabled through a component-oriented method with variability-related capabilities. The outcome supports the find-and-integrate method from the idea formation to the executable system, and thus reducing the need for heavy processes for development. Intelligence is provided through ontology modeling that supports repeatability of the approach in different domains, especially when used in interaction with component variability. In this context, an example problem exploiting the variability in the density of a smart stadium network is used to illustrate the application of the component-driven approach.}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } Close Technological improvements of the Internet and connected devices cause increased user expectations. People want to be offered different services in nearly every aspect of their lives. It is a key point that these services can be reached seamlessly and should be dynamically available conforming to the active daily life of today's people. This can be achieved by having intelligent environments along with smart appliances and applications. The concept of ambient intelligence arises from this need to react with users at runtime and keep providing real-time services under changing conditions. This chapter introduces a component-oriented ontology-based approach to develop runtime adaptable ambient intelligenceAmbient Intelligence (AmI)systems. In this approach, the adaptability mechanism is enabled through a component-oriented method with variability-related capabilities. The outcome supports the find-and-integrate method from the idea formation to the executable system, and thus reducing the need for heavy processes for development. Intelligence is provided through ontology modeling that supports repeatability of the approach in different domains, especially when used in interaction with component variability. In this context, an example problem exploiting the variability in the density of a smart stadium network is used to illustrate the application of the component-driven approach. Close https://doi.org/10.1007/978-3-030-04173-1_4 doi:10.1007/978-3-030-04173-1_4 Close
	Mollahasani, Shahram, Onur, Ertan Density-Aware, Energy-and Spectrum-Efficient Small Cell Scheduling Journal Article IEEE Access, 7 , pp. 65852–65869, 2019. BibTeX @article{mollahasani2019density, title = {Density-Aware, Energy-and Spectrum-Efficient Small Cell Scheduling}, author = {Mollahasani, Shahram and Onur, Ertan}, year = {2019}, date = {2019-01-01}, journal = {IEEE Access}, volume = {7}, pages = {65852--65869}, publisher = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close
	Eroğlu, Alperen, Yaman, Okan, Onur, Ertan Density-aware cellular coverage control: Interference-based density estimation Journal Article Computer Networks, 165 , pp. 106922, 2019. BibTeX @article{erouglu2019density, title = {Density-aware cellular coverage control: Interference-based density estimation}, author = {Ero{ğ}lu, Alperen and Yaman, Okan and Onur, Ertan}, year = {2019}, date = {2019-01-01}, journal = {Computer Networks}, volume = {165}, pages = {106922}, publisher = {Elsevier}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close
	Ergenç, Doğanalp, Onur, Ertan iSDR: SDR-in-the-loop Simulation Inproceedings IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1037–1038, IEEE 2019. BibTeX @inproceedings{ergencc2019isdr, title = {iSDR: SDR-in-the-loop Simulation}, author = {Ergen{ç}, Do{ğ}analp and Onur, Ertan}, year = {2019}, date = {2019-01-01}, booktitle = {IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)}, pages = {1037--1038}, organization = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close
	Simsek, Goksel, Alemdar, Hande, Onur, Ertan Multi-Connectivity Enabled User Association Inproceedings 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1–6, IEEE 2019. BibTeX @inproceedings{simsek2019multi, title = {Multi-Connectivity Enabled User Association}, author = {Simsek, Goksel and Alemdar, Hande and Onur, Ertan}, year = {2019}, date = {2019-01-01}, booktitle = {2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)}, pages = {1--6}, organization = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close
	Ergenç, Doǧanalp, Eksert, Levent, Onur, Ertan Dependability-based Clustering in Mobile Ad-Hoc Networks Journal Article Ad Hoc Networks, pp. 101926, 2019. BibTeX @article{ergencc2019dependability, title = {Dependability-based Clustering in Mobile Ad-Hoc Networks}, author = {Ergen{ç}, Doǧanalp and Eksert, Levent and Onur, Ertan}, year = {2019}, date = {2019-01-01}, journal = {Ad Hoc Networks}, pages = {101926}, publisher = {Elsevier}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close
	Cavit Kara, Ertan Onur A Software-defined Network Based Lightweight Cluster Inproceedings Proc. of the IEEE Signal Processing and Communication Applications (SIU), İzmir, Turkey, 2018. BibTeX @inproceedings{Kara2018SIU, title = {A Software-defined Network Based Lightweight Cluster}, author = {Cavit Kara and Ertan Onur}, year = {2018}, date = {2018-05-02}, booktitle = {Proc. of the IEEE Signal Processing and Communication Applications (SIU)}, address = {İzmir, Turkey}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close
	Shahram Mollahasani, Ertan Onur Density-Aware Power Allocation in Mobile Networks Using Edge Computing Inproceedings İzmir, Turkey, 2018. BibTeX @inproceedings{Mollahasan2018SIU, title = {Density-Aware Power Allocation in Mobile Networks Using Edge Computing}, author = {Shahram Mollahasani and Ertan Onur}, year = {2018}, date = {2018-05-02}, journal = {Proc. of the IEEE Signal Processing and Communication Applications (SIU) }, address = {İzmir, Turkey}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close
	Alperen Eroglu, Ertan Onur, Mehmet Turan Density-aware Outage in Clustered Ad Hoc Networks Inproceedings NTMS'2018 - Mobility & Wireless Networks Track (NTMS 2018 Mobility & Wireless Track), Paris, France, 2018. Abstract \| BibTeX @inproceedings{Erog1802:Density, title = {Density-aware Outage in Clustered Ad Hoc Networks}, author = {Alperen Eroglu and Ertan Onur and Mehmet Turan}, year = {2018}, date = {2018-01-01}, booktitle = {NTMS'2018 - Mobility & Wireless Networks Track (NTMS 2018 Mobility & Wireless Track)}, address = {Paris, France}, abstract = {Density of ad hoc networks may vary in time and space because of mobile stations, sleep scheduling or failure of nodes. Resources such as spectrum will be wasted if the network is not density-aware and -adaptive. Towards this aim, distributed and robust network density estimators are required. In this paper, we propose a novel cluster density estimator in random ad hoc networks by employing distance matrix. Monte-Carlo simulation results validate the proposed estimator in addition to comparison with two different estimators. The accuracy of the estimator is impressive even under a high amount of distance measurement errors. We also demonstrate impact of density on network outage and transmission power adaption via proposing 2-D analytic models based on density and validating these models with the proposed density estimator.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Density of ad hoc networks may vary in time and space because of mobile stations, sleep scheduling or failure of nodes. Resources such as spectrum will be wasted if the network is not density-aware and -adaptive. Towards this aim, distributed and robust network density estimators are required. In this paper, we propose a novel cluster density estimator in random ad hoc networks by employing distance matrix. Monte-Carlo simulation results validate the proposed estimator in addition to comparison with two different estimators. The accuracy of the estimator is impressive even under a high amount of distance measurement errors. We also demonstrate impact of density on network outage and transmission power adaption via proposing 2-D analytic models based on density and validating these models with the proposed density estimator. Close
	Okan Yaman, Alperen Eroglu, Ertan Onur Density-aware Cell Zooming Inproceedings 2018 21st Conference on Innovation in Clouds, Internet and Networks (ICIN) (ICIN 2018), Paris, France, 2018. Abstract \| BibTeX @inproceedings{Erog1802:Densityb, title = {Density-aware Cell Zooming}, author = {Okan Yaman and Alperen Eroglu and Ertan Onur}, year = {2018}, date = {2018-01-01}, booktitle = {2018 21st Conference on Innovation in Clouds, Internet and Networks (ICIN) (ICIN 2018)}, address = {Paris, France}, abstract = {Ultra-dense deployments and mobile cells significantly change cellular networking paradigm. Infrastructure and topology of cellular networks become dynamic as opposed to legacy systems where the infrastructure is assumed to be stationary. As topology morphs, base station or user density of networks also change impacting the performance in terms of resource utilization and quality of service. To increase network capacity, preserve coverage and conserve energy, network density should be considered in communication stacks to make the network density-aware, and -adaptive. In this work, we analyze the impact of density on network outage in cellular networks. We propose a novel cell zooming technique at run-time considering network outage and density jointly with a three-dimensional base station density estimator.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Ultra-dense deployments and mobile cells significantly change cellular networking paradigm. Infrastructure and topology of cellular networks become dynamic as opposed to legacy systems where the infrastructure is assumed to be stationary. As topology morphs, base station or user density of networks also change impacting the performance in terms of resource utilization and quality of service. To increase network capacity, preserve coverage and conserve energy, network density should be considered in communication stacks to make the network density-aware, and -adaptive. In this work, we analyze the impact of density on network outage in cellular networks. We propose a novel cell zooming technique at run-time considering network outage and density jointly with a three-dimensional base station density estimator. Close
	Doğanalp Ergenç, Levent Eksert, Ertan Onur Density-aware Probabilistic Clustering in Ad hoc Networks Inproceedings 2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) (IEEE BlackSeaCom 2018), Batumi, Georgia, 2018. Abstract \| BibTeX @inproceedings{Erge1806:Density, title = {Density-aware Probabilistic Clustering in Ad hoc Networks}, author = {Doğanalp Ergenç and Levent Eksert and Ertan Onur}, year = {2018}, date = {2018-01-01}, booktitle = {2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) (IEEE BlackSeaCom 2018)}, address = {Batumi, Georgia}, abstract = {Clustering makes an ad hoc network scalable forming easy-to-manage local groups. However, it brings an extra control overhead to create and maintain clustered network topology. In this paper, we propose Probabilistic Clustering Algorithm that is a simple and efficient clustering algorithm with minimal overhead. In this algorithm, cluster heads are determined probabilistically in a distributed fashion. An analytic model is introduced for nodes to compute the probability of declaring themselves as cluster heads. We validate the analytic model by Monte-Carlo simulations. Furthermore, we propose a cross-layer clustered stack and simulate simple applications in stationary and dynamic topologies using OMNeT++. Discrete event simulation results show that Probabilistic Clustering Algo- rithm eliminates a significant amount of control overhead and the performance of the algorithm is considerably better compared to its opponent, Identity-based Clustering Algorithm in both uniform and nonuniform network deployments.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Clustering makes an ad hoc network scalable forming easy-to-manage local groups. However, it brings an extra control overhead to create and maintain clustered network topology. In this paper, we propose Probabilistic Clustering Algorithm that is a simple and efficient clustering algorithm with minimal overhead. In this algorithm, cluster heads are determined probabilistically in a distributed fashion. An analytic model is introduced for nodes to compute the probability of declaring themselves as cluster heads. We validate the analytic model by Monte-Carlo simulations. Furthermore, we propose a cross-layer clustered stack and simulate simple applications in stationary and dynamic topologies using OMNeT++. Discrete event simulation results show that Probabilistic Clustering Algo- rithm eliminates a significant amount of control overhead and the performance of the algorithm is considerably better compared to its opponent, Identity-based Clustering Algorithm in both uniform and nonuniform network deployments. Close
	Doganalp Ergenc, Ertan Onur Cross-layer Stack Design Framework in OMNeT++ Inproceedings Förster, Anna; Udugama, Asanga; Virdis, Antonio; Nardini, Giovanni (Ed.): Proceedings of the 5th International OMNeT++ Community Summit, pp. 11–22, EasyChair, 2018, ISSN: 2398-7340. Links \| BibTeX @inproceedings{OMNeT2018:Cross_layer_Stack_Design_Framework, title = {Cross-layer Stack Design Framework in OMNeT++}, author = {Doganalp Ergenc and Ertan Onur}, editor = {Anna Förster and Asanga Udugama and Antonio Virdis and Giovanni Nardini}, url = {https://easychair.org/publications/paper/Sklb}, doi = {10.29007/45sr}, issn = {2398-7340}, year = {2018}, date = {2018-01-01}, booktitle = {Proceedings of the 5th International OMNeT++ Community Summit}, volume = {56}, pages = {11--22}, publisher = {EasyChair}, series = {EPiC Series in Computing}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close https://easychair.org/publications/paper/Sklb doi:10.29007/45sr Close
	Mert Çalık, Shahram Mollahasani, Ertan Onur Density-aware Joint Optimization of Cell Scheduling and User Association Conference IEEE WCNC FLEXNETS 2018, Paris, France, 2018. BibTeX @conference{Calik2018, title = {Density-aware Joint Optimization of Cell Scheduling and User Association}, author = {Mert Çalık and Shahram Mollahasani and Ertan Onur}, year = {2018}, date = {2018-01-01}, booktitle = {IEEE WCNC FLEXNETS 2018}, address = {Paris, France}, keywords = {}, pubstate = {published}, tppubtype = {conference} } Close
	Adnan Kılıç, Cansu Betin Onur, Ertan Onur Revisiting Shamir's No-key Protocol: Lightweight Key Transport Inproceedings Forthcoming 15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC), Orlando Florida, Forthcoming. BibTeX @inproceedings{KilicDASC2017, title = {Revisiting Shamir's No-key Protocol: Lightweight Key Transport}, author = {Adnan Kılıç and Cansu Betin Onur and Ertan Onur}, year = {2017}, date = {2017-11-10}, booktitle = {15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC)}, address = {Orlando Florida}, keywords = {}, pubstate = {forthcoming}, tppubtype = {inproceedings} } Close
	Shahram Mollahasani, Alperen Eroğlu, Ömer Yamaç, Ertan Onur Simulators, Test Beds and Prototypes of 5G mobile Networking Architectures Book Chapter Forthcoming Elkhodr, Mahmoud; Hassan, Qusay; Shahrestani, Seyed (Ed.): Chapman and Hall/CRC, Networks of the Future: Architectures, Technologies, and Implementations, Forthcoming, ISBN: 9781498783972. Abstract \| BibTeX @inbook{Mollahasani2017, title = {Simulators, Test Beds and Prototypes of 5G mobile Networking Architectures}, author = {Shahram Mollahasani and Alperen Eroğlu and Ömer Yamaç and Ertan Onur}, editor = {Mahmoud Elkhodr and Qusay Hassan and Seyed Shahrestani}, isbn = {9781498783972}, year = {2017}, date = {2017-09-15}, publisher = {Chapman and Hall/CRC}, edition = {Networks of the Future: Architectures, Technologies, and Implementations}, series = {Chapman & Hall/CRC Computer and Information Science Series}, abstract = {There will be a big leap in mobile communications in the coming years. Heterogeneous infrastructures, including ubiquitous solutions such as the Internet of Things, Machine to Machine Communication, and Intelligent Transportation Systems will be an integral part of mobile communication networks. Cloudification, softwarization and visualization will be the major paradigm changes in the design of networks to achieve flexible and efficient systems providing a high capacity with minimal delay. To materialize this vision, many research challenges have to be addressed and validated on simulators or test beds. Prior to deployment of developed features in 5G systems, experimentations of the proposals under realistic and practical operating circumstances are required. Well-designed simulators and test beds for 5G experimentation are needed towards this aim. This chapter explains and analyzes some of the 5G simulators, federations, test beds, and their prototypes by considering some research and design issues. The joint requirements and the comparison criteria for 5G test beds are explained and presented. This chapter also explains and compares the reviewed 5G simulators in terms of some shared design and research properties. }, keywords = {}, pubstate = {forthcoming}, tppubtype = {inbook} } Close There will be a big leap in mobile communications in the coming years. Heterogeneous infrastructures, including ubiquitous solutions such as the Internet of Things, Machine to Machine Communication, and Intelligent Transportation Systems will be an integral part of mobile communication networks. Cloudification, softwarization and visualization will be the major paradigm changes in the design of networks to achieve flexible and efficient systems providing a high capacity with minimal delay. To materialize this vision, many research challenges have to be addressed and validated on simulators or test beds. Prior to deployment of developed features in 5G systems, experimentations of the proposals under realistic and practical operating circumstances are required. Well-designed simulators and test beds for 5G experimentation are needed towards this aim. This chapter explains and analyzes some of the 5G simulators, federations, test beds, and their prototypes by considering some research and design issues. The joint requirements and the comparison criteria for 5G test beds are explained and presented. This chapter also explains and compares the reviewed 5G simulators in terms of some shared design and research properties. Close
	Hüsnü Yıldız, Adnan Kılıç, Ertan Onur Lightweight Cryptography in 5G Machine-type Communication Book Chapter Forthcoming Elkhodr, Mahmoud; Hassan, Qusay; Shahrestani, Seyed (Ed.): Chapman and Hall/CRC, Networks of the Future: Architectures, Technologies, and Implementations, Forthcoming, ISBN: 9781498783972. Abstract \| BibTeX @inbook{Yildiz2017, title = {Lightweight Cryptography in 5G Machine-type Communication}, author = {Hüsnü Yıldız and Adnan Kılıç and Ertan Onur}, editor = {Mahmoud Elkhodr and Qusay Hassan and Seyed Shahrestani}, isbn = {9781498783972}, year = {2017}, date = {2017-09-06}, publisher = {Chapman and Hall/CRC}, edition = {Networks of the Future: Architectures, Technologies, and Implementations}, series = {Chapman & Hall/CRC Computer and Information Science Series}, abstract = {The number of connected devices is expected to reach 50 billion, varying from sensors to industry-grade servers by 2020. These devices will communicate with each other using 5G technologies supporting high-capacity and longer ranges through massive machine-to-machine and human-to-machine communication. Security will still be a major concern in future networks. Conventional cryptographic algorithms may not be appropriate for constrained devices since they have limited CPU, power and memory. Lightweight cryptographic algorithms have been proposed to provide confidentiality, integrity and availability especially for constrained devices. In this chapter, we elaborate on constrained devices and security of machine-type communication, lightweight cryptographic algorithms, their features and related attack types. }, keywords = {}, pubstate = {forthcoming}, tppubtype = {inbook} } Close The number of connected devices is expected to reach 50 billion, varying from sensors to industry-grade servers by 2020. These devices will communicate with each other using 5G technologies supporting high-capacity and longer ranges through massive machine-to-machine and human-to-machine communication. Security will still be a major concern in future networks. Conventional cryptographic algorithms may not be appropriate for constrained devices since they have limited CPU, power and memory. Lightweight cryptographic algorithms have been proposed to provide confidentiality, integrity and availability especially for constrained devices. In this chapter, we elaborate on constrained devices and security of machine-type communication, lightweight cryptographic algorithms, their features and related attack types. Close
	Talha Koruk, Ertan Onur Bio-inspired Bandwidth Packing Inproceedings Forthcoming Proc. of the IEEE Consumer Communications & Networking Conference (CCNC), IEEE, Las Vegas, Nevada, Forthcoming. BibTeX @inproceedings{Koruk2017, title = {Bio-inspired Bandwidth Packing}, author = {Talha Koruk and Ertan Onur}, year = {2017}, date = {2017-05-06}, booktitle = {Proc. of the IEEE Consumer Communications & Networking Conference (CCNC)}, publisher = {IEEE}, address = {Las Vegas, Nevada}, keywords = {}, pubstate = {forthcoming}, tppubtype = {inproceedings} } Close
	Can Mehteroğlu, Ertan Onur Semantic Edge Caching and Prefetching in 5G Inproceedings Forthcoming Proc. of the IEEE Consumer Communications & Networking Conference (CCNC), IEEE Las Vegas, Nevada, Forthcoming. BibTeX @inproceedings{Mehteroglu2017, title = {Semantic Edge Caching and Prefetching in 5G}, author = {Can Mehteroğlu and Ertan Onur}, year = {2017}, date = {2017-05-06}, booktitle = {Proc. of the IEEE Consumer Communications & Networking Conference (CCNC)}, address = {Las Vegas, Nevada}, organization = {IEEE}, keywords = {}, pubstate = {forthcoming}, tppubtype = {inproceedings} } Close
	Shaharam Mollahasani, Ertan Onur Evaluation of Terahertz Channel in Data Centers Inproceedings NOMS 2016 (), Istanbul, Turkey, 2016. Abstract \| Links \| BibTeX @inproceedings{150457, title = {Evaluation of Terahertz Channel in Data Centers}, author = {Shaharam Mollahasani and Ertan Onur}, doi = {10.1109/NOMS.2016.7502886}, year = {2016}, date = {2016-04-01}, booktitle = {NOMS 2016 ()}, address = {Istanbul, Turkey}, abstract = {Designing data center network topologies with the objective of minimizing cost, increasing bisection bandwidth and decreasing latency is a difficult problem. The solutions in the literature mainly concentrate on wired networks and minimizing wiring costs thereof. Only a few proposals address the benefit of employing wireless communications in data centers due to spectrum and bandwidth limitations of current wireless communication technologies. By using terahertz communication in data centers as a complementary technology, the performance of a data center can be enhanced and substantial savings in cabling costs can be achieved without any throughput concession. Terahertz (THz) band can overcome bandwidth limitations and satisfy a wide range of applications from classical networking to board-to-board communication. In this paper, we evaluate the terahertz channel in data centers by considering atmospheric absorption. Based on the results, we recommend employing 190-310 GHz range with a bandwidth of 120 GHz. Keeping the relative humidity level at 40% will reduce atmospheric absorption while proving a healthy environmental regime for the equipment in a data center.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Designing data center network topologies with the objective of minimizing cost, increasing bisection bandwidth and decreasing latency is a difficult problem. The solutions in the literature mainly concentrate on wired networks and minimizing wiring costs thereof. Only a few proposals address the benefit of employing wireless communications in data centers due to spectrum and bandwidth limitations of current wireless communication technologies. By using terahertz communication in data centers as a complementary technology, the performance of a data center can be enhanced and substantial savings in cabling costs can be achieved without any throughput concession. Terahertz (THz) band can overcome bandwidth limitations and satisfy a wide range of applications from classical networking to board-to-board communication. In this paper, we evaluate the terahertz channel in data centers by considering atmospheric absorption. Based on the results, we recommend employing 190-310 GHz range with a bandwidth of 120 GHz. Keeping the relative humidity level at 40% will reduce atmospheric absorption while proving a healthy environmental regime for the equipment in a data center. Close doi:10.1109/NOMS.2016.7502886 Close
	Seyyit Ali Sert, Ertan Onur, Adnan Yazıcı Security attacks and countermeasures in Surveillance Wireless Sensor Networks Inproceedings Application of Information and Communication Technologies (AICT), 2015 9th International Conference on, pp. 201-205, 2015. Abstract \| Links \| BibTeX @inproceedings{7338546, title = {Security attacks and countermeasures in Surveillance Wireless Sensor Networks}, author = {Seyyit Ali Sert and Ertan Onur and Adnan Yazıcı}, doi = {10.1109/ICAICT.2015.7338546}, year = {2015}, date = {2015-10-01}, booktitle = {Application of Information and Communication Technologies (AICT), 2015 9th International Conference on}, pages = {201-205}, abstract = {Surveillance has always been an important task for human beings either for protecting a precious asset or gathering information from the surrounding environment. However, things to be monitored are increasing with a huge rate due to the changing requirements day by day. As a result, it becomes nearly impossible for individuals to do this task manually. To be able to fulfill such requirements, Surveillance Wireless Sensor Networks (SWSNs) have emerged. An SWSN is comprised of tiny nodes geared with various sensor types from a few of them to hundreds or even thousands, where each node is connected to several surrounding nodes. Most SWSNs operate by sensing at the node-level and conveying the sensed data to the sink (base station) for decision making processes such as object classification, localization, or event detection. In this respect, secure transmission of the sensed data is crucial since decision making is performed according to the received data. In this study, we primarily discuss the security attacks and defense mechanisms in surveillance wireless sensor networks. Moreover, security requirements of SWSNs, how accuracy and efficiency aspects of SWNSs are affected from each attack type, and evaluation criteria of defense mechanisms are presented in detail.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Surveillance has always been an important task for human beings either for protecting a precious asset or gathering information from the surrounding environment. However, things to be monitored are increasing with a huge rate due to the changing requirements day by day. As a result, it becomes nearly impossible for individuals to do this task manually. To be able to fulfill such requirements, Surveillance Wireless Sensor Networks (SWSNs) have emerged. An SWSN is comprised of tiny nodes geared with various sensor types from a few of them to hundreds or even thousands, where each node is connected to several surrounding nodes. Most SWSNs operate by sensing at the node-level and conveying the sensed data to the sink (base station) for decision making processes such as object classification, localization, or event detection. In this respect, secure transmission of the sensed data is crucial since decision making is performed according to the received data. In this study, we primarily discuss the security attacks and defense mechanisms in surveillance wireless sensor networks. Moreover, security requirements of SWSNs, how accuracy and efficiency aspects of SWNSs are affected from each attack type, and evaluation criteria of defense mechanisms are presented in detail. Close doi:10.1109/ICAICT.2015.7338546 Close
	Alperen Eroglu, Ertan Onur, Halit Oguztuzun Estimating density of wireless networks in practice Inproceedings Personal, Indoor, and Mobile Radio Communications (PIMRC), 2015 IEEE 26th Annual International Symposium on, pp. 1476-1480, 2015. Abstract \| Links \| BibTeX @inproceedings{7343531, title = {Estimating density of wireless networks in practice}, author = {Alperen Eroglu and Ertan Onur and Halit Oguztuzun}, doi = {10.1109/PIMRC.2015.7343531}, year = {2015}, date = {2015-08-01}, booktitle = {Personal, Indoor, and Mobile Radio Communications (PIMRC), 2015 IEEE 26th Annual International Symposium on}, pages = {1476-1480}, abstract = {Density of a wireless network drastically impacts its performance. Adapting the networking protocols at run-time to density changes, which may not be predictable in advance, may improve the network performance. Estimating the density of a wireless network is the challenge we address in this paper. A wireless node may locally estimate the network density by measuring the received signal strength (RSS) of packets sent by its neighbours. However, RSS is prone to large- and small-scale fading, and this phenomenon negatively affects the accuracy of density estimators. In this study, we validate the existing RSS-based density estimators by controlled laboratory experiments conducted in the FIT IoT-LAB test-bed located in Lille, France. Further, we propose a new density estimator that is a fusion of existing estimators. Controlled laboratory experiments showed that the average absolute percentage deviation of the new density estimator is around 1 to 10 percent and the fusion approach overcomes the deficiencies of the existing RSS-based estimators.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Density of a wireless network drastically impacts its performance. Adapting the networking protocols at run-time to density changes, which may not be predictable in advance, may improve the network performance. Estimating the density of a wireless network is the challenge we address in this paper. A wireless node may locally estimate the network density by measuring the received signal strength (RSS) of packets sent by its neighbours. However, RSS is prone to large- and small-scale fading, and this phenomenon negatively affects the accuracy of density estimators. In this study, we validate the existing RSS-based density estimators by controlled laboratory experiments conducted in the FIT IoT-LAB test-bed located in Lille, France. Further, we propose a new density estimator that is a fusion of existing estimators. Controlled laboratory experiments showed that the average absolute percentage deviation of the new density estimator is around 1 to 10 percent and the fusion approach overcomes the deficiencies of the existing RSS-based estimators. Close doi:10.1109/PIMRC.2015.7343531 Close
	Yunus Durmuş, Ertan Onur Service Knowledge Discovery in Smart Machine Networks Journal Article Wireless Personal Communications, 81 (4), pp. 1455–1480, 2015, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{durmus2015service, title = {Service Knowledge Discovery in Smart Machine Networks}, author = {Yunus Durmuş and Ertan Onur}, doi = {10.1007/s11277-015-2483-2}, issn = {0929-6212}, year = {2015}, date = {2015-01-01}, journal = {Wireless Personal Communications}, volume = {81}, number = {4}, pages = {1455--1480}, publisher = {Springer US}, abstract = {The devices surrounding us become smarter and can autonomously form a network without requiring our intervention. However, our needs can be even better accommodated when the networked devices cooperate and complement each otherÃ¢â‚¬â„¢s capabilities. One of the initial steps towards achieving a cooperative platform of smart devices is the discovery of resources and capabilities within the network. TodayÃ¢â‚¬â„¢s operational service discovery protocols carry simple text-based uniform resource identifiers that are not expressive enough. Machines cannot comprehend the meaning of a new service that is not in their knowledge base. In addition to being more expressive, service discovery protocols must compensate the diversity to improve cooperation between the devices that use different application protocols and operate on different communication interfaces. In this paper, we propose the Smart Discovery Protocol (SDP) which outperforms the operational service discovery protocols with three main features: (1) more expressive semantic representation of the services, (2) operating in the network layer to deal with diversity, and (3) unifying existing service discovery protocols. SDP represents services with ontologies as some recently proposed semantic service discovery protocols. It further enhances the success of semantic representations by creating a unified platform that can carry legacy discovery services. In this respect, the novelties of SDP are as follows: firstly, it operates in the network layer and consequently abstracts both the application layer and communication interfaces. Secondly, SDP unifies the legacy service discovery protocols by integrating their simple text-based service representations in one message. The underlying transport mechanism of SDP is designed as an add-on to the Neighbor Discovery Protocol (NDP) of the IPv6 standard. The metadata is carried in the payload of ICMPv6 packets. Simple text-based representations of other service discovery protocols are embedded in type-length-value options of NDP. Authenticity of the devices is ensured by the IPv6 Secure Neighbor Discovery protocol. Unlike previous semantic approaches on service discovery, we have implemented our protocol on real hardware. The results demonstrate the feasibility of carrying semantic representations of the services and integration of other service discovery protocols.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close The devices surrounding us become smarter and can autonomously form a network without requiring our intervention. However, our needs can be even better accommodated when the networked devices cooperate and complement each otherÃ¢â‚¬â„¢s capabilities. One of the initial steps towards achieving a cooperative platform of smart devices is the discovery of resources and capabilities within the network. TodayÃ¢â‚¬â„¢s operational service discovery protocols carry simple text-based uniform resource identifiers that are not expressive enough. Machines cannot comprehend the meaning of a new service that is not in their knowledge base. In addition to being more expressive, service discovery protocols must compensate the diversity to improve cooperation between the devices that use different application protocols and operate on different communication interfaces. In this paper, we propose the Smart Discovery Protocol (SDP) which outperforms the operational service discovery protocols with three main features: (1) more expressive semantic representation of the services, (2) operating in the network layer to deal with diversity, and (3) unifying existing service discovery protocols. SDP represents services with ontologies as some recently proposed semantic service discovery protocols. It further enhances the success of semantic representations by creating a unified platform that can carry legacy discovery services. In this respect, the novelties of SDP are as follows: firstly, it operates in the network layer and consequently abstracts both the application layer and communication interfaces. Secondly, SDP unifies the legacy service discovery protocols by integrating their simple text-based service representations in one message. The underlying transport mechanism of SDP is designed as an add-on to the Neighbor Discovery Protocol (NDP) of the IPv6 standard. The metadata is carried in the payload of ICMPv6 packets. Simple text-based representations of other service discovery protocols are embedded in type-length-value options of NDP. Authenticity of the devices is ensured by the IPv6 Secure Neighbor Discovery protocol. Unlike previous semantic approaches on service discovery, we have implemented our protocol on real hardware. The results demonstrate the feasibility of carrying semantic representations of the services and integration of other service discovery protocols. Close doi:10.1007/s11277-015-2483-2 Close
	Durmus, Yunus, Loukas, Andreas, Onur, Ertan, Langendoen, Koen Sybil-Resistant Meta Strategies for the Forwarder's Dilemma Inproceedings Proc. of the IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 90-99, 2014. Abstract \| Links \| BibTeX @inproceedings{7001004, title = {Sybil-Resistant Meta Strategies for the Forwarder's Dilemma}, author = {Durmus, Yunus and Loukas, Andreas and Onur, Ertan and Langendoen, Koen}, doi = {10.1109/SASO.2014.21}, year = {2014}, date = {2014-09-01}, booktitle = {Proc. of the IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO)}, pages = {90-99}, abstract = {Cooperation is the foundation of wireless ad hoc networks with nodes forwarding their neighbors' packets for the common good. However, energy and bandwidth constraints combined with selfish behaviour lead to collapsed networks where all nodes defect. Researchers have tried to incentivize or enforce the nodes for cooperation in various ways. However, these techniques do not consider the heterogeneous networks in which a diverse set of nodes with different cognitive capabilities exist. Furthermore, in ad hoc networks identity is a fuzzy concept. It is easy to forge multiple identities and hide defective behaviour. Moreover, the nature of the wireless medium is always ambiguous due to collisions, interference and asymmetric links. In all this uncertainty, having complete information about the intentions of the nodes and acting on it is not straightforward. Backed by evolutionary game theory and multi-agent systems research, we adapt and modify two meta strategies to embrace this uncertainty. These modified meta strategies, Win Stay Loose Shift and Stochastic Imitate Best Strategy, do not require strict identity information and only depend on nodes' own capabilities. Nodes monitor the traffic in their neighbourhood by using a two-hop overhearing method, and decide whether they should be cooperative or defective. We show that nodes are able to discover and use the best strategy in their locality and protect themselves against the exploitation by free riders who devise Sybil attacks by changing their identities.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Cooperation is the foundation of wireless ad hoc networks with nodes forwarding their neighbors' packets for the common good. However, energy and bandwidth constraints combined with selfish behaviour lead to collapsed networks where all nodes defect. Researchers have tried to incentivize or enforce the nodes for cooperation in various ways. However, these techniques do not consider the heterogeneous networks in which a diverse set of nodes with different cognitive capabilities exist. Furthermore, in ad hoc networks identity is a fuzzy concept. It is easy to forge multiple identities and hide defective behaviour. Moreover, the nature of the wireless medium is always ambiguous due to collisions, interference and asymmetric links. In all this uncertainty, having complete information about the intentions of the nodes and acting on it is not straightforward. Backed by evolutionary game theory and multi-agent systems research, we adapt and modify two meta strategies to embrace this uncertainty. These modified meta strategies, Win Stay Loose Shift and Stochastic Imitate Best Strategy, do not require strict identity information and only depend on nodes' own capabilities. Nodes monitor the traffic in their neighbourhood by using a two-hop overhearing method, and decide whether they should be cooperative or defective. We show that nodes are able to discover and use the best strategy in their locality and protect themselves against the exploitation by free riders who devise Sybil attacks by changing their identities. Close doi:10.1109/SASO.2014.21 Close
	Constantinescu, Mihai, Onur, Ertan, Durmus, Yunus, Nikou, Shahrokh, De Reuver, Mark, Bouwman, Harry, Djurica, Miodrag, Maria Glatz, Philipp Mobile tethering: overview, perspectives and challenges Journal Article Info, 16 (3), pp. 40–53, 2014, ISSN: 1463-6697. Abstract \| Links \| BibTeX @article{constantinescu2014mobile, title = {Mobile tethering: overview, perspectives and challenges}, author = {Constantinescu, Mihai and Onur, Ertan and Durmus, Yunus and Nikou, Shahrokh and De Reuver, Mark and Bouwman, Harry and Djurica, Miodrag and Maria Glatz, Philipp}, doi = {10.1108/info-05-2013-0033}, issn = {1463-6697}, year = {2014}, date = {2014-01-01}, journal = {Info}, volume = {16}, number = {3}, pages = {40--53}, publisher = {Emerald Group Publishing Limited}, abstract = {Purpose: The purpose of this paper is to analyze mobile tethering from technological and social perspectives. Mobile tethering allows us to share cellular data connection with others over WiFi, Bluetooth or USB. Although the technology is ready and has promising outcomes, service providers and the users still keep their distance. Therefore, the incentives for the users and service providers should be identified. Design/methodology/approach: Technical challenges in terms of energy and bandwidth consumption are explored using an application specifically developed for mobile tethering. Usage: issues are studied through conjoint analysis, in which we analyze the importance of technical aspects as well as social conditions for sharing data connection with others. Findings: The research shows that although energy, bandwidth and security are important technical challenges, users are mainly concerned about social aspects, such as with whom the connection will be shared, rather than monetary issues. Mobile tethering is a viable cooperative service, only when users are familiar with the person with whom the data connection is being shared. Research limitations/implications In the technical evaluation of the mobile tethering application, only Android operating systems are being used. Other operating systems (e.g. iOS) may perform differently. Moreover, only a small fraction of smartphones and tablets has been tested. Practical implications: Service providers tend to block mobile tethering technology, as they do not have control and do not expect to gain revenues. However, service providers have the abilities to satisfy the security and privacy concerns of the users and can create secure femtocells for their customers. Social implications: Mobile tethering performance results indicate that more people can access the Internet while they are mobile even if they do not have cellular data subscription. More Internet-based services can be offered to people while they roam in other countries. Originality/value: For technology developers, both the key technical issues and the concerns of the consumers are highlighted. Future applications must contain reliable security and privacy protocols in their design. Moreover, the significance of the social networks is shown in the decision-making of the use of mobile tethering, especially with respect to the credit exchange.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Purpose: The purpose of this paper is to analyze mobile tethering from technological and social perspectives. Mobile tethering allows us to share cellular data connection with others over WiFi, Bluetooth or USB. Although the technology is ready and has promising outcomes, service providers and the users still keep their distance. Therefore, the incentives for the users and service providers should be identified. Design/methodology/approach: Technical challenges in terms of energy and bandwidth consumption are explored using an application specifically developed for mobile tethering. Usage: issues are studied through conjoint analysis, in which we analyze the importance of technical aspects as well as social conditions for sharing data connection with others. Findings: The research shows that although energy, bandwidth and security are important technical challenges, users are mainly concerned about social aspects, such as with whom the connection will be shared, rather than monetary issues. Mobile tethering is a viable cooperative service, only when users are familiar with the person with whom the data connection is being shared. Research limitations/implications In the technical evaluation of the mobile tethering application, only Android operating systems are being used. Other operating systems (e.g. iOS) may perform differently. Moreover, only a small fraction of smartphones and tablets has been tested. Practical implications: Service providers tend to block mobile tethering technology, as they do not have control and do not expect to gain revenues. However, service providers have the abilities to satisfy the security and privacy concerns of the users and can create secure femtocells for their customers. Social implications: Mobile tethering performance results indicate that more people can access the Internet while they are mobile even if they do not have cellular data subscription. More Internet-based services can be offered to people while they roam in other countries. Originality/value: For technology developers, both the key technical issues and the concerns of the consumers are highlighted. Future applications must contain reliable security and privacy protocols in their design. Moreover, the significance of the social networks is shown in the decision-making of the use of mobile tethering, especially with respect to the credit exchange. Close doi:10.1108/info-05-2013-0033 Close
	Islam, T., Yongchang Hu, Onur, E., Boltjes, B., de Jongh, J.F.C.M. Realistic simulation of IEEE 802.11p channel in mobile Vehicle to Vehicle communication Inproceedings Proc. of the IEEE Conference on Microwave Techniques (COMITE), pp. 156-161, 2013. Abstract \| Links \| BibTeX @inproceedings{Islam2013, title = {Realistic simulation of IEEE 802.11p channel in mobile Vehicle to Vehicle communication}, author = {Islam, T. and Yongchang Hu and Onur, E. and Boltjes, B. and de Jongh, J.F.C.M.}, doi = {10.1109/COMITE.2013.6545061}, year = {2013}, date = {2013-04-01}, booktitle = {Proc. of the IEEE Conference on Microwave Techniques (COMITE)}, pages = {156-161}, abstract = {Intelligent Transportation Systems (ITS) is becoming an important paradigm, because of its ability to enhance safety and to mitigate congestion on road traffic scenarios. Realizing the fact that data collection scheme from in-situ test beds for large number of vehicles is always expensive and time consuming, before being employed in large scale, such safety critical system should be tested narrowing down the gap between real circumstances and analytical models in a simulation platform. It is evident that underlying radio wave propagation models can comprise the validity of large scale vehicular network simulation results. Vehicle-to-Vehicle (V2V) channels have higher dynamics due to rapidly varying topologies and environments which have significant impact on performance study of upper layer protocols and applications. In spite of the fact that few measurement based empirical channel models are present in the literature, they are not tested for large scale vehicular networks. In this study, we simulate suburban scenarios with hundreds of IEEE802.11p nodes in the OPNET simulation environment with more realistic channel models. The standard OPNET propagation model was replaced by Nakagami-m fading channel. For the sake of modeling, changing relative velocity attribute and separation distance, power spectrum and fading parameter-m were defined as function of velocity and separation distance respectively. Then statistics were collected to evaluate performance of physical and higher layers. Primarily we have found all the vehicles within the standard requirement for Dedicated Short Range Communications (DSRC) range of 1 kilometer may not receive packets, which was also found in several earlier publications.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Intelligent Transportation Systems (ITS) is becoming an important paradigm, because of its ability to enhance safety and to mitigate congestion on road traffic scenarios. Realizing the fact that data collection scheme from in-situ test beds for large number of vehicles is always expensive and time consuming, before being employed in large scale, such safety critical system should be tested narrowing down the gap between real circumstances and analytical models in a simulation platform. It is evident that underlying radio wave propagation models can comprise the validity of large scale vehicular network simulation results. Vehicle-to-Vehicle (V2V) channels have higher dynamics due to rapidly varying topologies and environments which have significant impact on performance study of upper layer protocols and applications. In spite of the fact that few measurement based empirical channel models are present in the literature, they are not tested for large scale vehicular networks. In this study, we simulate suburban scenarios with hundreds of IEEE802.11p nodes in the OPNET simulation environment with more realistic channel models. The standard OPNET propagation model was replaced by Nakagami-m fading channel. For the sake of modeling, changing relative velocity attribute and separation distance, power spectrum and fading parameter-m were defined as function of velocity and separation distance respectively. Then statistics were collected to evaluate performance of physical and higher layers. Primarily we have found all the vehicles within the standard requirement for Dedicated Short Range Communications (DSRC) range of 1 kilometer may not receive packets, which was also found in several earlier publications. Close doi:10.1109/COMITE.2013.6545061 Close
	Huaizhou, Shi, Venkatesha, R, Onur, Ertan, Niemegeers, Ignas Fairness in wireless networks: Issues, measures and challenges Journal Article IEEE Communications Surveys &amp;amp; Tutorials, 16 (1), pp. 5–24, 2013, ISSN: 1553-877X. Abstract \| Links \| BibTeX @article{huaizhou2013fairness, title = {Fairness in wireless networks: Issues, measures and challenges}, author = {Huaizhou, Shi and Venkatesha, R and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/SURV.2013.050113.00015}, issn = {1553-877X}, year = {2013}, date = {2013-01-01}, journal = {IEEE Communications Surveys &amp;amp; Tutorials}, volume = {16}, number = {1}, pages = {5--24}, abstract = {The pervasiveness of wireless technology has indeed created massive opportunity to integrate almost everything into the Internet fabric. This can be seen with the advent of Internet of Things and Cyber Physical Systems, which involves cooperation of massive number of intelligent devices to provide intelligent services. Fairness amongst these devices is an important issue that can be analysed from several dimensions, e.g., energy usage, achieving required quality of services, spectrum sharing, and so on. This article focusses on these viewpoints while looking at fairness research. To generalize, mainly wireless networks are considered. First, we present a general view of fairness studies, and pose three core questions that help us delineate the nuances in defining fairness. Then, the existing fairness models are summarized and compared. We also look into the major fairness research domains in wireless networks such as fair energy consumption control, power control, topology control, link and flow scheduling, channel assignment, rate allocation, congestion control and routing protocols. We make a distinction amongst fairness, utility and resource allocation to begin with. Later, we present their inter-relation. At the end of this article, we list the common properties of fairness and give an example of fairness management. Several open research challenges that point to further work on fairness in wireless networks are also discussed. Indeed, the research on fairness is entangled with many other aspects such as performance, utility, optimization and throughput at the network and node levels. While consolidating the contributions in the literature, this article tries to explain the niceties of all these aspects in the domain of wireless networking.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close The pervasiveness of wireless technology has indeed created massive opportunity to integrate almost everything into the Internet fabric. This can be seen with the advent of Internet of Things and Cyber Physical Systems, which involves cooperation of massive number of intelligent devices to provide intelligent services. Fairness amongst these devices is an important issue that can be analysed from several dimensions, e.g., energy usage, achieving required quality of services, spectrum sharing, and so on. This article focusses on these viewpoints while looking at fairness research. To generalize, mainly wireless networks are considered. First, we present a general view of fairness studies, and pose three core questions that help us delineate the nuances in defining fairness. Then, the existing fairness models are summarized and compared. We also look into the major fairness research domains in wireless networks such as fair energy consumption control, power control, topology control, link and flow scheduling, channel assignment, rate allocation, congestion control and routing protocols. We make a distinction amongst fairness, utility and resource allocation to begin with. Later, we present their inter-relation. At the end of this article, we list the common properties of fairness and give an example of fairness management. Several open research challenges that point to further work on fairness in wireless networks are also discussed. Indeed, the research on fairness is entangled with many other aspects such as performance, utility, optimization and throughput at the network and node levels. While consolidating the contributions in the literature, this article tries to explain the niceties of all these aspects in the domain of wireless networking. Close doi:10.1109/SURV.2013.050113.00015 Close
	Khatibi, Arash, Durmus, Yunus, Onur, Ertan, Niemegeers, Ignas Event-Driven MAC Protocol for Dual-Radio Cooperation Inproceedings Proc. of the IEEE Vehicular Technology Conference (VTC Fall), pp. 1-5, 2012, ISSN: 1090-3038. Abstract \| Links \| BibTeX @inproceedings{khatibi2012, title = {Event-Driven MAC Protocol for Dual-Radio Cooperation}, author = {Khatibi, Arash and Durmus, Yunus and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/VTCFall.2012.6399143}, issn = {1090-3038}, year = {2012}, date = {2012-09-01}, booktitle = {Proc. of the IEEE Vehicular Technology Conference (VTC Fall)}, pages = {1-5}, abstract = {One of the sources of the energy waste in wireless sensor networks is idle listening, the time in which a node monitors the free channel. In applications where the events occur sporadically, energy consumption due to idle listening can be further reduced by dual-radio cooperation. In dual- radio cooperation, nodes in the network have two stacks. One stack makes use of a low-power wake-up radio for event-driven communication over the main radio. The other stack may employ any sensor networking medium access control protocol only over the main radio. One of the two stacks can be dynamically operational depending on the rate of the events or the packet arrival rate. When the event rate becomes small, the event-driven stack takes over the operation. If the event rate increases, it could be more efficient to operate the legacy single radio stack. In this paper, we investigate the performance of the dual-radio cooperation in wireless sensor networks. A medium access control protocol is proposed for the dual- radio cooperation to maximize the energy efficiency of the wireless network. We define the critical event rate as the event rate threshold above which the single-radio stack performs better than the dual- radio stack. We analyzed and validated the critical event rate by simulations. We show that 70-97% energy conservation is possible by employing the dual-radio cooperation.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close One of the sources of the energy waste in wireless sensor networks is idle listening, the time in which a node monitors the free channel. In applications where the events occur sporadically, energy consumption due to idle listening can be further reduced by dual-radio cooperation. In dual- radio cooperation, nodes in the network have two stacks. One stack makes use of a low-power wake-up radio for event-driven communication over the main radio. The other stack may employ any sensor networking medium access control protocol only over the main radio. One of the two stacks can be dynamically operational depending on the rate of the events or the packet arrival rate. When the event rate becomes small, the event-driven stack takes over the operation. If the event rate increases, it could be more efficient to operate the legacy single radio stack. In this paper, we investigate the performance of the dual-radio cooperation in wireless sensor networks. A medium access control protocol is proposed for the dual- radio cooperation to maximize the energy efficiency of the wireless network. We define the critical event rate as the event rate threshold above which the single-radio stack performs better than the dual- radio stack. We analyzed and validated the critical event rate by simulations. We show that 70-97% energy conservation is possible by employing the dual-radio cooperation. Close doi:10.1109/VTCFall.2012.6399143 Close
	Durmus, Yunus, Onur, Ertan Imitation as the simplest strategy for cooperation Inproceedings Proc. of the IEEE 23rd International Symposium on Personal Indoor and Mobile Radio Communications, pp. 863-869, 2012, ISSN: 2166-9570. Abstract \| Links \| BibTeX @inproceedings{6362905, title = {Imitation as the simplest strategy for cooperation}, author = {Durmus, Yunus and Onur, Ertan}, doi = {10.1109/PIMRC.2012.6362905}, issn = {2166-9570}, year = {2012}, date = {2012-09-01}, booktitle = {Proc. of the IEEE 23rd International Symposium on Personal Indoor and Mobile Radio Communications}, pages = {863-869}, abstract = {Ad hoc networks comprise independent cooperative nodes which work together to constitute a system having a value greater than the sum of the values of the individual components. The nodes cooperate to gain access to the medium or to establish a messaging infrastructure by relaying foreign packets. However, when nodes in an ad hoc network operate autonomously without a central authority, they tend to defect, e.g., do not forward each other's packets following the game theoretic analysis. External mechanisms may preserve and enforce cooperation in network in return of additional operational costs or security overheads. However, low power devices may lack computational power that is required to implement the system. Recent works in evolutionary game theory have shown that cooperation may survive in a lattice structured biological network without any enforcement. The spatial structure of the network may allow the survival of the cooperative nodes when they imitate the dominant surrounding strategy. Imitating strategy helps low power devices adapt dynamically to the environment rather than giving deterministic and static decisions. In this work, we apply the imitation strategy to ad hoc networks which have geometric random network structure different from the lattice structured networks. Simulations show that simple imitation strategy allows cooperation to be spread over the network.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Ad hoc networks comprise independent cooperative nodes which work together to constitute a system having a value greater than the sum of the values of the individual components. The nodes cooperate to gain access to the medium or to establish a messaging infrastructure by relaying foreign packets. However, when nodes in an ad hoc network operate autonomously without a central authority, they tend to defect, e.g., do not forward each other's packets following the game theoretic analysis. External mechanisms may preserve and enforce cooperation in network in return of additional operational costs or security overheads. However, low power devices may lack computational power that is required to implement the system. Recent works in evolutionary game theory have shown that cooperation may survive in a lattice structured biological network without any enforcement. The spatial structure of the network may allow the survival of the cooperative nodes when they imitate the dominant surrounding strategy. Imitating strategy helps low power devices adapt dynamically to the environment rather than giving deterministic and static decisions. In this work, we apply the imitation strategy to ad hoc networks which have geometric random network structure different from the lattice structured networks. Simulations show that simple imitation strategy allows cooperation to be spread over the network. Close doi:10.1109/PIMRC.2012.6362905 Close
	Zhou, Jinglong, Jacobsson, Martin, Onur, Ertan, Niemegeers, Ignas An investigation of link quality assessment for mobile multi-hop and multi-rate wireless networks Journal Article Wireless personal communications, 65 (2), pp. 405–423, 2012, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{zhou2012investigation, title = {An investigation of link quality assessment for mobile multi-hop and multi-rate wireless networks}, author = {Zhou, Jinglong and Jacobsson, Martin and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1007/s11277-011-0263-1}, issn = {0929-6212}, year = {2012}, date = {2012-01-01}, journal = {Wireless personal communications}, volume = {65}, number = {2}, pages = {405--423}, publisher = {Springer US}, abstract = {Wireless ad hoc networks will be an important component in future communication systems. The performance of wireless ad hoc networks can be improved by link quality-aware applications. Wireless link quality is dynamic in nature, especially in mobile scenarios. Therefore, accurate and fast packet delivery ratio estimation is a prerequisite to good performance in mobile, multi-hop and multi-rate wireless ad hoc networks. In this paper, we propose a novel packet delivery ratio estimation method that improves the accuracy and responsiveness of the packet delivery ratio estimation. The proposed link quality estimation components are implemented in a IEEE 802.11b/g test-bed. The experiment results show that the accuracy of the packet delivery ratio estimation can improve up to 50% in mobile scenarios without introducing overhead. We also show the end-to-end performance impact of this improved estimation on route selection using different routing metrics and configurations. The measurement results show that our packet delivery ratio method leads to better route selection in the form of increased end-to-end throughput compared to traditional methods, which respond slowly to the link dynamics.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Wireless ad hoc networks will be an important component in future communication systems. The performance of wireless ad hoc networks can be improved by link quality-aware applications. Wireless link quality is dynamic in nature, especially in mobile scenarios. Therefore, accurate and fast packet delivery ratio estimation is a prerequisite to good performance in mobile, multi-hop and multi-rate wireless ad hoc networks. In this paper, we propose a novel packet delivery ratio estimation method that improves the accuracy and responsiveness of the packet delivery ratio estimation. The proposed link quality estimation components are implemented in a IEEE 802.11b/g test-bed. The experiment results show that the accuracy of the packet delivery ratio estimation can improve up to 50% in mobile scenarios without introducing overhead. We also show the end-to-end performance impact of this improved estimation on route selection using different routing metrics and configurations. The measurement results show that our packet delivery ratio method leads to better route selection in the form of increased end-to-end throughput compared to traditional methods, which respond slowly to the link dynamics. Close doi:10.1007/s11277-011-0263-1 Close
	Onur, Ertan, Durmus, Yunus, Niemegeers, Ignas Cooperative density estimation in random wireless ad hoc networks Journal Article IEEE Communications Letters, 16 (3), pp. 331–333, 2012, ISSN: 1089-7798. Abstract \| Links \| BibTeX @article{onur2012cooperative, title = {Cooperative density estimation in random wireless ad hoc networks}, author = {Onur, Ertan and Durmus, Yunus and Niemegeers, Ignas}, doi = {10.1109/LCOMM.2012.011312.112140}, issn = {1089-7798}, year = {2012}, date = {2012-01-01}, journal = {IEEE Communications Letters}, volume = {16}, number = {3}, pages = {331--333}, publisher = {IEEE}, abstract = {Density estimation is crucial for wireless ad hoc networks for adequate capacity planning. Protocols have to adapt their operation to the density since the throughput in an ad hoc network approaches asymptotically to zero as the density increases. A wireless node can estimate the global density by using local information such as the received power from neighbors. In this paper, we propose a cross layer protocol to compute the density estimate. The accuracy of the estimate can be enhanced and its variance can be reduced through cooperation among the nodes. Nodes share the received power measurements with each other. Based on the collected observations, the maximum likelihood estimate is computed. It is shown that cooperative density estimation has better accuracy with less variance than the individual estimation. When nodes share received power measurements from further away neighbors, the variance of the estimate is further reduced.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Density estimation is crucial for wireless ad hoc networks for adequate capacity planning. Protocols have to adapt their operation to the density since the throughput in an ad hoc network approaches asymptotically to zero as the density increases. A wireless node can estimate the global density by using local information such as the received power from neighbors. In this paper, we propose a cross layer protocol to compute the density estimate. The accuracy of the estimate can be enhanced and its variance can be reduced through cooperation among the nodes. Nodes share the received power measurements with each other. Based on the collected observations, the maximum likelihood estimate is computed. It is shown that cooperative density estimation has better accuracy with less variance than the individual estimation. When nodes share received power measurements from further away neighbors, the variance of the estimate is further reduced. Close doi:10.1109/LCOMM.2012.011312.112140 Close
	Genc, Zulkuf, Thillo, WV, Bourdoux, Andre, Onur, Ertan 60 GHz PHY performance evaluation with 3D ray tracing under human shadowing Journal Article IEEE Wireless Communications Letters, 1 (2), pp. 117–120, 2012, ISSN: 2162-2337. Abstract \| Links \| BibTeX @article{genc201260, title = {60 GHz PHY performance evaluation with 3D ray tracing under human shadowing}, author = {Genc, Zulkuf and Thillo, WV and Bourdoux, Andre and Onur, Ertan}, doi = {10.1109/WCL.2012.022012.120033}, issn = {2162-2337}, year = {2012}, date = {2012-01-01}, journal = {IEEE Wireless Communications Letters}, volume = {1}, number = {2}, pages = {117--120}, publisher = {IEEE}, abstract = {This work evaluates the system-level performance of 60 GHz channels by simulating a realistic living room scenario with various numbers of humans and three different antenna configurations. In the first step, a comprehensive ray tracing study with a 3D ray tracing tool is performed to determine the channel impulse responses. Feeding our PHY simulator with the collected channel responses, the performance figures are generated over received SNR. It was observed that for a satisfactory BER performance, a directional antenna with the minimum of 10 dB antenna gain should be used at least in the receiver side when there is human shadowing in the environment.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close This work evaluates the system-level performance of 60 GHz channels by simulating a realistic living room scenario with various numbers of humans and three different antenna configurations. In the first step, a comprehensive ray tracing study with a 3D ray tracing tool is performed to determine the channel impulse responses. Feeding our PHY simulator with the collected channel responses, the performance figures are generated over received SNR. It was observed that for a satisfactory BER performance, a directional antenna with the minimum of 10 dB antenna gain should be used at least in the receiver side when there is human shadowing in the environment. Close doi:10.1109/WCL.2012.022012.120033 Close
	Constantinescu, Mihai Marius, Onur, Ertan, Bouwman, Harry, Djurica, Miodrag, De Reuver, Mark, Durmus, Yunus Cooperative Networks: The Mobile Tethering Game Inproceedings Proc. of the Seventh ACM International Workshop on Mobility in the Evolving Internet Architecture, pp. 41–42, ACM, Istanbul, Turkey, 2012, ISBN: 978-1-4503-1526-5. Abstract \| Links \| BibTeX @inproceedings{Constantinescu2012, title = {Cooperative Networks: The Mobile Tethering Game}, author = {Constantinescu, Mihai Marius and Onur, Ertan and Bouwman, Harry and Djurica, Miodrag and De Reuver, Mark and Durmus, Yunus}, doi = {10.1145/2348676.2348687}, isbn = {978-1-4503-1526-5}, year = {2012}, date = {2012-01-01}, booktitle = {Proc. of the Seventh ACM International Workshop on Mobility in the Evolving Internet Architecture}, pages = {41--42}, publisher = {ACM}, address = {Istanbul, Turkey}, series = {MobiArch '12}, abstract = {We propose an analysis of cooperation for data sharing and the behavioral aspects involved in the process of decision making. Starting with the tethering capabilities of recent devices we apply game theoretical principles and models, inquire what makes the cooperation work, and what are the economical implications required to build a cooperative network. Aggregating the game theory with the results of the market inquiry of a questionnaire and with a developed android application, will give us an idea of why and how people share.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close We propose an analysis of cooperation for data sharing and the behavioral aspects involved in the process of decision making. Starting with the tethering capabilities of recent devices we apply game theoretical principles and models, inquire what makes the cooperation work, and what are the economical implications required to build a cooperative network. Aggregating the game theory with the results of the market inquiry of a questionnaire and with a developed android application, will give us an idea of why and how people share. Close doi:10.1145/2348676.2348687 Close
	Venkatesha Prasad, Ranga Rao, Onur, Ertan, Durmus, Yunus, Biswas, Abdurrahim, Niemegeers, Ignas Approximate service provisioning in an invisible network of the future Miscellaneous 27th Meeting of Wireless World Research Forum, 2011. BibTeX @misc{PrasadWWRF, title = {Approximate service provisioning in an invisible network of the future}, author = {Venkatesha Prasad, Ranga Rao and Onur, Ertan and Durmus, Yunus and Biswas, Abdurrahim and Niemegeers, Ignas}, year = {2011}, date = {2011-11-01}, howpublished = {27th Meeting of Wireless World Research Forum}, keywords = {}, pubstate = {published}, tppubtype = {misc} } Close
	Onur, Ertan, Durmus, Yunus, Hawas, Mohamed Gamal, de Groot, Sonia Marcela Heemstra, Niemegeers, Ignas GMM Collaborative and cognitive network platforms: Vision and research challenges Journal Article Wireless Personal Communications, 58 (1), pp. 71–93, 2011, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{onur2011collaborative, title = {Collaborative and cognitive network platforms: Vision and research challenges}, author = {Onur, Ertan and Durmus, Yunus and Hawas, Mohamed Gamal and de Groot, Sonia Marcela Heemstra and Niemegeers, Ignas GMM}, doi = {10.1007/s11277-011-0289-4}, issn = {0929-6212}, year = {2011}, date = {2011-01-01}, journal = {Wireless Personal Communications}, volume = {58}, number = {1}, pages = {71--93}, publisher = {Springer US}, abstract = {In this paper, we present a visionary concept referred to as Collaborative and Cognitive Network Platforms (CCNPs) as a future-proof solution for creating a dependable, self-organizing and self-managing communication substrate for effective ICT solutions to societal problems. CCNP creates a cooperative communication platform to support critical services across a range of business sectors. CCNP is based on the personal network (PN) technology which is an inherently cooperative environment prototyped in the Dutch Freeband PNP2008 and the European Union IST MAGNET projects. In CCNP, the cognitive control plane strives to exploit the resources to better satisfy the requirements of networked applications. CCNP facilitates collaboration inherently. Through cognition in the cognitive control plane, CCNP becomes a self-managed substrate. The self-managed substrate, in this paper, is defined as cognitive and collaborative middleware on which future applications run without user intervention. Endemic sensor networks may be incorporated into the CCNP concept to feed its cognitive control plane. In this paper, we present the CCNP concept and discuss the research challenges related to collaboration and cognition.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close In this paper, we present a visionary concept referred to as Collaborative and Cognitive Network Platforms (CCNPs) as a future-proof solution for creating a dependable, self-organizing and self-managing communication substrate for effective ICT solutions to societal problems. CCNP creates a cooperative communication platform to support critical services across a range of business sectors. CCNP is based on the personal network (PN) technology which is an inherently cooperative environment prototyped in the Dutch Freeband PNP2008 and the European Union IST MAGNET projects. In CCNP, the cognitive control plane strives to exploit the resources to better satisfy the requirements of networked applications. CCNP facilitates collaboration inherently. Through cognition in the cognitive control plane, CCNP becomes a self-managed substrate. The self-managed substrate, in this paper, is defined as cognitive and collaborative middleware on which future applications run without user intervention. Endemic sensor networks may be incorporated into the CCNP concept to feed its cognitive control plane. In this paper, we present the CCNP concept and discuss the research challenges related to collaboration and cognition. Close doi:10.1007/s11277-011-0289-4 Close
	Kosar, Rabun, Bojaxhiu, Ilir, Onur, Ertan, Ersoy, Cem Lifetime extension for surveillance wireless sensor networks with intelligent redeployment Journal Article Journal of network and computer applications, 34 (6), pp. 1784–1793, 2011, ISSN: 1068-9605. Abstract \| Links \| BibTeX @article{kosar2011lifetime, title = {Lifetime extension for surveillance wireless sensor networks with intelligent redeployment}, author = {Kosar, Rabun and Bojaxhiu, Ilir and Onur, Ertan and Ersoy, Cem}, doi = {10.1016/j.jnca.2010.12.010}, issn = {1068-9605}, year = {2011}, date = {2011-01-01}, journal = {Journal of network and computer applications}, volume = {34}, number = {6}, pages = {1784--1793}, publisher = {Academic Press}, abstract = {For wireless sensor networks (WSNs), uneven energy consumption is a major problem. A direct consequence of this is the energy hole problem, formation of sensing voids within the network field due to battery depleted sensors in the corresponding region. Hole formations are inherent in the network topology, yet it is possible to develop strategies to delay the hole formations to later stages of the network operation and essentially extend the network lifetime without sensing quality loss. In this work, we initially propose and analyze an approach that can be used to mitigate the hole problem. The approach is presented in detail and the effects on the sustained surveillance quality are presented. The results are based on simulations with different network configurations with realistic sensor models, MAC and routing protocols. By using the proposed approach, sustaining a sensing quality above a given threshold and more than doubling the network lifetime are possible. The results clearly indicate the suitability of the approach for especially demanding WSNs such as the ones used for border surveillance tasks.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close For wireless sensor networks (WSNs), uneven energy consumption is a major problem. A direct consequence of this is the energy hole problem, formation of sensing voids within the network field due to battery depleted sensors in the corresponding region. Hole formations are inherent in the network topology, yet it is possible to develop strategies to delay the hole formations to later stages of the network operation and essentially extend the network lifetime without sensing quality loss. In this work, we initially propose and analyze an approach that can be used to mitigate the hole problem. The approach is presented in detail and the effects on the sustained surveillance quality are presented. The results are based on simulations with different network configurations with realistic sensor models, MAC and routing protocols. By using the proposed approach, sustaining a sensing quality above a given threshold and more than doubling the network lifetime are possible. The results clearly indicate the suitability of the approach for especially demanding WSNs such as the ones used for border surveillance tasks. Close doi:10.1016/j.jnca.2010.12.010 Close
	Vazifehdan, Javad, Prasad, R Venkatesha, Onur, Ertan, Niemegeers, Ignas Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies Journal Article Computer Networks, 55 (15), pp. 3256–3274, 2011, ISSN: 1389-1286. Abstract \| Links \| BibTeX @article{vazifehdan2011energy, title = {Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies}, author = {Vazifehdan, Javad and Prasad, R Venkatesha and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1016/j.comnet.2011.06.015}, issn = {1389-1286}, year = {2011}, date = {2011-01-01}, journal = {Computer Networks}, volume = {55}, number = {15}, pages = {3256--3274}, publisher = {Elsevier}, abstract = {Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into a framework in which the route selection is formulated as a bi-criteria decision making problem. Minimizing the energy cost for end-to-end packet transfer and minimizing the hop count are the two criteria in this framework. Various algorithms that we propose differ in the way they define the energy cost for end-to-end packet traversal or the way they solve the bi-criteria decision making problem. Some of them consider the energy consumed to transmit and receive packets, while others also consider the residual battery energy of battery-enabled nodes. The proposed algorithms use either the weighted sum approach or the lexicographic method to solve the bi-criteria decision making problem. We evaluate the performance of our algorithms in static and mobile ad hoc networks, and in networks with and without transmission power control. Through extensive simulations we show that our algorithms can significantly enhance the lifetime of battery-powered nodes while the hop count is kept close to its optimal value. We also discuss the scenarios and conditions in which each algorithm could be suitably deployed.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into a framework in which the route selection is formulated as a bi-criteria decision making problem. Minimizing the energy cost for end-to-end packet transfer and minimizing the hop count are the two criteria in this framework. Various algorithms that we propose differ in the way they define the energy cost for end-to-end packet traversal or the way they solve the bi-criteria decision making problem. Some of them consider the energy consumed to transmit and receive packets, while others also consider the residual battery energy of battery-enabled nodes. The proposed algorithms use either the weighted sum approach or the lexicographic method to solve the bi-criteria decision making problem. We evaluate the performance of our algorithms in static and mobile ad hoc networks, and in networks with and without transmission power control. Through extensive simulations we show that our algorithms can significantly enhance the lifetime of battery-powered nodes while the hop count is kept close to its optimal value. We also discuss the scenarios and conditions in which each algorithm could be suitably deployed. Close doi:10.1016/j.comnet.2011.06.015 Close
	Olcer, Gencay Mutlu, Genc, Zulkuf, Onur, Ertan Smart neighbor scanning with directional antennas in 60 GHz indoor networks Inproceedings Proc. of the IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), pp. 2393-2398, 2010. Abstract \| Links \| BibTeX @inproceedings{Olcer2010, title = {Smart neighbor scanning with directional antennas in 60 GHz indoor networks}, author = {Olcer, Gencay Mutlu and Genc, Zulkuf and Onur, Ertan}, doi = {10.1109/PIMRC.2010.5671720}, year = {2010}, date = {2010-09-01}, booktitle = {Proc. of the IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC)}, pages = {2393-2398}, abstract = {The 60 GHz technology has an immense potential to provide wireless communication at multi-gigabit rates. At 60 GHz frequency band, severe attenuation of the signals can significantly degrade communication performance. To cope with the attenuation problem, directional antennas with high directive gains can be utilized. When network nodes use directional antennas, the neighbor discovery process becomes more complicated and time consuming. To reduce the neighbor discovery time, we propose a smart neighbor scanning algorithm in this paper. It is observed that the proposed strategy discovers 70% of the links 81% faster and 90% of the links 15% faster than random scanning strategy.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close The 60 GHz technology has an immense potential to provide wireless communication at multi-gigabit rates. At 60 GHz frequency band, severe attenuation of the signals can significantly degrade communication performance. To cope with the attenuation problem, directional antennas with high directive gains can be utilized. When network nodes use directional antennas, the neighbor discovery process becomes more complicated and time consuming. To reduce the neighbor discovery time, we propose a smart neighbor scanning algorithm in this paper. It is observed that the proposed strategy discovers 70% of the links 81% faster and 90% of the links 15% faster than random scanning strategy. Close doi:10.1109/PIMRC.2010.5671720 Close
	Vazifehdan, Javad, Venkatesha Prasad, Ranga Rao, Onur, Ertan, Niemegeers, Ignas Energy-aware routing in wireless ad hoc networks with mains-powered nodes Inproceedings Future Network and Mobile Summit, 2010, pp. 1-12, 2010. Abstract \| BibTeX @inproceedings{5722377, title = {Energy-aware routing in wireless ad hoc networks with mains-powered nodes}, author = {Vazifehdan, Javad and Venkatesha Prasad, Ranga Rao and Onur, Ertan and Niemegeers, Ignas}, year = {2010}, date = {2010-06-01}, booktitle = {Future Network and Mobile Summit, 2010}, pages = {1-12}, abstract = {Energy-aware routing is an effective way to prolong the lifetime of nodes with scarce battery power in ad hoc networks. The proposed energy-aware routing schemes so far do not consider the energy supply of nodes in route selection. They only consider the residual battery capacity of nodes. This paper proposes energy-aware routing algorithms for ad hoc networks with both battery-powered and mains-powered nodes. The proposed algorithms direct the traffic load to mains-powered nodes to avoid using battery-powered nodes as relay. By tuning some tunable coefficients, these algorithms can provide a trade-off between the operational lifetime of the network and the hop count of the selected routes. We compare the performance of the proposed algorithms with other algorithms which do not differentiate explicitly between mains-powered and battery-powered nodes. We show that when most of the nodes in the network are mains-powered, the use of only the type of power supply of nodes in route selection results in a higher network lifetime compared to using the residual battery capacity of nodes. This implies that in such cases, the routing overhead can be reduced, since there is no need to repeatedly propagate the residual battery capacity of nodes (as needed in so-far proposed energy-aware routing algorithms), while even the network lifetime increases.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Energy-aware routing is an effective way to prolong the lifetime of nodes with scarce battery power in ad hoc networks. The proposed energy-aware routing schemes so far do not consider the energy supply of nodes in route selection. They only consider the residual battery capacity of nodes. This paper proposes energy-aware routing algorithms for ad hoc networks with both battery-powered and mains-powered nodes. The proposed algorithms direct the traffic load to mains-powered nodes to avoid using battery-powered nodes as relay. By tuning some tunable coefficients, these algorithms can provide a trade-off between the operational lifetime of the network and the hop count of the selected routes. We compare the performance of the proposed algorithms with other algorithms which do not differentiate explicitly between mains-powered and battery-powered nodes. We show that when most of the nodes in the network are mains-powered, the use of only the type of power supply of nodes in route selection results in a higher network lifetime compared to using the residual battery capacity of nodes. This implies that in such cases, the routing overhead can be reduced, since there is no need to repeatedly propagate the residual battery capacity of nodes (as needed in so-far proposed energy-aware routing algorithms), while even the network lifetime increases. Close
	Genc, Zulkuf, Olcer, Gencay Mutlu, Onur, Ertan, Niemegeers, Ignas Improving 60 GHz Indoor Connectivity with Relaying Inproceedings Proc. of the IEEE International Conference on Communications, pp. 1-6, 2010, ISSN: 1550-3607. Abstract \| Links \| BibTeX @inproceedings{5502707, title = {Improving 60 GHz Indoor Connectivity with Relaying}, author = {Genc, Zulkuf and Olcer, Gencay Mutlu and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/ICC.2010.5502707}, issn = {1550-3607}, year = {2010}, date = {2010-05-01}, booktitle = {Proc. of the IEEE International Conference on Communications}, pages = {1-6}, abstract = {The 60 GHz technology has a great potential to provide wireless communication at multi-gigabit rates in future home networks. To maintain the network connectivity with 60 GHz links, which are highly susceptible to propagation and penetration losses, is a major challenge. The quality and the robustness of the 60 GHz links can be improved by employing relay nodes in the network. In this paper, the contribution of relaying to the connectivity and the quality of the 60 GHz radio links is studied by modeling three indoor scenarios. It is analytically and through simulations shown that having a relay node in a 60 GHz network decreases the average freespace path loss 33% in the worst case scenario. The effects of relay device position and the obstacle density on the improvement of the average received signal level are investigated with a verified 3D ray tracing tool. A comparative simulation study on the performance of different relay configurations under various network conditions is conducted. The results yield that even a single relay device positioned at the height of other nodes can improve 50% of the links in considerable levels in a 60 GHz indoor network. It is also shown that additional relay nodes do not contribute to 60 GHz indoor connectivity significantly, if there are two properly positioned relay devices in a network which is moderately populated.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close The 60 GHz technology has a great potential to provide wireless communication at multi-gigabit rates in future home networks. To maintain the network connectivity with 60 GHz links, which are highly susceptible to propagation and penetration losses, is a major challenge. The quality and the robustness of the 60 GHz links can be improved by employing relay nodes in the network. In this paper, the contribution of relaying to the connectivity and the quality of the 60 GHz radio links is studied by modeling three indoor scenarios. It is analytically and through simulations shown that having a relay node in a 60 GHz network decreases the average freespace path loss 33% in the worst case scenario. The effects of relay device position and the obstacle density on the improvement of the average received signal level are investigated with a verified 3D ray tracing tool. A comparative simulation study on the performance of different relay configurations under various network conditions is conducted. The results yield that even a single relay device positioned at the height of other nodes can improve 50% of the links in considerable levels in a 60 GHz indoor network. It is also shown that additional relay nodes do not contribute to 60 GHz indoor connectivity significantly, if there are two properly positioned relay devices in a network which is moderately populated. Close doi:10.1109/ICC.2010.5502707 Close
	Genc, Zulkuf, Rizvi, Umar Hasan, Onur, Ertan, Niemegeers, Ignas Robust 60 GHz Indoor Connectivity: Is It Possible with Reflections? Inproceedings Proc. of the 2010 IEEE 71st Vehicular Technology Conference (VTC 2010-Spring), pp. 1-5, 2010, ISSN: 1550-2252. Abstract \| Links \| BibTeX @inproceedings{5493722, title = {Robust 60 GHz Indoor Connectivity: Is It Possible with Reflections?}, author = {Genc, Zulkuf and Rizvi, Umar Hasan and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/VETECS.2010.5493722}, issn = {1550-2252}, year = {2010}, date = {2010-05-01}, booktitle = {Proc. of the 2010 IEEE 71st Vehicular Technology Conference (VTC 2010-Spring)}, pages = {1-5}, abstract = {In this paper, we investigate the robustness of the 60 GHz connectivity in typical indoor environments by analyzing the outage probability. We define three realistic indoor scenarios which may host the 60 GHz networks in the future and perform simulations with a verified 3D ray tracing tool on them. In the first set of simulations, we show the impact of access unit position on the connectivity. In the next step, we show that increasing the obstacle density linearly decreases the outage probability of the 60 GHz network and this decrease is found to be sharper for certain positions of the access point. In the last step, we demonstrate the direct effect of reflective surface availability on the connectivity. A 60 GHz indoor network relying solely on the reflections in the absence of line-of-sight path is very vulnerable to outages even in moderately populated indoor environments.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close In this paper, we investigate the robustness of the 60 GHz connectivity in typical indoor environments by analyzing the outage probability. We define three realistic indoor scenarios which may host the 60 GHz networks in the future and perform simulations with a verified 3D ray tracing tool on them. In the first set of simulations, we show the impact of access unit position on the connectivity. In the next step, we show that increasing the obstacle density linearly decreases the outage probability of the 60 GHz network and this decrease is found to be sharper for certain positions of the access point. In the last step, we demonstrate the direct effect of reflective surface availability on the connectivity. A 60 GHz indoor network relying solely on the reflections in the absence of line-of-sight path is very vulnerable to outages even in moderately populated indoor environments. Close doi:10.1109/VETECS.2010.5493722 Close
	Vazifehdan, Javad, Onur, Ertan, Niemegeers, Ignas On the resilience of personal networks Inproceedings Proc. of the 2010 5th IEEE International Symposium on Wireless Pervasive Computing (ISWPC), pp. 198-203, 2010. Abstract \| Links \| BibTeX @inproceedings{5483758, title = {On the resilience of personal networks}, author = {Vazifehdan, Javad and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1109/ISWPC.2010.5483758}, year = {2010}, date = {2010-05-01}, booktitle = {Proc. of the 2010 5th IEEE International Symposium on Wireless Pervasive Computing (ISWPC)}, pages = {198-203}, abstract = {A personal network (PN) is a network of devices belonging to a person. It may consist of a number of ad hoc sub-networks, referred to as clusters. Clusters of a PN could be linked together through the Internet. In this paper, we study the resilience of clusters in a PN, when nodes fail due to battery depletion. A cluster is resilient until a given pair of source-destination nodes can communicate in a multi-hop fashion in the presence of failed nodes. The communication between two nodes stops, if either there is no route between them, or one of the two nodes fails. We derive a closed-form expression for the expected duration that a PN cluster remains resilient. The derived expression determines how and to what extend different parameters such as node density, transmission range, network deployment area, packet length and rate, and energy consumption characteristics of the wireless interface can affect this duration. We verify the accuracy of our analysis using simulation.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close A personal network (PN) is a network of devices belonging to a person. It may consist of a number of ad hoc sub-networks, referred to as clusters. Clusters of a PN could be linked together through the Internet. In this paper, we study the resilience of clusters in a PN, when nodes fail due to battery depletion. A cluster is resilient until a given pair of source-destination nodes can communicate in a multi-hop fashion in the presence of failed nodes. The communication between two nodes stops, if either there is no route between them, or one of the two nodes fails. We derive a closed-form expression for the expected duration that a PN cluster remains resilient. The derived expression determines how and to what extend different parameters such as node density, transmission range, network deployment area, packet length and rate, and energy consumption characteristics of the wireless interface can affect this duration. We verify the accuracy of our analysis using simulation. Close doi:10.1109/ISWPC.2010.5483758 Close
	Alvarez, Santiago, Genc, Zulkuf, Onur, Ertan Cognitive engine for neighbor discovery scheduling in 60 GHz home net- works Miscellaneous Proc. of the WIC Symposium on Information Theory in the Benelux, 2010. BibTeX @misc{Alvarez2010, title = {Cognitive engine for neighbor discovery scheduling in 60 GHz home net- works}, author = {Alvarez, Santiago and Genc, Zulkuf and Onur, Ertan}, year = {2010}, date = {2010-05-01}, howpublished = {Proc. of the WIC Symposium on Information Theory in the Benelux}, keywords = {}, pubstate = {published}, tppubtype = {misc} } Close
	Genc, Zulkuf, Rizvi, Umar H, Onur, Ertan, Niemegeers, Ignas Cooperative communications in future home networks Journal Article Wireless personal communications, 53 (3), pp. 349–364, 2010, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{gencc2010cooperative, title = {Cooperative communications in future home networks}, author = {Genc, Zulkuf and Rizvi, Umar H and Onur, Ertan and Niemegeers, Ignas}, doi = {10.1007/s11277-010-9951-5}, issn = {0929-6212}, year = {2010}, date = {2010-01-01}, journal = {Wireless personal communications}, volume = {53}, number = {3}, pages = {349--364}, publisher = {Springer US}, abstract = {The basic idea behind cooperative communications is that mobile terminals collaborate to send data to each other. This effectively adds diversity in the system and improves the overall performance. In this paper, we investigate the potential gains of cooperative communication in future home networks. We derive analytical expressions for the error probability of binary phase shift keying (BPSK) signals over Nakagami-m fading channels in a multi relay communication network. Following to the analytical study, we analyze the contribution of cooperative relaying to the 60GHz network connectivity through simulations using a realistic indoor environment model. We compare the performance of different relay configurations under variable obstacle densities. We show that a typical 60GHz indoor network should employ either a multi-relay configuration or a single-relay configuration with a smart relay selection mechanism to achieve acceptable outage rates. In the use of multiple-relay configuration, both analytical and simulation studies indicate that increasing the number of cooperative relays does not improve the system performance significantly after a certain threshold.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close The basic idea behind cooperative communications is that mobile terminals collaborate to send data to each other. This effectively adds diversity in the system and improves the overall performance. In this paper, we investigate the potential gains of cooperative communication in future home networks. We derive analytical expressions for the error probability of binary phase shift keying (BPSK) signals over Nakagami-m fading channels in a multi relay communication network. Following to the analytical study, we analyze the contribution of cooperative relaying to the 60GHz network connectivity through simulations using a realistic indoor environment model. We compare the performance of different relay configurations under variable obstacle densities. We show that a typical 60GHz indoor network should employ either a multi-relay configuration or a single-relay configuration with a smart relay selection mechanism to achieve acceptable outage rates. In the use of multiple-relay configuration, both analytical and simulation studies indicate that increasing the number of cooperative relays does not improve the system performance significantly after a certain threshold. Close doi:10.1007/s11277-010-9951-5 Close
	Onur, Ertan, Ersoy, Cem, Delic, Hakan, Akarun, Lale Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours Journal Article Computer Networks, 54 (3), pp. 428–441, 2010, ISSN: 1389-1286. Abstract \| Links \| BibTeX @article{onur2010surveillance, title = {Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours}, author = {Onur, Ertan and Ersoy, Cem and Delic, Hakan and Akarun, Lale}, doi = {10.1016/j.comnet.2009.09.006}, issn = {1389-1286}, year = {2010}, date = {2010-01-01}, journal = {Computer Networks}, volume = {54}, number = {3}, pages = {428--441}, publisher = {Elsevier}, abstract = {For surveillance applications of wireless sensor networks, analysis of sensing coverage and quality of sensing is crucial. For rough terrains where obstacles block the sensing capability, region-based approaches must be employed to determine the sensing quality. In this paper, we present a method to determine the breach paths and the deployment quality defined as the minimum of the maximum detection probabilities on the breach paths in the presence of obstacles. We propose the utilization of watershed segmentation on the iso-sensing map that reveals the equally-sensed regions of the field-of-interest in a surveillance application. Probabilistic sensor models are utilized to produce the iso-sensing map considering the sensing coverage degree and reliability level as the design criteria. The watershed segmentation algorithm is applied on the iso-sensing map to identify the possible breach paths. An algorithm is proposed to convert the watershed segmentation to an auxiliary graph which is then employed to determine the deployment quality measure (DQM). The effects of the sensor count and coverage degree on the DQM are analyzed.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close For surveillance applications of wireless sensor networks, analysis of sensing coverage and quality of sensing is crucial. For rough terrains where obstacles block the sensing capability, region-based approaches must be employed to determine the sensing quality. In this paper, we present a method to determine the breach paths and the deployment quality defined as the minimum of the maximum detection probabilities on the breach paths in the presence of obstacles. We propose the utilization of watershed segmentation on the iso-sensing map that reveals the equally-sensed regions of the field-of-interest in a surveillance application. Probabilistic sensor models are utilized to produce the iso-sensing map considering the sensing coverage degree and reliability level as the design criteria. The watershed segmentation algorithm is applied on the iso-sensing map to identify the possible breach paths. An algorithm is proposed to convert the watershed segmentation to an auxiliary graph which is then employed to determine the deployment quality measure (DQM). The effects of the sensor count and coverage degree on the DQM are analyzed. Close doi:10.1016/j.comnet.2009.09.006 Close
	Aguiar, Rui L, Onur, Ertan, Skouby, Knud Erik, Aguayo-Torres, Mari Carmen, Toftegaard, Thomas Skjodeberg Users, Economics, Technology: Unavoidable Interdynamics Journal Article Wireless personal communications, 53 (3), pp. 437–442, 2010, ISSN: 0929-6212. Abstract \| Links \| BibTeX @article{aguiar2010users, title = {Users, Economics, Technology: Unavoidable Interdynamics}, author = {Aguiar, Rui L and Onur, Ertan and Skouby, Knud Erik and Aguayo-Torres, Mari Carmen and Toftegaard, Thomas Skjodeberg}, doi = {10.1007/s11277-010-9956-0}, issn = {0929-6212}, year = {2010}, date = {2010-01-01}, journal = {Wireless personal communications}, volume = {53}, number = {3}, pages = {437--442}, publisher = {Springer US}, abstract = {This paper briefly presents some conclusions of a brainstorming session on the way technology is evolving in ICT. Technology advances have overcome society ability to answer, both in economic and in human aspects. The current design paradigms, of agnostic technology development, need to be reconsidered, and the user needs to be repositioned at the center of future developments.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close This paper briefly presents some conclusions of a brainstorming session on the way technology is evolving in ICT. Technology advances have overcome society ability to answer, both in economic and in human aspects. The current design paradigms, of agnostic technology development, need to be reconsidered, and the user needs to be repositioned at the center of future developments. Close doi:10.1007/s11277-010-9956-0 Close
	Olcer, Gencay Mutlu, Genc, Zulkuf, Onur, Ertan Sector scanning attempts for non-isolation in directional 60 GHz networks Journal Article IEEE Communications Letters, 14 (9), pp. 845–847, 2010, ISSN: 1089-7798. Abstract \| Links \| BibTeX @article{olcer2010sector, title = {Sector scanning attempts for non-isolation in directional 60 GHz networks}, author = {Olcer, Gencay Mutlu and Genc, Zulkuf and Onur, Ertan}, doi = {10.1109/LCOMM.2010.09.100779}, issn = {1089-7798}, year = {2010}, date = {2010-01-01}, journal = {IEEE Communications Letters}, volume = {14}, number = {9}, pages = {845--847}, publisher = {Institute of Electrical and Electronics Engineers, Inc., 3 Park Avenue, 17 th Fl New York NY 10016-5997 USA}, abstract = {Large path losses of millimeter waves restrain the acceptance of 60 GHz technology in future networks. Directional antennas can be exploited in 60 GHz networks to mitigate the detrimental impact of fading. Employing fully directional antennas complicates the neighbor discovery process where each sector must be probed individually to discover neighbors located in that sector. In random scanning strategy, nodes select to-be-scanned sector randomly. In this letter, we analyze the minimum number of random sector scanning attempts during neighbor discovery process to have a non-isolated network. We present an analytical model to study the isolation probability defined as probability of having at least one isolated node in the network. Based on the isolation probability, we derive the minimum number of sector scanning attempts in a 60 GHz ad hoc network with arbitrary number of nodes. Although 60 GHz directional network is studied, this analysis is applicable to any directional wireless network.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Close Large path losses of millimeter waves restrain the acceptance of 60 GHz technology in future networks. Directional antennas can be exploited in 60 GHz networks to mitigate the detrimental impact of fading. Employing fully directional antennas complicates the neighbor discovery process where each sector must be probed individually to discover neighbors located in that sector. In random scanning strategy, nodes select to-be-scanned sector randomly. In this letter, we analyze the minimum number of random sector scanning attempts during neighbor discovery process to have a non-isolated network. We present an analytical model to study the isolation probability defined as probability of having at least one isolated node in the network. Based on the isolation probability, we derive the minimum number of sector scanning attempts in a 60 GHz ad hoc network with arbitrary number of nodes. Although 60 GHz directional network is studied, this analysis is applicable to any directional wireless network. Close doi:10.1109/LCOMM.2010.09.100779 Close
	PN Editing Group, Personal Networks (PNs) - Overview and Standardisation Needs Technical Report Ecma International (tc32-pnf-2010-021), 2010. Abstract \| BibTeX @techreport{EcmaPN, title = {Personal Networks (PNs) - Overview and Standardisation Needs}, author = {PN Editing Group,}, editor = {Ertan Onur}, year = {2010}, date = {2010-01-01}, number = {tc32-pnf-2010-021}, institution = {Ecma International}, abstract = {Personal Networks (PNs) - Overview and standardisation Needs PNs make it easy and secure to interconnect a person''s electronic devices. They enable the usage of personal devices and applications in a completely new way. Imagine users controlling their front door using their mobile phones or seamlessly accessing files stored on their office PC with their personal Internet tablet from home. Today, most users of electronic devices, including mobile phones, struggle with setting up both wired and wireless networking between their devices even though several network technologies, such as WiFi and Bluetooth, are available in most devices. However, there is no reason why it should be like this. We believe that connecting your electronic devices and using them together should be both easy and secure. PNs make secure and ubiquitous communication using personal devices over any network technology a reality by providing automatic configuration of networking and security, and offering users access to their Services across their PNs. PNs can run with existing hardware, including embedded systems, and use any communication technology, such as Ethernet, WiFi, Bluetooth, WiMedia, 3G/LTE, and WiMAX. With PNs, applications and services on people's devices can start to interact with each other allowing for telecommunications, access and synchronization of documents, remote monitoring and control, multimedia, as well as medical applications. It can also connect with wireless sensor networks and cloud-based services. For instance, it becomes possible to build a single personal virtual file system that contains all storage on all a person's devices as well as cloud-based storage.}, keywords = {}, pubstate = {published}, tppubtype = {techreport} } Close Personal Networks (PNs) - Overview and standardisation Needs PNs make it easy and secure to interconnect a person''s electronic devices. They enable the usage of personal devices and applications in a completely new way. Imagine users controlling their front door using their mobile phones or seamlessly accessing files stored on their office PC with their personal Internet tablet from home. Today, most users of electronic devices, including mobile phones, struggle with setting up both wired and wireless networking between their devices even though several network technologies, such as WiFi and Bluetooth, are available in most devices. However, there is no reason why it should be like this. We believe that connecting your electronic devices and using them together should be both easy and secure. PNs make secure and ubiquitous communication using personal devices over any network technology a reality by providing automatic configuration of networking and security, and offering users access to their Services across their PNs. PNs can run with existing hardware, including embedded systems, and use any communication technology, such as Ethernet, WiFi, Bluetooth, WiMedia, 3G/LTE, and WiMAX. With PNs, applications and services on people's devices can start to interact with each other allowing for telecommunications, access and synchronization of documents, remote monitoring and control, multimedia, as well as medical applications. It can also connect with wireless sensor networks and cloud-based services. For instance, it becomes possible to build a single personal virtual file system that contains all storage on all a person's devices as well as cloud-based storage. Close
	Onur, Ertan, Niemegeers, Ignas, Snijders, Fred Duurzaam Draadloos Book Chapter Croes, Roel (Ed.): Duurzame ICT, pp. 83–91, Sdu Uitgevers bv, Den Haag, 2010, ISBN: 978 90 12 5 8 2 2 8 5. Abstract \| BibTeX @inbook{Onur-DuurzameICT, title = {Duurzaam Draadloos}, author = {Onur, Ertan and Niemegeers, Ignas and Snijders, Fred}, editor = {Roel Croes}, isbn = {978 90 12 5 8 2 2 8 5}, year = {2010}, date = {2010-01-01}, booktitle = {Duurzame ICT}, pages = {83--91}, publisher = {Sdu Uitgevers bv, Den Haag}, abstract = {Voorspellingen van het Wireless World Research Forum geven aan dat er rond het jaar 2017 ongeveer 1000 draadloze apparaten per persoon op aarde zullen zijn. Deze apparaten kunnen zeer uiteenlopende kenmerken hebben van zeer eenvoudige sensoren tot gesofistikeerde â€œsmartphonesâ€. Zeker is dat deze apparaten voornamelijk draadloos en mobiel zullen zijn en de voornaamste elementen vormen van het â€œInternet of Thingsâ€. Toekomstige applicaties en diensten die hier gebruik van maken, zijn te vinden in alle geledingen van de maatschappij, in het bijzonder in kritische toepassingen zoals gezondheid en zorg waar veel vitale functies gemeten moeten worden en de betrouwbaarheidseisen hoog zijn. Energie en straling spelen hierbij in toenemende mate een rol en zijn cruciaal voor de betrouwbaarheid van de diensten en de veiligheid van de gebruiker. De rol van de infrastructuur en de daarmee samenhangende energieconsumptie ter ondersteuning van mobiliteit zal sterk toenemen tenzij passende maatregelen worden getroffen in de draadloze systemen. Cruciaal hierbij is beperking van de afstand tussen basisstation en de mobiele terminal bijvoorbeeld door gebruik van femto-cellen als extensie van cellulaire netwerken of van multi-hop netwerkconcepten. Bij de eerste variant gebruikt men het vaste (optische) netwerk voor de bulk van het dataverkeer naar kleine basisstations dicht bij de abonnees en in de tweede variant de tussenkomst van andere mobiele apparaten voor het doorgeven van de boodschappen. In dit hoofdstuk worden de uitdagingen die ons wachten, uitgediept en de mogelijke oplossingsrichtingen voor verduurzaming van mobiele communicatie besproken.}, keywords = {}, pubstate = {published}, tppubtype = {inbook} } Close Voorspellingen van het Wireless World Research Forum geven aan dat er rond het jaar 2017 ongeveer 1000 draadloze apparaten per persoon op aarde zullen zijn. Deze apparaten kunnen zeer uiteenlopende kenmerken hebben van zeer eenvoudige sensoren tot gesofistikeerde â€œsmartphonesâ€. Zeker is dat deze apparaten voornamelijk draadloos en mobiel zullen zijn en de voornaamste elementen vormen van het â€œInternet of Thingsâ€. Toekomstige applicaties en diensten die hier gebruik van maken, zijn te vinden in alle geledingen van de maatschappij, in het bijzonder in kritische toepassingen zoals gezondheid en zorg waar veel vitale functies gemeten moeten worden en de betrouwbaarheidseisen hoog zijn. Energie en straling spelen hierbij in toenemende mate een rol en zijn cruciaal voor de betrouwbaarheid van de diensten en de veiligheid van de gebruiker. De rol van de infrastructuur en de daarmee samenhangende energieconsumptie ter ondersteuning van mobiliteit zal sterk toenemen tenzij passende maatregelen worden getroffen in de draadloze systemen. Cruciaal hierbij is beperking van de afstand tussen basisstation en de mobiele terminal bijvoorbeeld door gebruik van femto-cellen als extensie van cellulaire netwerken of van multi-hop netwerkconcepten. Bij de eerste variant gebruikt men het vaste (optische) netwerk voor de bulk van het dataverkeer naar kleine basisstations dicht bij de abonnees en in de tweede variant de tussenkomst van andere mobiele apparaten voor het doorgeven van de boodschappen. In dit hoofdstuk worden de uitdagingen die ons wachten, uitgediept en de mogelijke oplossingsrichtingen voor verduurzaming van mobiele communicatie besproken. Close
	Onur, Ertan, Sfakianakis, E., Papagianni, C., Karagiannis, G., Kontos, T., Niemegeers, I., Chochliouros, I.P., de Groot, S.H., Sjodin, P., Hidell, M., Cinkler, T., Maliosz, M., Kaklamani, D.I., Carapinha, J., Belesioti, M., Fytros, E. Intelligent End-To-End Resource Virtualization Using Service Oriented Architecture Inproceedings Proc. of the 2009 IEEE GLOBECOM Workshops, pp. 1-6, 2009. Abstract \| Links \| BibTeX @inproceedings{5360701, title = {Intelligent End-To-End Resource Virtualization Using Service Oriented Architecture}, author = {Onur, Ertan and Sfakianakis, E. and Papagianni, C. and Karagiannis, G. and Kontos, T. and Niemegeers, I. and Chochliouros, I.P. and de Groot, S.H. and Sjodin, P. and Hidell, M. and Cinkler, T. and Maliosz, M. and Kaklamani, D.I. and Carapinha, J. and Belesioti, M. and Fytros, E.}, doi = {10.1109/GLOCOMW.2009.5360701}, year = {2009}, date = {2009-11-01}, booktitle = {Proc. of the 2009 IEEE GLOBECOM Workshops}, pages = {1-6}, abstract = {Service-oriented architecture can be considered as a philosophy or paradigm in organizing and utilizing services and capabilities that may be under the control of different ownership domains. Virtualization provides abstraction and isolation of lower level functionalities, enabling portability of higher level functions and sharing of physical resources. However, dynamics, environmental conditions and increasing complexity / heterogeneity of underlying resources call for adaptive resource handling. In this view an intelligent distributed architecture that enables dynamic user management and control on network-wide resource sharing by using the service oriented architecture concept is presented. Additionally, the proposed architecture supports trading of resources that will enable the transformation of traditional business models.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Close Service-oriented architecture can be considered as a philosophy or paradigm in organizing and utilizing services and capabilities that may be under the control of different ownership domains. Virtualization provides abstraction and isolation of lower level functionalities, enabling portability of higher level functions and sharing of physical resources. However, dynamics, environmental conditions and increasing complexity / heterogeneity of underlying resources call for adaptive resource handling. In this view an intelligent distributed architecture that enables dynamic user management and control on network-wide resource sharing by using the service oriented architecture concept is presented. Additionally, the proposed architecture supports trading of resources that will enable the transformation of traditional business models. Close doi:10.1109/GLOCOMW.2009.5360701 Close