Computers, Materials & Continua
DOI:10.32604/cmc.2022.024688
images

Article

QoS Aware Multicast Routing Protocol for Video Transmission in Smart Cities

Khaled Mohamad Almustafa1, Taiseer Abdalla Elfadil Eisa2, Amani Abdulrahman Albraikan3, Mesfer Al Duhayyim4,*, Manar Ahmed Hamza5, Abdelwahed Motwakel5, Ishfaq Yaseen5 and Muhammad Imran Babar6

1Department of Information Systems, College of Computer and Information Sciences, Prince Sultan University, Riyadh, 11586, Saudi Arabia
2Department of Information Systems-Girls Section, King Khalid University, Mahayil, 62529, Saudi Arabia
3Department of Computer Sciences, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, Riyadh, 11671, Saudi Arabia
4Department of Natural and Applied Sciences, College of Community-Aflaj, Prince Sattam bin Abdulaziz University, 16278, Saudi Arabia
5Department of Computer and Self Development, Preparatory Year Deanship, Prince Sattam bin Abdulaziz University, AlKharj, 16278, Saudi Arabia
6Department of Computer Science, FAST-National University of Computer and Emerging Sciences, Chiniot, Faisalabad, 44090, Pakistan
*Corresponding Author: Mesfer Al Duhayyim. Email: m.alduhayyim@psau.edu.sa
Received: 27 October 2021; Accepted: 29 December 2021

Abstract: In recent years, Software Defined Networking (SDN) has become an important candidate for communication infrastructure in smart cities. It produces a drastic increase in the need for delivery of video services that are of high resolution, multiview, and large-scale in nature. However, this entity gets easily influenced by heterogeneous behaviour of the user's wireless link features that might reduce the quality of video stream for few or all clients. The development of SDN allows the emergence of new possibilities for complicated controlling of video conferences. Besides, multicast routing protocol with multiple constraints in terms of Quality of Service (QoS) is a Nondeterministic Polynomial time (NP) hard problem which can be solved only with the help of metaheuristic optimization algorithms. With this motivation, the current research paper presents a new Improved Black Widow Optimization with Levy Distribution model (IBWO-LD)-based multicast routing protocol for smart cities. The presented IBWO-LD model aims at minimizing the energy consumption and bandwidth utilization while at the same time accomplish improved quality of video streams that the clients receive. Besides, a priority-based scheduling and classifier model is designed to allocate multicast request based on the type of applications and deadline constraints. A detailed experimental analysis was carried out to ensure the outcomes improved under different aspects. The results from comprehensive comparative analysis highlighted the superiority of the proposed IBWO-LD model over other compared methods.

Keywords: Smart cities; software defined networking; quality of service; video data transmission; multicast routing

1  Introduction

In the past few years, the tremendous growth of smart cities has caused a few serious problems like crime tracking, traffic, and public security. Smart city concept exploits big data analytics and data techniques’ sensing to collect human activity data from across the city. It analyzes the information and provides smart services to public applications. Especially, the transformation of infrastructures, services, and buildings with Internet of Things (IoT) technology has gained considerable attention from both industry and academia as shown in Fig. 1 [1]. With the help of sensor nodes, IoT produces large amount of information about smart cities such as traffic, earth vibration, air composition, etc. Amongst these data which demonstrates the realistic efficiency of clustering for gathering, video footage quality, taken by surveillance cameras, has improved widely. As per the literature [2], global video surveillance produces over 560 petabytes of information daily [2]. In smart city applications, video information produced from IoT possesses certain problems. The cameras distributed in modern cities collect video sources from some restricted zones too, even under compromising situations. Particularly, video surveillance content from multiple cameras for the same scene possesses a problem to the application and unified analyses. E.g., three cameras deployed in three consecutive streets with totally different environments. Some of the video surveillance applications such as tracking objects get affected apparently due to tracking of multiple scenarios [3]. When video information is full of unwanted content, then detection or tracking accuracy gets reduced. A reasonable and efficient fusion system can reduce unnecessary information, filter the video data and increase the accuracy of content analysis applications in smart cities.

Figure 1: Application of smart cities

