In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
MAR SECURITY: IMPROVED SECURITY MECHANISM FOR EMERGENCY MESSAGES OF VANET USI...IJCNCJournal
Vehicular Ad-hoc network (VANET) is one of the emerging technologies for research community to get various research challenges to construct secured framework for autonomous vehicular communication. The prime concern of this technology is to provide efficient data communication among registered vehicle nodes. The several research ideas are implemented practically to improve overall communication in VANETs by considering security and privacy as major aspects of VANETs. Several mechanisms have been implemented using cryptography algorithms and methodologies. However, these mechanisms provide a solution only for some restricted environments and to limited security threats. Hence, the proposed novel mechanism has been introduced, implemented and tested using key management technique. It provides secured network environment for VANET and its components. Later, this mechanism provides security for data packets of emergency messages using cryptography mechanism. Hence, the proposed novel mechanism is named Group Key Management & Cryptography Schemes (GKMC). The experimental analysis shows significant improvements in the network performance to provide security and privacy for emergency messages. This GKMC mechanism will help the VANET user’s to perform secured emergency message communication in network environment.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
MAR SECURITY: IMPROVED SECURITY MECHANISM FOR EMERGENCY MESSAGES OF VANET USI...IJCNCJournal
Vehicular Ad-hoc network (VANET) is one of the emerging technologies for research community to get various research challenges to construct secured framework for autonomous vehicular communication. The prime concern of this technology is to provide efficient data communication among registered vehicle nodes. The several research ideas are implemented practically to improve overall communication in VANETs by considering security and privacy as major aspects of VANETs. Several mechanisms have been implemented using cryptography algorithms and methodologies. However, these mechanisms provide a solution only for some restricted environments and to limited security threats. Hence, the proposed novel mechanism has been introduced, implemented and tested using key management technique. It provides secured network environment for VANET and its components. Later, this mechanism provides security for data packets of emergency messages using cryptography mechanism. Hence, the proposed novel mechanism is named Group Key Management & Cryptography Schemes (GKMC). The experimental analysis shows significant improvements in the network performance to provide security and privacy for emergency messages. This GKMC mechanism will help the VANET user’s to perform secured emergency message communication in network environment.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
In most efficient clustering technique for WSN has been proved as a congestion control and hierarchical
based cluster head selection process. The cluster head reduces the energy wastage and additionally that improves
the receiving of data and collection of data from their member sensor nodes. Also transmitting the collected data
to the base station (BS). In proposed method hybrid cluster based congestion aware (HCBCA) is mostly focused
on traffic that affects the continuous flow of data, Arrival of data from the source to destination delay time,
Avoid packet losses and energy consumption process. Mainly congestion happens in the intra cluster to do the
process of transmitting the destination of packets in many to one manner form sensor node to CH. The main
reason for occurrence of congestion is communication path, nodes energy level and nodes buffer size. When
these above it are successful done the congestion, does not exist or otherwise congestion will occur. The purpose
of WSN congestion control is to improve the packet delivery ratio and energy consumption.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
Cellular wireless systems like GSM suffer from congestion resulting in overall system degradation and poor service delivery. When the traffic demand in a geographical area is high, the input traffic rate will exceed thecapacity of the output lines. This work focused on homogenous wireless network (the network traffic and resource dimensioning that are statistically identical) such that the network performance
evaluation can be reduced to a system with single cell and a single traffic type. Such system can employa queuing model to evaluate the performance metric of a cell in terms of blocking probability.
Five congestion control models were compared in the work to ascertain their peculiarities, they are Erlang B, Erlang C, Engset (cleared), Engset (buffered), and Bernoulli. To analyze the system, an aggregate onedimensional Markov chain wasderived, such that it describes a call arrival process under the assumption
that it is Poisson distributed. The models were simulated and their results show varying performances, however the Bernoulli model (Pb5) tends to show a situation that allows more users access to the system and the congestion level remain unaffected despite increase in the number of users and the offered traffic into the system.
PERFORMANCE ENHANCEMENT OF DYNAMIC CHANNEL ALLOCATION IN CELLULAR MOBILE NETW...ijcseit
In cellular mobile communication system the existing dynamic channel allocation scheme suffer from
high blocking probability and forced termination probability. To mitigate this problem, in this paper we
evaluated the performance of dynamic channel allocation scheme based on carrier-to-noise interference
ratio. In our system model, uplink power strength from a call-initiating user to the base station is
examined. This power is provided by the carrier-to-noise ratio (C/N). The channel search is conducted in
the repeated channel numbers of that cell based on the carrier-to-noise ratio so that this system provides
the low blocking probability and initiates large number of calls in dynamic channel allocation
environment. We have presented the momentous performance in blocking probability and forced
termination probability through this research.
Checkpoint and recovery protocols are commonly used in distributed applications for providing fault
tolerance. A distributed system may require taking checkpoints from time to time to keep it free of arbitrary
failures. In case of failure, the system will rollback to checkpoints where global consistency is preserved.
Checkpointing is one of the fault-tolerant techniques to restore faults and to restart job fast. The algorithms
for checkpointing on distributed systems have been under study for years.
It is known that checkpointing and rollback recovery are widely used techniques that allow a distributed
computing to progress inspite of a failure.There are two fundamental approaches for checkpointing and
recovery.One is asynchronus approach, process take their checkpoints independenty.So,taking checkpoints
is very simple but due to absence of a recent consistent global checkpoint which may cause a rollback of
computation.Synchronus checkpointing approach assumes that a single process other than the application
process invokes the checkpointing algorithm periodically to determine a consistent global checkpoint.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
In most efficient clustering technique for WSN has been proved as a congestion control and hierarchical
based cluster head selection process. The cluster head reduces the energy wastage and additionally that improves
the receiving of data and collection of data from their member sensor nodes. Also transmitting the collected data
to the base station (BS). In proposed method hybrid cluster based congestion aware (HCBCA) is mostly focused
on traffic that affects the continuous flow of data, Arrival of data from the source to destination delay time,
Avoid packet losses and energy consumption process. Mainly congestion happens in the intra cluster to do the
process of transmitting the destination of packets in many to one manner form sensor node to CH. The main
reason for occurrence of congestion is communication path, nodes energy level and nodes buffer size. When
these above it are successful done the congestion, does not exist or otherwise congestion will occur. The purpose
of WSN congestion control is to improve the packet delivery ratio and energy consumption.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
Cellular wireless systems like GSM suffer from congestion resulting in overall system degradation and poor service delivery. When the traffic demand in a geographical area is high, the input traffic rate will exceed thecapacity of the output lines. This work focused on homogenous wireless network (the network traffic and resource dimensioning that are statistically identical) such that the network performance
evaluation can be reduced to a system with single cell and a single traffic type. Such system can employa queuing model to evaluate the performance metric of a cell in terms of blocking probability.
Five congestion control models were compared in the work to ascertain their peculiarities, they are Erlang B, Erlang C, Engset (cleared), Engset (buffered), and Bernoulli. To analyze the system, an aggregate onedimensional Markov chain wasderived, such that it describes a call arrival process under the assumption
that it is Poisson distributed. The models were simulated and their results show varying performances, however the Bernoulli model (Pb5) tends to show a situation that allows more users access to the system and the congestion level remain unaffected despite increase in the number of users and the offered traffic into the system.
PERFORMANCE ENHANCEMENT OF DYNAMIC CHANNEL ALLOCATION IN CELLULAR MOBILE NETW...ijcseit
In cellular mobile communication system the existing dynamic channel allocation scheme suffer from
high blocking probability and forced termination probability. To mitigate this problem, in this paper we
evaluated the performance of dynamic channel allocation scheme based on carrier-to-noise interference
ratio. In our system model, uplink power strength from a call-initiating user to the base station is
examined. This power is provided by the carrier-to-noise ratio (C/N). The channel search is conducted in
the repeated channel numbers of that cell based on the carrier-to-noise ratio so that this system provides
the low blocking probability and initiates large number of calls in dynamic channel allocation
environment. We have presented the momentous performance in blocking probability and forced
termination probability through this research.
Checkpoint and recovery protocols are commonly used in distributed applications for providing fault
tolerance. A distributed system may require taking checkpoints from time to time to keep it free of arbitrary
failures. In case of failure, the system will rollback to checkpoints where global consistency is preserved.
Checkpointing is one of the fault-tolerant techniques to restore faults and to restart job fast. The algorithms
for checkpointing on distributed systems have been under study for years.
It is known that checkpointing and rollback recovery are widely used techniques that allow a distributed
computing to progress inspite of a failure.There are two fundamental approaches for checkpointing and
recovery.One is asynchronus approach, process take their checkpoints independenty.So,taking checkpoints
is very simple but due to absence of a recent consistent global checkpoint which may cause a rollback of
computation.Synchronus checkpointing approach assumes that a single process other than the application
process invokes the checkpointing algorithm periodically to determine a consistent global checkpoint.
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...ijwmn
Hierarchical Genetic Algorithms (HGA) as a tool for search and optimizing methodology have now reached a mature stage. The minimum resource facility to carry user traffic, termed a channel unit (CU), is composed of a one time-slot and one code in the TD-CDMA/TDD system. The control of the number of CUs depends on the traffic load solves varied and asymmetrical traffic problems in the 3G system. In a cellular network, the call arrival rate, call duration and the communication overhead between the base stations and the control center are vague and uncertain, regardless of whether the criteria of concern are nonlinear, constrained, discrete or NP hard. In this paper, the HGA is used to tackle the neural network (NN) topology as well as the fuzzy logic controller for the dynamic CU allocation scheme in wireless cellular networks. Therefore, we propose a new efficient HGA CUs Allocation (HGACA) in cellular networks. It aims to efficiently satisfy the diverse quality-of-service (QoS) requirements of multimedia traffic. The results show our algorithm has a lower blocking rate, lower dropping rate, less update overhead, and shorter channel-acquisition delay than previous methods
An efficient model for reducing soft blocking probability in wireless cellula...ijwmn
One of the research challenges in cellular networks is the design of an efficient model that can reduce call
blocking probability and improve the quality of service (QoS) provided to mobile users. Blocking occurs
when a new call cannot be admitted into the network due to channel unavailability caused by limited
capacity or when an ongoing call cannot be continued as it moves from one base station to another due to
mobility of the user. The proposed model computes the steady state probability and resource occupancy
distribution, traffic distribution, intra-cell and inter-cell interferences from mobile users. Previously
proposed models are reviewed through which the present model is built for use in emerging wireless
networks so as to obtain improved QoS performance. The developed model is validated through simulations
in MATLAB and its equations implemented using Java Programming Language. The results obtained
indicate reduced call blocking probability below threshold.
Reduce the probability of blocking for handoff and calls in cellular systems ...TELKOMNIKA JOURNAL
In cellular systems the high probability of blocking represents a big problem for users, the proposed solution by reducing the blocking probability and investigation cellular systems by method channels assignment. The aim from apaper is studying the effect the channel assignment on the value of blocking probability. The results showed that the fixe channeld assignment gives a large probability of blocking for high loads, while (FCA) reduce probability of blocking for handoff and calls according to cluster size. The cellular system representation in the case of (DCA), in (3-cell reuse) and (7-cell reuse), the results showed the first best way to reduce blocking probability and lead to reduce to approximately zero when loads that are less than 200%. Increasing the cluster size causes to reduce blocking probability. The results showed that the probability blocking for handoff less than from probability of blocking for new calls.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Congestion control based on sliding mode control and scheduling with prioriti...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Fuzzy Logic-based Efficient Message Route Selection Method to Prolong the Net...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols, nodes located upstream tend to consume relatively high energy compared to other nodes. A network protocol should be considered to provide minimal security and efficient allocation of energy consumption by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck problem through an efficient message route selection method. The proposed method selects an efficient messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the potential portability of the clustering-based protocol. In addition, the proposed method is updated to find the optimal path through the genetic algorithm to respond to various environments. We demonstrated the effectiveness of the proposed method through an experiment in which the proposed method is applied to a probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node
performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor
network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to
prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols,
nodes located upstream tend to consume relatively high energy compared to other nodes. A network
protocol should be considered to provide minimal security and efficient allocation of energy consumption
by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck
problem through an efficient message route selection method. The proposed method selects an efficient
messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an
important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the
potential portability of the clustering-based protocol. In addition, the proposed method is updated to find
the optimal path through the genetic algorithm to respond to various environments. We demonstrated the
effectiveness of the proposed method through an experiment in which the proposed method is applied to a
probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...ssuser7dcef0
Power plants release a large amount of water vapor into the
atmosphere through the stack. The flue gas can be a potential
source for obtaining much needed cooling water for a power
plant. If a power plant could recover and reuse a portion of this
moisture, it could reduce its total cooling water intake
requirement. One of the most practical way to recover water
from flue gas is to use a condensing heat exchanger. The power
plant could also recover latent heat due to condensation as well
as sensible heat due to lowering the flue gas exit temperature.
Additionally, harmful acids released from the stack can be
reduced in a condensing heat exchanger by acid condensation. reduced in a condensing heat exchanger by acid condensation.
Condensation of vapors in flue gas is a complicated
phenomenon since heat and mass transfer of water vapor and
various acids simultaneously occur in the presence of noncondensable
gases such as nitrogen and oxygen. Design of a
condenser depends on the knowledge and understanding of the
heat and mass transfer processes. A computer program for
numerical simulations of water (H2O) and sulfuric acid (H2SO4)
condensation in a flue gas condensing heat exchanger was
developed using MATLAB. Governing equations based on
mass and energy balances for the system were derived to
predict variables such as flue gas exit temperature, cooling
water outlet temperature, mole fraction and condensation rates
of water and sulfuric acid vapors. The equations were solved
using an iterative solution technique with calculations of heat
and mass transfer coefficients and physical properties.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
RAT: Retrieval Augmented Thoughts Elicit Context-Aware Reasoning in Long-Hori...
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEUEING MODEL WITH THE FRACTIONAL GUARD CHANNELS POLICIES
1. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
DOI: 10.5121/ijcnc.2021.13406 85
PERFORMANCE ANALYSIS IN CELLULAR
NETWORKS CONSIDERING THE QOS BY RETRIAL
QUEUEING MODEL WITH THE FRACTIONAL GUARD
CHANNELS POLICIES
Dang ThanhChuong1
, Hoa Ly Cuong1
,
Pham Trung Duc1
and Duong Duc Hung2
1
Faculty of Information Technology, University of Sciences, Hue University, Viet Nam
2
Hue University, Viet Nam
ABSTRACT
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
KEYWORDS
Cellular Mobile Networks, Retrial, FGC, QoS.
1. INTRODUCTION
In the present, with the aid of the rapid development of wireless and mobile networks, many
queueing models, especially retrial queues, have been proposed to evaluate the actual
performances of these network systems. In cellular networks, it is important to design network
models that the handover calls are more prior than the fresh calls properly. The concerns are
limited resources, for example, a number of channels, sharings, and competitions in a certain cell
(the collisions between the handover calls and the fresh calls), which can lead to the call
interruptions when a user frequently moves among cells in the network as cell edges. Therefore,
it is necessary that the appropriate policy admitting and processing the arrival calls minimize
congestion risks of the system, including the handover and fresh calls. The call admission
controls have been proposed to fulfillQoS requirements [1].
The research [1] and [2] first introduced the application of the retrial queueing models on
evaluating cellular mobile networks involving the fractional guard channel policy to minimize the
handover probability. Then [3] constructed the novel model and obtained some important results
but that model bases only one probability 𝜃. In later years [4] and [5] reapplied and renovated [3]
by considering the additional probability of the fresh calls 𝜃′. [6] used the fractional guard
channel without retrial customers. [7] improved [3] by using the fractional guard channel, but it
considered only one probability 𝜃. The fractional guard channel policy allocates resources in the
2. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
86
cellular mobile network to reserve for the handover calls. This policy is considered the general
form of the guard channel ones. When the system has available resources, the fresh call
requirements are accepted by a certain probability, depending on the cell states (a number of the
busy channels).
Ramjee [8] first proposed the fractional guard channel policy with the accepted probability of the
fresh calls 𝛽𝑖 (0 ≤ 𝛽𝑖 ≤ 1, 𝑖 = 0, 𝑐, where 𝑐 is the number of the channels), and it depends on the
number of the operating channels. The problem is that the optimal probability 𝛽𝑖 is chosen by the
fractional guard channel policy. The limited fractional guard channel LFGC, the uniform
fractional guard channel UFGC, the limited average fractional guard channel LAFGC and the
quasi-uniform fractional guard channel QUFGC policies have been initiated based on the features
of different network systems.
To generalize the above results, the research can be examined the retrial queueing model whose
form is 𝑀/𝑀/𝑐/(𝑐 + 𝐿) in combination with the fractional guard channel policies and the
characteristic parameters, such as the probability that a fresh call first arrives and then it enters
the orbit and the impatient customer probability that a call resumes to enter the servers. In
contrast, it is unsuccessful and eternally departs and the additional features are the probability 𝜃
(0 < 𝜃 ≤ 1) that a call first enters the orbit when failing and the probability 𝜃′ (0 < 𝜃′ ≤ 1)
which can be considered as a call next enters the orbit when failing, whereas [7] has only one
fixed probability 𝜃 for all calls entering the orbit. The main aim of our model is to lessen
possibilities of being blocked with retrial and handover calls, significant factors to accomplish
QoS, with the additional measure which is a novel attribute in comparison with the
aforementioned works.
The organization of the article is as follows, In Section 2, the detailed problems with the
parameters and the models are described. The analysis results will be presented evaluated the
model performances in Section 3.
2. ANALYSIS MODEL
2.1. Performance Analysis of Fractional Guard Channel
The model that we use in this study is some what like the models in [3], [4], [5] and [7] by
considering the retrial customers for the fresh and handover calls. The salient point is that we
implement the fractional guard channel with the two probabilities of the fresh calls (Figure 1). In
the guard channel model, the guard channels reserve for the handover calls. It means that a fresh
call arrives in the system and is accepted with the probability 𝛽𝑖 (0 ≤ 𝛽𝑖 ≤ 1, 𝑖 = 0, 𝑐, where 𝑐 is
the number of the channels) and the system has at least a vacant channel, otherwise it will be
rejected. A handover call is denied when all channels of the system are busy. Also in this model,
the fairness is considered in the resource stores for all calls, including the fresh and handover
calls. The innovations are that implement the fractional guard channels (Definition 2.1) with the
limited capacity of the orbit.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
87
F
⋮
Call admission
control
i=𝛽i F+ H
H
Orbit
1-𝜃
𝜃
1-𝜃’
𝜃’
⋮
c channels
Figure 1.The retrial queueing model in the cellular mobile network.
Definition 2.1 [7]: A fresh or retrial call is admitted by the system in accordance with the
fractional guard channel policy. The handover calls are accepted if the system exists a certainly
available channel, and the fresh calls only are served with the probabilities 𝛽𝑖(0 ≤ 𝛽𝑖 ≤ 1)
depending on the system state.
As the aforementioned issue, we consider the fractional guard channel policies, such as LFGC,
UFGC, LAFGC, and QUFGC. In addition, we assume that the system consists of 𝑐 the operation
channels, 𝑔 the permission channels, the accepted probability of the fresh calls 𝑝(0 ≤ 𝑝 ≤ 1),
and the average value 𝑟(𝑟 ∈ ℝ, 0 ≤ 𝑟 ≤ 𝑐).
LFGC: 𝛽𝑖 = 1 (0 ≤ 𝑖 ≤ 𝑔 − 1), 𝛽𝑔 = 𝑝, 𝛽𝑖 = 0 (𝑔 + 1 ≤ 𝑖 < 𝑐).
LAFGC: 𝛽𝑖 = 1 (0 ≤ 𝑖 ≤ 𝑐 − ⌊𝑟⌋ − 2), 𝛽𝑐−⌊𝑟⌋−1 = 1 − 𝑟 + ⌊𝑟⌋, 𝛽𝑖 = 0 (𝑐 − ⌊𝑟⌋ ≤ 𝑖 < 𝑐).
UFGC: 𝛽𝑖 = 𝑝 (0 ≤ 𝑖 < 𝑐).
QUFGC: 𝛽𝑖 = 1 (0 ≤ 𝑖 ≤ 𝑔 − 1), 𝛽𝑖 = 𝑝 (𝑔 ≤ 𝑖 < 𝑐).
Obviously, we have𝛽𝑐 = 0.
2.2. The Parameters
Considering a certain cell in the cellular mobile network, the system is modeled in Figure 1. The
arrival calls will be admitted by the call admission control with the fractional guard channel
policies. The interarrival times for fresh and handover calls follow the exponential distribution
with the rate 𝐹 and 𝐻, respectively. Let is defined as the interarrival time between
consecutively incoming calls regardless of fresh and handover calls, thus we have = 𝐹 + 𝐻.
Also, the served time follows the exponential distribution with the rate .
A call first arriving the system is blocked due to lacking or allocating the resources. Now it is:
Permanently depart the system with the probability1 − 𝜃(0 < 𝜃 ≤ 1).
or enter the orbit with the probability 𝜃.
In this model, the orbit is considered a queue (capacity𝐿) to store the blocked calls (or the fresh
calls).Similarly, when the retrial calls are unsuccessful, they will:
Permanently depart the system with the probability1 − 𝜃′ (0 < 𝜃′ ≤ 1).
or continue entering the orbit with the probability 𝜃′.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
88
In addition, the retrial rate for the fresh calls from the orbit to the system is .
The fresh or retrial calls enter the system with the probability 𝛽𝑖 in accordance with the state
system. A handover call is served immediately if the system exists at least one vacant channel. In
contrast, it will permanently depart and does not enter orbit.
2.3. Modelling
The system is illustrated by the two-dimensional continuous-time Markov chains 𝑋 =
{(𝐼(𝑡), 𝐽(𝑡)), 𝑡 ≥ 0}, where 𝐼(𝑡)(0 ≤ 𝐼(𝑡) ≤ 𝑐)are the numbers ofthecustomers being served by
the system, and 𝐽(𝑡)(0 ≤ 𝐽(𝑡) ≤ 𝐿)are the numbers of the customerswaiting to enter the system
at the time 𝑡. The state space of the above chains is depicted by Figure 2, where (𝑖, 𝑗)are the
states that the numbers of the occupied channels at the time 𝑡are𝑖(𝑖 = 0, 1, 2, … , 𝑐 − 𝑔, 𝑐 − 𝑔 +
1, … , 𝑐), and the numbers of the customers in the orbit at the time 𝑡are𝑗(𝑗 = 0, 1, 2, … , 𝐿).
1,0
0,0
1,1
0,1 ...
... 1,L-1
0,L-1
1,L
0,L
l0 m
l1 2m
b0a
c,0 c,1 c,L-1 c,L
...
lc-1 cm
(1-q’)a
lFq
cm cm cm
l1 2m l1 2m l1 2m
l0 m l0 m l0 m
L(1-q’)a
lc-1 lc-1 lc-1
c-1,0 c-1,1 ... c-1,
L-1
c-1,L
lc-2 (c-1)m
lF(1- b0)q
lF(1- b1)q
lF(1- bc-1)q
lc-2 lc-2 lc-2
lF(1- b0)q
lF(1- b1)q
lF(1- bc-1)q
lFq
b1a
bc-2a
bc-1a
Lb0a
Lb1a
Lbc-2a
Lbc-1a
(1- bc-1)(1-q’)a
(1- b1)(1-q’)a
(1- b0)(1-q’)a L(1- b0)(1-q’)a
L(1- b1)(1-q’)a
L(1- bc-1)(1-q’)a
2b0a
2(1-q’)a
lFq
lF(1- b0)q
lF(1- b1)q
lF(1- bc-1)q
2b1a
2bc-2a
2bc-1a
2(1- bc-1)(1-q’)a
2(1- b1)(1-q’)a
2(1- b0)(1-q’)a
(L-1)b0a
(L-1)(1-q’)a
lFq
lF(1- b0)q
lF(1- b1)q
lF(1- bc-1)q
(L-1)b1a
(L-1)bc-2a
(L-1)bc-1a
(L-1)(1- bc-1)(1-q’)a
(L-1)(1- b1)(1-q’)a
(L-1)(1- b0)(1-q’)a
(c-1)m (c-1)m (c-1)m
Figure 2. State transition diagram of the model
Let 𝜋𝑖,𝑗 = lim
𝑡→∞
𝑃(𝐼(𝑡) = 𝑖, 𝐽(𝑡) = 𝑗), where 𝜋𝑖,𝑗 are the steady-state probabilities for the state
(𝑖, 𝑗). When the chains 𝑋 = {𝐼(𝑡), 𝐽(𝑡); 𝑡 ≥ 0}are represented through the state transition
matrixes 𝐴𝑗, 𝐵𝑗, 𝐶𝑗 (with theirdimension(𝑐 + 1) × (𝑐 + 1)) [9-13]:
𝐴𝑗(𝑖, 𝑘) are the state transition matrixes for the states from (𝑖, 𝑗) to (𝑘, 𝑗)(0 ≤ 𝑖, 𝑘 ≤
𝑐, 0 ≤ 𝑗 ≤ 𝐿). They express an successful call, which is a fresh or handover call, or a call
having been completed and departing. 𝐴𝑗 has the entries 𝐴𝑗(𝑖, 𝑖 − 1) = 𝑖 (𝑖 = 1, 𝑐) and
𝐴𝑗(𝑖, 𝑖 + 1) = 𝑖 = 𝛽𝑖 𝐹 + 𝐻(𝑖 = 0, 𝑐 − 1) and the rest 0.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
89
𝐴𝑗 = 𝐴 =
(
0 0 0 ⋯ 0 0 0
0 1 ⋯ 0 0 0
⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮
0 0 0 ⋯ (𝑐 − 1) 0 𝑐−1
0 0 0 ⋯ 0 𝑐 0 )
, (𝑗 ≥ 0) (1)
𝐵𝑗(𝑖, 𝑘)are the state transition matrixes for the states from (𝑖, 𝑗) to (𝑘, 𝑗 + 1)(0 ≤ 𝑖, 𝑘 ≤
𝑐, 0 ≤ 𝑗 ≤ 𝐿 − 1). They express a fresh call first arriving the system and entering the
orbit with the probability 𝜃. 𝐵𝑗 has the entries 𝐵𝑗(𝑖, 𝑖) = (1 − 𝛽𝑖)𝜃 𝐹(𝑖 = 0, 𝑐) (note
𝐵𝑗(𝑐, 𝑐) = 𝜃 𝐹 due to 𝛽𝑐 = 0) and the rest 0.
𝐵𝑗 = 𝐵 =
(
𝜎0 ⋯ 0 0
0 ⋯ 0 0
⋮ ⋮ ⋮ ⋮
0 ⋯ 𝜎𝑐−1 0
0 ⋯ 0 𝜎𝑐)
, (𝑗 ≥ 0) (2)
Where 𝜎𝑖 = (1 − 𝛽𝑖)𝜃 𝐹, (0 ≤ 𝑖 ≤ 𝑐).
𝐶𝑗(𝑖, 𝑘)are the state transition matrixes for the states from (𝑖, 𝑗) to (𝑘, 𝑗 − 1)(0 ≤
𝑖, 𝑘 ≤ 𝑐, 1 ≤ 𝑗 ≤ 𝐿). They express a retrial call returning the system. Then it is
served or permanently departs due to its impatience and all channels that are busy.
𝐶𝑗 has the entries 𝐶𝑗(𝑖, 𝑖 + 1) = 𝛽𝑖𝑗 (𝑖 = 0, 𝑐 − 1) and 𝐶𝑗(𝑖, 𝑖) = (1 − 𝛽𝑖)(1 −
𝜃′)𝑗 (𝑖 = 0, 𝑐) (note 𝐶𝑗(𝑐, 𝑐) = (1 − 𝜃′)𝑗 due to 𝛽𝑐 = 0) and the rest 0.
𝐶𝑗 =
(
𝜎0,𝑗 𝛽0𝑗 0 ⋯ 0 0
0 𝜎1,𝑗 𝛽1𝑗 ⋯ 0 0
⋮ ⋮ ⋮ ⋮ ⋮ ⋮
0 0 0 ⋯ 𝜎𝑐−1,𝑗 𝛽𝑐−1𝑗
0 0 0 ⋯ 0 𝜎𝑐,𝑗 )
, (𝑗 ≥ 1) (3)
Where 𝜎𝑖,𝑗 = (1 − 𝛽𝑖)(1 − 𝜃′)𝑗 (0 ≤ 𝑖 ≤ 𝑐, 1 ≤ 𝑗 ≤ 𝐿).
We have the generator matrix 𝑄:
𝑄 =
(
𝑄1
(0)
𝑄2
(0)
𝟎 𝟎 𝟎
𝑄0
(1)
𝑄1
(1)
⋱ 𝟎 𝟎
𝟎 ⋱ ⋱ 𝑄2
(𝐿−2)
𝟎
𝟎 𝟎 𝑄0
(𝐿−1)
𝑄1
(𝐿−1)
𝑄2
(𝐿−1)
𝟎 𝟎 𝟎 𝑄0
(𝐿)
𝑄1
(𝐿)
)
(4)
6. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
90
Where:
{
𝑄1
(0)
= 𝐴 − 𝐷𝐴
− 𝐷𝐵
𝑄1
(𝑗)
= 𝐴 − 𝐷𝐴
− 𝐷𝐵
− 𝐷𝐶𝑗(1 ≤ 𝑗 ≤ 𝐿 − 1)
𝑄𝐿
(0)
= 𝐴 − 𝐷𝐴
− 𝐷𝐶𝐿
𝑄0
(𝑗)
= 𝐶𝑗(1 ≤ 𝑗 ≤ 𝐿)
𝑄2
(𝑗)
= 𝐵 (0 ≤ 𝑗 ≤ 𝐿 − 1)
Where 𝐷𝑋(𝑋 = 𝐴, 𝐵, 𝐶𝑗) are the diagonal matrixes with the entries on the main diagonal that are
the sum of the entries on respective row of the matrix 𝑋. We have:
𝑣𝑄 = (0,0, … ,0)
⏟
(𝑐+1)×(𝑐+1)
(5)
Where 𝑣 = (𝑣0,𝑣1, … , 𝑣𝐿).
Let the probabilities (𝑖, 𝑗) are defined by 𝑝𝑖,𝑗 = lim
𝑡→+∞
𝑃(𝐼(𝑡) = 𝑖, 𝐽(𝑡) = 𝑗), and the level
probabilities vectors 𝑣𝑗 = (𝑝0,𝑗, 𝑝1,𝑗, … , 𝑝𝑐,𝑗)(1 ≤ 𝑗 ≤ 𝐿). The balance equations of the system
are:
𝑣0𝑄1
(0)
+ 𝑣1𝑄0
(1)
= (0,0, … ,0)
⏟
𝑐+1
(6)
𝑣𝑗−1𝑄2
(𝑗−1)
+ 𝑣𝑗𝑄1
(𝑗)
+ 𝑣𝑗+1𝑄1
(𝑗+1)
= (0,0, … ,0)
⏟
𝑐+1
(1 ≤ 𝑗 ≤ 𝐿 − 1) (7)
𝑣𝐿−1𝑄2
(𝐿−1)
+ 𝑣𝐿𝑄1
(𝐿)
= (0,0, … ,0)
⏟
𝑐+1
(8)
∑ 𝑣𝑗
𝐿
𝑗=0
× (
1
1
⋮
1
)
⏟
𝑐+1
= 1 (9)
From (5) and (9), we calculate 𝑣:
𝑣 = 𝑒(𝑄 + 𝐸)−1 (10)
Where 𝑒 is the row vector (1 × (𝑐 + 1)) and 𝐸 is the matrix ((𝑐 + 1) × (𝑐 + 1)) all of whose
elements are the constants 1.
2.4. The Performance Measures of the System
The probability of the fresh calls 𝑃𝐵𝐹 firstly arrives the system and find all busy channels at the
time or is rejected with the probability (1 − 𝛽𝑖).
7. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
91
𝑃𝐵𝐹 = ∑ ∑ 𝑝𝑖,𝑗(1 − 𝛽𝑖)
𝑐
𝑖=0
𝐿
𝑗=0
(11)
The probability of the retrial calls 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 then arrives the system from the orbit and find all
busy channels at the time is rejected with the probability (1 − 𝜃′).
𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 =
(1 − 𝜃′)
𝜃 𝐹
∑ ∑ 𝑗𝑝𝑖,𝑗
𝑐
𝑖=0
𝐿
𝑗=1
(12)
The probability of the handover calls 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 clearly arrives the system and find all busy
channels at the time.
𝑃𝐵𝐻 = ∑ 𝑝𝑐,𝑗
𝐿
𝑗=0
(13)
3. RESULTS
The efficiency of the performance as the change of the parameters of the system is firstly
considered with the fresh and handover calls. When the blocks occur, the fresh calls reattempt to
connect in the intervals of the stochastic distribution. We assume the base station of the cell that
can process 𝑐 the connection simultaneously. Table 1 enumerates the parameters to analyze
results. The Mathematica program of Wolfram Research denoted [14] is a power tool to compute
and simulate for network models and is utilized in the proposed model of the paper.
Table 1. The parameters of the model.
The parameters Values Describe the parameters
𝑐 10 Number of the channels in the cell
𝑔 1 to 7 Number of the accepted channels
𝑝 0.1 to 1 Probability that a fresh call is served
𝐿 1 to 10 Number of the customers in the orbit
𝐻 0.002 to 2 Arrival rate for the handover calls
𝐹 0.018 to 0.2 Arrival rate for the fresh calls
0.2 Service rate
0.4 Retrial rate
𝜃 0.1 to 1 Probability that a fresh call first enters the orbit
𝜃′ 0.1 to 1 Retrial probability that a fresh call re-enters the orbit
3.1. Analysing and Comparing the Blocking Probabilities with Values 𝝆
First, we compare the blocking probabilities 𝑃𝐵 (𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 or 𝑃𝐵𝑅, 𝑃𝐵𝐻) according to a
variety of the fractional guard channel policies with the fluctuations in values 𝜌. It can be seen in
Figure 3, the value 𝜌, the traffic load, is definited by the expression 𝜌 = 𝑐
⁄ . We have 𝑔 = 7,
𝑝 = 0.5, 𝑟 = 2.3 (for the LAFGC policy), 𝐿 = 8, 𝜃 = 0.5, 𝜃′ = 0.5, 𝐹 = 2 𝐻, 𝜌 ranging from
0.3 to 1.9. We find that the blocking probabilities for the LFGC and LAFGC policies are better
than the blocking probabilities for the UFGC and QUFGC policies.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
92
Figure 3. The blocking probability of 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 and 𝑃𝐵𝐻by 𝜌.
This may partly explain that the UFGC and QUFGC policies permit the fresh calls with 𝛽𝑖 = 1 or
𝛽𝑖 = 𝑝(0 ≤ 𝑖 < 𝑐). As a result, the fresh calls are easier to enter the system, and the handover
calls are significantly restricted. In the meanwhile, the LFGC and LAFGC policies control the
fresh calls with 𝛽𝑖 = 0 (0 < 𝐿 ≤ 𝑖 < 𝑐, 𝐿: a particular parameter) at some of the last states with
𝑖 ≥ 𝐿.
3.2. Analysing and comparing the blocking probabilities with values𝒈
With 𝜌 = 0.7, 𝑝 = 0.5, 𝐿 = 8, 𝜃 = 0.5, 𝜃′
= 0.5, 𝐹 = 2 𝐻, 𝑔 ranging from 1 to 7, we obtain
the results as presented in Figure 4.
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.3 0.5 0.7 0.9 1.1 1.3 1.5 1.7 1.9
PB
r
UFGC
PB_F
PB_R
PB_H
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
0.3 0.5 0.7 0.9 1.1 1.3 1.5 1.7 1.9
PB
r
LFGC
PB_F
PB_R
PB_H
0
0.1
0.2
0.3
0.4
0.5
0.6
1 2 3 4 5 6 7
PB
g
UFGC
PB_F
PB_R
PB_H
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.3 0.5 0.7 0.9 1.1 1.3 1.5 1.7 1.9
PB
r
QUFGC
PB_F
PB_R
PB_H
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
0.3 0.5 0.7 0.9 1.1 1.3 1.5 1.7 1.9
PB
r
LAFGC
PB_F
PB_R
PB_H
0
0.1
0.2
0.3
0.4
0.5
0.6
1 2 3 4 5 6 7
PB
g
QUFGC
PB_F
PB_R
PB_H
9. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
93
Figure 4. The blocking probability of 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 , and 𝑃𝐵𝐻by 𝑔.
When we change values 𝑔, the probabilities 𝑃𝐵𝐹 and 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 for the QUFGC policy decrease
inversely proportional to values 𝑔, and the probabilities 𝑃𝐵𝐻 for the QUFGC, UFGC, LFGC and
LAFGC policies remain steady and thus we need to choose an appropriate value 𝑔 for the low
blocking probabilities 𝑃𝐵𝐻. The UFGC policy has the probabilities 𝑃𝐵𝐹 and 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 which
maintain stable due to 𝛽𝑖 = 𝑝(0 ≤ 𝑖 < 𝑐). Similar to the QUFGC policy, the probabilities 𝑃𝐵𝐹
and 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 for the LFGC and LAFGC policies significantly decline because the numbers of
the accepted channels for the fresh and retrial calls gradually increase.
3.2. Analysing and Comparing the Blocking Probabilities with Values 𝑳
With 𝜌 = 0.7, 𝑔 = 7, 𝑝 = 0.5, 𝑟 = 2.3 (for the LAFGC policy), 𝜃 = 0.5, 𝜃′ = 0.5, 𝐹 = 2 𝐻, 𝐿
ranging from 1 to 8, we obtain the results presented in Figure 5.
Figure 5. The blocking probability of 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 , and 𝑃𝐵𝐻by 𝐿.
The blocking probabilities 𝑃𝐵𝐹 and 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 are influenced by the number of the maximum
customers in the orbit 𝐿 when 𝐿 < 4 as Figure 5. When 𝐿 ≥ 4 these probalities are almost
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
1 2 3 4 5 6 7
PB
g
LFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
1 2 3 4 5 6 7 8
PB
L
LFGC
PB_F
PB_R
PB_H
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
1 2 3 4 5 6 7
PB
g
LAFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
1 2 3 4 5 6 7 8
PB
L
LAFGC
PB_F
PB_R
PB_H
10. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
94
steady. While the blocking probabilities 𝑃𝐵𝐻 are not affected regardless of the value 𝐿. This can
be explained that the number of the servers is fixed, the more the customers in the orbit are, the
more blocked the system is. For this reason, we can approximate to the infinite model with 𝐿 →
+∞.
3.3. Analysing and comparing the blocking probabilities with values 𝒑
With 𝜌 = 0.7, 𝑔 = 7, 𝑝 = 0.5, 𝐿 = 8, 𝑟 = 2.3 (for the LAFGC policy), 𝜃 = 0.5, 𝜃′ = 0.5, 𝐹 =
2 𝐻, 𝑝 ranging from 0.1 to 1, we obtain the results as listed in Figure 6.
Figure 6. The blocking probability of 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 , and 𝑃𝐵𝐻by 𝑝.
We found/find that the accepted probabilities of the fresh calls 𝑝 influence on how the
congestions of the fresh and retrial calls are. In these analyses, the blocking probabilities of the
fresh calls for the UFGC and QUFGC policies are better than the ones for the LFGC and LAFGC
policies due to the fact that the the probabilities 𝛽𝑖(0 ≤ 𝑖 ≤ 𝑐) for the LFGC and LAFGC
policies have more the values 𝑝 than the ones for the UFGC and QUFGC policies. As a result, the
fresh and retrial calls ease to enters the system for the LFGC and LAFGC policies.
3.4. Analysing and comparing the blocking probabilities with values 𝝀𝑯 𝝀𝑭
⁄
With 𝜌 = 0.7, 𝑔 = 7, 𝐿 = 8, 𝑝 = 0.5, 𝜃 = 0.5, 𝜃′ = 0.5, 𝐻 𝐹
⁄ ranging from 1 5
⁄ to 5, we
obtain the results as shown in Figure 7.
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
PB
p
UFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
PB
p
LFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
PB
p
QUFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
PB
p
LAFGC
PB_F
PB_R
PB_H
11. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
95
Figure 7. The blocking probability of 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 , and 𝑃𝐵𝐻by 𝐻 𝐹
⁄ .
We find that if the ratio 𝐻 𝐹
⁄ < 1/3, the probabilities 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟 and 𝑃𝐵𝐻 are changed, but if
the ratio 𝐻 𝐹
⁄ ≥ 1/3, the probabilities 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟 and 𝑃𝐵𝐻 remain almost unchanged.
Therefore, we choose the ratio 𝐻 𝐹
⁄ ≥ 1/3 to maintain the stability of the system.
3.5. Analysing and comparing the blocking probabilities with values 𝜽
With 𝜌 = 0.7, 𝑔 = 7, 𝐿 = 8, 𝑝 = 0.5, 𝑟 = 2.3 (for the LAFGC policy), 𝜃′ = 0.5, 𝐹 = 2 𝐻, 𝜃
ranging from 0.1 to 1, we gain the results as presented in Figure 8.
0
0.1
0.2
0.3
0.4
0.5
0.6
1/5 1/4 1/3 1/2 1 2 3 4 5
PB
H/ F
UFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
1/5 1/4 1/3 1/2 1 2 3 4 5
PB
H/ F
LFGC
PB_F
PB_R
PB_H
0
0.1
0.2
0.3
0.4
0.5
0.6
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
PB
q
UFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
1/5 1/4 1/3 1/2 1 2 3 4 5
PB
H/ F
QUFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
1/5 1/4 1/3 1/2 1 2 3 4 5
PB
H/ F
LAFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
PB
q
QUFGC
PB_F
PB_R
PB_H
12. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
96
Figure 8. The blocking probability of 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 , and 𝑃𝐵𝐻by 𝜃.
The parameter 𝜃 gives the influence on the blocking probabilities of the retrial calls rather than
the ones of the fresh calls. This can be explained that the probabilities that a fresh call first enters
the orbit increase resulting in a numerous number of the customers in the the orbit, and the
blocking probabilities of the retrial calls will raise. In the meantime, the probabilities of the
handover calls remain almost unchanged. In these analyses, we find that the parameters ∈
(0.2 − 𝜀, 0.2 + 𝜀), with 𝜀 ≥ 0 is a arbitrarily small real. The system performances are optimized
by the given parameters.
3.6. Analysing and comparing the blocking probabilities with values𝜽′
With 𝜌 = 0.7, 𝑔 = 7, 𝐿 = 8, 𝑝 = 0.5, 𝑟 = 2.3 (for the LAFGC policy), 𝜃 = 0.5, 𝐹 = 2 𝐻, 𝜃′
ranging from 0.1 to 1, we obtain the results as presented Figure 9.
Figure 9. The blocking probability of 𝑃𝐵𝐹, 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 , and 𝑃𝐵𝐻by 𝜃′.
When taking into account the increase in the retrial probabilities 𝜃′(0.1 ≤ 𝜃′ ≤ 0.9), the
blocking probabilities 𝑃𝐵𝐹,𝑟 are declined. Then the retrial calls re-enter the orbit to attempt the
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
PB
q
LFGC
PB_F
PB_R
PB_H
0
0.1
0.2
0.3
0.4
0.5
0.6
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
PB
q'
UFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
PB
q'
LFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
PB
q
LAFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
PB
q'
QUFGC
PB_F
PB_R
PB_H
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
PB
q'
LAFGC
PB_F
PB_R
PB_H
13. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
97
next occasions. On the contrary, the blocking probabilities 𝑃𝐵𝐹 and 𝑃𝐵𝐻 are slightly affected. As
the results ofinFigure 9, when the parameter 𝜃′ tends to the asymptotic value of 1, the blocking
probabilities 𝑃𝐵𝐹,𝑟 almost optimize the certain performances.
(a)
(b)
Figure 10. The blocking probability of 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 (a) and 𝑃𝐵𝐻(b) among LAFGC, LFGC, QUFGC and
UFGC
We find that the blocking probabilities 𝑃𝐵𝐹,𝑟𝑒𝑡𝑟𝑖𝑎𝑙 and 𝑃𝐵𝐻 of LAFGC and LFGC are almost
equivalent (Figure 10). Also, the blocking probabilities 𝑃𝐵𝐻 of QUFGC and UFGC are
approximately equal, yet the blocking probabilities 𝑃𝐵𝐹,𝑟 of QUFGC are better than those of
UFGC. This is explained that the accepted probabilities 𝛽𝑖 of QUFGC are 1 at some initial states.
0
0,1
0,2
0,3
0,4
0,5
0,6
0,7
0,8
0,9
1
0,3 0,5 0,7 0,9 1,1 1,3 1,5 1,7 1,9
PB
F,retrial
r
LAFGC
LFGC
QUFGC
UFGC
0
0,05
0,1
0,15
0,2
0,25
0,3
0,35
0,4
0,45
0,3 0,5 0,7 0,9 1,1 1,3 1,5 1,7 1,9
PB
H
r
LAFGC
LFGC
QUFGC
UFGC
14. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
98
Figure 11. The blocking probability of 𝑃𝐵𝐹 between in [7] and the article.
According to figures extracted from [7] (of Do Van Tien) with 𝐿 = 𝑐 − 1, 𝛽 = 0, 𝑐 = 15, =
1
120
, = 20 , 𝐹 = 24 𝐻, we ascertain that the probabilties of 𝑃𝐵𝐹 in the article are superior to
those of [7]. The disparity is that the further value 𝜃′
can be varied, depending on users’s
adjustments and playing a signal role in reducing the possibilities of obstructing the fresh calls.
4. CONCLUSIONS
We have introduced the retrial queueing model in the cellular mobile network using the fractional
guard channel policy with impatient customers according to the probabilities θ and θ'. The
advantage of the model is the significant decrease of the blocking probabilities for the fresh and
retrial calls as well as the support of the network operation to maintain the stability of QoS under
the influences on the network traffic and additional factors. The generality in the model is
weighed by choosing the retrial queueing model in combination with the fractional guard channel
policies. The analysis results are simple and guarantee the low blocking probabilities of the
handover calls for the fractional guard channel policy in compassion to the blocking probabilities
of the guard channel policy. In addition, the retrial queueing model with the fractional guard
channel policy in the cellular mobile network can be used for the criteria of the different network
traffics to measure the performances. The corollaries elucidate that the model is appropriate and
precise. Besides, the research considers a variety of the fractional guard channel policies,
including the UFGC, QUFGC, LFGC, and LAFGC policies, to fall the blocking probabilities of
the fresh calls, but they still guarantee the handover calls protected with the call admission
control.
CONFLICTS OF INTEREST
The authors declare no conflict of interest.
0
0,02
0,04
0,06
0,08
0,1
0,12
0,14
0,16
0,18
0,2
0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
PB
F
r
LFGC
Do V Tien
This article
15. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
99
REFERENCES
[1] Mandles M. and Tutschku K., (1996). Efficient Call Handling Procedures in Cellular Mobile
Networks.Forschungsbericht, Preprint-Reihe 144, Institut fur Informatik, Universitat Wurzburg,
Germany.
[2] Tran-Gia P. and Mandles M., (1997). Modeling of Customer Retrial Phenomenon in Cellular Mobile
Networks.IEEE Journal on Selected Areas in Communications, 15(8), pp. 1406-1414.
[3] Do T. V. (2010). A new computational algorithm for retrial queues to cellular mobile systems with
guard channels. Computers & Industrial Engineering, 59(4), pp. 865–872.
[4] Linda A. C. and Ani C. I. (2014). A Reservation and Retrial Queue Analysis for Cellular
Networks.International Journal of Engineering Research & Technology (IJERT), ISSN: 2278-0181,
Vol. 3 Issue 2, February – 2014
[5] Bhargava A., Bhagat A. and Singh J., (2016). Modelling and Performance Analysis of Cellular
Mobile Networks.Indian Journal of Science and Technology, Vol 9 (48), December 2016.
[6] Vazquez-Avila J., Cruz-Pérez F.A. and Ortigoza-Guerrero L., (2006). Performance Analysis of
Fractional Guard Channel Policies in Mobile Cellular Networks.IEEE Transactions on Wireless
Communications, 5 (2006), pp. 301-305.
[7] Do T. V. (2011). Solution for A Retrial Queueing Problem in Cellular Networks with the Fractional
Guard Channel Policy.Mathematical and Computer Modelling, 53(11–12), pp. 2058-2065.
[8] Ramjee R., Towsley D. and Nagarajan R., (1997). On Optimal Call Admission Control in Cellular
Networks.Wireless Network, 3(1), March 1997.
[9] Neuts M.F. (1981). Matrix Geometric Solutions in Stochastic Model, Johns Hopkins University
Press, Baltimore.
[10] Tien Van Do, Ram Chakka, An efficient method to compute the rate matrix for retrial queues with
large number of servers, Applied Mathematics Letters 23, (2010) 638-643.
[11] Tien, D.V. (2013). An Enhanced Algorithm to Solve Multiserver Retrial Queueing Systems with
Impatient Customer. Computers & Industrial Engineering, Vol 65, No 4, pp. 719-728.
[12] Kulshrestha R, Agarwal A, Shruti (2019). An adaptive fractional guard channel based CAC scheme
for heterogeneous traffic in wireless cellular networks. In: Proceedings of IEEE 6th international
conference in computing for sustainable global development, Delhi, India, pp 1066–1070.
[13] Do T.V. (2010). An Efficient Computation Algorithm for A Multiserver Feedback retrial Queue With
A Large Queueing Capacity, Applied Mathematical Modelling, 34(8), pp. 2272-2278.
[14] https://www.wolfram.com/mathematica/
16. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
100
AUTHORS
Dang Thanh Chuong obtained his doctorate in Mathematical Foundation for
Computers and Computing Systems in 2014 from the Institute of Information
Technology, Vietnam Academy of Science and Technology (VAST). He has published
over 20 research papers. His research interests are in the fields of all-optical networks
with emphasis on packet/burst-based switching, Contention Resolution, and Quality of
Service; Queueing Theory and Retrial Queue. Email: dtchuong@hueuni.edu.vn.
Hoa Ly Cuong procuring MSc in Computer Science in 2017 from the Hue University
of Science, Hue University. The areas he has engaged in comprise Queueing Theory
and Wireless Networks.
Email: hlcuong90@gmail.com.
Pham TrungDuc In 2010, he graduated with a Bachelor of Information Technology
from University of Sciences, Hue University. In 2012, he received a Master's degree in
Computer Science from Hue University of Sciences. Currently, he is a PhD student at
Hue University of Sciences, Hue University (from December 2016 to the present).
Research fields: OBS network, QoS differentiation, scheduling admission control, QoS
improvement, QoS provisioning. Email: phamtrungduc@hueuni.edu.vn
Duong Duc Hung is a Technical Editor at the HU Journal of Science, Hue University,
Vietnam. His main research topics are Computer Networks and Communications; Text
Mining.
Email: ddhung@hueuni.edu.vn