Plane-separated routing in ad-hoc networks

2022-01-01
Ergenc, Doganalp
Onur, Ertan
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
104
views
72
downloads
Control and user (data) plane separation (CUPS) is a concept applied in various networking areas to scale network resources independently, increase the quality of service, and facilitate the autonomy of networks. In this study, we leverage this concept to design a plane-separated routing algorithm, CUPS-based hierarchical routing algorithm (CHRA), as an energy-efficient and low-latency end-to-end communication scheme for clustered ad-hoc networks. In CHRA, while cluster heads constitute the control plane to conduct network discovery and routing, ordinary nodes residing in the user plane forward packets according to the routing decisions taken by the control plane. Exploiting the CUPS, we avoid exhausting cluster heads by offloading packet-forwarding to ordinary nodes and improve the quality of service by utilizing alternative paths other than the backbone of cluster heads. Our simulation results show that CHRA offers a better quality of service in terms of end-to-end latency and data-to-all ratio, and promotes fairness in energy-consumption in both stationary and mobile scenarios.
Control and user plane separation, CUPS, Ad-hoc networks, Hierarchical routing, Clustering, SDN CONTROL, PROTOCOL
https://hdl.handle.net/11511/95371
WIRELESS NETWORKS
Department of Computer Engineering, Article

Suggestions

Control and user plane separation in AD-HOC Networks
Ergenç, Doğanalp; Onur, Ertan; Department of Computer Engineering (2018)
Separation of user (data) plane from control plane in networks helps scale resources independently, increase the quality of service and facilitate autonomy. In ad-hoc networks, the plane-separation through clustering introduces a hierarchy where control functions can be carried out by some designated cluster heads and other nodes perform according to the outcomes of those functions. Therefore, clustered topologies can be considered as a natural consequence of the control and user plane separation (CUPS). Mo...
Context-aware location recommendation by using a random walk-based approach
Bagci, Hakan; Karagöz, Pınar (2016-05-01)
The location-based social networks (LBSN) enable users to check in their current location and share it with other users. The accumulated check-in data can be employed for the benefit of users by providing personalized recommendations. In this paper, we propose a context-aware location recommendation system for LBSNs using a random walk approach. Our proposed approach considers the current context (i.e., current social relations, personal preferences and current location) of the user to provide personalized ...
Towards Usable Solutions to Graphical Password Hotspot Problem
BIÇAKCI, KEMAL; ATALAY, NART BEDİN; Yuceel, Mustafa; Gurbaslar, Hakan; Erdeniz, Burak (2009-07-24)
Click based graphical passwords that use background images suffer from hot-spot problem. Previous graphical password schemes based on recognition of images do not have a sufficiently large password space suited for most Internet applications. In this paper, we propose two novel graphical password methods based on recognition of icons to solve the hotspot problem without decreasing the password space. The experiment we have conducted that compares the security and usability of proposed methods with earlier w...
SLIDING-MODE CONTROL ALGORITHM DEVELOPMENT FOR ANTI-LOCK BRAKING SYSTEM
Okyay, Ahmet; Ciğeroğlu, Ender; BAŞLAMIŞLI, SELAHATTİN ÇAĞLAR (2010-07-24)
In this paper, a sliding mode control methodology is implemented for the ABS control problem. Tire-road adhesion coefficient is taken as an uncertain parameter within known limits. This allows designing a robust sliding mode controller which does not require utilization of road coefficient of adhesion information, which is difficult to measure. As an improvement over previous studies, the sliding plane is formed to include both integral and derivative terms of the slip ratio error rather than only one of th...
FORMATION PRESERVING NAVIGATION OF AGENT TEAMS IN 3-D TERRAINS
Bayrak, Ali Galip; Polat, Faruk (2008-06-11)
Navigation of a. group of autonomous agents dial are needed to maintain a. formation is a challenging task which has not been studied much in especially 3-D terrains. This paper presents a novel approach to collision free path finding of multiple agents preserving a predefined formation in a 3-D terrain. The proposed method could be used in many areas like navigation of semi-automated forces (SAF) at, unit level in military simulations kind lion player characters (NPC) in computer games. The proposed path f...
Citation Formats
D. Ergenc and E. Onur, “Plane-separated routing in ad-hoc networks,” WIRELESS NETWORKS, vol. 28, no. 1, pp. 331–353, 2022, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/95371.
METU IIS - Integrated Information Service open@metu.edu.tr