One of the basic criteria to judge a video conference call is its quality of video stream [4]. Usually, this stream is highly sensitive to 5-network states and has rigorous Quality of Service (QoS) necessities like low packet loss, high bandwidth, low end-to-end delay, and so on. Additionally, it is susceptible to heterogeneity of user wireless connection features that might reduce the quality of video stream for all or some users [5]. The conventional networks find it challenging to handle each QoS requirement in real-time settings. In literature, the researchers attempted to develop novel video codecs like Scalable Video Coding (SVC) which splits the video stream into different layers with different qualities. Therefore, this codec is capable of simply adjusting the bit rate of video streams by dropping redundant layers. This framework 20 provides separations between the data plane and control plane of the system [6]. Therefore, it allows a logically-centralized view which enables network management in an effective manner.

The tremendous growth of Software Defined Networking (SDN), with remarkable industrial support, is a great opportunity to perform Internet Protocol (IP) multicast without any difficulties [7]. In fact, it is possible to create and preserve © 2014 IEEE while the material is allowed for personal usage. It is inevitable to obtain authorization for present or future media from IEEE for other purposes including the creation of new collective works, republishing or reprinting the material for promotional/advertising purpose, for redistribution/resale to lists or servers, or reutilization of any copyrighted content of these works, in any other work [8]. Multicast tree between subscribers, its sources and its control applications run on logically-centralized SDN controllers which possess a global network view. SDN possesses programmable features that enable immediate scalability, deployability, updatability, and adaptability traits, which are formerly related to Application-Layer Multicast (ALM), not IP multicast. In this research, an IP multicast application is proposed to run on SDN controller. It also records the subscription activity through a simple northbound interface and illustrates its advantageous performance.

The current research paper presents a novel Improved Black Widow Optimization with Levy Distribution Model (IBWO-LD)-based multicast routing protocol for application in smart cities. The presented IBWO-LD model aims to minimize the energy consumption and bandwidth utilization in accomplishing improved video stream quality in which the client can receive. Besides, a priority based scheduling and classifier model is designed to allocate the multicast request depending upon the type of applications and deadline constraints. A detailed experimental analysis is carried out to ensure the improved outcomes interms of different aspects.

Rest of the paper is planned as follows. Section 2 offers literature review while Section 3 introduces the proposed model. Section 4 details about the results of the analysis, while Section 5 draws the conclusion for the study.

2  Related Works

Naeem et al. [9] employed an iterative low-complexity probabilistic evolutionary technique to schedule video cameras so as to maximize the throughput in Video Camera Sensor Networks (VCSN) for IoT systems. Video camera scheduling-in-VCSN is a combinatorial optimization problem to increase throughput while the difficulty in computation increases gradually with increasing number of video cameras. Doan et al. [10] provided a scalable IoT video data analytics application for smart cities to end users, who can take advantage of scalability in both data processing as well as storage power to perform analysis on complex/large datasets. This algorithm offers data analytics environment and suite in which the researchers and developers could develop scalable analytical applications and services. Edge or cloud-based automatic video analysis methods process a massive number of video streams. In these methods, the fundamental structure could scale according to the number of camera devices and is easier to incorporate analytical applications.

Pan et al. [11] addressed the problem by presenting Machine Learning (ML) based Bitrate Estimation (MBE) algorithm for parsing bitrate data from IP packet level. Next, the transmission modes were recognized in this method based on the traffic features of some earlier packets. Then, the resolutions and bitrates of Dynamic Adaptive Streaming and Hypertext Transfer Protocol (HTTP) Live Streaming over HTTP modes were recognized based on the features present in video chunks. Calavia et al. [12] introduced a smart video surveillance method which can detect and classify abnormal and alarming scenarios by investigating object movements. This architecture is developed to mitigate transmission and video processing tasks, thereby enabling a massive number of cameras is positioned on the network. This phenomenon makes it appropriate for its utilization as a ‘combined security and safety solution’ in smart city. Alarm detection can be implemented based on the parameters of their trajectories and object movement. Further, it is also implemented by ontologies and semantic reasoning.

