The aim of equipping a wireless network with a mobile relay node is to support broadband wireless communications for vehicular users and their devices. The high mobility of vehicular users, possibly at a very high velocity in the area in which two cells overlap, could cause the network to suffer from a reduced handover success rate and, hence, increased radio link failure. The combined impact of these problems is service interruptions to vehicular users. Thus, the handover schemes are crucial in solving these problems. In this work, we first present the adaptive handover hysteresis scheme for the wireless network with mobile relay nodes in the high-speed train scenario. Specifically, our proposed adaptive hysteresis scheme is based on the velocity of the train. Second, the handover call dropping probability is reduced by introducing a modified call admission control scheme to support radio resource reservation for handover calls that prioritizes handover calls of mobile relay over the other calls. The proposed solution in which adaptive parameter is combined with call admission control is evaluated by system level simulation. Our simulation results illustrate an increased handover success rate and reduced radio link failures.
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.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
PERFORMANCE COMPARISON OF PACKET SCHEDULING ALGORITHMS FOR VIDEO TRAFFIC IN L...ijmnct
In this paper we have studied downlink packet scheduling algorithms proposed for LTE cellular networks.
The study emphasize on three most promising scheduling algorithms such as: FLS, EXP rule and LOG rule.
The performance of these three algorithms is conducted over video traffic in a vehicular environment using
LTE-Sim simulator. The simulation was setup with varying number of users from 10 - 60 in fixed bounded
regions of 1 km radius. The main goal this study is to provide results that will help in the design process of
packet scheduler for LTE cellular networks, aiming to get better overall performance users. Simulation
results show that, the FLS scheme outperforms in terms of average system throughput, average packet
delay, PLR; and with a satisfactory level of fairness index.
PERFORMANCE ANALYSIS OF CARRIER AGGREGATION FOR VARIOUS MOBILE NETWORK IMPLEM...ijwmn
Carrier Aggregation (CA) is one of the Long Term Evolution Advanced (LTE-A) features that allow mobile network operators (MNO) to combine multiple component carriers (CCs) across the available spectrum to create a wider bandwidth channel for increasing the network data throughput and overall capacity. CA has a potential to enhance data rates and network performance in the downlink, uplink, or both, and it can support aggregation of frequency division duplexing (FDD) as well as time division duplexing (TDD). The technique enables the MNO to exploit fragmented spectrum allocations and can be utilized to aggregate licensed and unlicensed carrier spectrum as well. This paper analyzes the performance gains and complexity level that arises from the aggregation of three inter-band component carriers (3CC) as compared to the aggregation of 2CC using a Vienna LTE System Level simulator. The results show a considerable growth in the average cell throughput when 3CC aggregations are implemented over the 2CC aggregation, at the expense of reduction in the fairness index. The reduction in the fairness index implies that, the scheduler has an increased task in resource allocations due to the added component carrier. Compensating for such decrease in the fairness index could result into scheduler design complexity. The proposed scheme can be adopted in combining various component carriers, to increase the bandwidth and hence the data rates.
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.
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.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
PERFORMANCE COMPARISON OF PACKET SCHEDULING ALGORITHMS FOR VIDEO TRAFFIC IN L...ijmnct
In this paper we have studied downlink packet scheduling algorithms proposed for LTE cellular networks.
The study emphasize on three most promising scheduling algorithms such as: FLS, EXP rule and LOG rule.
The performance of these three algorithms is conducted over video traffic in a vehicular environment using
LTE-Sim simulator. The simulation was setup with varying number of users from 10 - 60 in fixed bounded
regions of 1 km radius. The main goal this study is to provide results that will help in the design process of
packet scheduler for LTE cellular networks, aiming to get better overall performance users. Simulation
results show that, the FLS scheme outperforms in terms of average system throughput, average packet
delay, PLR; and with a satisfactory level of fairness index.
PERFORMANCE ANALYSIS OF CARRIER AGGREGATION FOR VARIOUS MOBILE NETWORK IMPLEM...ijwmn
Carrier Aggregation (CA) is one of the Long Term Evolution Advanced (LTE-A) features that allow mobile network operators (MNO) to combine multiple component carriers (CCs) across the available spectrum to create a wider bandwidth channel for increasing the network data throughput and overall capacity. CA has a potential to enhance data rates and network performance in the downlink, uplink, or both, and it can support aggregation of frequency division duplexing (FDD) as well as time division duplexing (TDD). The technique enables the MNO to exploit fragmented spectrum allocations and can be utilized to aggregate licensed and unlicensed carrier spectrum as well. This paper analyzes the performance gains and complexity level that arises from the aggregation of three inter-band component carriers (3CC) as compared to the aggregation of 2CC using a Vienna LTE System Level simulator. The results show a considerable growth in the average cell throughput when 3CC aggregations are implemented over the 2CC aggregation, at the expense of reduction in the fairness index. The reduction in the fairness index implies that, the scheduler has an increased task in resource allocations due to the added component carrier. Compensating for such decrease in the fairness index could result into scheduler design complexity. The proposed scheme can be adopted in combining various component carriers, to increase the bandwidth and hence the data rates.
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.
3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users and to minimize
the charge on the Macro cells. A key mechanism in the LTE traffic handling is the packet
scheduler which is in charge of allocating resources to active flows in both the frequency and
time dimension. So several scheduling algorithms need to be analyzed for femtocells networks.
In this paper we introduce a performance analysis of three distinct scheduling algorithms of
mixed type of traffic flows in LTE femtocells networks. The particularly study is evaluated in
terms of throughput, packet loss ratio, fairness index and spectral efficiency.
A DDRESSING T HE M ULTICHANNEL S ELECTION , S CHEDULING A ND C OORDINATION...pijans
We discuss a new multichannel coordination and sche
duling challenge called the Multichannel Scheduling
Cost (MSC). It is caused by the inability of the co
ntrol channel to schedule simultaneous transmission
s
resulting in data channels lying idle and their ban
dwidth underutilized. As a result, wasted bandwidth
increases as the number of data channels increases.
To address this challenge, a cyclic scheduling
Algorithm (CSA) is proposed. It employs one dedicat
ed signaling channel and 4 data channels. It is
premised on a proactive channel reservation scheme
which reduces the idleness of channels. The scheme
ensures that data channels are reserved while they
are still busy. The data channels are reserved whil
e
their remaining transmission duration is equal to t
he virtual carrier sensing duration. This gives the
next
pair sufficient time to reserve the current data ch
annel before it becomes available, limiting the MSC
to the
first cycle. The simulation results show a performa
nce benefit of the CSA scheme in addressing the eff
ects
of the MSC
B ENCHMARKING OF C ELL T HROUGHPUT U SING P ROPORTIONAL F AIR S CHEDULE...ijwmn
The proportional fair (PF) scheduling algorithm com
promises between cell throughput and fairness. Many
research findings have been published by various re
searchers about PF algorithm based on mathematical
model and simulations. In this paper we have taken
the practical route to analyse the algorithm based
on
three types of subscription. In this benchmarking s
tudy, the user subscriptions are differentiated as
Gold,
Silver and Bronze schemes and they are provisioned
with certain throughputs. Apart from subscriptions
plans, the channel condition also plays a major rol
e in determining the throughput. So in order to ens
ure
fairness among different subscriptions even in the
bad channel conditions and to deliver the provision
ed
throughputs certain priorities are attached with th
e subscriptions. As per the subscription plans Gold
subscribers are assigned with 50% of the speed offe
red by the network as maximum based on CAT3 speed
(100 Mbps in DL and 50 Mbps in UL), Silver is assig
ned with 25% of the max speed and Bronze is
assigned with 12% of the max speed. The priorities
assigned to subscribers determines the fairness in
the
unfavourable channel conditions - Bronze (high), Si
lver and Gold (medium). In this paper, an
benchmarking tests have been performed with all of
three types of subscribers for nearly two hours in
the
live single cell network without any heterogeneous
cells influencing it. Furthermore, the results are
compared with the simulation results.
Duplexing mode, ARB and modulation approaches parameters affection on LTE upl...IJECEIAES
The next generation of radio technologies designed to increase the capacity and speed of mobile networks. LTE is the first technology designed explicitly for the Next Generation Network NGN and is set to become the de-facto NGN mobile access network standard. It takes advantage of the NGN's capabilities to provide an always-on mobile data experience comparable to wired networks. In this paper LTE uplink waveforms displayed with various duplexing mode, Allocated Resources Blocks ARB, Modulation types and total information per frame, QPSK and 16 QAM used as modulation techniques and tested under AWGN and Rayleigh channels, similarity and interference of the generated waveforms tested using auto-correlation and cross-correlation respectively.
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.
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.
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.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
Macro with pico cells (hetnets) system behaviour using well known scheduling ...ijwmn
This paper demonstrates the concept of using Heterogeneous networks (HetNets) to improve Long Term Evolution (LTE) system by introducing the LTE Advance (LTE-A). The type of HetNets that has been chosen for this study is Macro with Pico cells. Comparing the system performance with and without Pico cells has clearly illustrated using three well-known scheduling algorithms (Proportional Fair PF, Maximum Largest Weighted Delay First MLWDF and Exponential/Proportional Fair EXP/PF). The system is judged based on throughput, Packet Loss Ratio PLR, delay and fairness.. A simulation platform called LTE-Sim has been used to collect the data and produce the paper’s outcomes and graphs. The results prove that adding Pico cells enhances the overall system performance. From the simulation outcomes, the overall system performance is as follows: throughput is duplicated or tripled based on the number of users, the PLR is almost quartered, the delay is nearly reduced ten times (PF case) and changed to be a half (MLWDF/EXP cases), and the fairness stays closer to value of 1. It is considered an efficient and cost effective way to increase the throughput, coverage and reduce the latency.
A Review of Ad hoc on demand distance vector routing and proposed AR-AODVEditor IJMTER
Mobile Ad-hoc networks are a key in the evolution of wireless networks. In mobile
ad hoc networks, there is no centralized infrastructure to monitor or allocate the resources
used by the mobile nodes. The absence of any central coordinator makes the routing a
complex one compared to cellular networks. The Ad hoc On Demand Distance Vector
(AODV) routing algorithm is a routing protocol designed for ad hoc mobile devices. AODV
uses an on demand approach for finding routes .A class of routing protocols called ondemand protocols has recently found attention because of their low routing overhead. The ondemand protocols depend on query floods to discover routes whenever a new route is needed.
Such floods take up a substantial portion of network bandwidth. The routing in Mobile ad hoc
network is difficult and number of reactive routing protocols like AODV, DSR, and DSDV
has been implemented. In this paper, an attempt has been made to thoroughly study all
AODVs and a new AODV is proposed called AR-AODV
Long-Term Advancement Progressed (LTE-ADV) is the advancement of the long-term evolution,
which created via 3GPP. LTE-ADV aims to offer a transmission bandwidth of (100) MHz by using Carrier
Aggregation (CA) to aggregate LTE-ADV carriers. To increase the data capacity of the system and
resource allocation converts a very good tool. LTE-Advanced multiple Component Carriers (CCs) becomes
a difficult optimization problem. In the paper proposes a new scheduling algorithm and compares with a
different scheduling traditional algorithms that are proportional fair and round robin in the CA, in order to
find the best scheduler that provides high-quality throughput and improves fairness. It also evaluates
mapping model types are Mutual Information Effective SINR Mapping (MIESM) and Exponential Effective
SINR Mapping (EESM). The results show that the throughput in the proposed algorithm with MIESM
outperforms from others mapping and scheduling.
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...IJECEIAES
Nowadays, with the advent of smartphones, most of people started to make voice and video conference calls continuously even in a high mobility scenario, the bandwidth requirements have increased considerably, which can cause network congestion phenomena. To avoid network congestion problems and to support high mobility scenario, 3GPP has developed a new cellular standard based packet switching, termed LTE (Long Term Evolution). The purpose of this paper is to evaluate the performance of the new proposed algorithm, named Exponential Modified Largest Weighted Delay First „EXP-MLWDF‟, for high mobility scenario and with the presence of a large number of active users, in comparison with the wellknown algorithms such as a proportional fair algorithm (PF), Exponential Proportional Fairness (EXP/PF), Logarithm Rule (LOG-Rule), Exponential Rule (EXP-Rule) and Modified Largest Weighted Delay First (MLWDF). The performance evaluation is conducted in terms of system throughput, delay and PLR. Finally, it will be concluded that the proposed scheduler satisfies the quality of service (QoS) requirements of the real-time traffic in terms of packet loss ratio (PLR), average throughput and packet delay. Because of the traffic evolution, some key issues related to scheduling strategies that will be considered in the future requirements are discussed in this article.
Performance evaluation of bandwidth optimization algorithm (boa) in atm networkEditor Jacotech
domains: none of them are suitable, alone, for the wide range of traffic services expected in ATM-based networks. Therefore, some integration of these basic schemes should be considered. In this paper, we propose a new traffic control algorithm, called the Bandwidth optimization Algorithm (BOA). BOA is a multi-level control algorithm that attempts to optimally manage network resources and perform traffic control among a wide range of traffic services in ATM-based networks. The basic objective of BOA is to meet the quality of service requirements for different traffic sources, while making the best possible use of network bandwidth. In addition. BOA attempts to minimize network congestion in a preventive way.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
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.
Advancements in Complementary Metal Oxide Semiconductor (CMOS) technology have enabled Wireless Sensor Networks (WSN) to gather, process and transport multimedia (MM) data as well and not just limited to handling ordinary scalar data anymore. This new generation of WSN type is called Wireless Multimedia Sensor Networks (WMSNs). Better and yet relatively cheaper sensors – sensors that are able to sense both scalar data and multimedia data with more advanced functionalities such as being able to handle rather intense computations easily - have sprung up. In this paper, the applications, architectures, challenges and issues faced in the design of WMSNs are explored. Security and privacy issues, over all requirements, proposed and implemented solutions so far, some of the successful achievements and other related works in the field are also highlighted. Open research areas are pointed out and a few solution suggestions to the still persistent problems are made, which, to the best of my knowledge, so far haven’t been explored yet.
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users and to minimize
the charge on the Macro cells. A key mechanism in the LTE traffic handling is the packet
scheduler which is in charge of allocating resources to active flows in both the frequency and
time dimension. So several scheduling algorithms need to be analyzed for femtocells networks.
In this paper we introduce a performance analysis of three distinct scheduling algorithms of
mixed type of traffic flows in LTE femtocells networks. The particularly study is evaluated in
terms of throughput, packet loss ratio, fairness index and spectral efficiency.
A DDRESSING T HE M ULTICHANNEL S ELECTION , S CHEDULING A ND C OORDINATION...pijans
We discuss a new multichannel coordination and sche
duling challenge called the Multichannel Scheduling
Cost (MSC). It is caused by the inability of the co
ntrol channel to schedule simultaneous transmission
s
resulting in data channels lying idle and their ban
dwidth underutilized. As a result, wasted bandwidth
increases as the number of data channels increases.
To address this challenge, a cyclic scheduling
Algorithm (CSA) is proposed. It employs one dedicat
ed signaling channel and 4 data channels. It is
premised on a proactive channel reservation scheme
which reduces the idleness of channels. The scheme
ensures that data channels are reserved while they
are still busy. The data channels are reserved whil
e
their remaining transmission duration is equal to t
he virtual carrier sensing duration. This gives the
next
pair sufficient time to reserve the current data ch
annel before it becomes available, limiting the MSC
to the
first cycle. The simulation results show a performa
nce benefit of the CSA scheme in addressing the eff
ects
of the MSC
B ENCHMARKING OF C ELL T HROUGHPUT U SING P ROPORTIONAL F AIR S CHEDULE...ijwmn
The proportional fair (PF) scheduling algorithm com
promises between cell throughput and fairness. Many
research findings have been published by various re
searchers about PF algorithm based on mathematical
model and simulations. In this paper we have taken
the practical route to analyse the algorithm based
on
three types of subscription. In this benchmarking s
tudy, the user subscriptions are differentiated as
Gold,
Silver and Bronze schemes and they are provisioned
with certain throughputs. Apart from subscriptions
plans, the channel condition also plays a major rol
e in determining the throughput. So in order to ens
ure
fairness among different subscriptions even in the
bad channel conditions and to deliver the provision
ed
throughputs certain priorities are attached with th
e subscriptions. As per the subscription plans Gold
subscribers are assigned with 50% of the speed offe
red by the network as maximum based on CAT3 speed
(100 Mbps in DL and 50 Mbps in UL), Silver is assig
ned with 25% of the max speed and Bronze is
assigned with 12% of the max speed. The priorities
assigned to subscribers determines the fairness in
the
unfavourable channel conditions - Bronze (high), Si
lver and Gold (medium). In this paper, an
benchmarking tests have been performed with all of
three types of subscribers for nearly two hours in
the
live single cell network without any heterogeneous
cells influencing it. Furthermore, the results are
compared with the simulation results.
Duplexing mode, ARB and modulation approaches parameters affection on LTE upl...IJECEIAES
The next generation of radio technologies designed to increase the capacity and speed of mobile networks. LTE is the first technology designed explicitly for the Next Generation Network NGN and is set to become the de-facto NGN mobile access network standard. It takes advantage of the NGN's capabilities to provide an always-on mobile data experience comparable to wired networks. In this paper LTE uplink waveforms displayed with various duplexing mode, Allocated Resources Blocks ARB, Modulation types and total information per frame, QPSK and 16 QAM used as modulation techniques and tested under AWGN and Rayleigh channels, similarity and interference of the generated waveforms tested using auto-correlation and cross-correlation respectively.
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.
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.
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.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
Macro with pico cells (hetnets) system behaviour using well known scheduling ...ijwmn
This paper demonstrates the concept of using Heterogeneous networks (HetNets) to improve Long Term Evolution (LTE) system by introducing the LTE Advance (LTE-A). The type of HetNets that has been chosen for this study is Macro with Pico cells. Comparing the system performance with and without Pico cells has clearly illustrated using three well-known scheduling algorithms (Proportional Fair PF, Maximum Largest Weighted Delay First MLWDF and Exponential/Proportional Fair EXP/PF). The system is judged based on throughput, Packet Loss Ratio PLR, delay and fairness.. A simulation platform called LTE-Sim has been used to collect the data and produce the paper’s outcomes and graphs. The results prove that adding Pico cells enhances the overall system performance. From the simulation outcomes, the overall system performance is as follows: throughput is duplicated or tripled based on the number of users, the PLR is almost quartered, the delay is nearly reduced ten times (PF case) and changed to be a half (MLWDF/EXP cases), and the fairness stays closer to value of 1. It is considered an efficient and cost effective way to increase the throughput, coverage and reduce the latency.
A Review of Ad hoc on demand distance vector routing and proposed AR-AODVEditor IJMTER
Mobile Ad-hoc networks are a key in the evolution of wireless networks. In mobile
ad hoc networks, there is no centralized infrastructure to monitor or allocate the resources
used by the mobile nodes. The absence of any central coordinator makes the routing a
complex one compared to cellular networks. The Ad hoc On Demand Distance Vector
(AODV) routing algorithm is a routing protocol designed for ad hoc mobile devices. AODV
uses an on demand approach for finding routes .A class of routing protocols called ondemand protocols has recently found attention because of their low routing overhead. The ondemand protocols depend on query floods to discover routes whenever a new route is needed.
Such floods take up a substantial portion of network bandwidth. The routing in Mobile ad hoc
network is difficult and number of reactive routing protocols like AODV, DSR, and DSDV
has been implemented. In this paper, an attempt has been made to thoroughly study all
AODVs and a new AODV is proposed called AR-AODV
Long-Term Advancement Progressed (LTE-ADV) is the advancement of the long-term evolution,
which created via 3GPP. LTE-ADV aims to offer a transmission bandwidth of (100) MHz by using Carrier
Aggregation (CA) to aggregate LTE-ADV carriers. To increase the data capacity of the system and
resource allocation converts a very good tool. LTE-Advanced multiple Component Carriers (CCs) becomes
a difficult optimization problem. In the paper proposes a new scheduling algorithm and compares with a
different scheduling traditional algorithms that are proportional fair and round robin in the CA, in order to
find the best scheduler that provides high-quality throughput and improves fairness. It also evaluates
mapping model types are Mutual Information Effective SINR Mapping (MIESM) and Exponential Effective
SINR Mapping (EESM). The results show that the throughput in the proposed algorithm with MIESM
outperforms from others mapping and scheduling.
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...IJECEIAES
Nowadays, with the advent of smartphones, most of people started to make voice and video conference calls continuously even in a high mobility scenario, the bandwidth requirements have increased considerably, which can cause network congestion phenomena. To avoid network congestion problems and to support high mobility scenario, 3GPP has developed a new cellular standard based packet switching, termed LTE (Long Term Evolution). The purpose of this paper is to evaluate the performance of the new proposed algorithm, named Exponential Modified Largest Weighted Delay First „EXP-MLWDF‟, for high mobility scenario and with the presence of a large number of active users, in comparison with the wellknown algorithms such as a proportional fair algorithm (PF), Exponential Proportional Fairness (EXP/PF), Logarithm Rule (LOG-Rule), Exponential Rule (EXP-Rule) and Modified Largest Weighted Delay First (MLWDF). The performance evaluation is conducted in terms of system throughput, delay and PLR. Finally, it will be concluded that the proposed scheduler satisfies the quality of service (QoS) requirements of the real-time traffic in terms of packet loss ratio (PLR), average throughput and packet delay. Because of the traffic evolution, some key issues related to scheduling strategies that will be considered in the future requirements are discussed in this article.
Performance evaluation of bandwidth optimization algorithm (boa) in atm networkEditor Jacotech
domains: none of them are suitable, alone, for the wide range of traffic services expected in ATM-based networks. Therefore, some integration of these basic schemes should be considered. In this paper, we propose a new traffic control algorithm, called the Bandwidth optimization Algorithm (BOA). BOA is a multi-level control algorithm that attempts to optimally manage network resources and perform traffic control among a wide range of traffic services in ATM-based networks. The basic objective of BOA is to meet the quality of service requirements for different traffic sources, while making the best possible use of network bandwidth. In addition. BOA attempts to minimize network congestion in a preventive way.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
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.
Advancements in Complementary Metal Oxide Semiconductor (CMOS) technology have enabled Wireless Sensor Networks (WSN) to gather, process and transport multimedia (MM) data as well and not just limited to handling ordinary scalar data anymore. This new generation of WSN type is called Wireless Multimedia Sensor Networks (WMSNs). Better and yet relatively cheaper sensors – sensors that are able to sense both scalar data and multimedia data with more advanced functionalities such as being able to handle rather intense computations easily - have sprung up. In this paper, the applications, architectures, challenges and issues faced in the design of WMSNs are explored. Security and privacy issues, over all requirements, proposed and implemented solutions so far, some of the successful achievements and other related works in the field are also highlighted. Open research areas are pointed out and a few solution suggestions to the still persistent problems are made, which, to the best of my knowledge, so far haven’t been explored yet.
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
On the approximation of the sum of lognormals by a log skew normal distributionIJCNCJournal
Several methods have been proposed to approximate the sum of lognormal RVs. However the accuracy of each method relies highly on the region of the resulting distribution being examined, and the individual lognormal parameters, i.e., mean and variance. There is no such method which can provide the needed accuracy for all cases. This paper propose a universal yet very simple approximation method for the sum of Lognormals based on log skew normal approximation. The main contribution on this work is to propose an analytical method for log skew normal parameters estimation. The proposed method provides highly accurate approximation to the sum of lognormal distributions over the whole range of dB spreads for any correlation coefficient. Simulation results show that our method outperforms all previously proposed methods and provides an accuracy within 0.01 dB for all cases.
In this paper, an application-based QoS evaluation approach for heterogeneous networks is proposed.It is possible to expand the network capacity and coverage in a dynamic fashion by applying heterogeneous wireless network architecture. However, the Quality of Service (QoS) evaluation of this type of network architecture is very challenging due to the presence of different communication technologies. Different communication technologies have different characteristics and the applications that utilize them have unique QoS requirements. Although, the communication technologies have different performance measurement parameters, the applications using these radio access networks have the same QoS requirements. As a result, it would be easier to evaluate the QoS of the access networks and the overall network configuration based on the performance of applications running on them. Using such applicationbased QoS evaluation approach, the heterogeneous nature of the underlying networks and the diversity of their traffic can be adequately taken into account. Through simulation studies, we show that the application performance based assessment approach facilitates better QoS management and monitoring of heterogeneous network configurations.
ENERGY SAVINGS IN APPLICATIONS FOR WIRELESS SENSOR NETWORKS TIME CRITICAL REQ...IJCNCJournal
Along with handling and poor storage capacity, each sensor in wireless sensor network (WSN) is equipped
with a limited power source and very difficult to be replaced in most application environments. Improving
the energy savings in applications for wireless sensor networks is necessary. In this paper, we mainly focus
on energy consumption savings in applications for wireless sensor networks time critical requirements. Our
Paper accompanying analysis of advanced technologies for energy saving techniques for the optimization
of energy efficiency together with the data transmission is optimal. Moreover, we propose improvements to
increase energy savings in applications for wireless sensor networks require time critical (LEACH
improvements). Simulation results show that our proposed protocol significantly better than LEACH about
the formation of clusters in each round, the average power, the number of nodes alive and average total
received data in base stations.
PERFORMANCE ASSESSMENT OF CHAOTIC SEQUENCE DERIVED FROM BIFURCATION DEPENDENT...IJCNCJournal
In CDMA system, m-sequence and Gold codes are often utilized for spreading-despreading and
scrambling-descrambling operations. In a previous work, a design framework was created for generating
large family of codes from logistic map, which have comparable autocorrelation and cross correlation to
m-sequence and Gold codes. The purpose of this work is to evaluate the performance of these chaotic
codes in a CDMA environment. In the bit error rate (BER) simulation, matched filter, decorrelator and
MMSE receiver have been utilized. The received signal was modelled for synchronous CDMA uplink for
simulation simplicity purpose. Additive White Gaussian Noise channel model was assumed for the
simulation.
As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system.
ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NE...IJCNCJournal
Transmitter range assignment in clustered wireless networks is the bottleneck of the balance between
energy conservation and the connectivity to deliver data to the sink or gateway node. The aim of this
research is to optimize the energy consumption through reducing the transmission ranges of the nodes,
while maintaining high probability to have end-to-end connectivity to the network’s data sink. We modified
the approach given in [1] to achieve more than 25% power saving through reducing cluster head (CH)
transmission range of the backbone nodes in a multihop wireless sensor network with ensuring at least
95% end-to-end connectivity probability.
Using spectral radius ratio for node degreeIJCNCJournal
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
PERFORMANCE ANALYSIS OF MULTI-PATH TCP NETWORKIJCNCJournal
MPTCP is proposed by IETF working group, it allows a single TCP stream to be split across multiple
paths. It has obvious benefits in performance and reliability. MPTCP has implemented in Linux-based
distributions that can be compiled and installed to be used for both real and experimental scenarios. In this
article, we provide performance analyses for MPTCP with a laptop connected to WiFi access point and 3G
cellular network at the same time. We prove experimentally that MPTCP outperforms regular TCP for
WiFi or 3G interfaces. We also compare four types of congestion control algorithms for MPTCP that are
also implemented in the Linux Kernel. Results show that Alias Linked Increase Congestion Control
algorithm outperforms the others in the normal traffic load while Balanced Linked Adaptation algorithm
outperforms the rest when the paths are shared with heavy traffic, which is not supported by MPTCP.
HIDING A MESSAGE IN MP3 USING LSB WITH 1, 2, 3 AND 4 BITSIJCNCJournal
Steganography is the art of hiding information in ways that prevent the detection of hidden messages. This
paper presentsa new method which randomly selects position in MP3 file to hide a text secret messageby
using Least Significant Bit (LSB) technique. The text secret message isused in start and ends locations a
unique signature or key.The methodology focuses to embed one bit, two bits, three bitsor four bits from
secret message into MP3 file by using LSB techniques. The evaluation and performancemethods are based
on robustness (BER and correlation), Imperceptibility (PSNR) and hiding capacity (Ratio between Sizes of
text message and MP3 Cover) indicators.The experimental results show the new method is more security.
Moreover the contribution of this paper is the provision of a robustness-based classification of LSB
steganography models depending on their occurrence in the embedding position.
APPROXIMATING NASH EQUILIBRIUM UNIQUENESS OF POWER CONTROL IN PRACTICAL WSNSIJCNCJournal
Transmission power has a major impact on link and communication reliability and network lifetime in Wireless Sensor Networks. We study power control in a multi-hop Wireless Sensor Network where nodes' communication interfere with each other. Our objective is to determine each node's transmission power level that will reduce the communication interference and keep energy consumption to a minimum. We propose a potential game approach to obtain the unique equilibrium of the network transmission power allocation. The unique equilibrium is located in a continuous domain. However, radio transceivers accept only discrete values for transmission power level setting. We study the viability and performance of mapping the continuous solution from the potential game to the discrete domain required by the radio. We demonstrate the success of our approach through TOSSIM simulation when nodes use the Collection Tree Protocol for routing the data. Also, we show results of our method from the Indriya testbed. We compare it with the case where the motes use Collection Tree Protocol with the maximum transmission power.
Sensor nodes are highly mobile, which makes the application running on them face network related problems like node failure, link failure, network level disconnection, scarcity of resources etc. Node failure and Network fault are need to be monitored continuously by supervising the network status especially for critical applications like Health Monitoring System. We propose Node Monitoring protocol (NMP) to monitor the node good conditions using agents and ensure that node gets promised quality of service. These Nodes senses environment and communicates important data to the sink or base station. To establish the correct event time, these nodes need to be synchronized with global clock. Therefore, time synchronization is very important parameter. We have built a simulating environment for Validating Node Monitoring Protocol (NMP) to assess the reliability of Health Monitoring systems. Formal Specification and Description Language tool (SDL) has been used to validate the NMP at design time in order to increase the confidence and efficiency of the system.
Maximizing network interruption in wirelessIJCNCJournal
With the colossal growth of wireless sensor networks (WSNs) in different applications starting from home
automation to military affairs, the pressure on ensuring security in such a network is paramount.
Considering the security challenges, it is really a hard-hitting effort to develop a secured WSN system.
Moreover, as the information technology is getting popular, the intruders are also planning new ideas to
break the system security, to harm the network and to make the system quality down with the target of
taking the control of the network to corrupt it or to get benefits from it anyway. The intruders corrupt the
system only when the security breaking cost (SBC) is lower compared with the benefits they attained or the
harm it can make to others. In this paper, the authors define the term “maximizing network interruption
problem” and propose a technique, called the grid point approximation algorithm, to estimate the SBC of a
multi-hop WSN so that it can be made tougher for an intruder to break the system security. It is assumed
that the intruder has the complete picture of the entire network. The technique is designed from the
intruder’s point of view for completely jamming all the sensor nodes in the network through placing
jammers or malicious nodes strategically and at the same time keeping the number of jammer nodes to
minimum or near minimum. To the best of the authors’ knowledge, there is no work proposed so far of the
same kind. Experimental results with the changes of the different network parameters show that the
proposed algorithm is able to provide excellent performances to achieve the targets.
A NOVEL METHOD TO TEST DEPENDABLE COMPOSED SERVICE COMPONENTSIJCNCJournal
Assessing Web service systems performance and their dependability are crucial for the development of
today’s applications. Testing the performance and Fault Tolerance Mechanisms (FTMs) of composed
service components is hard to be measured at design time due to service instability is often caused by the
nature of the network conditions. Using a real internet environment for testing systems is difficult to set up
and control. We have introduced a fault injection toolkit that emulates a WAN within a LAN environment
between composed service components and offers full control over the emulated environment in addition to
the capability to inject network-related faults and application specific faults. The toolkit also generates
background workloads on the system under test so as to produce more realistic results. We describe an
experiment that has been performed to examine the impact of fault tolerance protocols deployed at a
service client by using our toolkit system.
These days considering expansion of networks, dissemination of information has become one of significant cases for researchers. In social networks in addition to social structures and people effectiveness on each other, Profit increase of sales, publishing a news or rumor, spread or diffusion of an idea can be mentioned. In social societies, people affect each other and with an individual’s membership, his friends
may join that group as well. In publishing a piece of news, independent of its nature there are different ways to expand it. Since information isn’t always suitable and positive, this article is trying to introduce the immunization mechanism against this information. The meaning of immunization is a kind of Slow Publishing of such information in network. Therefor it has been tried in this article to slow down the
publishing of information or even stop them. With comparison of presented methods for immunization and also presenting rate delay parameter, the immunization of methods were evaluated and we identified the most effective immunization method. Among existing methods for immunization and recommended methods, recommended methods also have an effective role in preventing spread of malicious rumor.
PERFORMANCE EVALUATION OF WIRELESS SENSOR NETWORK UNDER HELLO FLOOD ATTACKIJCNCJournal
Wireless sensor network (WSN) is highly used in many fields. The network consists of tiny lightweight
sensor nodes and is largely used to scan or detect or monitor environments. Since these sensor nodes are
tiny and lightweight, they put some limitations on resources such as usage of power, processing given task,
radio frequency range. These limitations allow network vulnerable to many different types of attacks such
as hello flood attack, black hole, Sybil attack, sinkhole, and many more. Among these attacks, hello flood is
one of the most important attacks. In this paper,we have analyzed the performance of hello flood attack and
compared the network performance as number of attackers increases. Network performance is evaluated
by modifying the ad-hoc on demand distance vector (AODV) routing protocol by using NS2 simulator. It
has been tested under different scenarios like no attacker, single attacker, and multiple attackers to know
how the network performance changes. The simulation results show that as the number of attackers
increases the performance in terms of throughput and delay changes.
A predictive framework for cyber security analytics using attack graphsIJCNCJournal
Security metrics serve as a powerful tool for organizations to understand the effectiveness of protecting computer networks. However majority of these measurement techniques don’t adequately help corporations to make informed risk management decisions. In this paper we present a stochastic security framework for obtaining quantitative measures of security by taking into account the dynamic attributes associated with vulnerabilities that can change over time. Our model is novel as existing research in attack graph analysis do not consider the temporal aspects associated with the vulnerabilities, such as the availability of exploits and patches which can affect the overall network security based on how the vulnerabilities are interconnected and leveraged to compromise the system. In order to have a more realistic representation of how the security state of the network would vary over time, a nonhomogeneous model is developed which incorporates a time dependent covariate, namely the vulnerability age. The daily transition-probability matrices are estimated using Frei's Vulnerability Lifecycle model. We also leverage the trusted CVSS metric domain to analyze how the total exploitability and impact measures evolve over a time period for a given network.
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD REL...IJCNCJournal
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
A SURVEY ON CALL ADMISSION CONTROL SCHEMES IN LTEIJCSES Journal
The growing number of mobile users with diverse applications such as VoIP, video, internet surfing etc. has made LTE networks to adopt a CAC strategy in order to ensure the quality of service (QoS) requirements of these applications. Over the years, several CAC schemes have been proposed to either accept or reject service requests. This paper presents a survey of these schemes under four different classes. The classes are: Bandwidth Reservation (BR), Bandwidth Degradation (BD), BR and BD and Non-BR and Non-BD (NBR-NBD). In each of the classification, the operation procedure, strengths and weaknesses of each scheme has been discussed. Furthermore, a comparative analysis of these schemes is also presented. The analysis provides insight into the challenges in the design of CAC by highlighting open research issues for future directions.
Spectrum Sharing between Cellular and Wi-Fi Networks based on Deep Reinforcem...IJCNCJournal
Recently, mobile traffic is growing rapidly and spectrum resources are becoming scarce in wireless networks. Due to this, the wireless network capacity will not meet the traffic demand. To address this problem, using cellular systems in an unlicensed spectrum emerged as an effective solution. In this case, cellular systems need to coexist with Wi-Fi and other systems. For that, we propose an efficient channel assignment method for Wi-Fi AP and cellular NB, based on the DRL method. To train the DDQN model, we implement an emulator as an environment for spectrum sharing in densely deployed NB and APs in wireless heterogeneous networks. Our proposed DDQN algorithm improves the average throughput from 25.5% to 48.7% in different user arrival rates compared to the conventional method. We evaluated the generalization performance of the trained agent, to confirm channel allocation efficiency in terms of average throughput under the different user arrival rates.
Spectrum Sharing between Cellular and Wi-Fi Networks based on Deep Reinforcem...IJCNCJournal
Recently, mobile traf ic is growing rapidly and spectrum resources are becoming scarce in wireless
networks. Due to this, the wireless network capacity will not meet the traf ic demand. To address this
problem, using cellular systems in an unlicensed spectrum emerged as an ef ective solution. In this case,
cellular systems need to coexist with Wi-Fi and other systems. For that, we propose an ef icient channel
assignment method for Wi-Fi AP and cellular NB, based on the DRL method. To train the DDQN model,
we implement an emulator as an environment for spectrum sharing in densely deployed NB and APs in
wireless heterogeneous networks. Our proposed DDQN algorithm improves the average throughput from
25.5% to 48.7% in dif erent user arrival rates compared to the conventional method. We evaluated the
generalization performance of the trained agent, to confirm channel allocation ef iciency in terms of
average throughput under the dif erent user arrival rates
PERFORMANCE ANALYSIS OF CARRIER AGGREGATION FOR VARIOUS MOBILE NETWORK IMPLEM...ijwmn
Carrier Aggregation (CA) is one of the Long Term Evolution Advanced (LTE-A) features that allow mobile
network operators (MNO) to combine multiple component carriers (CCs) across the available spectrum to
create a wider bandwidth channel for increasing the network data throughput and overall capacity. CA has
a potential to enhance data rates and network performance in the downlink, uplink, or both, and it can
support aggregation of frequency division duplexing (FDD) as well as time division duplexing (TDD). The
technique enables the MNO to exploit fragmented spectrum allocations and can be utilized to aggregate
licensed and unlicensed carrier spectrum as well.
This paper analyzes the performance gains and complexity level that arises from the aggregation of three
inter-band component carriers (3CC) as compared to the aggregation of 2CC using a Vienna LTE System
Level simulator. The results show a considerable growth in the average cell throughput when 3CC
aggregations are implemented over the 2CC aggregation, at the expense of reduction in the fairness index.
The reduction in the fairness index implies that, the scheduler has an increased task in resource allocations
due to the added component carrier. Compensating for such decrease in the fairness index could result into
scheduler design complexity. The proposed scheme can be adopted in combining various component
carriers, to increase the bandwidth and hence the data rates.
PERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKScscpconf
3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users and to minimize the charge on the Macro cells. A key mechanism in the LTE traffic handling is the packet
scheduler which is in charge of allocating resources to active flows in both the frequency and time dimension. So several scheduling algorithms need to be analyzed for femtocells networks. In this paper we introduce a performance analysis of three distinct scheduling algorithms of mixed type of traffic flows in LTE femtocells networks. The particularly study is evaluated in terms of throughput, packet loss ratio, fairness index and spectral efficiency.
The important goal of this thesis is represented as demonstrating a self-organising based process for current versions of heterogeneous LTE-Advanced networks to simultaneously improve both quality of service and ability. The main index terms of this research could be exhibited as: SON; LTE-A, HetNets; Femtocell; Interference, Multi-Layer; Handover, Access Control; Power Control, eICIC. The self-organizing method of this research is described as the primary goal, to be got through the following targets: ThesisScientist.com
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
Radio Resource Management for Eicic, Comp, Relaying and Back-hauls Techniques...ijwmn
Frequency reuse in cells is one of the strategies that LTE (Long Term Evolution) uses to maximize the spectrum efficiency. However, it leads to an interference among the cells, especially at the cell edges where the probability for a cell-edge user to be scheduled on a resource block that is being transmitted by the neighbouring cell is high; consequently, the interference is high. In-order to mitigate Inter-Cell Interference (ICI), Inter-Cell Interference Coordination (ICIC) was proposed by the Third Generation Partnership Project (3GPP) standards for the LTE network, and later on, the enhanced Inter-Cell Interference Coordination (eICIC) was proposed for the LTE-Advanced network. ICIC reduces cell-edge interference on traffic channels from neighbouring cells by the use of three interference reduction schemes that works in the power and frequency domain, and they are based on lowering the power of some channels to limit their reception to the users that are close to the base station, and by reducing the chance of frequency overlap. eICIC was proposed to handle ICI in Heterogeneous Network (HetNet) deployments. It reduces the interference on both the traffic and control channels. It uses power, frequency and also time domain to mitigate intra-frequency interference in HetNets. Another technique that was proposed by the 3GPP for the LTE-Advanced network that can reduce the ICI and improve the cell average and cell-edge user throughput is the Coordinated Multi-Point (CoMP) transmission/reception technique. CoMP can increase the cell average and cell edge user throughput in both the uplink and downlink transmission by joint scheduling and data processing in multiple cells/eNBs. Another technique that was proposed by the 3GPP for the LTE-Advanced network that can improve the LTE network coverage in difficult conditions is to deploy Relay Nodes (RNs). In this paper, we survey Radio Resource Management (RRM) for some of the techniques that are used with LTE-A. The included techniques in this paper are; the ICIC, eICIC, CoMP, Relaying and Back-hauls. We start by explaining the concepts of these techniques. Then, by summarizing the radio resource management approaches that were proposed in the literature for these techniques. And finally, we provide some concluding remarks in the last section.
RADIO RESOURCE MANAGEMENT FOR EICIC, COMP, RELAYING AND BACK-HAULS TECHNIQUES...ijwmn
Frequency reuse in cells is one of the strategies that LTE (Long Term Evolution) uses to maximize the
spectrum efficiency. However, it leads to an interference among the cells, especially at the cell edges where
the probability for a cell-edge user to be scheduled on a resource block that is being transmitted by the
neighbouring cell is high; consequently, the interference is high. In-order to mitigate Inter-Cell
Interference (ICI), Inter-Cell Interference Coordination (ICIC) was proposed by the Third Generation
Partnership Project (3GPP) standards for the LTE network, and later on, the enhanced Inter-Cell
Interference Coordination (eICIC) was proposed for the LTE-Advanced network. ICIC reduces cell-edge
interference on traffic channels from neighbouring cells by the use of three interference reduction schemes
that works in the power and frequency domain, and they are based on lowering the power of some channels
to limit their reception to the users that are close to the base station, and by reducing the chance of
frequency overlap. eICIC was proposed to handle ICI in Heterogeneous Network (HetNet) deployments. It
reduces the interference on both the traffic and control channels. It uses power, frequency and also time
domain to mitigate intra-frequency interference in HetNets. Another technique that was proposed by the
3GPP for the LTE-Advanced network that can reduce the ICI and improve the cell average and cell-edge
user throughput is the Coordinated Multi-Point (CoMP) transmission/reception technique. CoMP can
increase the cell average and cell edge user throughput in both the uplink and downlink transmission by
joint scheduling and data processing in multiple cells/eNBs. Another technique that was proposed by the
3GPP for the LTE-Advanced network that can improve the LTE network coverage in difficult conditions is
to deploy Relay Nodes (RNs). In this paper, we survey Radio Resource Management (RRM) for some of the
techniques that are used with LTE-A. The included techniques in this paper are; the ICIC, eICIC, CoMP,
Relaying and Back-hauls. We start by explaining the concepts of these techniques. Then, by summarizing
the radio resource management approaches that were proposed in the literature for these techniques. And
finally, we provide some concluding remarks in the last section.
MECC scheduling algorithm in vehicular environment for uplink transmission in...IJECEIAES
Single Carrier Frequency Division Multiple Access (SC-FDMA) is chosen because of the lower peak-to-average power ratio (PAPR) value in uplink transmission. However, the contiguity constraint is one of the major constraint presents in uplink packet scheduling, where all RBs allocated to a single UE must be contiguous in the frequency-domain within each time slot to maintain its single carrier. This paper proposed an uplink-scheduling algorithm namely the Maximum Expansion with Contiguity Constraints (MECC) algorithm, which supports both the RT and NRT services. The MECC algorithm is deployed in two stages. In the first stage, the RBs are allocated fairly among the UEs. The second stage allocates the RBs with the highest metric value and expands the allocation on both sides of the matrix, M with respect to the contiguity constraint. The performance of the MECC algorithm was observed in terms of throughput, fairness, delay, and Packet Loss Ratio (PLR) for VoIP, video and best effort flows. The MECC scheduling algorithm is compared to other algorithms namely the Round Robin (RR), Channel-Dependent First Maximum Expansion (CD-FME), and Proportional Fairness First Maximum Expansion (PF-FME). From here, it can be concluded that the MECC algorithm shows the best results among other algorithms by delivering the highest throughput which is up to 81.29% and 90.04% than CD-FME and RR scheduler for RT and NRT traffic respectively, having low PLR and delay which is up to 93.92% and 56.22% of improvement than CD-FME for the RT traffic flow. The MECC also has a satisfactory level of fairness for the cell-edge users in a vehicular environment of LTE network.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
The Optimal Link State Routing (OLSR) protocol employs multipoint relay (MPR) nodes to disseminate topology control (TC) messages, enabling network topology discovery and maintenance. However, this approach increases control overhead and leads to wasted network bandwidth in stable topology scenarios due to fixed flooding periods. To address these challenges, this paper presents an Efficient Topology Maintenance Algorithm (ETM-OLSR) for Enhanced Link-State Routing Protocols. By reducing the number of MPR nodes, TC message generation and forwarding frequency are minimized. Furthermore, the algorithm selects a smaller subset of TC messages based on the changes in the MPR selection set from the previous cycle, adapting to stable and fluctuating network conditions. Additionally, the sending cycle of TC messages is dynamically adjusted in response to network topology changes. Simulation results demonstrate that the ETM-OLSR algorithm effectively reduces network control overhead, minimizes end-to-end delay, and improves network throughput compared to traditional OLSR and HTR-OLSR algorithms.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
The Optimal Link State Routing (OLSR) protocol employs multipoint relay (MPR) nodes to disseminate topology control (TC) messages, enabling network topology discovery and maintenance. However, this approach increases control overhead and leads to wasted network bandwidth in stable topology scenarios due to fixed flooding periods. To address these challenges, this paper presents an Efficient Topology Maintenance Algorithm (ETM-OLSR) for Enhanced Link-State Routing Protocols. By reducing the number of MPR nodes, TC message generation and forwarding frequency are minimized. Furthermore, the algorithm selects a smaller subset of TC messages based on the changes in the MPR selection set from the previous cycle, adapting to stable and fluctuating network conditions. Additionally, the sending cycle of TC messages is dynamically adjusted in response to network topology changes. Simulation results demonstrate that the ETM-OLSR algorithm effectively reduces network control overhead, minimizes end-to-end delay, and improves network throughput compared to traditional OLSR and HTR-OLSR algorithms.
Long-Term Evolution (LTE), an emerging and promising fourth generation mobile technology, is expected
to offer ubiquitous broadband access to the mobile subscribers. In this paper, the performance of Frame
Level Scheduler (FLS), Exponential (EXP) rule, Logarithmic (LOG) rule and Maximum-Largest Weighted
Delay First (M-LWDF) packet scheduling algorithms has been studied in the downlink 3GPP LTE cellular
network. To this aim, a single cell with interference scenario has been considered. The performance
evaluation is made by varying the number of UEs ranging from 10 to 50 (Case 1) and user speed in the
range of [3, 120] km/h (Case 2). Results show that while the number of UEs and user speed increases, the
performance of the considered scheduling schemes degrades and in both case FLS outperforms other three
schemes in terms of several performance indexes such as average throughput, packet loss ratio (PLR),
packet delay and fairness index.
Smart optimization in 802.11p media access control protocol for vehicular ad ...IJECEIAES
The innovative idea presented in this research is that advancements in automotive networks and embedded devices can be used to assess the impact of congestion control on throughput and packet delivery ratio (PDR), or socalled multimedia content delivery. Vehicle networking and the distribution of multimedia content have become essential factors in getting packets to their intended recipients due to the availability of bandwidth. Vehicle-toinfrastructure (V2I) communication systems are crucial in vehicular ad hoc networks (VANETs), which permit vehicles to connect by distributing and delivering traffic data and transmission packet schemes. High levels of mobility and changing network topology necessitate dispersed monitoring and execution for congestion control. The amount of traffic congestion for packet transfers could be reduced by enhancing congestion management in terms of throughput and PDR percentages. In a highway setting, the Taguchi approach has been used to optimize the parameters for congestion control. Based on throughput and PDR performance measures, this technique minimizes superfluous traffic information and lowers the likelihood of network congestion. The simulation results have shown that the proposed approach performs better since it increases network performance while effectively utilizing bandwidth. The effectiveness of the suggested technique is evaluated using a typical VANETs scenario for V2I communication while driving on a highway.
Call Admission Control Scheme With Multimedia Scheduling Service in WiMAX Net...Waqas Tariq
WiMAX network introduces a multimedia data scheduling service with different quality of service (QoS) requirements. Transmission opportunities are scheduled by the service according to the types of traffic data for the different connections or users. In the paper, we first propose a uniform definition of QoS level for the multimedia data types in the service. The QoS level of a connection are determined by the type of data of the connection and its allocated resources. Based on these QoS levels, we propose a call admission control (CAC) scheme for the entry admission of a new connection without degrading the network performance and the QoS of ongoing connections. The key idea of this scheme is to regulate the arriving traffic of the network such that the network can work at an optimal point, given under a heavy load traffic. Taking advantage of the simulation experiments, we confirm the fact that the proposed scheme can achieve better trade-off between the overall performance of network system and the QoS level of individual connection.
Simulation of LTE-TDD in the HAPS channel IJECEIAES
LTE stands for Long Term Evolution. This technology enhances the data rate and capacity using a new radio interface and an optimized core network. This progress was done to satisfy standards defined for the fourth generation of cellular communications in ITU. LTE has two types of transmission: Frequency Division Duplex (FDD) and Time Division Duplex (TDD). Nowadays, LTE-TDD rapidly Grows and takes place of old fixed cellular communications, like WiMAX. Another upcoming technology in the communication industry is High Amplitude Platform Stations (HAPS). Studying the capability of HAPS as a base station for LTE-TDD is the main purpose of this paper. Simulations have done using HAPS channel and compared to Stanford University Interim (SUI) standard channels for different scenarios. Results were compared to achieve a conclusion on HAPS implementation for LTE-TDD based on BER and data throughput.
A Case Study on Ip Based Cdma Ran by Controlling RouterIJERA Editor
As communication plays an important role in day to day life, the effective and efficient data transmission is to be maintained. This paper mainly deals with implements a congestion control mechanism using Router control method for IP-RAN on CDMA cellular network. The Router control mechanism uses the features of CDMA networks using active Queue Management technique to reduce delay and to minimize the correlated losses. When utilizing these new personal tools and services to enrich our lives, while being mobile, we are using Mobile Multimedia applications. As new handsets, new technologies and new business models are introduced on the marketplace, new attractive multimedia services can and will be launched, fulfilling the demands. Because the number of multimedia services and even more so, the context in which the services are used is numerous, the following model is introduced in order to simplify and clarify how different services will evolve, enrich our lives and fulfill our desires.The proposed paper work is to be realized using Matlab platform.
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.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
ADAPTIVE HANDOVER HYSTERESIS AND CALL ADMISSION CONTROL FOR MOBILE RELAY NODES
1. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
DOI : 10.5121/ijcnc.2015.7606 87
ADAPTIVE HANDOVER HYSTERESIS AND
CALL ADMISSION CONTROL FOR MOBILE
RELAY NODES
Battulga Davaasambuu1
, Frank Semaganga2
and Takuro Sato2
1
Graduated School of Global Information and Telecommunication Studies, Waseda
University, Bldg. No. 29-7, 1-3-10 Nishiwaseda, Tokyo, Japan 169-0051
2
Department of Communications and Computer Engineering, School of Fundamental
Science and Engineering, Waseda University, 66 Bldg., 802, 3-14-9 Ookubo, Tokyo 169-
0072, Japan
ABSTRACT
The aim of equipping a wireless network with a mobile relay node is to support broadband wireless
communications for vehicular users and their devices. The high mobility of vehicular users, possibly at a
very high velocity in the area in which two cells overlap, could cause the network to suffer from a reduced
handover success rate and, hence, increased radio link failure. The combined impact of these problems is
service interruptions to vehicular users. Thus, the handover schemes are crucial in solving these problems.
In this work, we first present the adaptive handover hysteresis scheme for the wireless network with mobile
relay nodes in the high-speed train scenario. Specifically, our proposed adaptive hysteresis scheme is
based on the velocity of the train. Second, the handover call dropping probability is reduced by introducing
a modified call admission control scheme to support radio resource reservation for handover calls that
prioritizes handover calls of mobile relay over the other calls. The proposed solution in which adaptive
parameter is combined with call admission control is evaluated by system level simulation. Our simulation
results illustrate an increased handover success rate and reduced radio link failures.
KEYWORDS
Handover, hysteresis, mobile relay node; call admission control, LTE
1.INTRODUCTION
Long-Term Evolution (LTE) is the wireless technology that was developed by the 3rd Generation
Partnership Project (3GPP) and which contributed to the development of 4G systems. LTE
supports the OFDM (orthogonal frequency-division multiple), 2x2 and 4x4 MIMO (multi-input
multi-output) antenna systems, as well as FDD (frequency-division duplexing) and TDD (time-
division duplexing) modes. Apart from providing cost-effective broadband communication
services, LTE provides improved capacity, higher throughput, increased spectrum efficiency,
lower latency and improved coverage [1]. LTE has been superseded by enhanced LTE, which is
known as Long-Term Evolution Advanced (LTE-A). LTE-A includes new capabilities, which
offer sufficient performance to support good-quality IP-based video streaming and other
multimedia services over IP to a large number of customers simultaneously [1].
2. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
88
A relay node architecture is included in LTE with the purpose of increasing the capacity of the
system and the coverage area [2,3]. The relay node architecture is schemed to support mobility in
LTE-A Release 12 [4,5]. From a technical point of view, similar to the fixed relay node (FRN),
the mobile relay node (MRN) is connected to the Donor Evolved Node B (DeNB) node via a
radio interface backhaul link (named as Un) for data transmission. Moreover, to exchange control
information, the MRN is associated to a mobility management entity (MME) and Evolved
Universal Terrestrial Radio Access (E-UTRAN). In addition, the user equipment (UE) is
connected to an MRN located either in the vehicle or in a public transportation vehicle, such as a
train or bus. Figure 1 contains a diagram showing the MRN architecture. The passengers in the
vehicle do not use handover (HO) between the base stations; MRN only executes HO by using
the outer antenna of the vehicle [4]. The two main problems associated with MRN HO procedures
are that: (1) they require radio resources to be reserved for the MRN HO call; and (2) they need to
be instructed on how to finish HO procedures of the train before losing the signal of the serving
cell.
Figure 1. A system model of the mobile relay node (MRN).
In LTE systems, call admission control (CAC) functions to manage radio resources, as well as
call blocking or acceptance. When admitting calls, CAC can either process a new call or an HO
call based on the availability of resources in the target cell. The radio resources are efficiently
utilized, and the quality of service (QoS) in terms of UE requirements is satisfied. In addition, the
target cell should provide resources for the MRN and its connected UE during the HO procedure
and cell residence time. Therefore, our proposed CAC scheme is required to realize radio
resource reservations for three call types (a new call, UE HO call and MRN HO call) and to
minimize the dropping of MRN HO connections simultaneously. If CAC blocked the MRN HO
call, MRN would have to re-initiate the HO procedure to the other DeNBs. This, in turn, requires
more time for HO, and as a result, a further delay and increased HO failure rate is introduced.
The main part of mobility management for MRN is the HO scheme that can be used to support
seamless connectivity for a mobile terminal moving into the overlap area. The HO of the LTE
system with MRN is based on network-controlled hard handover (NCHH) [4]. The hard HO is a
break-to-make method, in which old link between the MRN and the source eNodeB is released
before the new link (between the MRN and the target eNodeB) is established. Otherwise, MRN
HO reuses conventional NCHH. It is well known that the typical HO process consists of
preparation, execution and completion [6]. Conventional NCHH is more satisfactory in a low-
mobility environment. Why is it not satisfactory for use with a high-speed mobility environment?
High-speed mobility in the overlap area has the advantage of a reduced ping-pong HO ratio for
the passengers of the vehicles, but it also imposes disadvantages resulting from an increased radio
link failures (RLF) ratio, service interruption and a reduced HO success rate. In contrast, low-
3. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
89
speed mobility causes UEs to incur a high ping-pong HO ratio and a low RLFs ratio. An
enhanced HO scheme is therefore crucial to solving these problems. Our proposed HO scheme
would enable a reduction in RLF and would increase the probability of HO success in a high-
speed mobility environment.
The main aim of this paper is to propose an enhanced HO scheme capable of dynamically tuning
HO hysteresis (HH) based on the velocity of the train. HH is the main parameter that can manage
the starting point of the HO procedure in the preparation step. Then, to reduce the HO dropping
probability (HDP), we reverse the radio resources for the MRN HO procedure.
Wireless networks based on a CAC scheme have been described and studied in many papers. In
[11], the authors analyzed the adaptive resource allocation scheme for two cases, namely with
both non-priority and guard-channel schemes for the adaptive HO scheme, and the corresponding
simulation results showed that adaptive schemes are able to reduce the dropping probability of
HO connections. In [12], the authors introduced an adaptive CAC algorithm to complement the
resource reservation mechanism with a bandwidth reallocation policy. The proposed scheme was
shown to significantly reduce the probability of new call blocking and HO call dropping. The
self-optimization of the CAC is being investigated in the SOCRATES (Self-Optimisation and
self-ConfiguRATion in wirelEss networkS) project [13] for LTE and next generation mobile
networks.
The HO for MRN is introduced similarly to a regular UE HO (which is named NCHH) in 3rd
Generation Partnership Project (3GPP) Technical Report 36.836 [4]. Researchers introduced an
HO scheme for relay-based networks. Chen proposed an HO-based relay enhanced for UE [7].
They proposed a novel HO scheme based on a cost function, including signal cost and throughput
on LTE cellular relay networks, and compared their scheme with conventional NCHH of an LTE
network. Moreover, [8] introduced a cell selection mechanism for mobile relay operations based
on the geometric boundary of the cell and the obtained location of the UE. The analysis and
simulation results presented in [3] are related to moving relays and mobility optimization for
relay-enhanced networks. In addition, RSS-based HO was introduced between the serving DeNB
and the target DeNB for LTE relay architecture alternatives, Alt1 and Alt2 [5]. A cost-based
vertical HO algorithm decision with a combination of the prediction of SINR (signal to
interference plus noise ratio) in heterogeneous wireless networks has been demonstrated [9]. A
cost function was introduced on the basis of multi-attribute QoS, and an approach for optimal
network selection was introduced. In [10], Thomas researched the relationship between hysteresis
and time-to-trigger and presented an adaptive HO scheme based on HO performance indicators.
First, we investigate an adaptive HH scheme based on the train’s velocity to increase the HO
performance of hard HO in an LTE system. The aim of the adaptive HH scheme, which is based
on the speed of the vehicle with MRN, is to influence the HO triggering. Moreover, the proposed
HO can increase the time for the HO procedure, including the time required by the security policy
and data re-routing, when the velocity of the vehicle is high in the overlap area. Second, we
propose a CAC scheme to reduce the dropping ratio of MRN HO calls. The aim of the proposed
CAC is to support radio resource reservation for MRN HO calls.
2. ADAPTIVE HANDOVER HYSTERESIS
The MRN is always controlling Reference Signal Received Power (RSRP) of the serving DeNB.
When MRN reaches the boundary of the serving DeNB or the designated criteria, the
measurement is performed and sent to the serving DeNB. The candidate target DeNBs in this
measurement report are related to the serving DeNB by utilizing the X2 interface to estimate the
load of all of the target cells and then to generate a priority list based on load. The cell boundary
is the starting point of overlap between the neighbour cells.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
90
Figure 2 shows the calculation of the HH value when an MRN moves to the target DeNB. In this
calculation of the HH value, def
H is the default HH value configured by the system, H
denotes the adjustment value of HH calculated by a function and max
H is the maximum HH
value. If the calculated hysteresis exceeds max
H , the serving DeNB sends a command to the MRN
requesting a new hysteresis calculation and the target DeNB. The point at which the RSRP value
of the target DeNB exceeds the value of the serving DeNB is named minimum hysteresis. A
selected HH can provide efficient HO decisions and triggering that can manage a starting point of
the HO procedure in the preparation step of the hard handover procedures. In the proposed
scheme, the HH (H) value is automatically adjusted and calculated by Equation 1.
HHH def
= (1)
Figure 2. Hysteresis values when an MRN moves.
Moreover, if the situation represented below (Equation 2) occurs, the MRN starts an HO
procedure for the target DeNB.
HRR targetserving
(2)
where target
R and serving
R denote the RSRPs of the target DeNB and serving DeNB, respectively.
In (7), H is expressed by:
H
fH *= (3)
where selects less than defmax
HH . If is increased, the range of H will be extended, in
which case it would be more agreeable to find the best HH value for the HO procedure. A H
f is
the function that are presented in Equation 4.
max
currentmax
def
HH
V
VV
logf
1)(
=
(4)
where current
V is the current velocity of the MRN, def
H is the default fixed value of the hysteresis
and max
V is the maximum velocity of the MRN (= 350 km/p). If current
V were to reach maximum
velocity, velocity
N would be equal to def
H . Thus, the HO decision (or time-to-trigger) would shift
depending on the velocity of the MRN.
RSRP
5. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
91
3. CALL ADMISSION CONTROL
The serving DeNB send the "HO request" with context information to the target DeNB, if
Equation 2 keep during the preparation step of the HO procedure. The "HO request" with context
information include of the number of MRNs outside antennas and the connected devices of
passengers. After handling the "HO request" on the target DeNB, the CAC scheme allocates a
radio resource for the received request. The resource management consists of CAC, the efficient
utilization of power and a channel allocation strategy. CAC denotes the process of admitting a
new call or an HO call, based on the availability of resources in the target cell. The utilization of
power controls the transmission power between the target cell and the MRN. Moreover, the target
cell classifies calls when a connection request arrives. In CAC, two important QoS parameters are
the new call blocking probability (NCBP) and handover call dropping probability (HCDP), both
of which apply during the HO procedure. The NCBP is the probability of dropping a new call
during the HO procedure, whereas HCDP is the probability of HO failure or dropped HO calls by
the target cell. If the available resources are insufficient in the target cell for accepting the HO
calls, the target cell will drop them. The result of this is an increase in the unsuccessful HO ratio.
The typical CAC schemes can reserves the radio resource for HO calls and the new calls (two
classifications) in the target cell. In this point, the HO call of MRN is the same as HO calls of
UEs.
In proposed CAC scheme, calls are classified according to three types: HO calls of MRNs, HO
calls of UEs and new calls. Additionally, if HO calls of MRNs in received, CAC need reserve the
radio resources for the connected devices of passengers. Moreover, we propose a CAC scheme
for the wireless network, which provides a radio resource allocation policy with three classes and
prioritizes MRN HO calls over UE HO calls and new calls. The focus of the proposed CAC
scheme is to improve the utilization of radio resources in order to reduce the dropping probability
of MRN HO calls.
The proposed scheme is based on the guard channels scheme that can reserves channels separated
the HO calls of MRN and HO calls of UEs. On the other words, the total channels of the target
cell are divided into three parts, HO calls of UEs, HO calls of MRN and new calls. The system
model for our scheme is shown in Figure 3. For example, C1–C2 are reserved for HO calls of
UEs, C2–C3 are reserved for HO calls of MRN and devices of passengers, and the remaining
channels (Channel 1–C1) are shared by all calls.
Figure 3. A system model of C channels.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
92
In the system, the arrival of calls is represented by a Poisson function with the arrival rate of new
calls denoted by n
, HO calls of UEs by ue
, and HO calls of MRNs with devices of passengers
by mrn
. mrn
denotes a channel number of MRN and the connected devices of passengers. In
other words, if HO calls of MRN is received, the reserved radio resources and the number of the
connected devices is equal in the proposed CAC. The call holding time for all three types of call
is exponentially distributed with 1/ , 1/ and 1/ , respectively. Let =( n
+ )( ue
+ )(
mrn
+ ) be the total arrival rates of calls to the target cell. If the target cell has n channels, let
n
P be the probability. The probability n
P that n channels are busy is:
32
!
21
!
10
!
=
0
32
3
0
2
2
0
CnCP
n
CnCP
n
CnP
n
P
CC
mrnC
Cn
ueC
n
n
(5)
where:
1
323
12=
3
22
11=
2
1
0=
0
!!!
=
nnn
P
CC
mrn
C
Cn
C
Cn
ue
C
Cn
C
nC
n
(6)
Following which, the MRN HCDP is calculated by using the following:
n
C
n
C
C
n
C
C
mrn
l
PPPP
1
1
2
1
3
2
= (7)
When a new call arrives, the target cell will check the channels up to C1. If channels are not
available, the target cell drops the new call it has received. Upon arrival of an HO call of UE, the
target cell first checks the channels between C1 and C2. If channels are not available, the target
cell checks between 1 and C1. If it is unable to find an available channel, the HO call of UE is
dropped by the target cell. When an HO call of MRN arrives, CAC gets the number of the
connected devices from "HO request" with context information. Then, the target cell checks
between C2 and C3, and if no channels are available, it again checks between C1 and C2. If no
channels are available, the target cell checks between 1 and C1. The result of this procedure is
that, because none of the channels of the target cell are free, the HO call of MRN is dropped.
Figure 4 describes the procedure of our scheme.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
93
Figure 4. Call admission control (CAC) procedure of our scheme.
4. SIMULATION RESULTS
This section presents the simulation of our schemes. First, we simulated an adaptive HO scheme
based on the velocity of the vehicle equipped with an MRN. Second, we simulated two CAC
schemes, the conventional and the proposed CAC schemes.
4.1. ANALYSIS OF THE PROPOSED HANDOVER
Our proposed the adaptive HH scheme is simulated on the open source LTE-sim [15]. For
simulation purposes, a connection manager application was used to modify and implement in
order to control connection quality between the serving DeNB and the MRN. In addition, we
have to modify and add the DeNBs for calculating the load of the target DeNBs by considering
sending a request to the target DeNBs to receive the necessary information and to repeat the
sorting of the target DeNBs according to their load. Table 1 lists all of the parameters of the
simulation.
Figure 5 shows the scenario we used for our simulation. It consists of a homogeneous network
with urban cells (the radius is 1 km) that includes five LTE eNBs, the MRN-installed vehicle (a
train) and its number of connected UEs between 10 and 50. The MRN is equipped with a
transparent router between the outside and inside antennas. The cell boundary and overlap of
neighbouring cells is 300 meters. At the beginning of the simulation, the MRN is connected to the
serving DeNB. At the starting point of the overlap area, the MRN make a measurement report for
HO and send to the serving DeNB. After received this report, the serving DeNB calculates the
HH and to run a cell selection scheme based on the load of the candidate DeNBs. However, the
MRN controls the RSRP of the serving and target DeNBs, if the conditions in Equation 2 are
fulfilled, by starting time-to-trigger. A simulation can effectively show the difference between the
static hysteresis-based conventional HO and the proposed HO with dynamically changed
hysteresis based on the speed of the train.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
94
Table 1. Simulation parameters.
Parameter Value
Number of Donor eNBs 5 cell sites, urban area
Radius of cell 1 kilometer
Overlap area between two cells 300 m
Distance between eNodeB and
railway line (MRN)
100 m
Cell Tx power 46 dBm
Carrier frequency 2.6 GHz
Path loss model 128.1 + 37.6 log10d
Shadow fading deviation 4 dB
System bandwidth 10 MHz
Transmission time interval 1 ms
Traffic type Video stream, VoIP and data
MRN speed Interval [120 km/h,350 km/h]
Figure 6 shows the simulation results of the HO triggering probability with the location of the
train equipped with MRN and five different speed scenarios up to 350 km/p. The x-axis is the
distance between the train with the MRN and the serving DeNB. Starting from the location x =
840, the RSRP of the target DeNB starts to overbear the RSRP of the serving DeNB. The
resulting HO triggering probability increases at the location x = 850, and the velocity is typically
higher rather than lower. Further, the triggering probability increases abruptly up to 90 percent of
the distance between the locations x = 875 and x = 925. Thus, our proposed HO scheme is
capable of triggering the probability based on velocity. At the location x = 850, the signal quality
of the target DeNB is sufficient to meet the communication requirement. In addition, the
proposed HO scheme can provide the HO decision, and the starting time satisfies the high-speed
mobility environment.
Figure 5. Homogeneous network.
Figure 7 shows the simulation results of the RLF ratio with different MRN velocities in the
interval [120,350]. In the figure, our proposed HO scheme with adaptive HH compares hard HO
with the received signal strength based scheme that employs regular UE HO based on static HO
parameters, as defined by the 3GPP standard, which has been reused for MRN [4]. In a low
mobility environment, the two schemes behave similarly. However, when the MRN runs at high
speed, the change in the RLF of the proposed scheme is low. It is also observed that as the speed
increases, the proposed scheme to decrease the HH value. This is because in the proposed scheme
9. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
95
the train with high-speed required smaller HH value than the user devices with low-speed. As a
result, the HO procedures start too early. If the train leaves from the coverage of the serving
DeNB before the HO procedure was completed, the number of RLFs increase. RLFs is dropped
HO calls before the HO procedure was completed, if the train leaves the coverage of the serving
DeNB. Moreover, the device makes a new connection with the available cell. In other hands, HO
procedure failed (not RLFs), MRN must re-connect to the serving DeNB and restart the HO
procedure.
Figure 6. Handover triggering probability of different velocities.
Figure 7. The radio link failure (RLF) ratio of the proposed scheme and the hard handover scheme at MRN
velocity.
4.2. ANALYSIS OF THE CAC SCHEME
In this subsection, we present our analysis of the effectiveness of the proposed CAC, which
performs the task of reducing the HO dropping probability. We consider three priority classes in
the homogeneous system: new calls, HO calls of UEs, and HO calls of MRN. The call arrivals are
generated based on Poisson process with a mean arrival rate of (calls/s). Simulation model and
parameters are considering Table 1. We choose a set other parameters: the channel C3 is the
number of all radio resources on the target cell, guard channel C2 is 75 percent of all radio
resources, and C1 is 50 percent of the remaining radio resources.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
96
Furthermore, the performance is evaluated with/without the effect of the proposed CAC using the
following performance metrics: (i) the new call blocking probability is defined as the faction of
new calls that are blocked on the target cells; (ii) the UE HO dropping probability is defined as
the faction of HO call of UE attempts that are blocked because of lack of available channels; and
(iii) the MRN HO dropping probability is defined as the faction of HO call of MRN attempts that
are blocked because of all channels being unavailable.
Figure 8 shows the difference between the proposed and the conventional CAC schemes. The
non-priority based conventional CAC cannot reserve channels for HO calls. In other words,
conventional CAC that used FIFO (first input first out) algorithm and will drop calls (both new
calls and HO calls) if all channels are busy [14]. The proposed CAC separated HO calls of MRNs
and HO calls of UEs. The "NCBP non-prioritized" and "HCDP non-prioritized" are the NCBP
and HCDP when conventional CAC was active, respectively. The "NCBP proposed", "HCDP
proposed" are NCBP and HCDP of MRN and its connected UEs when the proposed CAC was
active, respectively. The y-axis represents the call blocking probability between zero and 25
percent.
Figure 8. HCDP. The connected UEs of MRN is an interval between 10 and 50.
From figure, we observe the new call blocking probability and the handover call dropping
probability increase as the arrival rate increases. The blocking and dropping probability of the
conventional CAC are same during the simulation time. The change in the NCBP of the proposed
scheme is low. Furthermore, HCDP of MRN is lower than NCBP because of the guard channels
and high priority reservation for HO calls of MRNs. In addition, HCDP of MRN is increased as
the number of connected UEs increases because of the CAC scheme need reserve larger radio
resources for the larger number of the connected UEs. In the proposed CAC, the new calls are the
lowest priority. The results of proposed CAC can be explained by the processes of the proposed
scheme: radio resource reservation, three call classification and giving the high priority to HO
calls of MRN in the admission step. In addition, our proposed scheme prioritizes HO calls of
MRN over HO calls of UEs and new calls (HO calls of MRN are high; HO calls of UEs are
medium; and new calls are low). The HO call of MRNs was the same as the HO calls of UEs in
the conventional CAC scheme. From this point of view, conventional CAC can reserve one radio
resource for MRN. Therefore, the CAC scheme would need to support MRN and its connected
devices. To address this need, our proposed CAC reserved the radio resources for MRN and its
connected UEs.
11. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
97
5. CONCLUSION
This paper presents an adaptive HH scheme and CAC for MRN in a 3GPP LTE-A system. First,
we introduced an adaptive HH scheme between the DeNBs in the LTE network with NCHH. Our
proposed scheme focused on adaptive HH of a hard HO based on MRN velocity. We compared
our proposed scheme with the static HH based NCHH scheme in terms of RLF ratio and HO
triggering probability. The result of the simulation showed that our proposed HO scheme has an
increased success rate during HO procedures. Subsequently, we compared the performance of the
proposed CAC scheme and conventional scheme. Our proposed CAC scheme was shown to
reduce the HO call blocking ratio. In addition, the proposed scheme can reserve the radio
resources for MRN and its connected UEs.
ACKNOWLEDGEMENTS
The authors would like to thank everyone, just everyone!
REFERENCES
[1] Tran, T.T.; Shin, Y.; Shin, O.S. Overview of enabling technologies for 3GPP LTE-advanced.
EURASIP Journal on Wireless Communications and Networking 2012, pp. 1–12.
[2] 3GPP. Evolved Universal Terrestrial Radio Access (E-UTRA), Relay architecture for E-UTRA (LTE-
A). TR 36.806, 3rd Generation Partnership Project (3GPP), 2010.
[3] Christian Pietsch, Stefan Brueck, M.F.T.M.M.K.J.V.M.D.N.E.S.T.S.A.P.Y.S.M. Moving Relays and
Mobility aspects. Technical report, ARTIST4G project, 2012.
[4] 3GPP. Study on Mobile Relay for Evolved Universal Terrestrail Radio Access (E-UTRA). TR
36.836, 3rd Generation Partnership Project (3GPP), 2013.
[5] Krendzel, A. LTE-A Mobile Relay Handling: Architecture Aspects. Wireless Conference (EW),
Proceedings of the 2013 19th European. VDE, 2013, pp. 1–6.
[6] Kuang, Q.; Belschner, J.; Bleicher, Z.; Droste, H.; Speidel, J. A measurement-based study of
handover improvement through range expansion and interference coordination. Wireless
Communications and Mobile Computing 2014.
[7] Muqiong, C.; Hong, J.; Xi, L. Handover improvement based on cost function and user fairness for
cellular relay enhanced LTE networks. High Technology Letters 2011, vol. 17, pp. 299–304.
[8] Teyeb, O.; Kazmi, M.; Mildh, G. Cell Selection Mechanism in Mobile Relay Operation; Google
Patents, 2012. US Patent App. 13/499,952.
[9] Zhang, Y.; Zheng, Z.; Chen, L. A Cost-Based Vertical Handoff with Combination Prediction of SINR
in Heterogeneous Wireless Networks. Journal of Theoretical and Applied Information Technology
2013, vol. 49.
[10] Jansen, T.; Balan, I.; Turk, J.; Moerman, I.; Kurner, T. Handover parameter optimization in LTE self-
organizing networks. Vehicular Technology Conference Fall (VTC 2010-Fall), 2010 IEEE 72nd.
IEEE, 2010, pp. 1–5.
[11] Lee, J.; Kim, H.c. Performance Analysis of Adaptive QoS Handoff Mechanism Using Service
Degradation and Compensation. International Journal of Software Engineering & Its Applications
2013, vol. 7.
[12] Sanabani, M.; Shamala, S.; Othman, M.; Desa, J. Adaptive call admission control for prioritized
adaptive services in wireless/mobile multimedia cellular networks. IJCSNS 2006, vol. 6,pp. 115.
[13] Spaey, K.; Sas, B.; Blondia, C. Self-optimising call admission control for LTE downlink. COST 2100
TD(10)10056, Joint Workshop COST 2100 SWG 3.1 & FP7-ICT-SOCRATES 2010.
[14] Bejaoui, Tarek, and Nidal Nasser. "Handover and class-based Call Admission Control policy for 4G-
heterogeneous mobile networks." Computer Systems and Applications. AICCSA. IEEE/ACS
International Conference on. IEEE, 2008.
[15] Giuseppe Piro, Luigi Alfredo Grieco, Gennaro Boggia, Francesco Capozzi, and Pietro Camarda",
Simulating LTE Cellular Systems: an Open Source Framework", IEEE Trans. Veh. Technol., vol. 60,
no. 2, Feb, 2011, doi: 10.1109/TVT.2010.2091660
12. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015
98
AUTHORS
Battulga Davaasambuu received the B.S. and M.S. degrees from National University of
Mongolia, Ulaanbaatar, Mongolia, in 2007 and 2009, respectively. From 2009 to 2011,
he worked as a research engineer at the National University of Mongolia. From 2012, he
is a Ph.D. candidate at Graduate School of Global Information and Telecommunication
Studies (GITS), Waseda University, Tokyo, Japan. He is a student member of IEEE. His
research interests include mobile communication, mobility management, next generation
wireless networks and their architecture.
He received his BSc. in Telecommunications Engineering from University of Dar es
salaam,Tanzania in 2007. He then worked with Telecommunication Companies for 3
years in areas of Network Management and Product Management. In march,2011 He was
granted Japanese Government Scholarship. He was a research student at Waseda
University from April 2011 to March 2012.He obtained Msc. in Global Information and
Telecommunication Studies from Waseda University,Japan in 2014.He is currently doing
his PhD at Waseda University,Japan and his current research interest include RF-Impairments in Massive
MIMO Systems, wireless communication in high mobility environment and Millimeter Wave Wireless
Communications.
Takuro Sato received the B.E. and Ph.D. degrees in electronics engineering from
Niigata University, Niigata, Japan, in 1973 and 1993, respectively. He joined the
Research and Development Laboratories, OKI Electric Industry Co., Ltd., Tokyo, Japan,
in 1973, where he was a Senior Research Manager and Research Director with
Communication Systems Laboratory. He joined the Niigata Institute of Technology from
1995 as a Professor where he research focused on CDMA, OFDM, personal communication systems and
other related areas. In 2004, he joined GITS, Waseda University, Tokyo, as a professor and currently
serving as the Dean. He has engaged in the research on PCM transmission equipment, mobile
communications, data transmission technology, and digital signal processing technology. He has developed
wideband CDMA system for personal communication system and joined the PCS standardization
committee in the USA and Japan. His contributes are mainly in high speed cellular modem standardization
for ITU, 2.4GHz PCS for ITA and wireless LAN technology for IEEE 802.11, etc.. He has authored 11
Books and more than 200 papers. His current research interests include Next generation mobile
communications, wireless communications, ICN/CCN technology, ICT in Smart Grid and their global
standardization. He is a fellow of IEICE and IEEE.