scholarly journals Game Theory based Channel Assignment and Load balancing for Cognitive Radio Ad-hoc Networks

2019 ◽  
Vol 8 (3) ◽  
pp. 3716-3722
Keyword(s):  
Game Theory ◽  
Cognitive Radio ◽  
Load Balancing ◽  
Utility Function ◽  
Channel Assignment ◽  
Delivery Ratio ◽  
Channel Quality ◽  
Maximum Utility ◽  
End To End ◽  
Channel Availability

Though various works have been done for handling end-to-end congestion control in traditional wireless adhoc networks, they lead to abnormal delay in Cognitive Radio Networks (CRN) due to the extra delaycaused by PU activities. While assigning channels along the route towards destination, channel availability, channel quality and channel switching delay should be considered. In this paper, we propose a Game theory based Channel Assignment and Load balancing(GTCALB) technique for multicast routing for CRAHN. In this technique, a channel matrix is constructed for each link with probability of channel availability, delay cost and channel quality. Then Game theory model is applied for each link in which a utility function is derived for each channel. Then the link with minimum overload is selected with a channel having maximum utility function. The proposed GTCALB technique is applied for each route, during the multicast route discovery. By NS2 simulation, it is shown that the GTCALB technique reduces the end-to-end delay and increases the throughput and packet delivery ratio for the constructed multicast routes.

scholarly journals Analisis Kinerja GPSR dan AODV pada VANET dengan Skema Pengimbangan Beban Trafik

2018 ◽  
Vol 6 (2) ◽  
pp. 207
Author(s):  
RENDI DIAN PRASETIA ◽  
DOAN PERDANA ◽  
RIDHA MULDINA NEGARA
Keyword(s):  
Load Balancing ◽  
Routing Protocol ◽  
Mean Value ◽  
Packet Delivery Ratio ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Vehicle Traffic ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

ABSTRAKSalah satu permasalahan di kota-kota besar adalah kemacetan lalu lintas yang disebabkan karena tidak mencukupinya ruas jalan, volume kendaraan yang begitu besar, persebaran kendaraan yang tidak merata dan lain-lain. Salah satu solusinya adalah para pengendara dapat menggunakan aplikasi peta digital pada smartphone-nya. Oleh karena itu perlu dilakukan pengimbangan beban trafik kendaraan. Pada penelitian ini akan dibahas mengenai kinerja VANET yang menggunakan protokol routing GPSR dan AODV dengan skema pengimbangan beban trafik kendaraan dengan pengaruh kepadatan node. Perancangan sistem simulasi terbagi menjadi dua subsistem yaitu subsistem mobilitas dan jaringan. Kemudian dilakukan pengimbangan beban trafik kendaraan, dan kinerja VANET akan diamati. Performansi dievaluasi dengan average end to end delay, throughput, dan packet delivery ratio. Nilai rata-rata throughput, PDR, delay untuk GPSR adalah 142.21 Kbps, 87.47 %, dan 82.83 ms. Sedangkan AODV adalah 119.81 Kbps, 86.67 %, dan 103.21 ms. Dari hasil penelitian nilai QoS performansi dari routing protocol GPSR lebih baik dari pada AODV pada VANET.Kata kunci: Vanet, Pengimbangan Beban, GPSR, AODV.ABSTRACTOne of the problems in big cities is congestion. The congestion is caused byinsufficient road segment, large volume of vehicles, unbalanced spread ofvehicles and others. One solution is that riders can use digital map applications on their smartphones. Therefore it is necessary to balancing the traffic load of vehicles. In this research will be discussed about VANET performance using GPSR and AODV routing protocol with vehicle traffic load balancing scheme with node density influence. The design of the simulation system is divided into two subsystems namely mobility and network subsystem. Then balancing the vehicle traffic load, and VANET performance will be observed. Performance is evaluated with the average end to end delay, throughput, and packet delivery ratio. The mean value of throughput, PDR, delay for GPSR respectively 142.21 Kbps, 87.47%, and 82.83 ms. While AODV is 119.81 Kbps, 86.67%, and 103.21 ms. From the simulation results can be concluded that the performance of GPSR is better than AODV on VANET. Keywords: Vanet, Load Balancing, GPSR, AODV.