Sodhro et al. [13] proposed two algorithms namely, Delay-tolerant Streaming Algorithm (DSA) and Hybrid Adoptive Bandwidth and Power Algorithm (HABPA) by adapting stored video stream in the name of ‘StarWarsIV’. In addition, a new framework was also presented for smart city schemes. Hossain et al. [14] designed a cloud-enabled architecture for a secure video transmission in which the mobile users have limited capacity. However, the user is empowered to share video easily, without compromising on its quality and integrity. In the presented architecture, when videos are taken using smart phones, a key frame is identified. This key frame can be identified with the help of Genetic Algorithm (GA) model. A Discrete Wavelet Transform (DWT)-based watermarking method is utilized for inserting the watermark into key frame. A 2-layer protection system-based error correcting code is employed as an identity/signature of a person to create the watermark i.e., insert in the videos to protect it from attacks/distortion and transmission loss.

Jin et al. [15] developed a sequence for scheduling strategies and optimization algorithms-based Unmanned Aerial Vehicles (UAV) clusters. Initially, a complete device coverage network is created with the help of UAV clusters in heterogeneous transmission environments of smart cities. Kang et al. [16] projected a cooperative method for mobile networks which could utilize local memory space and upload bandwidth to release the computation loads for streaming servers. Initially, a statistical distribution of the device's lifecycle is established vigorously, according to the analyses of departure and random arrival of mobile users. Tian et al. [17] suggested a Block-level Background Modelling (BBM) method for assisting long-term reference architecture for effective video surveillance coding. Also, a rate-distortion optimization system for surveillance source (SRDO) is presented for improving the performance of coding.

3  The Proposed Model

3.1 Assumptions Made

Once the video conference is set for a group of users, then the individuals are named as participants. A participant plays the role of a sender as well as receiver of video streams simultaneously from each of the remaining participants. Consider that a participant is interconnected to every node that belongs to the network whereas many other participants are also interconnected to similar nodes. The participant is assumed to be wirelessly connected to their nodes through 4G cellular technologies like Long Term Evolution (LTE). All the network nodes offer SDN switching function as well as wireless accessing function (like eNode-B). Since the network is an SDN-assisted one, consider that every node within the network contains OpenFlow switches and has the ability to interact with SDN controllers i.e., accountable for call management. Each switch is capable of adapting Scalable Video Coding (SVC) stream by dropping redundant layers on the path.

SVC stream is generally controlled in layers based on base layers. Consider that SVC layer consists of base layer L1, and three improved layers such as L2, L3, and L4. But this process could be generalized easily to any number of layers. Furthermore, a provided layer is utilized, once each low layer is received. All the participants accept the maximum number of layers that can be accepted by its downlink ability. The participant obtains low video quality when using the base layer.

In video conference, the best possible bitrate, allowed by access connection bandwidth, is suggested to achieve an improved Quality of Experience (QoE). Thus, during a video call, all the participants send the highest bitrate streams allowed by other receivers. Then, this stream gets degraded (viz., highest layer is dropped) to adapt according to the participant with least downlink bandwidth capability [18]. After determining the channel condition and network topology with SDN global view, it becomes easy to find the location of switches, where there is a need for degrading the SVC stream.

This method is implemented in SDN controllers to set up a video conferencing call and build a multi-cast tree from all participants (transmitter) to each other (receiver). It is based on the assumption given herewith.

•   Each SVC layer belongs to the video stream released by one sender and it follows a similar path. There is a single tree for each layer of the provided video streams. As the adaption is executed in fundamental network, few branches of the tree might bring a subset of layer.

•   SDN controllers know the network's comprehensive topology, positions of the participant, and their accessible downlink and uplink accessing bandwidth.

•   Some SDN switches may degrade (viz., drops high quality layer) SVC streams.

3.2 Design of Multicast Routing Protocol

At this stage, IBWO-LD technique is designed for multicast routing for the purpose of video data transmission in smart cities. BWO stimulates the metaheuristic techniques and is currently used in resolving difficult numerical optimization issues. BWO is assumed to be a part of evolutionary techniques, owing to its operator. BWOA components are same as that of GA, the most essential evolutionary technique. Like every other evolutionary technique, BWO too has few conditions that mimic the procedures found in natural evolution like mutation, reproduction, and selection. These conditional variations differentiates BWO from other evolutionary techniques. BWO is inspired from strange mating behaviour of black widow spider. Further, this technique has few variances against evolutionary techniques and is utilized in achieving optimum efficiency upon difficult issues. BWOA is simulated as the natural chosen Darwin model and is determined as descent with alteration, idea of altering species in time, and generation of novel ones. BWO avoids local optimum entity and delivers rapid convergence owing to which the algorithm is obtained through optimum techniques and can resolve different kinds of optimization issues. With a number of local optima in place, BWO keeps a balance between exploration and exploitation stages. Fig. 2 exhibits the block diagram of BWO system. A detailed explanation for the essential steps in BWO are explained herewith.

