Browsing by Author "Onur, Ertan"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Conference Object Citation Count: 0Density-aware Outage in Clustered Ad Hoc Networks(Ieee, 2018) Eroglu, Alperen; Onur, Ertan; Turan, MehmetDensity 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. The accuracy of the estimator is impressive even under a high amount of distance measurement errors. We also propose a network outage model and a transmit power adaption technique that are density-aware. The results indicate the necessity of the density-aware solutions for making network performance better from capacity, coverage and energy conservation viewpoints.Conference Object Citation Count: 0Revisiting Shamir's No-key Protocol: Lightweight Key Transport(Ieee Computer Soc, 2017) Onur, Cansu Betin; Onur, Ertan; Onur, Cansu Betin; MathematicsKey-transport protocols, subclasses of key-establishment protocols, are employed to convey secret keys from a principal to another for establishing a security association. In this paper, we propose a lightweight, practicable, tweakable, energy-efficient, and secure key-transport protocol, suitable for wireless sensor networks (WSN), Internet of Things (IoT) and mobile networks. The proposed protocol is based on the Shamir's no-key protocol. Although Shamir's no-key protocol does not require any pre-shared secret between principals, we show that it is impossible to employ the no-key protocol over public commutative groups. We modify Diffie-Hellman key-agreement protocol to morph it into a key-transport protocol by applying a set of changes on the original protocol and it becomes possible to compare both protocols in terms of memory usage and total time to accomplish a single key transport. The experimental results show that the proposed key transport protocol perform faster than the modified Diffie-Hellman protocol, and the total time to transport a single key by using the modified Diffie-Hellman protocol grows drastically with the increase in key size.