scholarly journals Design of utility functions for game-based channel allocation in cognitive radio wireless sensor network

2021 ◽  
Vol 22 (2) ◽  
pp. 1013
Author(s):  
Prativa Rai ◽  
Mrinal Kanti Ghose ◽  
Hiren Kumar Deva Sarma
Keyword(s):  
Game Theory ◽  
Cognitive Radio ◽  
Wireless Sensor Network ◽  
Utility Function ◽  
Sensor Network ◽  
Channel Allocation ◽  
High Growth ◽  
Utility Functions ◽  
Wireless Sensor ◽  
Allocation Algorithm

Cognitive radio enabled wireless sensor network is capable of reducing the spectrum scarcity problem of the wireless networks. Looking at the scarcity of available bandwidth, and the high growth in the number of communication devices in recent times, cognitive radio technology has proven to be a promising technology for the days to come. The application of Game Theory in cognitive radio networks has been visible in recent research works. However, only limited literature is available in which possibilities of applying the game-theory based approaches for the challenging task of channel assignment in cognitive radio wireless sensor are available in the literature. It is understood that the crux of the solution to the problem of scheming games for allocation of the channel is centered on the selection of the utility function in order to increase the efficiency of the channel allocation algorithm. Accordingly, the study regarding the influence of several utility functions on the performance of the corresponding channel allocation algorithm is important.  Such a study enables designers to arrive at the optimal utility function to be used in game-theory based channel allocation algorithms, and the same is explored to the best extent, in this paper. The detailed procedure of allocating channels to all the contending nodes through game-based channel allocation has been discussed in this paper. Moreover, the performance of six different utility functions proposed which can be used for channel allocation using game theory has been evaluated for respective performances through MATLAB-based simulations.

Link Capacity Based Channel Assignment (LCCA) for Cognitive Radio Wireless Mesh Networks

2013 ◽  
Vol 65 (1) ◽  
Author(s):  
Wajahat Maqbool ◽  
Sharifah K. Syed Yusof ◽  
N. M. Abdul Latiff ◽  
Hashim S. ◽  
Rahat U. ◽  
...  
Keyword(s):  
Cognitive Radio ◽  
Wireless Mesh Networks ◽  
Channel Assignment ◽  
Mesh Networks ◽  
Mesh Network ◽  
Delivery Ratio ◽  
Link Capacity ◽  
Wireless Mesh ◽  
User Activity ◽  
Decision Engine

Cognitive radio wireless mesh network (CRWMN) is expected as an upcoming technology with the potential advantages of both cognitive radio (CR) and the wireless mesh networks (WMN). In CRWMN, co-channel interference is one of the key limiting factors that affect the reception capabilities of the client and reduce the achievable transmission rate. Furthermore, it increases the frame loss rate and results in underutilization of resources. To maximize the performance of such networks, interference related issues need to be considered. Channel assignment (CA) is one of the key techniques to overcome the performance degradation of a network caused by the interferences. To counter the interference issues, we propose a novel CA  technique which is based on link capacity, primary user activity and secondary user activity. These three parameters are fed to the proposed weightage decision engine to get the weight for each of the stated parameters. Thus, the link capacity based channel assignment (LCCA) algorithm is based on the weightage decision engine. The end-to-end delay, packet delivery ratio and the throughput is used to estimate the performance of the proposed algorithm. The numerical results demonstrate that the proposed algorithm is closer to the optimum resource utilization. 

scholarly journals RPL LOAD BALANCING IN INTERNET OF THINGS

2017 ◽  
Vol 18 (2) ◽  
pp. 137-150 ◽  
Author(s):  
Mohammad Reza Parsaei ◽  
Ahmad Reza Parnian ◽  
Samaneh Miri Rostami ◽  
Reza Javidan
Keyword(s):  
Internet Of Things ◽  
Load Balancing ◽  
Low Power ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Lossy Networks ◽  
Smart Objects ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