Figure 2: Flowchart of BWO

Step 1: Initialization

During this phase, the population contains a few number of widows sized N, where all the widows are demonstrated as an array of 1×Nvar signifying the solution for the issue. This array is determined as widow=(x1,x2,…,xNvar), where Nvar refers to dimensions of the optimized issue. Besides, Nvar refers to the determined amount of threshold values which are required and can be attained by this technique and finally xi implies the ith candidate solution.

The fitness of widow is estimated using fitness function (FF) i.e., f of all the widows of the set (x1,x2,…,xNvar). Next, fitness=f(widow) is demonstrated as follows; fitness=f(x1,x2,…,xNvar). In the presented technique, f is replaced by FF Otsu in Eq. (8) or Kapur Eq. (14). Optimization procedure is started using an arbitrarily-initialized population of spiders from a matrix sized, Npop×Nvar. Afterward, a pairs of parents is chosen arbitrarily to implement the production step. Then, the mating procedure occurs in which the male black widow is consumed by female during mating or after mating is over [19].

Step 2: Procreate

During procreation phase, an array named alpha α is generated by a widow array which is composed of arbitrary values. Afterward, the offspring is created by utilizing α. In Eq. (1), x1 and x2 represent the parents and y1 and y2 demonstrate the offspring. The crossover outcome is estimated and saved.

y1=α×x1+(1−α)×x2andy2=α×x2+(1−α)×x1(1)

Step 3: Cannibalism

Different cannibalism behaviours have been reported earlier such as sibling cannibalism, sexual cannibalism, and a frequently-observed cannibalism in which baby spider eats its mother. After the implementation of cannibalism process, a novel population is estimated and saved based on the variable named pop2.

Step 4: Mutation

The procedure of mutation gets completed by the arbitrary-chosen Mutepop number of individuals in the mutated population. All the solutions are selected arbitrarily with connections containing two elements of array. Then, the mutation is implemented after which a novel population is estimated and saved from the novel population i.e., pop3. Eventually, a novel population is reached after the migration of pop3 and pop2 and is sorted out for returning an optimum widow of threshold value with Nvar dimension. Algorithm 1 illustrates the pseudocode for BWO.

To enhance the performance of BWO technique, IBWO-LD technique is derived by integrating Levy flight concept.

Levy Flight concept was first presented by the French mathematician named Paul Levy, in 1937. Different kinds of natural and artificial phenomena have been defined based on Levy statistics. LF is assumed to be a class of stochastic non-Gaussian walks in which the step length value is assigned based on Levy stable distributions. It is determined as follows.

Levy(β)∼u=t−1−β,0<β≤2(2)

β signifies the vital Levy index for changing the stability. Levy arbitrary amount is estimated using the formula given below.

Levy(β)∼φ×μ|v|1/β(3)

where μ & v signify the regular distribution, Γ demonstrates the normal Gamma function i.e., β=1.5, & φ are given as follows.

φ=[Γ(1+β)×sin⁡(π×β2)Γ((1+β2)×β×2β−12)]1β.(4)

To attain a trade-off between the exploitation and exploration abilities of metaheuristic technique, LF method is utilized. It also upgrades the location of search agents and is determined as follows.

Xilevy=Xi+r⊕levy(β)(5)

where Xilevy represents the novel position of ith search agent, Xi afterward upgrading and r defines the arbitrary vector between 0 and 1 and ⊕ signifies the dot product (entry wise multiplication).

During this case, the purpose of the proposed model is to send the information sized M in source to target the vehicles at minimal energy cost, without compromising on the deadline and bandwidth constraints. The issue is otherwise known to be Mixed Integer Programming (MIP) and is determined as follows.

Objective:

  min  ∑i∈V⁡∑j∈V⁡eijfij,(6)

