NETWORKS
Journal Articles
89.
Berke Tezergil; Ertan Onur
Wireless Backhaul in 5G and Beyond: Issues, Challenges and Opportunities Journal Article
In: IEEE Communications Surveys & Tutorials, vol. 24, no. 4, pp. 2579-2632, 2022.
@article{9873919,
title = {Wireless Backhaul in 5G and Beyond: Issues, Challenges and Opportunities},
author = {Berke Tezergil and Ertan Onur},
doi = {10.1109/COMST.2022.3203578},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
journal = {IEEE Communications Surveys & Tutorials},
volume = {24},
number = {4},
pages = {2579-2632},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
88.
Alperen Eroğlu; Ertan Onur
Revisiting Slotted ALOHA: Density Adaptation in FANETs Journal Article
In: Wireless Personal Communications, pp. 1–30, 2021, ISSN: 0929-6212.
@article{10.1007/s11277-021-09428-6,
title = {Revisiting Slotted ALOHA: Density Adaptation in FANETs},
author = {Alperen Eroğlu and Ertan Onur},
doi = {10.1007/s11277-021-09428-6},
issn = {0929-6212},
year = {2021},
date = {2021-11-30},
urldate = {2021-11-30},
journal = {Wireless Personal Communications},
pages = {1--30},
abstract = {Unmanned aerial vehicles have been widely used in many areas of life. They communicate with each other or infrastructure to provide ubiquitous coverage or assist cellular and sensor networks. They construct flying ad hoc networks. One of the most significant problems in such networks is communication among them over a shared medium. Using random channel access techniques is a useful solution. Another important problem is that the variations in the density of these networks impact the quality of service and introduce many challenges. This paper presents a novel density-aware technique for flying ad hoc networks. We propose Density-aware Slotted ALOHA Protocol that utilizes slotted ALOHA with a dynamic random access probability determined using network density in a distributed fashion. Compared to the literature, this paper concentrates on proposing a three-dimensional, easily traceable model and stabilize the channel utilization performance of slotted ALOHA with an optimized channel access probability to its maximum theoretical level, 1/e, where e is the Euler’s number. Monte-Carlo simulation results validate the proposed approach leveraging aggregate interference density estimator under the simple path-loss model. We compare our protocol with two existing protocols, which are Slotted ALOHA and Stabilized Slotted ALOHA. Comparison results show that the proposed protocol has 36.78% channel utilization performance; on the other hand, the other protocols have 24.74% and 30.32% channel utilization performances, respectively. Considering the stable results and accuracy, this model is practicable in highly dynamic networks even if the network is sparse or dense under higher mobility and reasonable non-uniform deployments.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Unmanned aerial vehicles have been widely used in many areas of life. They communicate with each other or infrastructure to provide ubiquitous coverage or assist cellular and sensor networks. They construct flying ad hoc networks. One of the most significant problems in such networks is communication among them over a shared medium. Using random channel access techniques is a useful solution. Another important problem is that the variations in the density of these networks impact the quality of service and introduce many challenges. This paper presents a novel density-aware technique for flying ad hoc networks. We propose Density-aware Slotted ALOHA Protocol that utilizes slotted ALOHA with a dynamic random access probability determined using network density in a distributed fashion. Compared to the literature, this paper concentrates on proposing a three-dimensional, easily traceable model and stabilize the channel utilization performance of slotted ALOHA with an optimized channel access probability to its maximum theoretical level, 1/e, where e is the Euler’s number. Monte-Carlo simulation results validate the proposed approach leveraging aggregate interference density estimator under the simple path-loss model. We compare our protocol with two existing protocols, which are Slotted ALOHA and Stabilized Slotted ALOHA. Comparison results show that the proposed protocol has 36.78% channel utilization performance; on the other hand, the other protocols have 24.74% and 30.32% channel utilization performances, respectively. Considering the stable results and accuracy, this model is practicable in highly dynamic networks even if the network is sparse or dense under higher mobility and reasonable non-uniform deployments.
87.
Doğanalp Ergenç; Ertan Onur
Plane-separated Routing in Ad-hoc Networks Journal Article Forthcoming
In: Wireless Networks, Forthcoming.
@article{Ergenc21,
title = {Plane-separated Routing in Ad-hoc Networks},
author = {Doğanalp Ergenç and Ertan Onur},
year = {2021},
date = {2021-10-25},
urldate = {2021-10-25},
journal = {Wireless Networks},
keywords = {},
pubstate = {forthcoming},
tppubtype = {article}
}
86.
Levent M Eksert; Hamdullah Yücel; Ertan Onur
Intra- and inter-cluster link scheduling in CUPS-based ad hoc networks Journal Article
In: Computer Networks, vol. 185, pp. 107659, 2021, ISSN: 1389-1286.
@article{EKSERT2021107659,
title = {Intra- and inter-cluster link scheduling in CUPS-based ad hoc networks},
author = {Levent M Eksert and Hamdullah Yücel and Ertan Onur},
url = {https://www.sciencedirect.com/science/article/pii/S1389128620312718},
doi = {10.1016/j.comnet.2020.107659},
issn = {1389-1286},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
journal = {Computer Networks},
volume = {185},
pages = {107659},
abstract = {While control and user (data) plane separation (CUPS) through clustering improves the scalability of ad hoc networks in comparison to flat topologies, it introduces additional challenges for resource scheduling when contention-free medium access is employed. This paper addresses intra- and inter-cluster link scheduling problem in multi-channel ad hoc networks employing CUPS architecture. We first describe the CUPS architecture. Then, we present a novel intra- and inter-cluster link scheduling mechanism over the CUPS architecture. We propose a link scheduling strategy that is responsive to instant communication demands and available resources as a non-linear optimization problem, which is then reduced to a linear form by eliminating non-linearities in order to simplify the problem definition and enhance optimizer performance. The results of the optimizer show that the run time cost of the optimization function drastically increases by the parameter size growth. Therefore, we propose an iterative solution to decrease the running time. The adaptation of the iterative history-based approach makes the solution feasible and ensures near-optimal satisfaction and efficiency.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
While control and user (data) plane separation (CUPS) through clustering improves the scalability of ad hoc networks in comparison to flat topologies, it introduces additional challenges for resource scheduling when contention-free medium access is employed. This paper addresses intra- and inter-cluster link scheduling problem in multi-channel ad hoc networks employing CUPS architecture. We first describe the CUPS architecture. Then, we present a novel intra- and inter-cluster link scheduling mechanism over the CUPS architecture. We propose a link scheduling strategy that is responsive to instant communication demands and available resources as a non-linear optimization problem, which is then reduced to a linear form by eliminating non-linearities in order to simplify the problem definition and enhance optimizer performance. The results of the optimizer show that the run time cost of the optimization function drastically increases by the parameter size growth. Therefore, we propose an iterative solution to decrease the running time. The adaptation of the iterative history-based approach makes the solution feasible and ensures near-optimal satisfaction and efficiency.
85.
Shahram Mollahasani; Alperen Eroğlu; Ilker Demirkol; Ertan Onur
Density-aware mobile networks: Opportunities and challenges Journal Article
In: Computer Networks, vol. 175, pp. 107271, 2020, ISSN: 1389-1286.
@article{MOLLAHASANI2020107271,
title = {Density-aware mobile networks: Opportunities and challenges},
author = {Shahram Mollahasani and Alperen Eroğlu and Ilker Demirkol and Ertan Onur},
url = {http://www.sciencedirect.com/science/article/pii/S1389128619309910},
doi = {https://doi.org/10.1016/j.comnet.2020.107271},
issn = {1389-1286},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
journal = {Computer Networks},
volume = {175},
pages = {107271},
abstract = {We experience a major paradigm shift in mobile networks. The infrastructure of cellular networks is becoming mobile since it is being densified also by using mobile and nomadic small cells to increase coverage and capacity. Furthermore, the innovative approaches such as green operation through sleep scheduling, user-controlled small cells, and dynamic end-to-end slicing will make the network topology and available resources highly dynamic. Therefore, the density of dynamic networks may vary in time and space from sparse to dense or vice versa. This paper advocates that on density-awareness is critical for dynamic mobile networks. Mobile cells, while bringing many benefits, introduce many unconventional challenges that we present in this paper. Novel techniques are needed for adapting network functions, communication protocols, and their parameters to the network density. Especially when cells on wheels or wings are considered, static and man-made configurations will waste valuable resources such as spectrum or energy if the density is not considered as an optimization parameter. In this paper, we evaluate the dynamicity of nomadic cells in density-aware mobile networks in a comprehensive and articulable way. The main challenges we may face by employing dynamic networks and how we can tackle these problems by using a density-oriented approach are discussed in detail. As a key concern in dynamic mobile networks, we treat the density of base stations, which is an indispensable performance parameter. For the applicability of such a parameter we present several potential density estimators. We epochally discuss the impact of density on coverage, interference, mobility management, scalability, capacity, caching, routing protocols, and energy consumption. Our findings illustrate that mobile cells bring more opportunities in addition to some challenges which can be solved, such as adapting mobile networks to base station density.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We experience a major paradigm shift in mobile networks. The infrastructure of cellular networks is becoming mobile since it is being densified also by using mobile and nomadic small cells to increase coverage and capacity. Furthermore, the innovative approaches such as green operation through sleep scheduling, user-controlled small cells, and dynamic end-to-end slicing will make the network topology and available resources highly dynamic. Therefore, the density of dynamic networks may vary in time and space from sparse to dense or vice versa. This paper advocates that on density-awareness is critical for dynamic mobile networks. Mobile cells, while bringing many benefits, introduce many unconventional challenges that we present in this paper. Novel techniques are needed for adapting network functions, communication protocols, and their parameters to the network density. Especially when cells on wheels or wings are considered, static and man-made configurations will waste valuable resources such as spectrum or energy if the density is not considered as an optimization parameter. In this paper, we evaluate the dynamicity of nomadic cells in density-aware mobile networks in a comprehensive and articulable way. The main challenges we may face by employing dynamic networks and how we can tackle these problems by using a density-oriented approach are discussed in detail. As a key concern in dynamic mobile networks, we treat the density of base stations, which is an indispensable performance parameter. For the applicability of such a parameter we present several potential density estimators. We epochally discuss the impact of density on coverage, interference, mobility management, scalability, capacity, caching, routing protocols, and energy consumption. Our findings illustrate that mobile cells bring more opportunities in addition to some challenges which can be solved, such as adapting mobile networks to base station density.
84.
Hüsnü Yıldız; Murat Cenk; Ertan Onur
PLGAKD: A PUF-based Lightweight Group Authentication and Key Distribution Protocol Journal Article
In: IEEE Internet of Things Journal, pp. 1-1, 2020, ISSN: 2327-4662.
@article{9234522,
title = {PLGAKD: A PUF-based Lightweight Group Authentication and Key Distribution Protocol},
author = {Hüsnü Yıldız and Murat Cenk and Ertan Onur},
doi = {10.1109/JIOT.2020.3032757},
issn = {2327-4662},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
journal = {IEEE Internet of Things Journal},
pages = {1-1},
abstract = {Securing Internet of Things (IoT) applications that collect and transport sensitive data by guaranteeing authenticity, integrity, and confidentiality is a critical challenge. Reducing computation and communication overhead of security functions is also a key concern since a large number of constrained devices may take place in such applications. Our main focus in this paper is group authentication and key management in IoT. The existing group authentication and key management protocols in the literature perform computations using asymmetric ciphers, which costly for IoT. Therefore, applications generally employ simple security primitives that are prone to or lead to cyber-attacks by using IoT devices. In this paper, we propose a physically unclonable function (PUF) based lightweight group authentication and key distribution (PLGAKD) protocol that employs PUF, factorial tree, and the Chinese Remainder Theorem (CRT). In PLGAKD, PUF facilitates lightweight authentication and key distribution for group members. Each group member performs 2 encryptions, 1 decryption, 4 XORs operations, and 3 HMAC operations. For the key renewal process, the factorial tree and CRT help us reduce the number of keys stored in nodes and the number of communication messages contrary to the binary tree. As an example, a binary tree with 4096 members completes the key renewal process with 12 messages by storing 12 keys. However, the PLGAKD protocol with 5040 members completes this process with 6 messages by storing 7 keys. Moreover, the PLGAKD protocol becomes more efficient in parallel with the increase in the number of members.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Securing Internet of Things (IoT) applications that collect and transport sensitive data by guaranteeing authenticity, integrity, and confidentiality is a critical challenge. Reducing computation and communication overhead of security functions is also a key concern since a large number of constrained devices may take place in such applications. Our main focus in this paper is group authentication and key management in IoT. The existing group authentication and key management protocols in the literature perform computations using asymmetric ciphers, which costly for IoT. Therefore, applications generally employ simple security primitives that are prone to or lead to cyber-attacks by using IoT devices. In this paper, we propose a physically unclonable function (PUF) based lightweight group authentication and key distribution (PLGAKD) protocol that employs PUF, factorial tree, and the Chinese Remainder Theorem (CRT). In PLGAKD, PUF facilitates lightweight authentication and key distribution for group members. Each group member performs 2 encryptions, 1 decryption, 4 XORs operations, and 3 HMAC operations. For the key renewal process, the factorial tree and CRT help us reduce the number of keys stored in nodes and the number of communication messages contrary to the binary tree. As an example, a binary tree with 4096 members completes the key renewal process with 12 messages by storing 12 keys. However, the PLGAKD protocol with 5040 members completes this process with 6 messages by storing 7 keys. Moreover, the PLGAKD protocol becomes more efficient in parallel with the increase in the number of members.
83.
Alperen Eroğlu; Okan Yaman; Ertan Onur
Density-aware cellular coverage control: Interference-based density estimation Journal Article
In: Computer Networks, vol. 165, pp. 106922, 2019.
@article{erouglu2019density,
title = {Density-aware cellular coverage control: Interference-based density estimation},
author = {Alperen Ero{ğ}lu and Okan Yaman and Ertan Onur},
url = {http://www.sciencedirect.com/science/article/pii/S1389128619305201},
doi = {10.1016/j.comnet.2019.106922},
year = {2019},
date = {2019-12-24},
journal = {Computer Networks},
volume = {165},
pages = {106922},
publisher = {Elsevier},
abstract = {Cellular networks, Moving base stations, Base station density estimation, Density-adaptive networking, Network coverage",
abstract = "As demand for mobile communications increases, cells have to become smaller to efficiently use the scarce spectrum and to increase capacity, and small-cell networks will hereby emerge. They may be large in scale and highly dynamic resembling ad hoc networks due to the moving base stations. The variations in the density of the small cell networks impact the quality of service and introduce many novel challenges such as coverage control. We propose two novel base station density estimators, the interference-based density estimator (IDE) and the multi-access edge cloud-based density estimator (CDE) in a three-dimensional field. The estimators employ received signal strength measurements. We validate these two density estimators by using Monte-Carlo simulations. Furthermore, we analyze the impact of density on network outage in cellular networks and propose a density-aware cell zooming technique. According to the observations, base station (BS) density affects network coverage significantly. Received signal strength (RSS)-based density estimators can easily be implemented and applied in the network communication stack although they are more prone to shadowing and fading. Under favour of the density-aware cell zooming method, the network outage can be managed dynamically by adapting the transmit power, which provides a self-configurable and -organized network.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Cellular networks, Moving base stations, Base station density estimation, Density-adaptive networking, Network coverage",
abstract = "As demand for mobile communications increases, cells have to become smaller to efficiently use the scarce spectrum and to increase capacity, and small-cell networks will hereby emerge. They may be large in scale and highly dynamic resembling ad hoc networks due to the moving base stations. The variations in the density of the small cell networks impact the quality of service and introduce many novel challenges such as coverage control. We propose two novel base station density estimators, the interference-based density estimator (IDE) and the multi-access edge cloud-based density estimator (CDE) in a three-dimensional field. The estimators employ received signal strength measurements. We validate these two density estimators by using Monte-Carlo simulations. Furthermore, we analyze the impact of density on network outage in cellular networks and propose a density-aware cell zooming technique. According to the observations, base station (BS) density affects network coverage significantly. Received signal strength (RSS)-based density estimators can easily be implemented and applied in the network communication stack although they are more prone to shadowing and fading. Under favour of the density-aware cell zooming method, the network outage can be managed dynamically by adapting the transmit power, which provides a self-configurable and -organized network.
abstract = "As demand for mobile communications increases, cells have to become smaller to efficiently use the scarce spectrum and to increase capacity, and small-cell networks will hereby emerge. They may be large in scale and highly dynamic resembling ad hoc networks due to the moving base stations. The variations in the density of the small cell networks impact the quality of service and introduce many novel challenges such as coverage control. We propose two novel base station density estimators, the interference-based density estimator (IDE) and the multi-access edge cloud-based density estimator (CDE) in a three-dimensional field. The estimators employ received signal strength measurements. We validate these two density estimators by using Monte-Carlo simulations. Furthermore, we analyze the impact of density on network outage in cellular networks and propose a density-aware cell zooming technique. According to the observations, base station (BS) density affects network coverage significantly. Received signal strength (RSS)-based density estimators can easily be implemented and applied in the network communication stack although they are more prone to shadowing and fading. Under favour of the density-aware cell zooming method, the network outage can be managed dynamically by adapting the transmit power, which provides a self-configurable and -organized network.
82.
Doǧanalp Ergenç; Levent Eksert; Ertan Onur
Dependability-based Clustering in Mobile Ad-Hoc Networks Journal Article
In: Ad Hoc Networks, pp. 101926, 2019.
@article{ergencc2019dependability,
title = {Dependability-based Clustering in Mobile Ad-Hoc Networks},
author = {Doǧanalp Ergen{ç} and Levent Eksert and Ertan Onur},
url = {http://www.sciencedirect.com/science/article/pii/S1570870518306929},
doi = {10.1016/j.adhoc.2019.101926},
year = {2019},
date = {2019-10-01},
journal = {Ad Hoc Networks},
pages = {101926},
publisher = {Elsevier},
abstract = {Clustering is an effective solution to handle challenges due to lack of centralized controllers and infrastructure in ad-hoc networks. Clustered network topologies offer better scalability and reliability when compared with flat topologies. In this paper, a novel clustering algorithm, Dependability-based Clustering Algorithm (DCA) is presented. In DCA, we focus on the dependability of clusters themselves rather than considering only individual nodes to maintain the clustered structure of a network. We validated the performance of our proposal by discrete-event simulations and showed that our approach outperforms its opponents in terms of stability, energy efficiency and quality of service in stationary and mobile scenarios. Moreover, we performed sensitivity analysis of different metrics that are used to select cluster heads and compute the cluster dependability score proposing a complete optimization framework to analyze such metrics for weighted clustering algorithms. As a result of the analysis, we found that while topology-related metrics have negative impact, in many cases, energy-related metrics (e.g., residual energy) have varying effects on different objectives.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Clustering is an effective solution to handle challenges due to lack of centralized controllers and infrastructure in ad-hoc networks. Clustered network topologies offer better scalability and reliability when compared with flat topologies. In this paper, a novel clustering algorithm, Dependability-based Clustering Algorithm (DCA) is presented. In DCA, we focus on the dependability of clusters themselves rather than considering only individual nodes to maintain the clustered structure of a network. We validated the performance of our proposal by discrete-event simulations and showed that our approach outperforms its opponents in terms of stability, energy efficiency and quality of service in stationary and mobile scenarios. Moreover, we performed sensitivity analysis of different metrics that are used to select cluster heads and compute the cluster dependability score proposing a complete optimization framework to analyze such metrics for weighted clustering algorithms. As a result of the analysis, we found that while topology-related metrics have negative impact, in many cases, energy-related metrics (e.g., residual energy) have varying effects on different objectives.
81.
Shahram Mollahasani; Ertan Onur
Density-Aware, Energy-and Spectrum-Efficient Small Cell Scheduling Journal Article
In: IEEE Access, vol. 7, pp. 65852–65869, 2019.
@article{mollahasani2019density,
title = {Density-Aware, Energy-and Spectrum-Efficient Small Cell Scheduling},
author = {Shahram Mollahasani and Ertan Onur},
url = {https://ieeexplore.ieee.org/document/8718288},
doi = {10.1109/ACCESS.2019.2917722},
year = {2019},
date = {2019-05-20},
journal = {IEEE Access},
volume = {7},
pages = {65852--65869},
publisher = {IEEE},
abstract = {Future mobile networks have to be densified by employing small cells to handle the upsurge in traffic load. Although the amount of energy each small cell consumes is low, the total energy consumption of a large-scale network may be enormous. To enhance energy efficiency, we have to adapt the number of active base stations to the offered traffic load. Deactivating base stations may cause coverage holes, degrade the quality of service and throughput while redundant base stations waste energy. That is why we have to adapt the network to an effective density. In this paper, we show that achieving an optimal solution for adapting the density of base stations to the demand is NP-hard. We propose a solution that consists of two heuristic algorithms: a base station density adaptation algorithm and a cell-zooming algorithm that determines which base stations must be kept active and adapts transmit power of base stations to enhance throughput, energy, and spectral efficiency. We employ a multi-access edge cloud for taking a snapshot of the network state in nearly real time with a wider perspective and for collecting network state over a large area. We show that the proposed algorithm conserves energy up to 12% while the spectral efficiency and network throughput can be enhanced up to 30% and 26% in comparison with recent works, respectively.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Future mobile networks have to be densified by employing small cells to handle the upsurge in traffic load. Although the amount of energy each small cell consumes is low, the total energy consumption of a large-scale network may be enormous. To enhance energy efficiency, we have to adapt the number of active base stations to the offered traffic load. Deactivating base stations may cause coverage holes, degrade the quality of service and throughput while redundant base stations waste energy. That is why we have to adapt the network to an effective density. In this paper, we show that achieving an optimal solution for adapting the density of base stations to the demand is NP-hard. We propose a solution that consists of two heuristic algorithms: a base station density adaptation algorithm and a cell-zooming algorithm that determines which base stations must be kept active and adapts transmit power of base stations to enhance throughput, energy, and spectral efficiency. We employ a multi-access edge cloud for taking a snapshot of the network state in nearly real time with a wider perspective and for collecting network state over a large area. We show that the proposed algorithm conserves energy up to 12% while the spectral efficiency and network throughput can be enhanced up to 30% and 26% in comparison with recent works, respectively.
80.
Yunus Durmuş; Ertan Onur
Service Knowledge Discovery in Smart Machine Networks Journal Article
In: Wireless Personal Communications, vol. 81, no. 4, pp. 1455–1480, 2015, ISSN: 0929-6212.
@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}
}
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.
79.
Mihai Constantinescu; Ertan Onur; Yunus Durmus; Shahrokh Nikou; Mark De Reuver; Harry Bouwman; Miodrag Djurica; Philipp Maria Glatz
Mobile tethering: overview, perspectives and challenges Journal Article
In: Info, vol. 16, no. 3, pp. 40–53, 2014, ISSN: 1463-6697.
@article{constantinescu2014mobile,
title = {Mobile tethering: overview, perspectives and challenges},
author = {Mihai Constantinescu and Ertan Onur and Yunus Durmus and Shahrokh Nikou and Mark De Reuver and Harry Bouwman and Miodrag Djurica and Philipp Maria Glatz},
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}
}
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.
78.
Shi Huaizhou; R Venkatesha; Ertan Onur; Ignas Niemegeers
Fairness in wireless networks: Issues, measures and challenges Journal Article
In: IEEE Communications Surveys & Tutorials, vol. 16, no. 1, pp. 5–24, 2013, ISSN: 1553-877X.
@article{huaizhou2013fairness,
title = {Fairness in wireless networks: Issues, measures and challenges},
author = {Shi Huaizhou and R Venkatesha and Ertan Onur and Ignas Niemegeers},
doi = {10.1109/SURV.2013.050113.00015},
issn = {1553-877X},
year = {2013},
date = {2013-01-01},
journal = {IEEE Communications Surveys & 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}
}
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.
77.
Jinglong Zhou; Martin Jacobsson; Ertan Onur; Ignas Niemegeers
An investigation of link quality assessment for mobile multi-hop and multi-rate wireless networks Journal Article
In: Wireless personal communications, vol. 65, no. 2, pp. 405–423, 2012, ISSN: 0929-6212.
@article{zhou2012investigation,
title = {An investigation of link quality assessment for mobile multi-hop and multi-rate wireless networks},
author = {Jinglong Zhou and Martin Jacobsson and Ertan Onur and Ignas Niemegeers},
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}
}
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.
76.
Ertan Onur; Yunus Durmus; Ignas Niemegeers
Cooperative density estimation in random wireless ad hoc networks Journal Article
In: IEEE Communications Letters, vol. 16, no. 3, pp. 331–333, 2012, ISSN: 1089-7798.
@article{onur2012cooperative,
title = {Cooperative density estimation in random wireless ad hoc networks},
author = {Ertan Onur and Yunus Durmus and Ignas Niemegeers},
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}
}
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.
75.
Zulkuf Genc; WV Thillo; Andre Bourdoux; Ertan Onur
60 GHz PHY performance evaluation with 3D ray tracing under human shadowing Journal Article
In: IEEE Wireless Communications Letters, vol. 1, no. 2, pp. 117–120, 2012, ISSN: 2162-2337.
@article{genc201260,
title = {60 GHz PHY performance evaluation with 3D ray tracing under human shadowing},
author = {Zulkuf Genc and WV Thillo and Andre Bourdoux and Ertan Onur},
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}
}
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.
74.
Ertan Onur; Yunus Durmus; Mohamed Gamal Hawas; Sonia Marcela Heemstra de Groot; Ignas GMM Niemegeers
Collaborative and cognitive network platforms: Vision and research challenges Journal Article
In: Wireless Personal Communications, vol. 58, no. 1, pp. 71–93, 2011, ISSN: 0929-6212.
@article{onur2011collaborative,
title = {Collaborative and cognitive network platforms: Vision and research challenges},
author = {Ertan Onur and Yunus Durmus and Mohamed Gamal Hawas and Sonia Marcela Heemstra de Groot and Ignas GMM Niemegeers},
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}
}
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.
73.
Javad Vazifehdan; Venkatesha R Prasad; Ertan Onur; Ignas Niemegeers
Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies Journal Article
In: Computer Networks, vol. 55, no. 15, pp. 3256–3274, 2011, ISSN: 1389-1286.
@article{vazifehdan2011energy,
title = {Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies},
author = {Javad Vazifehdan and Venkatesha R Prasad and Ertan Onur and Ignas Niemegeers},
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}
}
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.
72.
Rabun Kosar; Ilir Bojaxhiu; Ertan Onur; Cem Ersoy
Lifetime extension for surveillance wireless sensor networks with intelligent redeployment Journal Article
In: Journal of network and computer applications, vol. 34, no. 6, pp. 1784–1793, 2011, ISSN: 1068-9605.
@article{kosar2011lifetime,
title = {Lifetime extension for surveillance wireless sensor networks with intelligent redeployment},
author = {Rabun Kosar and Ilir Bojaxhiu and Ertan Onur and Cem Ersoy},
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}
}
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.
71.
Zulkuf Genc; Umar H Rizvi; Ertan Onur; Ignas Niemegeers
Cooperative communications in future home networks Journal Article
In: Wireless personal communications, vol. 53, no. 3, pp. 349–364, 2010, ISSN: 0929-6212.
@article{gencc2010cooperative,
title = {Cooperative communications in future home networks},
author = {Zulkuf Genc and Umar H Rizvi and Ertan Onur and Ignas Niemegeers},
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}
}
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.
70.
Ertan Onur; Cem Ersoy; Hakan Delic; Lale Akarun
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours Journal Article
In: Computer Networks, vol. 54, no. 3, pp. 428–441, 2010, ISSN: 1389-1286.
@article{onur2010surveillance,
title = {Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours},
author = {Ertan Onur and Cem Ersoy and Hakan Delic and Lale Akarun},
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}
}
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.
69.
Rui L Aguiar; Ertan Onur; Knud Erik Skouby; Mari Carmen Aguayo-Torres; Thomas Skjodeberg Toftegaard
Users, Economics, Technology: Unavoidable Interdynamics Journal Article
In: Wireless personal communications, vol. 53, no. 3, pp. 437–442, 2010, ISSN: 0929-6212.
@article{aguiar2010users,
title = {Users, Economics, Technology: Unavoidable Interdynamics},
author = {Rui L Aguiar and Ertan Onur and Knud Erik Skouby and Mari Carmen Aguayo-Torres and Thomas Skjodeberg Toftegaard},
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}
}
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.
68.
Gencay Mutlu Olcer; Zulkuf Genc; Ertan Onur
Sector scanning attempts for non-isolation in directional 60 GHz networks Journal Article
In: IEEE Communications Letters, vol. 14, no. 9, pp. 845–847, 2010, ISSN: 1089-7798.
@article{olcer2010sector,
title = {Sector scanning attempts for non-isolation in directional 60 GHz networks},
author = {Gencay Mutlu Olcer and Zulkuf Genc and Ertan Onur},
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}
}
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.
67.
Ilker Demirkol; Cem Ersoy; Ertan Onur
Wake-up receivers for wireless sensor networks: benefits and challenges Journal Article
In: Wireless Communications, IEEE, vol. 16, no. 4, pp. 88–96, 2009, ISSN: 1536-1284.
@article{demirkol2009wake,
title = {Wake-up receivers for wireless sensor networks: benefits and challenges},
author = {Ilker Demirkol and Cem Ersoy and Ertan Onur},
doi = {10.1109/MWC.2009.5281260},
issn = {1536-1284},
year = {2009},
date = {2009-01-01},
journal = {Wireless Communications, IEEE},
volume = {16},
number = {4},
pages = {88--96},
publisher = {IEEE},
abstract = {For successful data delivery, the destination nodes should be listening to the medium to receive data when the sender node starts data communication. To achieve this synchronization, there are different rendezvous schemes, among which the most energy-efficient is utilizing wakeup receivers. Current hardware technologies of wake-up receivers enable us to evaluate them as a promising solution for wireless sensor networks. In this article the benefits achieved with wake-up receivers are investigated along with the challenges observed. In addition, an overview of state-of-the-art hardware and networking protocol proposals is presented. As wake-up receivers offer new opportunities, new potential application areas are also presented and discussed.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
For successful data delivery, the destination nodes should be listening to the medium to receive data when the sender node starts data communication. To achieve this synchronization, there are different rendezvous schemes, among which the most energy-efficient is utilizing wakeup receivers. Current hardware technologies of wake-up receivers enable us to evaluate them as a promising solution for wireless sensor networks. In this article the benefits achieved with wake-up receivers are investigated along with the challenges observed. In addition, an overview of state-of-the-art hardware and networking protocol proposals is presented. As wake-up receivers offer new opportunities, new potential application areas are also presented and discussed.
66.
Ertan Onur; Cem Ersoy; Hakan Delic
Analysis of target detection probability in randomly deployed sensor networks Journal Article
In: IEEE Communications Letters, vol. 11, no. 10, pp. 778–780, 2007, ISSN: 1089-7798.
@article{onur2007analysis,
title = {Analysis of target detection probability in randomly deployed sensor networks},
author = {Ertan Onur and Cem Ersoy and Hakan Delic},
doi = {10.1109/LCOMM.2007.070780},
issn = {1089-7798},
year = {2007},
date = {2007-01-01},
journal = {IEEE Communications Letters},
volume = {11},
number = {10},
pages = {778--780},
publisher = {IEEE},
abstract = {The main functionality of a surveillance wireless sensor network is to detect unauthorized traversals in a field. In this paper, we develop a formulation to determine the probability of detecting a randomly positioned target by a set of binary sensors to serve as the deployment quality measure. This formulation leads to a recipe to determine the number of sensors required to deliver a certain deployment quality level. The sensing- and communication-neighbor degrees which can be used as design criteria in a sensor network are defined and calculated. The model is verified by simulations whose outcomes closely match the analytical results.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The main functionality of a surveillance wireless sensor network is to detect unauthorized traversals in a field. In this paper, we develop a formulation to determine the probability of detecting a randomly positioned target by a set of binary sensors to serve as the deployment quality measure. This formulation leads to a recipe to determine the number of sensors required to deliver a certain deployment quality level. The sensing- and communication-neighbor degrees which can be used as design criteria in a sensor network are defined and calculated. The model is verified by simulations whose outcomes closely match the analytical results.
65.
Ertan Onur; Cem Ersoy; Hakan Delic; Lale Akarun
Surveillance wireless sensor networks: deployment quality analysis Journal Article
In: IEEE Network, vol. 21, no. 6, pp. 48–53, 2007, ISSN: 0890-8044.
@article{onur2007surveillance,
title = {Surveillance wireless sensor networks: deployment quality analysis},
author = {Ertan Onur and Cem Ersoy and Hakan Delic and Lale Akarun},
doi = {10.1109/MNET.2007.4395110},
issn = {0890-8044},
year = {2007},
date = {2007-01-01},
journal = {IEEE Network},
volume = {21},
number = {6},
pages = {48--53},
publisher = {IEEE},
abstract = {Surveillance wireless sensor networks are deployed at perimeter or border locations to detect unauthorized intrusions. For deterministic deployment of sensors, the quality of deployment can be determined sufficiently by analysis in advance of deployment. However, when random deployment is required, determining the deployment quality becomes challenging. To assess the quality of sensor deployment, appropriate measures can be employed that reveal the weaknesses in the coverage of SWSNs with respect to the success ratio and time for detecting intruders. In this article, probabilistic sensor models are adopted, and the quality of deployment issue is surveyed and analyzed in terms of novel measures. Furthermore, since the presence of obstacles in the surveillance terrain has a negative impact on previously proposed deployment strategies and analysis techniques, we argue in favor of utilizing image segmentation algorithms by imitating the sensing area as a grayscale image referred to as the iso-sensing graph. Finally, the effect of sensor count on detection ratio and time to detect the target is analyzed through OMNeT++ simulation of an SWSN in a border surveillance scenario.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Surveillance wireless sensor networks are deployed at perimeter or border locations to detect unauthorized intrusions. For deterministic deployment of sensors, the quality of deployment can be determined sufficiently by analysis in advance of deployment. However, when random deployment is required, determining the deployment quality becomes challenging. To assess the quality of sensor deployment, appropriate measures can be employed that reveal the weaknesses in the coverage of SWSNs with respect to the success ratio and time for detecting intruders. In this article, probabilistic sensor models are adopted, and the quality of deployment issue is surveyed and analyzed in terms of novel measures. Furthermore, since the presence of obstacles in the surveillance terrain has a negative impact on previously proposed deployment strategies and analysis techniques, we argue in favor of utilizing image segmentation algorithms by imitating the sensing area as a grayscale image referred to as the iso-sensing graph. Finally, the effect of sensor count on detection ratio and time to detect the target is analyzed through OMNeT++ simulation of an SWSN in a border surveillance scenario.
64.
Ertan Onur; Cem Ersoy; Hakan Delic
How many sensors for an acceptable breach detection probability? Journal Article
In: Computer Communications, vol. 29, no. 2, pp. 173–182, 2006, ISSN: 0140-3664.
@article{e2006many,
title = {How many sensors for an acceptable breach detection probability?},
author = {Ertan Onur and Cem Ersoy and Hakan Delic},
doi = {10.1016/j.comcom.2005.05.021},
issn = {0140-3664},
year = {2006},
date = {2006-01-01},
journal = {Computer Communications},
volume = {29},
number = {2},
pages = {173--182},
publisher = {Elsevier},
abstract = {Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the number of sensors and the breach detection probability considering the effects of sensor parameters. We present the weakest breach path problem formulation and provide a solution by utilizing the Dijkstra's shortest path algorithm. We propose a method to determine the required number of sensors to be deployed and to gain insight about the surveillance performance of the network, the maximum detection probability on the weakest breach path is considered as the performance measure.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the number of sensors and the breach detection probability considering the effects of sensor parameters. We present the weakest breach path problem formulation and provide a solution by utilizing the Dijkstra's shortest path algorithm. We propose a method to determine the required number of sensors to be deployed and to gain insight about the surveillance performance of the network, the maximum detection probability on the weakest breach path is considered as the performance measure.
63.
Ertan Onur; Cem Ersoy; Hakan Delic
Quality of Deployment in Surveillance Wireless Sensor Networks Journal Article
In: International Journal of Wireless Information Networks, vol. 12, no. 1, pp. 61-67, 2005, ISSN: 1068-9605.
@article{,
title = {Quality of Deployment in Surveillance Wireless Sensor Networks},
author = {Ertan Onur and Cem Ersoy and Hakan Delic},
url = {http://eonur.ceng.metu.edu.tr/wordpress/wp-content/uploads/2015/05/Onur_F12_IJWIN.pdf},
doi = {10.1007/s10776-005-5152-7},
issn = {1068-9605},
year = {2005},
date = {2005-01-01},
journal = {International Journal of Wireless Information Networks},
volume = {12},
number = {1},
pages = {61-67},
publisher = {Kluwer Academic Publishers},
abstract = {When wireless sensors are used to keep an area under surveillance, a critical issue is the quality of the deployment from the sensing coverage viewpoint. In this paper, we propose several quality measures, which indicate if the deployment provides sufficient coverage, or whether redeployment is required or not. The terrain is modeled as a grid and the placement of the sensors is uniformly distributed. Neyman–Pearson detection is utilized to determine the effects of false-alarm and signal characteristics on the measures.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
When wireless sensors are used to keep an area under surveillance, a critical issue is the quality of the deployment from the sensing coverage viewpoint. In this paper, we propose several quality measures, which indicate if the deployment provides sufficient coverage, or whether redeployment is required or not. The terrain is modeled as a grid and the placement of the sensors is uniformly distributed. Neyman–Pearson detection is utilized to determine the effects of false-alarm and signal characteristics on the measures.
Book Chapters
62.
Muhammed Cagri Kaya; Alperen Eroglu; Alper Karamanlioglu; Ertan Onur; Bedir Tekinerdogan; Ali H Dogru
Runtime Adaptability of Ambient Intelligence Systems Based on Component-Oriented Approach Book Chapter
In: 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.
@inbook{Kaya2019,
title = {Runtime Adaptability of Ambient Intelligence Systems Based on Component-Oriented Approach},
author = {Muhammed Cagri Kaya and Alperen Eroglu and Alper Karamanlioglu and Ertan Onur and Bedir Tekinerdogan and Ali H Dogru},
editor = {Zaigham Mahmood},
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}
}
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.
61.
Ahmed Demirpolat; Doğanalp Ergenç; Esref Ozturk; Yusuf Ayar; Ertan Onur
Software-Defined Network Security Book Chapter
In: Enabling Technologies and Architectures for Next-Generation Networking Capabilities, pp. 232–253, IGI Global, 2018.
@inbook{demirpolat2019software,
title = {Software-Defined Network Security},
author = {Ahmed Demirpolat and Do{ğ}analp Ergen{ç} and Esref Ozturk and Yusuf Ayar and Ertan Onur},
year = {2018},
date = {2018-01-01},
urldate = {2018-01-01},
booktitle = {Enabling Technologies and Architectures for Next-Generation Networking Capabilities},
pages = {232--253},
publisher = {IGI Global},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
60.
Shahram Mollahasani; Alperen Eroğlu; Ömer Yamaç; Ertan Onur
Simulators, Test Beds and Prototypes of 5G mobile Networking Architectures Book Chapter
In: Elkhodr, Mahmoud; Hassan, Qusay; Shahrestani, Seyed (Ed.): Chapman and Hall/CRC, Networks of the Future: Architectures, Technologies, and Implementations, 2017, ISBN: 9781498783972.
@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 = {published},
tppubtype = {inbook}
}
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.
59.
Hüsnü Yıldız; Adnan Kılıç; Ertan Onur
Lightweight Cryptography in 5G Machine-type Communication Book Chapter
In: Elkhodr, Mahmoud; Hassan, Qusay; Shahrestani, Seyed (Ed.): Chapman and Hall/CRC, Networks of the Future: Architectures, Technologies, and Implementations, 2017, ISBN: 9781498783972.
@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},
urldate = {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 = {published},
tppubtype = {inbook}
}
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.
58.
Ertan Onur; Ignas Niemegeers; Fred Snijders
Duurzaam Draadloos Book Chapter
In: Croes, Roel (Ed.): Duurzame ICT, pp. 83–91, Sdu Uitgevers bv, Den Haag, 2010, ISBN: 978 90 12 5 8 2 2 8 5.
@inbook{Onur-DuurzameICT,
title = {Duurzaam Draadloos},
author = {Ertan Onur and Ignas Niemegeers and Fred Snijders},
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}
}
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.
57.
Ertan Onur
Sensing Coverage and Breach Paths in Surveillance Wireless Sensor Networks Book Chapter
In: Phoha, Shashi; Porta, Thomas F La; Griffin, Christopher (Ed.): Sensor Network Operations, vol. 2, pp. 68-81, John Wiley and Sons, 2006, ISBN: 978-0-471-71976-2.
@inbook{Onur2006Son,
title = {Sensing Coverage and Breach Paths in Surveillance Wireless Sensor Networks},
author = {Ertan Onur},
editor = {Shashi Phoha and Thomas F La Porta and Christopher Griffin},
isbn = {978-0-471-71976-2},
year = {2006},
date = {2006-07-01},
booktitle = {Sensor Network Operations},
volume = {2},
pages = {68-81},
publisher = {John Wiley and Sons},
series = {Sensor Network Operation},
abstract = {In this paper, the sensing coverage area of surveillance wireless sensor networks is considered. The sensing coverage is determined by applying the Neyman-Pearson detection model and defining the breach probability on a grid-modeled field. Using a graph model for the perimeter, Di- jkstra’s shortest path algorithm is used to find the weakest breach path. The breach probability is linked to parameters such as the false alarm rate, size of the data record and the signal-to-noise ratio. Consequently, the required number of sensor nodes and the surveillance performance of the network are determined. The false alarm rate and the field width turn out to be the two most influential parameters on the breach probability.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
In this paper, the sensing coverage area of surveillance wireless sensor networks is considered. The sensing coverage is determined by applying the Neyman-Pearson detection model and defining the breach probability on a grid-modeled field. Using a graph model for the perimeter, Di- jkstra’s shortest path algorithm is used to find the weakest breach path. The breach probability is linked to parameters such as the false alarm rate, size of the data record and the signal-to-noise ratio. Consequently, the required number of sensor nodes and the surveillance performance of the network are determined. The false alarm rate and the field width turn out to be the two most influential parameters on the breach probability.
56.
Tolga Onel; Ertan Onur; Cem Ersoy; Hakan Delic
Wireless Sensor Networks For Security: Issues and Challenges Book Chapter
In: Byrnes, Jim; Ostheimer, Gerald (Ed.): Advances in Sensing with Security Applications, vol. 2, pp. 95-119, Springer Netherlands, 2006, ISBN: 978-1-4020-4284-3.
@inbook{Tolga2006,
title = {Wireless Sensor Networks For Security: Issues and Challenges},
author = {Tolga Onel and Ertan Onur and Cem Ersoy and Hakan Delic},
editor = {Jim Byrnes and Gerald Ostheimer},
doi = {10.1007/1-4020-4295-7_05},
isbn = {978-1-4020-4284-3},
year = {2006},
date = {2006-01-01},
booktitle = {Advances in Sensing with Security Applications},
volume = {2},
pages = {95-119},
publisher = {Springer Netherlands},
series = {NATO Security Through Science Series},
abstract = {In this chapter, the sensing coverage area of surveillance wireless sensor networks is considered. The sensing coverage is determined by applying Neyman-Pearson detection and defining the breach probability on a grid-modeled field. Using a graph model for the perimeter, Dijkstra’s shortest path algorithm is used to find the weakest breach path. The breach probability is linked to parameters such as the false alarm rate, size of the data record and the signal-to-noise ratio. Consequently, the required number of sensor nodes and the surveillance performance of the network are determined. For target tracking applications, small wireless sensors provide accurate information since they can be deployed and operated near the phenomenon. These sensing devices have the opportunity of collaboration amongst themselves to improve the target localization and tracking accuracies. Distributed data fusion architecture provides a collaborative tracking framework. Due to the present energy constraints of these small sensing and wireless communicating devices, a common trend is to put some of them into a dormant state. We adopt a mutual information based metric to select the most informative subset of the sensors to achieve reduction in the energy consumption, while preserving the desired accuracies of the target position estimation.},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
In this chapter, the sensing coverage area of surveillance wireless sensor networks is considered. The sensing coverage is determined by applying Neyman-Pearson detection and defining the breach probability on a grid-modeled field. Using a graph model for the perimeter, Dijkstra’s shortest path algorithm is used to find the weakest breach path. The breach probability is linked to parameters such as the false alarm rate, size of the data record and the signal-to-noise ratio. Consequently, the required number of sensor nodes and the surveillance performance of the network are determined. For target tracking applications, small wireless sensors provide accurate information since they can be deployed and operated near the phenomenon. These sensing devices have the opportunity of collaboration amongst themselves to improve the target localization and tracking accuracies. Distributed data fusion architecture provides a collaborative tracking framework. Due to the present energy constraints of these small sensing and wireless communicating devices, a common trend is to put some of them into a dormant state. We adopt a mutual information based metric to select the most informative subset of the sensors to achieve reduction in the energy consumption, while preserving the desired accuracies of the target position estimation.
Proceedings Articles
55.
Mohamed Rouili; Niloy Saha; Morteza Golkarifard; Mohammad Zangooei; Raouf Boutaba; Ertan Onur; Aladdin Saleh
Evaluating Open-Source 5G SA Testbeds: Unveiling Performance Disparities in RAN Scenarios Proceedings Article
In: NOMS 2024-2024 IEEE Network Operations and Management Symposium, 2024 2024.
@inproceedings{rouili2024evaluating,
title = {Evaluating Open-Source 5G SA Testbeds: Unveiling Performance Disparities in RAN Scenarios},
author = {Mohamed Rouili and Niloy Saha and Morteza Golkarifard and Mohammad Zangooei and Raouf Boutaba and Ertan Onur and Aladdin Saleh},
year = {2024},
date = {2024-05-06},
urldate = {2024-05-06},
booktitle = {NOMS 2024-2024 IEEE Network Operations and Management Symposium},
organization = {2024},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
54.
Berker Acir; Ertan Onur; Cansu Betin Onur
Finding Islands on Encrypted Graphs Proceedings Article
In: 2023 31st Signal Processing and Communications Applications Conference (SIU), 2023 2023.
@inproceedings{acir2023findingb,
title = {Finding Islands on Encrypted Graphs},
author = {Berker Acir and Ertan Onur and Cansu Betin Onur},
year = {2023},
date = {2023-07-05},
urldate = {2023-07-05},
booktitle = {2023 31st Signal Processing and Communications Applications Conference (SIU)},
organization = {2023},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
53.
Furkan Murat; Alperen Eroglu; Ertan Onur
A Multi-Hop Routing Protocol in Backscattering Tag-To-Tag Networks Proceedings Article
In: 2023 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), 2023 2023.
@inproceedings{murat2023multi,
title = {A Multi-Hop Routing Protocol in Backscattering Tag-To-Tag Networks},
author = {Furkan Murat and Alperen Eroglu and Ertan Onur},
year = {2023},
date = {2023-07-04},
booktitle = {2023 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)},
organization = {2023},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
52.
Berker Acir; Ertan Onur; Raouf Boutaba
Privacy-Preserving User Abnormal Behavior Detection in 5G Networks Proceedings Article
In: 2023 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), 2023 2023.
@inproceedings{acir2023privacy,
title = {Privacy-Preserving User Abnormal Behavior Detection in 5G Networks},
author = {Berker Acir and Ertan Onur and Raouf Boutaba},
year = {2023},
date = {2023-07-04},
urldate = {2023-07-04},
booktitle = {2023 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)},
organization = {2023},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
51.
Saidu Sokoto; Ertan Onur
SGLC: A Logical Clock Using Succinct Graphs Proceedings Article
In: 2022 30th Signal Processing and Communications Applications Conference (SIU), pp. 1-4, 2022.
@inproceedings{9864718,
title = {SGLC: A Logical Clock Using Succinct Graphs},
author = {Saidu Sokoto and Ertan Onur},
doi = {10.1109/SIU55565.2022.9864718},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
booktitle = {2022 30th Signal Processing and Communications Applications Conference (SIU)},
pages = {1-4},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
50.
Goksel Simsek; Doğanalp Ergenç; Ertan Onur
Efficient Network Monitoring via In-band Telemetry Proceedings Article
In: 2021 17th International Conference on the Design of Reliable Communication Networks (DRCN), pp. 1-6, 2021.
@inproceedings{9477344,
title = {Efficient Network Monitoring via In-band Telemetry},
author = {Goksel Simsek and Doğanalp Ergenç and Ertan Onur},
doi = {10.1109/DRCN51631.2021.9477344},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {2021 17th International Conference on the Design of Reliable Communication Networks (DRCN)},
pages = {1-6},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
49.
Beyza Butun; Ertan Onur
Joint Virtual Machine Embedding and Wireless Data Center Topology Management Proceedings Article
In: 17th International Conference on Network and Service Management (CNSM 2021), Izmir, Turkey, Turkey, 2021.
@inproceedings{Butu2110:Joint,
title = {Joint Virtual Machine Embedding and Wireless Data Center Topology Management},
author = {Beyza Butun and Ertan Onur},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {17th International Conference on Network and Service Management (CNSM 2021)},
address = {Izmir, Turkey, Turkey},
abstract = {Data Center Networks (DCNs) have become critical infrastructures with the
enormous increase in the amount of data generated. This increase introduces
some problems in DCNs such as high cabling complexity, high-level power
consumption, low space utilization, and oversubscription. Wireless DCNs
(WDCNs) address these problems by decreasing cabling complexity and power
consumption and increasing space utilization thanks to their incorporation
of wireless communication technologies. Moreover, with its highly flexible
structure, WDCNs efficiently utilize the bandwidth and provide a promising
solution to the oversubscription problem. However, WDCNs pose some
challenges such as meeting dynamic traffic demands and increasing
throughput in the data center. In this work, we propose a WDCN with dynamic
topology, and we aim to handle the dynamic traffic demand of virtual
machines (i.e., services) and maximize throughput by efficiently embedding
virtual machines into physical machines (i.e., servers) and deploying
wireless transceivers on top of the racks to establish dynamic wireless
communication using unlicensed 60 GHz bands. To maximize throughput in the
WDCN, we create a mixed-integer programming (MIP) problem. Due to the
complexity of the problem, we also introduce two heuristics named Heuristic
for Wireless Link and Service Deployment (HWSD) and Improved HWSD (I-HWSD).
These heuristics significantly improve the time it takes to solve the MIP
problem with an optimization solver and approach the optimal solution by
about 20%. Unlike top-of-rack (ToR)-to-ToR WDCN, which doesn't consider
deploying virtual machines, we increase the throughput we can achieve by
deploying virtual machines according to the average traffic demands between
them.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Data Center Networks (DCNs) have become critical infrastructures with the
enormous increase in the amount of data generated. This increase introduces
some problems in DCNs such as high cabling complexity, high-level power
consumption, low space utilization, and oversubscription. Wireless DCNs
(WDCNs) address these problems by decreasing cabling complexity and power
consumption and increasing space utilization thanks to their incorporation
of wireless communication technologies. Moreover, with its highly flexible
structure, WDCNs efficiently utilize the bandwidth and provide a promising
solution to the oversubscription problem. However, WDCNs pose some
challenges such as meeting dynamic traffic demands and increasing
throughput in the data center. In this work, we propose a WDCN with dynamic
topology, and we aim to handle the dynamic traffic demand of virtual
machines (i.e., services) and maximize throughput by efficiently embedding
virtual machines into physical machines (i.e., servers) and deploying
wireless transceivers on top of the racks to establish dynamic wireless
communication using unlicensed 60 GHz bands. To maximize throughput in the
WDCN, we create a mixed-integer programming (MIP) problem. Due to the
complexity of the problem, we also introduce two heuristics named Heuristic
for Wireless Link and Service Deployment (HWSD) and Improved HWSD (I-HWSD).
These heuristics significantly improve the time it takes to solve the MIP
problem with an optimization solver and approach the optimal solution by
about 20%. Unlike top-of-rack (ToR)-to-ToR WDCN, which doesn't consider
deploying virtual machines, we increase the throughput we can achieve by
deploying virtual machines according to the average traffic demands between
them.
enormous increase in the amount of data generated. This increase introduces
some problems in DCNs such as high cabling complexity, high-level power
consumption, low space utilization, and oversubscription. Wireless DCNs
(WDCNs) address these problems by decreasing cabling complexity and power
consumption and increasing space utilization thanks to their incorporation
of wireless communication technologies. Moreover, with its highly flexible
structure, WDCNs efficiently utilize the bandwidth and provide a promising
solution to the oversubscription problem. However, WDCNs pose some
challenges such as meeting dynamic traffic demands and increasing
throughput in the data center. In this work, we propose a WDCN with dynamic
topology, and we aim to handle the dynamic traffic demand of virtual
machines (i.e., services) and maximize throughput by efficiently embedding
virtual machines into physical machines (i.e., servers) and deploying
wireless transceivers on top of the racks to establish dynamic wireless
communication using unlicensed 60 GHz bands. To maximize throughput in the
WDCN, we create a mixed-integer programming (MIP) problem. Due to the
complexity of the problem, we also introduce two heuristics named Heuristic
for Wireless Link and Service Deployment (HWSD) and Improved HWSD (I-HWSD).
These heuristics significantly improve the time it takes to solve the MIP
problem with an optimization solver and approach the optimal solution by
about 20%. Unlike top-of-rack (ToR)-to-ToR WDCN, which doesn't consider
deploying virtual machines, we increase the throughput we can achieve by
deploying virtual machines according to the average traffic demands between
them.
48.
Egemen Sarikaya; Ertan Onur
Placement of 5G RAN slices in Multi-tier O-RAN 5G networks with Flexible Functional Splits Proceedings Article
In: 17th International Conference on Network and Service Management (CNSM 2021), Izmir, Turkey, Turkey, 2021.
@inproceedings{Sari2110:Placement,
title = {Placement of 5G RAN slices in Multi-tier O-RAN 5G networks with Flexible Functional Splits},
author = {Egemen Sarikaya and Ertan Onur},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {17th International Conference on Network and Service Management (CNSM 2021)},
address = {Izmir, Turkey, Turkey},
abstract = {The network slicing concept has gained much attention with the development
of software-defined network and network function virtualization
technologies, enabling logically isolated networks for different purposes
in the same network infrastructure.
The virtualization of network functions enables the functional split of
radio access network functions to fulfill different 5G radio access network
requirements.
Functional split can be expressed as deciding the distribution of radio
access network functionalities between the radio unit placed at the edge of
the network, the distributed unit placed close to the users, and the
central unit placed centrally.
The open radio access network concept is utilized to achieve a virtualized,
interoperable radio access network among multiple vendors.
In this work, we considered the placement of radio access network slices in
a multi-tier 5G open radio access network architecture and formulated the
problem as a Mixed-Integer Quadratically Constrained Programming,
considering different functional split options for each network slice
separately. Our results showed that flexible functional split utilizes
physical network resources and satisfies different network slice
requirements better than fixed functional split options.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The network slicing concept has gained much attention with the development
of software-defined network and network function virtualization
technologies, enabling logically isolated networks for different purposes
in the same network infrastructure.
The virtualization of network functions enables the functional split of
radio access network functions to fulfill different 5G radio access network
requirements.
Functional split can be expressed as deciding the distribution of radio
access network functionalities between the radio unit placed at the edge of
the network, the distributed unit placed close to the users, and the
central unit placed centrally.
The open radio access network concept is utilized to achieve a virtualized,
interoperable radio access network among multiple vendors.
In this work, we considered the placement of radio access network slices in
a multi-tier 5G open radio access network architecture and formulated the
problem as a Mixed-Integer Quadratically Constrained Programming,
considering different functional split options for each network slice
separately. Our results showed that flexible functional split utilizes
physical network resources and satisfies different network slice
requirements better than fixed functional split options.
of software-defined network and network function virtualization
technologies, enabling logically isolated networks for different purposes
in the same network infrastructure.
The virtualization of network functions enables the functional split of
radio access network functions to fulfill different 5G radio access network
requirements.
Functional split can be expressed as deciding the distribution of radio
access network functionalities between the radio unit placed at the edge of
the network, the distributed unit placed close to the users, and the
central unit placed centrally.
The open radio access network concept is utilized to achieve a virtualized,
interoperable radio access network among multiple vendors.
In this work, we considered the placement of radio access network slices in
a multi-tier 5G open radio access network architecture and formulated the
problem as a Mixed-Integer Quadratically Constrained Programming,
considering different functional split options for each network slice
separately. Our results showed that flexible functional split utilizes
physical network resources and satisfies different network slice
requirements better than fixed functional split options.
47.
Furkan Murat; Ertan Onur
Caching Video on Demand in Radio Cluster Proceedings Article
In: 17th International Conference on Network and Service Management (CNSM 2021), Izmir, Turkey, Turkey, 2021.
@inproceedings{Mura2110:Caching,
title = {Caching Video on Demand in Radio Cluster},
author = {Furkan Murat and Ertan Onur},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {17th International Conference on Network and Service Management (CNSM 2021)},
address = {Izmir, Turkey, Turkey},
abstract = {Densification of mobile networks leads to some problems such as overloaded
backhaul and increased latency. Base stations may not always have fiber
backhauls. For such cases, radio links are employed between base stations
towards a base station that has a high capacity backhaul link. Those set of
base stations that are connected to the hub over radio links are called
radio clusters. We propose caching in radio clusters for decreasing the
video streaming load on radio links. We define an optimization problem to
determine the cache locations for video-on-demand segments considering user
requirements. We tested our model with different radio cluster
configurations concentrating on the size of the radio cluster, the number
of users, and the number of demanded videos. Significant gains can be
attained by employing the proposed cache placement and replication solution
in radio clusters.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Densification of mobile networks leads to some problems such as overloaded
backhaul and increased latency. Base stations may not always have fiber
backhauls. For such cases, radio links are employed between base stations
towards a base station that has a high capacity backhaul link. Those set of
base stations that are connected to the hub over radio links are called
radio clusters. We propose caching in radio clusters for decreasing the
video streaming load on radio links. We define an optimization problem to
determine the cache locations for video-on-demand segments considering user
requirements. We tested our model with different radio cluster
configurations concentrating on the size of the radio cluster, the number
of users, and the number of demanded videos. Significant gains can be
attained by employing the proposed cache placement and replication solution
in radio clusters.
backhaul and increased latency. Base stations may not always have fiber
backhauls. For such cases, radio links are employed between base stations
towards a base station that has a high capacity backhaul link. Those set of
base stations that are connected to the hub over radio links are called
radio clusters. We propose caching in radio clusters for decreasing the
video streaming load on radio links. We define an optimization problem to
determine the cache locations for video-on-demand segments considering user
requirements. We tested our model with different radio cluster
configurations concentrating on the size of the radio cluster, the number
of users, and the number of demanded videos. Significant gains can be
attained by employing the proposed cache placement and replication solution
in radio clusters.
46.
İdil Z Alemdar; Ertan Onur
Max-Min Fair Bandwidth Allocation in Millimeter-Wave Radio Cluster Proceedings Article
In: 17th International Conference on Network and Service Management (CNSM 2021), Izmir, Turkey, Turkey, 2021.
@inproceedings{Alem2110:Max,
title = {Max-Min Fair Bandwidth Allocation in Millimeter-Wave Radio Cluster},
author = {İdil Z Alemdar and Ertan Onur},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {17th International Conference on Network and Service Management (CNSM 2021)},
address = {Izmir, Turkey, Turkey},
abstract = {Enabling ultra high speed wireless communication,
Extreme High Frequency (EHF) or Millimeter Wave (mmWave)
bands will play a significant role for the 5G. Apart from speed,
5G will be very useful for handling great amounts of data
simultaneously and serving bandwidth hungry applications as
well. Ultra high quality and ultra fast video streaming will be
one of those applications that will be made possible by 5G.
While serving bandwidth hungry applications with ease will be
an important development and maximizing throughput is most
of the time the main goal in a network, it is also important
to make sure that no other application starves. In order to
prevent such a situation, fair bandwidth allocation should be
considered in wireless communications. We simulated a max-min
fair bandwidth allocation scenario in a mmWave radio cluster,
where a radio cluster is a set of base stations connected to a
main hub over 60 GHz radio links. We ran experiments with
different path loss exponent values with increasing number of
base stations to examine the effects of topology complexity and
radio signal loss on the optimization time and on the overall
network throughput while maintaining max-min fair allocation.
The results showed that as the topology becomes more complex,
the problem takes longer to solve. However, the overall network
throughput increases. In addition, our model has achieved a
decent quantitative fairness level as shown by Jain's index values,
which are always more than 0.5 on a scale of 0 to 1 with respect
to the topology complexity and the number users.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Enabling ultra high speed wireless communication,
Extreme High Frequency (EHF) or Millimeter Wave (mmWave)
bands will play a significant role for the 5G. Apart from speed,
5G will be very useful for handling great amounts of data
simultaneously and serving bandwidth hungry applications as
well. Ultra high quality and ultra fast video streaming will be
one of those applications that will be made possible by 5G.
While serving bandwidth hungry applications with ease will be
an important development and maximizing throughput is most
of the time the main goal in a network, it is also important
to make sure that no other application starves. In order to
prevent such a situation, fair bandwidth allocation should be
considered in wireless communications. We simulated a max-min
fair bandwidth allocation scenario in a mmWave radio cluster,
where a radio cluster is a set of base stations connected to a
main hub over 60 GHz radio links. We ran experiments with
different path loss exponent values with increasing number of
base stations to examine the effects of topology complexity and
radio signal loss on the optimization time and on the overall
network throughput while maintaining max-min fair allocation.
The results showed that as the topology becomes more complex,
the problem takes longer to solve. However, the overall network
throughput increases. In addition, our model has achieved a
decent quantitative fairness level as shown by Jain's index values,
which are always more than 0.5 on a scale of 0 to 1 with respect
to the topology complexity and the number users.
Extreme High Frequency (EHF) or Millimeter Wave (mmWave)
bands will play a significant role for the 5G. Apart from speed,
5G will be very useful for handling great amounts of data
simultaneously and serving bandwidth hungry applications as
well. Ultra high quality and ultra fast video streaming will be
one of those applications that will be made possible by 5G.
While serving bandwidth hungry applications with ease will be
an important development and maximizing throughput is most
of the time the main goal in a network, it is also important
to make sure that no other application starves. In order to
prevent such a situation, fair bandwidth allocation should be
considered in wireless communications. We simulated a max-min
fair bandwidth allocation scenario in a mmWave radio cluster,
where a radio cluster is a set of base stations connected to a
main hub over 60 GHz radio links. We ran experiments with
different path loss exponent values with increasing number of
base stations to examine the effects of topology complexity and
radio signal loss on the optimization time and on the overall
network throughput while maintaining max-min fair allocation.
The results showed that as the topology becomes more complex,
the problem takes longer to solve. However, the overall network
throughput increases. In addition, our model has achieved a
decent quantitative fairness level as shown by Jain's index values,
which are always more than 0.5 on a scale of 0 to 1 with respect
to the topology complexity and the number users.
45.
Ertan Onur
Peer Assessment in a Wireless Networking Course Proceedings Article
In: SIGCOMM Teaching and Learning Computer Networking During the Pandemic and Beyond Online Networking Education Community Discussion, 2020.
@inproceedings{OnurSigcommEdu2020,
title = {Peer Assessment in a Wireless Networking Course},
author = {Ertan Onur},
url = {http://gaia.cs.umass.edu/sigcomm_education_workshop_2020/papers/sigcommedu20-final13.pdf},
year = {2020},
date = {2020-08-05},
urldate = {2020-08-05},
booktitle = {SIGCOMM Teaching and Learning Computer Networking During the Pandemic and Beyond Online Networking Education Community Discussion},
abstract = {In the 2018-2019 Spring semester, we used peer assessment for grading the term projects in the CENG513, Wireless Communications and Networking course at the Department of Computer Engineering of Middle East Technical University. In this white paper, we present our experiences using the workshop tool for peer assessment on Moodle, an open-source learning management system. We believe these experiences and the lessons learned may help lecturers teaching networking courses during the Covid-19 pandemic.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In the 2018-2019 Spring semester, we used peer assessment for grading the term projects in the CENG513, Wireless Communications and Networking course at the Department of Computer Engineering of Middle East Technical University. In this white paper, we present our experiences using the workshop tool for peer assessment on Moodle, an open-source learning management system. We believe these experiences and the lessons learned may help lecturers teaching networking courses during the Covid-19 pandemic.
44.
Gamze Çavuşoglu; Hande Alemdar; Ertan Onur
Covert Channel Detection Using Machine Learning Proceedings Article
In: 2020 28th Signal Processing and Communications Applications Conference (SIU), pp. 1-4, 2020.
@inproceedings{9302098,
title = {Covert Channel Detection Using Machine Learning},
author = {Gamze Çavuşoglu and Hande Alemdar and Ertan Onur},
doi = {10.1109/SIU49456.2020.9302098},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
booktitle = {2020 28th Signal Processing and Communications Applications Conference (SIU)},
pages = {1-4},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
43.
Farnaz Hassanzadeh; Onur
Content Placement Problem in a Hierarchical Collaborative Caching method for 5G networks (CPP-HCC) Proceedings Article
In: 2020 16th International Conference on Network and Service Management (CNSM), pp. 1-7, 2020.
@inproceedings{9269047,
title = {Content Placement Problem in a Hierarchical Collaborative Caching method for 5G networks (CPP-HCC)},
author = {Farnaz Hassanzadeh and Onur},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
booktitle = {2020 16th International Conference on Network and Service Management (CNSM)},
pages = {1-7},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
42.
Goksel Simsek; Hakan Bostan; Alper Kaan Sarica; Egemen Sarikaya; Alperen Keles; Pelin Angin; Hande Alemdar; Ertan Onur
DroPPPP: A P4 Approach to Mitigating DoS Attacks in SDN Proceedings Article
In: Information Security Applications: 20th International Conference, WISA 2019, Jeju Island, South Korea, August 21--24, 2019, Revised Selected Papers, pp. 55, Springer Nature 2020.
@inproceedings{keles2020dropppp,
title = {DroPPPP: A P4 Approach to Mitigating DoS Attacks in SDN},
author = {Goksel Simsek and Hakan Bostan and Alper Kaan Sarica and Egemen Sarikaya and Alperen Keles and Pelin Angin and Hande Alemdar and Ertan Onur},
url = {https://link.springer.com/chapter/10.1007/978-3-030-39303-8_5},
doi = {10.1007/978-3-030-39303-8_5},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
booktitle = {Information Security Applications: 20th International Conference, WISA 2019, Jeju Island, South Korea, August 21--24, 2019, Revised Selected Papers},
volume = {11897},
pages = {55},
organization = {Springer Nature},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
41.
Goksel Simsek; Hande Alemdar; Ertan Onur
Multi-Connectivity Enabled User Association Proceedings Article
In: 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1–6, IEEE 2019.
@inproceedings{simsek2019multi,
title = {Multi-Connectivity Enabled User Association},
author = {Goksel Simsek and Hande Alemdar and Ertan Onur},
year = {2019},
date = {2019-07-02},
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}
}
40.
Doğanalp Ergenç; Ertan Onur
iSDR: SDR-in-the-loop Simulation Proceedings Article
In: IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1037–1038, IEEE 2019.
@inproceedings{ergencc2019isdr,
title = {iSDR: SDR-in-the-loop Simulation},
author = {Do{ğ}analp Ergen{ç} and Ertan Onur},
year = {2019},
date = {2019-05-01},
booktitle = {IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)},
pages = {1037--1038},
organization = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
39.
Cavit Kara; Ertan Onur
A Software-defined Network Based Lightweight Cluster Proceedings Article
In: Proc. of the IEEE Signal Processing and Communication Applications (SIU), İzmir, Turkey, 2018.
@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}
}
38.
Shahram Mollahasani; Ertan Onur
Density-Aware Power Allocation in Mobile Networks Using Edge Computing Proceedings Article
In: İzmir, Turkey, 2018.
@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}
}
37.
Alperen Eroglu; Ertan Onur; Mehmet Turan
Density-aware Outage in Clustered Ad Hoc Networks Proceedings Article
In: NTMS'2018 - Mobility & Wireless Networks Track (NTMS 2018 Mobility & Wireless Track), Paris, France, 2018.
@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}
}
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.
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.
36.
Okan Yaman; Alperen Eroglu; Ertan Onur
Density-aware Cell Zooming Proceedings Article
In: 2018 21st Conference on Innovation in Clouds, Internet and Networks (ICIN) (ICIN 2018), Paris, France, 2018.
@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}
}
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.
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.
35.
Doğanalp Ergenç; Levent Eksert; Ertan Onur
Density-aware Probabilistic Clustering in Ad hoc Networks Proceedings Article
In: 2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) (IEEE BlackSeaCom 2018), Batumi, Georgia, 2018.
@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}
}
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.
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.
34.
Doganalp Ergenc; Ertan Onur
Cross-layer Stack Design Framework in OMNeT++ Proceedings Article
In: 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.
@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}
}
33.
Mert Çalık; Shahram Mollahasani; Ertan Onur
Density-aware Joint Optimization of Cell Scheduling and User Association Proceedings Article
In: IEEE WCNC FLEXNETS 2018, Paris, France, 2018.
@inproceedings{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},
urldate = {2018-01-01},
booktitle = {IEEE WCNC FLEXNETS 2018},
address = {Paris, France},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
32.
Adnan Kılıç; Cansu Betin Onur; Ertan Onur
Revisiting Shamir's No-key Protocol: Lightweight Key Transport Proceedings Article
In: 15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC), Orlando Florida, 2017.
@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},
urldate = {2017-11-10},
booktitle = {15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC)},
address = {Orlando Florida},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
31.
Talha Koruk; Ertan Onur
Bio-inspired Bandwidth Packing Proceedings Article
In: Proc. of the IEEE Consumer Communications & Networking Conference (CCNC), IEEE, Las Vegas, Nevada, 2017.
@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 = {published},
tppubtype = {inproceedings}
}
30.
Can Mehteroğlu; Ertan Onur
Semantic Edge Caching and Prefetching in 5G Proceedings Article
In: Proc. of the IEEE Consumer Communications & Networking Conference (CCNC), IEEE Las Vegas, Nevada, 2017.
@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 = {published},
tppubtype = {inproceedings}
}
29.
Shaharam Mollahasani; Ertan Onur
Evaluation of Terahertz Channel in Data Centers Proceedings Article
In: NOMS 2016 (), Istanbul, Turkey, 2016.
@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}
}
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.
28.
Seyyit Ali Sert; Ertan Onur; Adnan Yazıcı
Security attacks and countermeasures in Surveillance Wireless Sensor Networks Proceedings Article
In: Application of Information and Communication Technologies (AICT), 2015 9th International Conference on, pp. 201-205, 2015.
@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},
urldate = {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}
}
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.
27.
Alperen Eroglu; Ertan Onur; Halit Oguztuzun
Estimating density of wireless networks in practice Proceedings Article
In: Personal, Indoor, and Mobile Radio Communications (PIMRC), 2015 IEEE 26th Annual International Symposium on, pp. 1476-1480, 2015.
@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}
}
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.
26.
Yunus Durmus; Andreas Loukas; Ertan Onur; Koen Langendoen
Sybil-Resistant Meta Strategies for the Forwarder's Dilemma Proceedings Article
In: Proc. of the IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 90-99, 2014.
@inproceedings{7001004,
title = {Sybil-Resistant Meta Strategies for the Forwarder's Dilemma},
author = {Yunus Durmus and Andreas Loukas and Ertan Onur and Koen Langendoen},
doi = {10.1109/SASO.2014.21},
year = {2014},
date = {2014-09-01},
urldate = {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}
}
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.
25.
T Islam; Yongchang Hu; E Onur; B Boltjes; J F C M de Jongh
Realistic simulation of IEEE 802.11p channel in mobile Vehicle to Vehicle communication Proceedings Article
In: Proc. of the IEEE Conference on Microwave Techniques (COMITE), pp. 156-161, 2013.
@inproceedings{Islam2013,
title = {Realistic simulation of IEEE 802.11p channel in mobile Vehicle to Vehicle communication},
author = {T Islam and Yongchang Hu and E Onur and B Boltjes and J F C M de Jongh},
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}
}
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.
24.
Arash Khatibi; Yunus Durmus; Ertan Onur; Ignas Niemegeers
Event-Driven MAC Protocol for Dual-Radio Cooperation Proceedings Article
In: Proc. of the IEEE Vehicular Technology Conference (VTC Fall), pp. 1-5, 2012, ISSN: 1090-3038.
@inproceedings{khatibi2012,
title = {Event-Driven MAC Protocol for Dual-Radio Cooperation},
author = {Arash Khatibi and Yunus Durmus and Ertan Onur and Ignas Niemegeers},
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}
}
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.
23.
Yunus Durmus; Ertan Onur
Imitation as the simplest strategy for cooperation Proceedings Article
In: Proc. of the IEEE 23rd International Symposium on Personal Indoor and Mobile Radio Communications, pp. 863-869, 2012, ISSN: 2166-9570.
@inproceedings{6362905,
title = {Imitation as the simplest strategy for cooperation},
author = {Yunus Durmus and Ertan Onur},
doi = {10.1109/PIMRC.2012.6362905},
issn = {2166-9570},
year = {2012},
date = {2012-09-01},
urldate = {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}
}
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.
22.
Mihai Marius Constantinescu; Ertan Onur; Harry Bouwman; Miodrag Djurica; Mark De Reuver; Yunus Durmus
Cooperative Networks: The Mobile Tethering Game Proceedings Article
In: 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.
@inproceedings{Constantinescu2012,
title = {Cooperative Networks: The Mobile Tethering Game},
author = {Mihai Marius Constantinescu and Ertan Onur and Harry Bouwman and Miodrag Djurica and Mark De Reuver and Yunus Durmus},
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}
}
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.
21.
Gencay Mutlu Olcer; Zulkuf Genc; Ertan Onur
Smart neighbor scanning with directional antennas in 60 GHz indoor networks Proceedings Article
In: Proc. of the IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), pp. 2393-2398, 2010.
@inproceedings{Olcer2010,
title = {Smart neighbor scanning with directional antennas in 60 GHz indoor networks},
author = {Gencay Mutlu Olcer and Zulkuf Genc and Ertan Onur},
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}
}
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.
20.
Javad Vazifehdan; Ranga Rao Venkatesha Prasad; Ertan Onur; Ignas Niemegeers
Energy-aware routing in wireless ad hoc networks with mains-powered nodes Proceedings Article
In: Future Network and Mobile Summit, 2010, pp. 1-12, 2010.
@inproceedings{5722377,
title = {Energy-aware routing in wireless ad hoc networks with mains-powered nodes},
author = {Javad Vazifehdan and Ranga Rao Venkatesha Prasad and Ertan Onur and Ignas Niemegeers},
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}
}
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.
19.
Zulkuf Genc; Gencay Mutlu Olcer; Ertan Onur; Ignas Niemegeers
Improving 60 GHz Indoor Connectivity with Relaying Proceedings Article
In: Proc. of the IEEE International Conference on Communications, pp. 1-6, 2010, ISSN: 1550-3607.
@inproceedings{5502707,
title = {Improving 60 GHz Indoor Connectivity with Relaying},
author = {Zulkuf Genc and Gencay Mutlu Olcer and Ertan Onur and Ignas Niemegeers},
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}
}
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.
18.
Zulkuf Genc; Umar Hasan Rizvi; Ertan Onur; Ignas Niemegeers
Robust 60 GHz Indoor Connectivity: Is It Possible with Reflections? Proceedings Article
In: Proc. of the 2010 IEEE 71st Vehicular Technology Conference (VTC 2010-Spring), pp. 1-5, 2010, ISSN: 1550-2252.
@inproceedings{5493722,
title = {Robust 60 GHz Indoor Connectivity: Is It Possible with Reflections?},
author = {Zulkuf Genc and Umar Hasan Rizvi and Ertan Onur and Ignas Niemegeers},
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}
}
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.
17.
Javad Vazifehdan; Ertan Onur; Ignas Niemegeers
On the resilience of personal networks Proceedings Article
In: Proc. of the 2010 5th IEEE International Symposium on Wireless Pervasive Computing (ISWPC), pp. 198-203, 2010.
@inproceedings{5483758,
title = {On the resilience of personal networks},
author = {Javad Vazifehdan and Ertan Onur and Ignas Niemegeers},
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}
}
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.
16.
Ertan Onur; E Sfakianakis; C Papagianni; G Karagiannis; T Kontos; I Niemegeers; I P Chochliouros; S H de Groot; P Sjodin; M Hidell; T Cinkler; M Maliosz; D I Kaklamani; J Carapinha; M Belesioti; E Fytros
Intelligent End-To-End Resource Virtualization Using Service Oriented Architecture Proceedings Article
In: Proc. of the 2009 IEEE GLOBECOM Workshops, pp. 1-6, 2009.
@inproceedings{5360701,
title = {Intelligent End-To-End Resource Virtualization Using Service Oriented Architecture},
author = {Ertan Onur and E Sfakianakis and C Papagianni and G Karagiannis and T Kontos and I Niemegeers and I P Chochliouros and S H de Groot and P Sjodin and M Hidell and T Cinkler and M Maliosz and D I Kaklamani and J Carapinha and M Belesioti and E Fytros},
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}
}
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.
15.
Jinglong Zhou; Ertan Onur; Martin Jacobsson; Ignas Nietnegeers
On the smoothing factor for rate adaptation in IEEE 802.11b/g mobile multi-hop networks Proceedings Article
In: Proc. of the IEEE 17th Signal Processing and Communications Applications Conference, pp. 237-240, 2009.
@inproceedings{5136376,
title = {On the smoothing factor for rate adaptation in IEEE 802.11b/g mobile multi-hop networks},
author = {Jinglong Zhou and Ertan Onur and Martin Jacobsson and Ignas Nietnegeers},
doi = {10.1109/SIU.2009.5136376},
year = {2009},
date = {2009-04-01},
booktitle = {Proc. of the IEEE 17th Signal Processing and Communications Applications Conference},
pages = {237-240},
abstract = {IEEE 802.11b/g networks support multiple rates and rate adaptation mechanisms provide the ability to select the adequate rate intelligently. Prior work on the rate-adaptation focuses on stationary scenarios, such as mesh networks. The effect of the smoothing of the rate adaptation is not a well-studied topic in the mobile scenarios such as IEEE 802.11 multi-hop networks. In this paper, we use an experimental method to evaluate the one-hop performance and the routing decisions of a well-known rate adaptation mechanism referred as the SampleRate algorithm. In the experiments, the impact of the smoothing factor on the rate adaptation is analyzed based on throughput comparison. Smaller smoothing factors lead to larger throughput improvement and faster response when the channel is dynamic.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
IEEE 802.11b/g networks support multiple rates and rate adaptation mechanisms provide the ability to select the adequate rate intelligently. Prior work on the rate-adaptation focuses on stationary scenarios, such as mesh networks. The effect of the smoothing of the rate adaptation is not a well-studied topic in the mobile scenarios such as IEEE 802.11 multi-hop networks. In this paper, we use an experimental method to evaluate the one-hop performance and the routing decisions of a well-known rate adaptation mechanism referred as the SampleRate algorithm. In the experiments, the impact of the smoothing factor on the rate adaptation is analyzed based on throughput comparison. Smaller smoothing factors lead to larger throughput improvement and faster response when the channel is dynamic.
14.
Rabun Kosar; Ertan Onur; Cem Ersoy
Redeployment Based Sensing Hole Mitigation in Wireless Sensor Networks Proceedings Article
In: Proc. of the IEEE Wireless Communications and Networking Conference, pp. 1-6, 2009, ISSN: 1525-3511.
@inproceedings{4917938,
title = {Redeployment Based Sensing Hole Mitigation in Wireless Sensor Networks},
author = {Rabun Kosar and Ertan Onur and Cem Ersoy},
doi = {10.1109/WCNC.2009.4917938},
issn = {1525-3511},
year = {2009},
date = {2009-04-01},
booktitle = {Proc. of the IEEE Wireless Communications and Networking Conference},
pages = {1-6},
abstract = {Environmental factors such as unavoidable physical constraints, intentional destruction of the sensors or asymmetric load distribution will lead to formation of holes in the wireless sensor networks. Holes hinder the operational quality of the network, where earlier formations have higher impact. In this paper, we study the sensing hole problem and propose a redeployment method to mitigate it. Image processing algorithms are used for identifying the sensing holes. A portion of the sensors are kept as spare; after identifying the holes, they are redeployed over the holes. The results indicate that the method leads to a considerable increase on the sustainable sensing quality of the network.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Environmental factors such as unavoidable physical constraints, intentional destruction of the sensors or asymmetric load distribution will lead to formation of holes in the wireless sensor networks. Holes hinder the operational quality of the network, where earlier formations have higher impact. In this paper, we study the sensing hole problem and propose a redeployment method to mitigate it. Image processing algorithms are used for identifying the sensing holes. A portion of the sensors are kept as spare; after identifying the holes, they are redeployed over the holes. The results indicate that the method leads to a considerable increase on the sustainable sensing quality of the network.
13.
Jinglong Zhou; Martin Jacobsson; Ertan Onur; Ignas Niemegeers
A Novel Link Quality Assessment Method for Mobile Multi-Rate Multi-Hop Wireless Networks Proceedings Article
In: Proc. of the 6th IEEE Consumer Communications and Networking Conference, pp. 1-5, (Best Student Paper), 2009.
@inproceedings{4784751,
title = {A Novel Link Quality Assessment Method for Mobile Multi-Rate Multi-Hop Wireless Networks},
author = {Jinglong Zhou and Martin Jacobsson and Ertan Onur and Ignas Niemegeers},
doi = {10.1109/CCNC.2009.4784751},
year = {2009},
date = {2009-01-01},
booktitle = {Proc. of the 6th IEEE Consumer Communications and Networking Conference},
pages = {1-5},
publisher = {(Best Student Paper)},
abstract = {Accurate and fast wireless link quality assessment (LQA) for wireless channels would bring huge benefits for mobile multi-hop and multi-rate wireless ad hoc and sensor networks in the form of improved end-to-end performance. In this paper, we propose a novel LQA method based on cross-layer information. The method is implemented in a real test-bed, which is based on IEEE 802.11b/g, and achieved a significant LQA improvement up to 50% in mobile scenarios without introducing overhead. The effectiveness of accurate and fast LQA is demonstrated by feeding it into the routing layer to enable the route decisions to adapt faster during changing situations, especially in mobile scenarios. The experiment results show that the proposed LQA method can lead to faster and smarter routing decisions and higher end-to-end throughput compared to traditional methods, which only use hello packets to determine the link quality in mobile scenario.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Accurate and fast wireless link quality assessment (LQA) for wireless channels would bring huge benefits for mobile multi-hop and multi-rate wireless ad hoc and sensor networks in the form of improved end-to-end performance. In this paper, we propose a novel LQA method based on cross-layer information. The method is implemented in a real test-bed, which is based on IEEE 802.11b/g, and achieved a significant LQA improvement up to 50% in mobile scenarios without introducing overhead. The effectiveness of accurate and fast LQA is demonstrated by feeding it into the routing layer to enable the route decisions to adapt faster during changing situations, especially in mobile scenarios. The experiment results show that the proposed LQA method can lead to faster and smarter routing decisions and higher end-to-end throughput compared to traditional methods, which only use hello packets to determine the link quality in mobile scenario.
12.
Ertan Onur; Cem Ersoy; Hakan Delic
Temporal Resilience of Deployment Quality in Surveillance Wireless Sensor Networks Proceedings Article
In: Proc. of the IEEE Wireless Communications and Networking Conference, pp. 3291-3296, 2008, ISSN: 1525-3511.
@inproceedings{4489605,
title = {Temporal Resilience of Deployment Quality in Surveillance Wireless Sensor Networks},
author = {Ertan Onur and Cem Ersoy and Hakan Delic},
doi = {10.1109/WCNC.2008.574},
issn = {1525-3511},
year = {2008},
date = {2008-03-01},
booktitle = {Proc. of the IEEE Wireless Communications and Networking Conference},
pages = {3291-3296},
abstract = {The network lifetime measures for wireless sensor networks are mostly based on the percentage of live sensors. However, the lifetime definition must be in accordance with the primary functionality of the network. In surveillance applications, the network must be regarded as dead if the required security level cannot be provisioned. In this paper, we analyze the temporal resilience of deployment quality in surveillance wireless sensor networks and propose several lifetime definitions. It is concluded that having just the necessary number of sensors to satisfy the initial deployment quality requirement is the best strategy to favor the network lifetime.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The network lifetime measures for wireless sensor networks are mostly based on the percentage of live sensors. However, the lifetime definition must be in accordance with the primary functionality of the network. In surveillance applications, the network must be regarded as dead if the required security level cannot be provisioned. In this paper, we analyze the temporal resilience of deployment quality in surveillance wireless sensor networks and propose several lifetime definitions. It is concluded that having just the necessary number of sensors to satisfy the initial deployment quality requirement is the best strategy to favor the network lifetime.
11.
Ertan Onur; Cem Ersoy; Hakan Delic; Lale Akarun
Coverage in Sensor Networks When Obstacles Are Present Proceedings Article
In: Proc. of the IEEE International Conference on Communications, pp. 4077-4082, 2006, ISSN: 8164-9547.
@inproceedings{4025121,
title = {Coverage in Sensor Networks When Obstacles Are Present},
author = {Ertan Onur and Cem Ersoy and Hakan Delic and Lale Akarun},
doi = {10.1109/ICC.2006.255719},
issn = {8164-9547},
year = {2006},
date = {2006-06-01},
booktitle = {Proc. of the IEEE International Conference on Communications},
volume = {9},
pages = {4077-4082},
abstract = {In this paper, we propose a method to determine the quality of deployment in a surveillance wireless sensor network in an environment that contains obstacles. The maximum detection probability on the potential breach paths is used as the deployment quality measure. The watershed segmentation algorithm is applied on the graph formed by the iso-sensing curves 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.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we propose a method to determine the quality of deployment in a surveillance wireless sensor network in an environment that contains obstacles. The maximum detection probability on the potential breach paths is used as the deployment quality measure. The watershed segmentation algorithm is applied on the graph formed by the iso-sensing curves 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.
10.
Ertan Onur; Cem Ersoy; Hakan Delic
On the quality of deployment in wireless sensor networks Proceedings Article
In: Proc. of the 8th International Conference on Telecommunications, pp. 547-551, 2005.
@inproceedings{1458629,
title = {On the quality of deployment in wireless sensor networks},
author = {Ertan Onur and Cem Ersoy and Hakan Delic},
doi = {10.1109/CONTEL.2005.185950},
year = {2005},
date = {2005-06-01},
booktitle = {Proc. of the 8th International Conference on Telecommunications},
volume = {2},
pages = {547-551},
abstract = {Not Available},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Not Available
9.
Ertan Onur; Cem Ersoy; Hakan Delic
Finding sensing coverage and breach paths in surveillance wireless sensor networks Proceedings Article
In: Proc. of the 15th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, pp. 984-988 Vol.2, 2004.
@inproceedings{1373846,
title = {Finding sensing coverage and breach paths in surveillance wireless sensor networks},
author = {Ertan Onur and Cem Ersoy and Hakan Delic},
url = {http://eonur.ceng.metu.edu.tr/wordpress/wp-content/uploads/2015/05/01373846.pdf},
doi = {10.1109/PIMRC.2004.1373846},
year = {2004},
date = {2004-09-01},
booktitle = {Proc. of the 15th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications},
volume = {2},
pages = {984-988 Vol.2},
abstract = {The sensing coverage area of surveillance wireless sensor networks, which is determined by applying the Neyman-Pearson detection rule, is considered. Using a graph model for the perimeter, the weakest breach path is found through Dijkstra's shortest path algorithm. The breach probability is a critical parameter for assessing the required number of sensor nodes and the surveillance performance of the network. Analysis indicates that for the Neyman-Pearson detection model, the most significant parameter is the false alarm rate, which is inversely proportional to the breach probability. Furthermore, the width of the field has a significant impact on the breach probability.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The sensing coverage area of surveillance wireless sensor networks, which is determined by applying the Neyman-Pearson detection rule, is considered. Using a graph model for the perimeter, the weakest breach path is found through Dijkstra's shortest path algorithm. The breach probability is a critical parameter for assessing the required number of sensor nodes and the surveillance performance of the network. Analysis indicates that for the Neyman-Pearson detection model, the most significant parameter is the false alarm rate, which is inversely proportional to the breach probability. Furthermore, the width of the field has a significant impact on the breach probability.
Patents
8.
Seyhan Civanlar; Hanife Senol; Tulay Sazak; Can Ozpak; Esra Ozlem Sakar; Can Ozumuztoprak; Burak Gorkemli; Adnan Burak Gurdag; Ertan Onur; Erhan Lokman; Altug Simsek; Gurkan Gur; Aziz Sever
SIP2 Mobile gateway Patent
US7254137, 2007.
@patent{sip2mobile,
title = {SIP2 Mobile gateway},
author = {Seyhan Civanlar and Hanife Senol and Tulay Sazak and Can Ozpak and Esra Ozlem Sakar and Can Ozumuztoprak and Burak Gorkemli and Adnan Burak Gurdag and Ertan Onur and Erhan Lokman and Altug Simsek and Gurkan Gur and Aziz Sever},
url = {http://www.google.com.tr/patents/US7254137},
year = {2007},
date = {2007-08-07},
number = {US7254137},
institution = {US Patent},
keywords = {},
pubstate = {published},
tppubtype = {patent}
}
Technical Reports
7.
PN Editing Group
Personal Networks (PNs) - Overview and Standardisation Needs Technical Report
Ecma International no. tc32-pnf-2010-021, 2010.
@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}
}
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.
6.
Ertan Onur; et al.
eHealth architecture; user service models and application classification into service models Technical Report
ETSI STF 355 no. TR 102 764, 2008.
@techreport{ETSI2008,
title = {eHealth architecture; user service models and application classification into service models},
author = {Ertan Onur and et al.},
url = {http://webapp.etsi.org/WorkProgram/Report_WorkItem.asp?WKI_ID=27268},
year = {2008},
date = {2008-01-01},
number = {TR 102 764},
institution = {ETSI STF 355},
abstract = {This work is an initial step in developing eHealth user service models. These models address interoperable solutions for healthcare data collection, transmission, storage and interchange with the required security, privacy and reliability. The next step of this work will be to develop requirements and service architecture to provide improved eHealth services involving the relevant stakeholders, including users, medical professionals etc. eHealth systems contribute to user ubiquitous access to more cost effective healthcare services irrespective to location.},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
This work is an initial step in developing eHealth user service models. These models address interoperable solutions for healthcare data collection, transmission, storage and interchange with the required security, privacy and reliability. The next step of this work will be to develop requirements and service architecture to provide improved eHealth services involving the relevant stakeholders, including users, medical professionals etc. eHealth systems contribute to user ubiquitous access to more cost effective healthcare services irrespective to location.
Workshops
5.
Ranga Rao Venkatesha Prasad; Ertan Onur; Yunus Durmus; Abdurrahim Biswas; Ignas Niemegeers
Approximate service provisioning in an invisible network of the future Workshop
2011.
@workshop{PrasadWWRF,
title = {Approximate service provisioning in an invisible network of the future},
author = {Ranga Rao Venkatesha Prasad and Ertan Onur and Yunus Durmus and Abdurrahim Biswas and Ignas Niemegeers},
year = {2011},
date = {2011-11-01},
howpublished = {27th Meeting of Wireless World Research Forum},
keywords = {},
pubstate = {published},
tppubtype = {workshop}
}
4.
Santiago Alvarez; Zulkuf Genc; Ertan Onur
Cognitive engine for neighbor discovery scheduling in 60 GHz home networks Workshop
2010.
@workshop{Alvarez2010,
title = {Cognitive engine for neighbor discovery scheduling in 60 GHz home networks},
author = {Santiago Alvarez and Zulkuf Genc and Ertan Onur},
year = {2010},
date = {2010-05-01},
howpublished = {Proc. of the WIC Symposium on Information Theory in the Benelux},
keywords = {},
pubstate = {published},
tppubtype = {workshop}
}
3.
Ertan Onur; Sonia Marcela Heemstra de Groot; Ignas Niemegeers
Manageable bubbles of the future Internet: personal virtual super devices Workshop
2008.
@workshop{wWRD08,
title = {Manageable bubbles of the future Internet: personal virtual super devices},
author = {Ertan Onur and Sonia Marcela Heemstra de Groot and Ignas Niemegeers},
year = {2008},
date = {2008-11-01},
howpublished = {21st Meeting of Wireless World Research Forum},
keywords = {},
pubstate = {published},
tppubtype = {workshop}
}
2.
Zhou Jinglong; Martin Jacobsson; Ertan Onur; Ignas Niemegeers
Factors that impact link quality estimation in personal networks Workshop
2008.
@workshop{Zhou2008,
title = {Factors that impact link quality estimation in personal networks},
author = {Zhou Jinglong and Martin Jacobsson and Ertan Onur and Ignas Niemegeers},
year = {2008},
date = {2008-06-01},
howpublished = {Proc. of the 8th International Symposium On Computer Networks},
keywords = {},
pubstate = {published},
tppubtype = {workshop}
}
1.
Rabun Kosar; Ertan Onur; Cem Ersoy
Energy hole problem in nonuniform deployments of wireless sensor networks Workshop
2008.
@workshop{Kosar2008,
title = {Energy hole problem in nonuniform deployments of wireless sensor networks},
author = {Rabun Kosar and Ertan Onur and Cem Ersoy},
year = {2008},
date = {2008-01-01},
howpublished = {Akademik Bilisim, Canakkale, Turkey},
keywords = {},
pubstate = {published},
tppubtype = {workshop}
}
SECURITY
Journal Articles
12.
PATS: Let Parties Have a Say in Threshold Group Key Sharing Journal Article
In: vol. IET Information Security, no. 2024, pp. 1, 2024.
@article{kilicc2024pats,
title = {PATS: Let Parties Have a Say in Threshold Group Key Sharing},
year = {2024},
date = {2024-06-09},
volume = {IET Information Security},
number = {2024},
pages = {1},
publisher = {2024},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
11.
Hüsnü Yıldız; Murat Cenk; Ertan Onur
PLGAKD: A PUF-based Lightweight Group Authentication and Key Distribution Protocol Journal Article
In: IEEE Internet of Things Journal, pp. 1-1, 2020, ISSN: 2327-4662.
@article{9234522,
title = {PLGAKD: A PUF-based Lightweight Group Authentication and Key Distribution Protocol},
author = {Hüsnü Yıldız and Murat Cenk and Ertan Onur},
doi = {10.1109/JIOT.2020.3032757},
issn = {2327-4662},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
journal = {IEEE Internet of Things Journal},
pages = {1-1},
abstract = {Securing Internet of Things (IoT) applications that collect and transport sensitive data by guaranteeing authenticity, integrity, and confidentiality is a critical challenge. Reducing computation and communication overhead of security functions is also a key concern since a large number of constrained devices may take place in such applications. Our main focus in this paper is group authentication and key management in IoT. The existing group authentication and key management protocols in the literature perform computations using asymmetric ciphers, which costly for IoT. Therefore, applications generally employ simple security primitives that are prone to or lead to cyber-attacks by using IoT devices. In this paper, we propose a physically unclonable function (PUF) based lightweight group authentication and key distribution (PLGAKD) protocol that employs PUF, factorial tree, and the Chinese Remainder Theorem (CRT). In PLGAKD, PUF facilitates lightweight authentication and key distribution for group members. Each group member performs 2 encryptions, 1 decryption, 4 XORs operations, and 3 HMAC operations. For the key renewal process, the factorial tree and CRT help us reduce the number of keys stored in nodes and the number of communication messages contrary to the binary tree. As an example, a binary tree with 4096 members completes the key renewal process with 12 messages by storing 12 keys. However, the PLGAKD protocol with 5040 members completes this process with 6 messages by storing 7 keys. Moreover, the PLGAKD protocol becomes more efficient in parallel with the increase in the number of members.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Securing Internet of Things (IoT) applications that collect and transport sensitive data by guaranteeing authenticity, integrity, and confidentiality is a critical challenge. Reducing computation and communication overhead of security functions is also a key concern since a large number of constrained devices may take place in such applications. Our main focus in this paper is group authentication and key management in IoT. The existing group authentication and key management protocols in the literature perform computations using asymmetric ciphers, which costly for IoT. Therefore, applications generally employ simple security primitives that are prone to or lead to cyber-attacks by using IoT devices. In this paper, we propose a physically unclonable function (PUF) based lightweight group authentication and key distribution (PLGAKD) protocol that employs PUF, factorial tree, and the Chinese Remainder Theorem (CRT). In PLGAKD, PUF facilitates lightweight authentication and key distribution for group members. Each group member performs 2 encryptions, 1 decryption, 4 XORs operations, and 3 HMAC operations. For the key renewal process, the factorial tree and CRT help us reduce the number of keys stored in nodes and the number of communication messages contrary to the binary tree. As an example, a binary tree with 4096 members completes the key renewal process with 12 messages by storing 12 keys. However, the PLGAKD protocol with 5040 members completes this process with 6 messages by storing 7 keys. Moreover, the PLGAKD protocol becomes more efficient in parallel with the increase in the number of members.
Book Chapters
10.
Ahmed Demirpolat; Doğanalp Ergenç; Esref Ozturk; Yusuf Ayar; Ertan Onur
Software-Defined Network Security Book Chapter
In: Enabling Technologies and Architectures for Next-Generation Networking Capabilities, pp. 232–253, IGI Global, 2018.
@inbook{demirpolat2019software,
title = {Software-Defined Network Security},
author = {Ahmed Demirpolat and Do{ğ}analp Ergen{ç} and Esref Ozturk and Yusuf Ayar and Ertan Onur},
year = {2018},
date = {2018-01-01},
urldate = {2018-01-01},
booktitle = {Enabling Technologies and Architectures for Next-Generation Networking Capabilities},
pages = {232--253},
publisher = {IGI Global},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
9.
Hüsnü Yıldız; Adnan Kılıç; Ertan Onur
Lightweight Cryptography in 5G Machine-type Communication Book Chapter
In: Elkhodr, Mahmoud; Hassan, Qusay; Shahrestani, Seyed (Ed.): Chapman and Hall/CRC, Networks of the Future: Architectures, Technologies, and Implementations, 2017, ISBN: 9781498783972.
@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},
urldate = {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 = {published},
tppubtype = {inbook}
}
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.
Proceedings Articles
8.
Berker Acir; Ertan Onur; Cansu Betin Onur
Finding Islands on Encrypted Graphs Proceedings Article
In: 2023 31st Signal Processing and Communications Applications Conference (SIU), 2023 2023.
@inproceedings{acir2023findingb,
title = {Finding Islands on Encrypted Graphs},
author = {Berker Acir and Ertan Onur and Cansu Betin Onur},
year = {2023},
date = {2023-07-05},
urldate = {2023-07-05},
booktitle = {2023 31st Signal Processing and Communications Applications Conference (SIU)},
organization = {2023},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
7.
Doruk Gerçel; Helin Kayabaş; Kadir Ekmekçi; Cansu Betin Onur; Ertan Onur
Performance of Graph-based Zero-knowledge Proofs Proceedings Article
In: 2022 30th Signal Processing and Communications Applications Conference (SIU), pp. 1-4, 2022.
@inproceedings{9864952,
title = {Performance of Graph-based Zero-knowledge Proofs},
author = {Doruk Gerçel and Helin Kayabaş and Kadir Ekmekçi and Cansu Betin Onur and Ertan Onur},
doi = {10.1109/SIU55565.2022.9864952},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
booktitle = {2022 30th Signal Processing and Communications Applications Conference (SIU)},
pages = {1-4},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
6.
Gamze Çavuşoglu; Hande Alemdar; Ertan Onur
Covert Channel Detection Using Machine Learning Proceedings Article
In: 2020 28th Signal Processing and Communications Applications Conference (SIU), pp. 1-4, 2020.
@inproceedings{9302098,
title = {Covert Channel Detection Using Machine Learning},
author = {Gamze Çavuşoglu and Hande Alemdar and Ertan Onur},
doi = {10.1109/SIU49456.2020.9302098},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
booktitle = {2020 28th Signal Processing and Communications Applications Conference (SIU)},
pages = {1-4},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
5.
Goksel Simsek; Hakan Bostan; Alper Kaan Sarica; Egemen Sarikaya; Alperen Keles; Pelin Angin; Hande Alemdar; Ertan Onur
DroPPPP: A P4 Approach to Mitigating DoS Attacks in SDN Proceedings Article
In: Information Security Applications: 20th International Conference, WISA 2019, Jeju Island, South Korea, August 21--24, 2019, Revised Selected Papers, pp. 55, Springer Nature 2020.
@inproceedings{keles2020dropppp,
title = {DroPPPP: A P4 Approach to Mitigating DoS Attacks in SDN},
author = {Goksel Simsek and Hakan Bostan and Alper Kaan Sarica and Egemen Sarikaya and Alperen Keles and Pelin Angin and Hande Alemdar and Ertan Onur},
url = {https://link.springer.com/chapter/10.1007/978-3-030-39303-8_5},
doi = {10.1007/978-3-030-39303-8_5},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
booktitle = {Information Security Applications: 20th International Conference, WISA 2019, Jeju Island, South Korea, August 21--24, 2019, Revised Selected Papers},
volume = {11897},
pages = {55},
organization = {Springer Nature},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
4.
Adnan Kılıç; Cansu Betin Onur; Ertan Onur
Revisiting Shamir's No-key Protocol: Lightweight Key Transport Proceedings Article
In: 15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC), Orlando Florida, 2017.
@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},
urldate = {2017-11-10},
booktitle = {15th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC)},
address = {Orlando Florida},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
3.
Seyyit Ali Sert; Ertan Onur; Adnan Yazıcı
Security attacks and countermeasures in Surveillance Wireless Sensor Networks Proceedings Article
In: Application of Information and Communication Technologies (AICT), 2015 9th International Conference on, pp. 201-205, 2015.
@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},
urldate = {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}
}
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.
2.
Yunus Durmus; Andreas Loukas; Ertan Onur; Koen Langendoen
Sybil-Resistant Meta Strategies for the Forwarder's Dilemma Proceedings Article
In: Proc. of the IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 90-99, 2014.
@inproceedings{7001004,
title = {Sybil-Resistant Meta Strategies for the Forwarder's Dilemma},
author = {Yunus Durmus and Andreas Loukas and Ertan Onur and Koen Langendoen},
doi = {10.1109/SASO.2014.21},
year = {2014},
date = {2014-09-01},
urldate = {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}
}
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.
1.
Yunus Durmus; Ertan Onur
Imitation as the simplest strategy for cooperation Proceedings Article
In: Proc. of the IEEE 23rd International Symposium on Personal Indoor and Mobile Radio Communications, pp. 863-869, 2012, ISSN: 2166-9570.
@inproceedings{6362905,
title = {Imitation as the simplest strategy for cooperation},
author = {Yunus Durmus and Ertan Onur},
doi = {10.1109/PIMRC.2012.6362905},
issn = {2166-9570},
year = {2012},
date = {2012-09-01},
urldate = {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}
}
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.