ABSTRACT:  The wide address space provided by Internet Protocol version 6 (IPv6) lets any thing to be identified uniquely. consistency of the modified version of IPv6 protocol stack with smart objects, facilitated the Internet interconnection of the networks of smart objects and introduced Internet of things. A smart object is a small micro-electronic device that consists of a communication device, a small microprocessor and a sensor or an actuator. A network made of such devices is called low-power and lossy network. RPL routing protocol that is consistent to IPv6, is designed to be used in these kinds of networks. Load balancing is not considered in the RPL design process. Whenever RPL is used in large scale low-power and lossy networks some nodes will suffer from congestion and this problem severely degrades network performance. In this paper, we consider solutions provided to tackle RPL load balancing problems. Load balancing algorithms and protoclos are evaluated through simulation. We evaluate IETF RPL implementation and LB-RPL method with Contiki OS Java (COOJA) simulator. They are assessed comprehensively through metrics such as Packet delivery Ratio, Average End to End delay, and Gateway Throughput. LB-RPL improves RPL in terms of Packet delivery Ratio and throughput but increases Average End to End delay. Simulations results show that RPL load balancing needs extensive works to be performed yet.

scholarly journals Dynamic Channel Assignment MAC Protocol for Cognitive Radio Ad Hoc Networks (CRAHNs)

2019 ◽  
Vol 8 (4) ◽  
pp. 10446-10452
Keyword(s):  
Cognitive Radio ◽  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Mac Protocol ◽  
Delivery Ratio ◽  
Medium Access ◽  
Lower Priority ◽  
Channel Quality ◽  
Real Time Traffic ◽  
Hoc Networks

In Cognitive Radio Ad Hoc Networks (CRAHNs), the Medium Access Control (MAC) protocol should handle the diverse Quality of Service (QoS) requirements of data packets of various classes generated by the nodes. The delay and reliability requirements of various applications should be considered while assigning the channels to the nodes. Hence in this paper, we propose to design a channel quality based MAC protocol for CRAHNs. In this technique, a channel with best Channel Quality Indicator (CQI) is chosen as the Common Control Channel (CCC). The CCC is assigned dynamically in each round. The channels with higher weights are assigned to higher priority traffic classes. Initially backup channels are assigned only to the nodes with higher priority real-time traffic. If a data channel is not available for any lower priority traffic, then the backup channels of higher priority traffic can be temporarily assigned to the lower priority traffic nodes. By simulation results, we show that the proposed technique reduces packet drop rate, error rate and increases packet delivery ratio and throughput.

scholarly journals NDN-CRAHNs: Named Data Networking for Cognitive Radio Ad Hoc Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Rana Asif Rehman ◽  
Jong Kim ◽  
Byung-Seo Kim
Keyword(s):  
Cognitive Radio ◽  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Future Internet ◽  
Delivery Ratio ◽  
Named Data Networking ◽  
Packet Delivery ◽  
End To End ◽  
Hoc Networks ◽  
Data Networking

Named data networking (NDN) is a newly proposed paradigm for future Internet, in which communication among nodes is based on data names, decoupling from their locations. In dynamic and self-organized cognitive radio ad hoc networks (CRAHNs), it is difficult to maintain end-to-end connectivity between ad hoc nodes especially in the presence of licensed users and intermittent wireless channels. Moreover, IP-based CRAHNs have several issues like scalability, inefficient-mapping, poor resource utilization, and location dependence. By leveraging the advantages of NDN, in this paper, we propose a new cross layer fine-grained architecture called named data networking for cognitive radio ad hoc networks (NDN-CRAHNs). The proposed architecture provides distinct features such as in-networking caching, security, scalability, and multipath routing. The performances of the proposed scheme are evaluated comparing to IP-based scheme in terms of average end-to-end delay and packet delivery ratio. Simulation results show that the proposed scheme is effective in terms of average contents download time and packet delivery ratios comparing to conventional cognitive radio ad hoc networks.

Sign in / Sign up

Export Citation Format

Share Document