Subject to

∑fkw(i)⁡fij=M,i=s(7)

∑j∈N(i)⁡fji=M,∀i∈T(8)

λij+λji≤1,∀i,j∈V(9)

fij≤λijbij,∀i,j∈V,(10)

∑j∈N(i)⁡fji≥fik,∀i,k∈V,(11)

dj≥(di+gij+qi+(fij/bij))−((1−λij)∗L),∀j∈V,i∈N(j),(12)

qi=0,∀i∈{s∪T}(13)

di=0,i=s(14)

di≤θ,∀i∈T,(15)

fij≥0,∀i,j∈V,(16)

λij∈{0,1},∀i,j∈V(17)

The objective function (6) is to minimize the utilization of energy in multi-casting data, sized M in source to destination [20].

Several constraints are taken into account from the chosen optimum multicast path. Following is the list of constraints used.

•   1st constraint (7): The overall amount of information sent by the source vehicle is equivalent to M.

•   2nd constraint (8): The overall amount of information is provided by the most number of target vehicles is equivalent to M.

•   3rd constraint (9): If the flow is sent in node i to j, the flow cannot enter node j to i. This constraint is utilized to avoid the loops.

•   4th constraint (10): Data flow gets transmitted from node i to j which is lesser than or equivalent to residual bandwidth of the connection in node i to j.

•   5th constraint (11): The in-between nodes cannot be taken as the message targets. So, it can be transmitted to an adjacent node once it is received. But, the maximum amount of information transferred from in-between node to every neighboring node is lesser than or equivalent to the amount of data received.

•   6th constraint (12): As the message is separated into distinct packets, all the packets arrive in a distinct path from transmitter node to inode. The delay for total number of messages to reach the node i is equivalent to the maximal delay of packets from the path that leads to node i when data is sent to i. Besides, these delays contain the Queuing Delay (QD) and propagation delay. The QD of i(qi) node implies the average QD from inode. All the set nodes calculate their average QD regularly (all the 4 s). Afterward, it transmits qi values to local controllers that upgrade their data and transmits the values to SDN controllers. During these constraints, (1−λij)∗L is utilized to explain that the deadline constraints are calculated for the nodes, i as well as j, if the flow is from i to j nodes. Else, (1−λij)=1, therefore dj≥di+gij+qi+(fij/bij) remains ineffective.

•   7th constraint (13): There is no QD from both source and target vehicles

•   8th constraint (14): As the message is established from the source nodes initially, the delay for the messages to reach the node is continuously equivalent to 0.

•   9th constraint (15): The delay of messages could not surpass the deadline.

•   10th constraint (16): The dataflow in some nodes to further ones is not ever negative because when the data could not be sent between two nodes, their volume becomes equivalent to 0; else it can be superior to 0.

•   Last constraint (17): Based on these constraints, the variable λij gets the value one, when the data is sent from node i to j. Else, their value is zero.

3.3 Design of Priority Based Scheduling and Classification Model

This protocol makes use of priority-based scheduling and application-based classification algorithm to reduce the cost and accomplish QoS needs.

The Closest Fixed Node F(i)t: This is a fixed node with minimal delay using ith vehicle at time t and is represented as F(i)t. As per (18), the nearby fixed node transmitted from j to vehicle i at time t is defined by regular transmission of beacon packet. The fixed nodes that respond to this packet with minimal delay is considered as a nearer one. The respond time to this packet through fixed node is based on traffic load and distance of this node.

F(i)t=arg  minj∈N⁡di,jt(18)

Here, N represents a group of fixed nodes and di,jt denotes the delay at the jth fixed node while ith vehicle at time t.

Local Controller Ci: All the groups of (Ni) fixed nodes are connected to individual local controllers which is represented as Ci in which i∈{1,2,…,Q} and Q denotes the amount of local controller.

Where, θ signifies deadline limitation, T indicates the group of destination vehicle, M represents the output of EEMSFV which denotes multi-cast tree and Π denotes data size.

Usually, distinct multi-cast session requests are raised towards the controllers (SDN/local controllers) which must serve these requests, according to their priority. Initially, the controller categorizes the request on the basis of every group of same application type and is queued in a certain format. In current study, four application types are considered that denote the type of vehicle i.e., normal, police, firefighting, and ambulance vehicles. Next, the request inside all the queues is scheduled according to the priority. The priority of the vehicle can be defined based on deadline limitation in which the request with low deadline limitation takes the higher priority.

After high priority requests are computed, the controllers select individual requests at a time, according to the priorities from the head of this queue. After that, the multi-cast tree is built for it. Such priorities are defined according to two criteria given herewith.

Application Type: Distinct application types have different priorities. In current work, several values have been allocated to all the application types for representing their priority. The value 14 represents the priority for normal, firefighting, ambulance, and police applications, correspondingly.

Deadline Constraint: Usually, multi-cast requests with minimal deadline limitation have high priority.

Next, the fitness value of all the requests is calculated. The requests with the least values are considered as high priority and are elected using the controllers. The fitness values are calculated as follows.

Fitnessi=Ai+θi(19)

In which Fitnessi signifies the fitness values of request, i. Ai and θi represent the standardized value of application types and the deadline limitation of request i, correspondingly.

Pi>Pjiffitnessi<fitnessj(20)

Here, Pi & Pj represent the priority of i and j requests correspondingly.

4  Performance Validation

The current section discusses the results achieved from performance analysis of IBWO-LD technique against other techniques under different aspects.

Tab. 1 and Fig. 3 shows the results from average bandwidth analysis accomplished by IBWO-LD technique and other techniques under varying number of participants. The results show that the proposed IBWO-LD algorithm generated improved performance with maximal average bandwidth compared to other techniques. For instance, with 3 participants, IBWO-LD technique resulted in an increased average bandwidth of 54 Mbps, whereas unicast (UNI), Shortest Path Tree (SPT), Minimizing Spanning Tree (MST), ALM, and Multiple Control Unit (MCU) techniques gained low average bandwidth values such as 47, 48, 43, 46, and 50 Mbps respectively. At the same time, with 12 participants, IBWO-LD technique gained a high average bandwidth of 817 Mbps, whereas UNI, SPT, MST, ALM, and MCU techniques attained reduced average bandwidth values such as 780, 420, 410, 630, and 740 Mbps respectively.

Figure 3: Average bandwidth analysis results of IBWO-LD technique under varying number of participants

A brief Average End to End Delay (AETED) analysis was conducted between IBWO-LD and other existing techniques and the results are shown in Tab. 2 and Fig. 4. The results point out that the proposed IBWO-LD technique accomplished effective outcomes with least AETED. For instance, with MS = 5, IBWO-LD technique obtained effective outcomes with least AETED value of 0.15 s, whereas MABC, CVLMS, and EEMSFC techniques attained maximum AETED values such as 0.50, 0.40, and 0.20 s respectively. Besides, with MS = 25, IBWO-LD method attained effective outcomes with least AETED value i.e., 0.50 s, whereas MABC, CVLMS, and EEMSFC techniques attained the maximum AETED values such as 1.50, 1.40, and 0.60 s correspondingly.

Figure 4: AETED analysis results of IBWO-LD techniques under varying MS

Tab. 3 and Fig. 5 shows the results for Successfully Transmitted Ratio (STR) analysis accomplished by the proposed IBWO-LD technique against other techniques under varying number of Multicast Session. The outcomes demonstrate that the proposed IBWO-LD method produced high performance with maximum STR compared to other techniques. For instance, MS = 5, IBWO-LD technique produced an increased STR of 0.99, whereas Modified Artificial Bee Colony (MABC), Collaborative Vehicle Location Management Service (CVLMS), and Energy Efficient Multicast routing protocol based on SDN and Fog computing for Vehicular networks (EEMSFV) techniques achieved low STR values such as 0.87, 0.93, and 0.98 correspondingly. Also, with 25 participants, IBWO-LD technique gained a high STR of 0.94, whereas MABC, CVLMS, and EEMSFV methods attained low STR values such as 0.21, 0.60, and 0.94 correspondingly.

Figure 5: STR analysis of IBWO-LD techniques under varying MS

A detailed Packet Loss Ratio (PLR) analysis was conducted between IBWO-LD and existing methods and the results are shown in Tab. 4 and Fig. 6. The results infer that the presented IBWO-LD technique accomplished effective outcomes with minimal PLR. For instance, with MS = 5, IBWO-LD technique achieved an effectual outcome with the least PLR of 0.07, whereas MABC, CVLMS, and EEMSFC techniques accomplished maximum PLR values such as 0.20, 0.15, and 0.08 correspondingly. In addition, with MS = 25, IBWO-LD system obtained effective outcomes with the least PLR of 0.15, whereas MABC, CVLMS, and EEMSFC techniques attained the maximum PLR values such as 0.75, 0.60, and 0.15 respectively.

Figure 6: PLR analysis of IBWO-LD techniques under varying MS

A brief Normalized Overhead Load (NOL) analysis was conducted between IBWO-LD and existing methods and the results are shown in Tab. 5 and Fig. 7. The results infer that the proposed IBWO-LD technique accomplished effective outcomes with minimal NOL. For instance, with MS = 5, the proposed IBWO-LD methodology reached effective outcomes with a decreased NOL of 15, whereas MABC, CVLMS, and EEMSFC techniques attained maximum NOL values such as 35, 28 s, and 20 respectively. Likewise, with MS = 25, IBWO-LD technique obtained effective outcomes with the least NOL of 50, whereas MABC, CVLMS, and EEMSFC techniques achieved the maximal NOL values such as 135, 100, and 58 correspondingly.

Figure 7: NOL analysis of IBWO-LD techniques under varying MS

A comparative Multicast Energy Consumption (MEC) analysis was conducted betweenthe proposed IBWO-LD against existing techniques and the results are shown in Tab. 6 and Fig. 8. The results showcase that the proposed IBWO-LD approach accomplished effective outcomes with the least MEC. For samples, with MS = 5, the proposed IBWO-LD technique has obtained effective outcomes with the least MEC of 285 Joules, whereas MABC, CVLMJOULES, and EEMSFC methods reached maximal MEC values such as 1250, 1049, and 586 Joules respectively. Besides, with MS = 25, IBWO-LD method obtained effective outcomes with the least MEC of 2819 Joules, whereas MABC, CVLMJOULES, and EEMSFC techniques attained the maximal MEC values namely, 5998, 5414, and 3885 Joules correspondingly.

Figure 8: MEC analysis of IBWO-LD techniques under varying MS

5  Conclusion

Multicast routing protocol with multiple QoS constraints is an NP hard problem. It can only be solved with the help of metaheuristic optimization algorithms. In this background, the current study presented an effective IBWO-LD based multicast routing protocol for smart cities. The presented IBWO-LD model aims at minimizing energy consumption as well as bandwidth utilization, while improved video stream quality is to be accomplished for client end. Besides, a priority-based scheduling and classifier model is designed to allocate multicast request based on the type of applications and deadline constraints. A thorough experimental analysis was conducted to guarantee the improved outcomes under different aspects. The comprehensive comparative analysis results highlighted the superiority of the proposed IBWO-LD model over other compared approaches. As a part of future scope, IBWO-LD technique can be implemented in real-time scenarios and its performance can be fine-tuned.

Acknowledgement: The authors would like to acknowledge the support of Prince Sultan University for paying the Article Processing Charges (APC) of this publication.

Funding Statement: The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under Grant Number (RGP.1/282/42). https://www.kku.edu.sa. Princess Nourah bint Abdulrahman University Researchers Supporting Project Number (PNURSP2022R191), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.

References

 1.  K. Z. Ghafoor, L. Kong, D. B. Rawat, E. Hosseini and A. S. Sadiq, “Quality of service aware routing protocol in software-defined internet of vehicles,” IEEE Internet Things Journal, vol. 6, no. 2, pp. 2817–2828, 2019.

 2.  A. P. Patil and L. C. M. Hurali, “Analysis of routing protocols for software-defined vehicular ad hoc networks,” International Journal of Networking and Virtual Organisations, vol. 24, no. 2, pp. 161, 2021.

 3.  T. Vaiyapuri, V. S. Parvathy, V. Manikandan, N. Krishnaraj, D. Gupta et al., “A novel hybrid optimization for cluster-based routing protocol in information-centric wireless sensor networks for iot based mobile edge computing,” in Wireless Personal Communications, 2021.

 4.  Z. A. Almusaylim, A. Alhumam and N. Z. Jhanjhi, “Proposing a secure rpl based internet of things routing protocol: A review,” Ad Hoc Networks, vol. 101, pp. 102096, 2020.

 5.  M. Elhoseny, R. S. Rajan, M. Hammoudeh, K. Shankar and O. Aldabbas, “Swarm intelligence–based energy efficient clustering with multihop routing protocol for sustainable wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 16, no. 9, pp. 155014772094913, 2020.

 6.  E. C. Liou, C. C. Kao, C. H. Chang, Y. S. Lin and C. J. Huang, “Internet of underwater things: Challenges and routing protocols,” in 2018 IEEE Int. Conf. on Applied System Invention (ICASI), Chiba, Japan, pp. 1171–1174, 2018.

 7.  P. Manickam, K. Shankar, E. Perumal, M. Ilayaraja and K. S. Kumar, “Secure data transmission through reliable vehicles in VANET using optimal lightweight cryptography,” Advanced Sciences and Technologies for Security Applications, pp. 193–204, 2019.

 8.  C. L. Garzon, M. Camelo, P. Vila and Y. Donoso, “A multi-objective routing algorithm for wireless mesh network in a smart cities environment,” Journal of Networks, vol. 10, no. 1, pp. 60–69, 2015.

 9.  M. Naeem, W. Ejaz, M. Iqbal, F. Iqbal, A. Anpalagan et al., “Efficient scheduling of video camera sensor networks for IoT systems in smart cities,” Transactions on Emerging Telecommunications Technologies, vol. 31, no. 5, pp. 1–13, 2020.

10. M. Doan, V. Tran, H. Huynh and H. Huynh, “A scalable iot video data analytics for smart cities,” EAI Endorsed Transactions on Context-Aware Systems and Applications, vol. 6, no. 19, pp. 163136, 2019.

11. W. Pan and G. Cheng, “QoE assessment of encrypted youtube adaptive streaming for energy saving in smart cities,” IEEE Access, vol. 6, pp. 25142–25156, 2018.

12. L. Calavia, C. Baladrón, J. M. Aguiar, B. Carro and A. S. Esguevillas, “A semantic autonomous video surveillance system for dense camera networks in smart cities,” Sensors, vol. 12, no. 8, pp. 10407–10429, 2012.

13. A. H. Sodhro, S. Pirbhulal, Z. Luo and V. H. C. d. Albuquerque, “Towards an optimal resource management for IoT based green and sustainable smart cities,” Journal of Cleaner Production, vol. 220, pp. 1167–1179, 2019.

14. M. S. Hossain, G. Muhammad, W. Abdul, B. Song and B. B. Gupta, “Cloud-assisted secure video transmission and sharing framework for smart cities,” Future Generation Computer Systems, vol. 83, pp. 596–606, 2018.

15. Y. Jin, Z. Qian and W. Yang, “UAV cluster-based video surveillance system optimization in heterogeneous communication of smart cities,” IEEE Access, vol. 8, pp. 55654–55664, 2020.

16. S. Kang, W. Ji, S. Rho, V. A. Padigala and Y. Chen, “Cooperative mobile video transmission for traffic surveillance in smart cities,” Computers & Electrical Engineering, vol. 54, pp. 16–25, 2016.

17. L. Tian, H. Wang, Y. Zhou and C. Peng, “Video big data in smart city: Background construction and optimization for surveillance video processing,” Future Generation Computer Systems, vol. 86, pp. 1371–1382, 2018.

18. C. A. Hasrouty, M. L. Lamali, V. Autefage, C. Olariu, D. Magoni et al., “Adaptive multicast streaming for videoconferences on software-defined networks,” Computer Communications, vol. 132, pp. 42–55, 2018.

19. E. H. Houssein, B. E. Helmy, D. Oliva, A. A. Elngar and H. Shaban, “A novel black widow optimization algorithm for multilevel thresholding image segmentation,” Expert Systems with Applications, vol. 167, pp. 114159, 2021.

20. A. J. Kadhim and S. A. H. Seno, “Energy-efficient multicast routing protocol based on SDN and fog computing for vehicular networks,” Ad Hoc Networks, vol. 84, pp. 68–81, 2019.

images
This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.