Tarik Taleb
Aalto University, Department of Communications and networking, Faculty Member
Over the years, the concept of multi-layered satellite networks has indeed become popular. Researchers have developed a wide variety of techniques related to these particular networks. However, users of satellite networks will exhibit... more
Over the years, the concept of multi-layered satellite
networks has indeed become popular. Researchers have developed a wide variety of techniques related to these particular networks. However, users of satellite networks will exhibit high variances due to their diverse geographical distributions. This causes traffic concentrations at particular satellites to increase drastically resulting in high packet drop rates and severe degradation of Quality of Service (QoS). The Explicit Load Balancing (ELB) scheme was developed to address these issues in Low Earth Orbit (LEO) satellite networks. In ELB, each satellite monitors its own queue and exchanges traffic-load information among its neighboring satellites. The satellites that experience heavy traffic
attempt to alleviate the traffic load by redirecting a portion of
the traffic via alternative paths. To cope with network congestion (over a single layer) and for better traffic distribution, multi layer satellites were proposed. In this paper, we propose an efficient traffic distribution scheme for multi-layered satellite networks based on ELB in which we extend the range for exchanging the traffic-load information for achieving further reductions in packet drop rates. In addition, we present an enhanced technique for computing the detouring ratio more efficiently. We demonstrate via simulations that the proposed approach effectively improves the performance of ELB over multi-layered satellite networks.
networks has indeed become popular. Researchers have developed a wide variety of techniques related to these particular networks. However, users of satellite networks will exhibit high variances due to their diverse geographical distributions. This causes traffic concentrations at particular satellites to increase drastically resulting in high packet drop rates and severe degradation of Quality of Service (QoS). The Explicit Load Balancing (ELB) scheme was developed to address these issues in Low Earth Orbit (LEO) satellite networks. In ELB, each satellite monitors its own queue and exchanges traffic-load information among its neighboring satellites. The satellites that experience heavy traffic
attempt to alleviate the traffic load by redirecting a portion of
the traffic via alternative paths. To cope with network congestion (over a single layer) and for better traffic distribution, multi layer satellites were proposed. In this paper, we propose an efficient traffic distribution scheme for multi-layered satellite networks based on ELB in which we extend the range for exchanging the traffic-load information for achieving further reductions in packet drop rates. In addition, we present an enhanced technique for computing the detouring ratio more efficiently. We demonstrate via simulations that the proposed approach effectively improves the performance of ELB over multi-layered satellite networks.
Research Interests:
In the modern era of Internet, providing Quality of Service (QoS) is a challenging issue, particularly in resource constrained wireless networks with delay-sensitive multimedia traffic. Real-time and multimedia services are now available... more
In the modern era of Internet, providing Quality of Service
(QoS) is a challenging issue, particularly in resource constrained wireless networks with delay-sensitive multimedia traffic. Real-time and multimedia services are now available to end-users over wired networks, Wireless Local Area Networks (WLANs), and Wireless Personal Area Networks (WPANs). While the usual trend is to provide the best possible QoS for these services, it is also imperative to deploy security requirements along with the QoS parameters. In this paper, we argue that the existing approaches for including security parameters (such as encryption/decryption
key lengths) with QoS parameters (e.g., end-to-end delay requirements) lead to further security risks and consequently
fail to provide an adequate solution. Through simulations,
we point out the pitfalls of integrating delay and security
support in the contemporary approaches. We also envision
QoS2 , a framework integrating both quality of security and
QoS, in order to provide possible solutions for solving these
problems. We also demonstrate via simulation the effectiveness and strength of our adopted approach.
(QoS) is a challenging issue, particularly in resource constrained wireless networks with delay-sensitive multimedia traffic. Real-time and multimedia services are now available to end-users over wired networks, Wireless Local Area Networks (WLANs), and Wireless Personal Area Networks (WPANs). While the usual trend is to provide the best possible QoS for these services, it is also imperative to deploy security requirements along with the QoS parameters. In this paper, we argue that the existing approaches for including security parameters (such as encryption/decryption
key lengths) with QoS parameters (e.g., end-to-end delay requirements) lead to further security risks and consequently
fail to provide an adequate solution. Through simulations,
we point out the pitfalls of integrating delay and security
support in the contemporary approaches. We also envision
QoS2 , a framework integrating both quality of security and
QoS, in order to provide possible solutions for solving these
problems. We also demonstrate via simulation the effectiveness and strength of our adopted approach.
Research Interests:
In this paper, we propose a cognitive radio based Medium Access Control (MAC) protocol for packet scheduling in wireless networks. Cognitive MAC protocols allow a class of users, called secondary users, to identify the unused frequency... more
In this paper, we propose a cognitive radio based
Medium Access Control (MAC) protocol for packet scheduling
in wireless networks. Cognitive MAC protocols allow a class of
users, called secondary users, to identify the unused frequency spectrum and to communicate without interfering with the primary users. In our proposed MAC protocol, each secondary user is equipped with two transceivers. One of the transceivers is used for control messages while the other periodically senses and dynamically utilizes the unused data channel. The secondary users report the status of channels on control channel and negotiate on the selected data channel itself for onward data transmission. Each channel is used by different set of secondary users. Contrary to existing protocols, data transmission takes place in the time slot in which spectrum opportunity is found. We develop a new analytical model, while taking into account the
backoff mechanism. Our simulation results show that throughput increases with the increase in the number of channels.
Medium Access Control (MAC) protocol for packet scheduling
in wireless networks. Cognitive MAC protocols allow a class of
users, called secondary users, to identify the unused frequency spectrum and to communicate without interfering with the primary users. In our proposed MAC protocol, each secondary user is equipped with two transceivers. One of the transceivers is used for control messages while the other periodically senses and dynamically utilizes the unused data channel. The secondary users report the status of channels on control channel and negotiate on the selected data channel itself for onward data transmission. Each channel is used by different set of secondary users. Contrary to existing protocols, data transmission takes place in the time slot in which spectrum opportunity is found. We develop a new analytical model, while taking into account the
backoff mechanism. Our simulation results show that throughput increases with the increase in the number of channels.
Research Interests:
From the beginning of data networking, dynamic routing has been a challenge. Due to the constantly increasing number of devices and the introduction of multi-hop wireless networks, dynamic routing will remain an important issue for any... more
From the beginning of data networking, dynamic routing has been a challenge. Due to the constantly increasing number of devices and the introduction of multi-hop wireless networks, dynamic routing will remain an important issue for any future network architecture. Using more elaborate routing
metrics for such environments is regarded as the general solution but neglects the introduction of significant overhead required to exchange the information. In this paper, we present a routing scheme which is based on metric dependent neighborhood to calculate the forwarding graph. The proposed routing scheme supports aggregation of this metric related information while disseminating routing updates to retain scalability. Simulation results with an exemplary metric based on link stability information
show the feasibility of this aggregation approach and
the improvement with respect to node reachability and reliable communication in self-organizing wireless networks. Moreover, we implemented this routing scheme on an autonomic networking architecture (ANA).
metrics for such environments is regarded as the general solution but neglects the introduction of significant overhead required to exchange the information. In this paper, we present a routing scheme which is based on metric dependent neighborhood to calculate the forwarding graph. The proposed routing scheme supports aggregation of this metric related information while disseminating routing updates to retain scalability. Simulation results with an exemplary metric based on link stability information
show the feasibility of this aggregation approach and
the improvement with respect to node reachability and reliable communication in self-organizing wireless networks. Moreover, we implemented this routing scheme on an autonomic networking architecture (ANA).
Research Interests:
Fast handover management in mobile IPv6 environments has been a research subject for a long time. Exploiting the cooperative diversity paradigm in Partner-based Hierarchical MIPv6 (PHMIPv6) promises an acceleration of the handoff... more
Fast handover management in mobile IPv6 environments
has been a research subject for a long time. Exploiting
the cooperative diversity paradigm in Partner-based Hierarchical MIPv6 (PHMIPv6) promises an acceleration of the handoff management operation by relaying some signaling over a selected partner node prior to the actual handover to the new access point. For this purpose, a suitable partner node, that stays in communication range for sufficient time until the signaling in the pre-handoff phase is finalized, should be selected. PHMIPv6 proposes to select the node with the highest signal strength as the partner node. In this paper, we show that using the Link Expiration Time (LET) metric to select the partner node can significantly improve handovers in Mobile IP (MIP) networks. The basis of this new metric is the relative position and the relative speed of the mobile node to the potential partner nodes. A set of simulations is conducted to evaluate the performance of
the proposed scheme and encouraging results are obtained.
has been a research subject for a long time. Exploiting
the cooperative diversity paradigm in Partner-based Hierarchical MIPv6 (PHMIPv6) promises an acceleration of the handoff management operation by relaying some signaling over a selected partner node prior to the actual handover to the new access point. For this purpose, a suitable partner node, that stays in communication range for sufficient time until the signaling in the pre-handoff phase is finalized, should be selected. PHMIPv6 proposes to select the node with the highest signal strength as the partner node. In this paper, we show that using the Link Expiration Time (LET) metric to select the partner node can significantly improve handovers in Mobile IP (MIP) networks. The basis of this new metric is the relative position and the relative speed of the mobile node to the potential partner nodes. A set of simulations is conducted to evaluate the performance of
the proposed scheme and encouraging results are obtained.
Research Interests:
Recent advances in wireless technology, sensors and portable devices offer interesting opportunities to enable ubiquitous assistance to individuals in need of prompt help. Providing healthcare services to mobile users, such as, patients,... more
Recent advances in wireless technology, sensors and
portable devices offer interesting opportunities to enable ubiquitous assistance to individuals in need of prompt help. Providing healthcare services to mobile users, such as, patients, elders, or potential drug abusers, is a rather challenging task. Novel middleware-level supports are required to integrate sensor infrastructures capable of detecting changes in the monitored subjects’ health conditions and of alerting medical personnel, and the victim’s
relatives and friends in case of emergency situations. Along
this line, the paper envisions a context-aware middleware-level solution dubbed Pervasive Environment for Affective Healthcare (PEACH). PEACH integrates together various sensors in a Wireless Body Area Network (WBAN) to detect alterations of monitored subjects’ affective and physical conditions, aggregate the sensed information, and also detect potentially dangerous situations for the monitored subject. Finally, PEACH aims at providing outdoor assistance to the victim/patient by quickly promoting the formation of ad hoc rescue groups comprising nearby volunteers. Through encouraging results obtained from both simulations and a practical drug-rehabilitation application testbed, the effectiveness of the envisioned PEACH framework is verified.
portable devices offer interesting opportunities to enable ubiquitous assistance to individuals in need of prompt help. Providing healthcare services to mobile users, such as, patients, elders, or potential drug abusers, is a rather challenging task. Novel middleware-level supports are required to integrate sensor infrastructures capable of detecting changes in the monitored subjects’ health conditions and of alerting medical personnel, and the victim’s
relatives and friends in case of emergency situations. Along
this line, the paper envisions a context-aware middleware-level solution dubbed Pervasive Environment for Affective Healthcare (PEACH). PEACH integrates together various sensors in a Wireless Body Area Network (WBAN) to detect alterations of monitored subjects’ affective and physical conditions, aggregate the sensed information, and also detect potentially dangerous situations for the monitored subject. Finally, PEACH aims at providing outdoor assistance to the victim/patient by quickly promoting the formation of ad hoc rescue groups comprising nearby volunteers. Through encouraging results obtained from both simulations and a practical drug-rehabilitation application testbed, the effectiveness of the envisioned PEACH framework is verified.
Research Interests:
—Due to their ability to overcome many shortcomings associated with the contemporary client-server paradigm, Peerto-Peer (P2P) networks have attracted phenomenal interests from researchers in both academia and industry. Interactive and... more
—Due to their ability to overcome many shortcomings
associated with the contemporary client-server paradigm, Peerto-Peer (P2P) networks have attracted phenomenal interests from researchers in both academia and industry. Interactive and multimedia streaming applications using P2P networks are, however, often prone to long startup delays, which disrupt the smooth playback and undermine users’ perceived quality of service. In addition, P2P networks must be able to support a potential number of users while ensuring that the resources are efficiently utilized. In this paper, by addressing these shortcomings in the traditional P2P framework, we envision a novel scheme to effectively provide a Video-on-Demand (VoD) using P2P-based
mesh overlay networks. The proposed scheme covers two main phases, namely requesting and scheduling modes. The former aims at dynamically selecting the required contents from the available peers. On the other hand, in the scheduling mode, the incoming requests are scheduled in a priority-based manner for minimizing the startup latency and sustaining the playback rate to an acceptable level. Computer simulations have been conducted to verify the effectiveness of the proposed scheme. The obtained results demonstrate the scalability of our envisioned scheme in addition to its capability to reduce the startup delay and provide a sustainable playback rate.
associated with the contemporary client-server paradigm, Peerto-Peer (P2P) networks have attracted phenomenal interests from researchers in both academia and industry. Interactive and multimedia streaming applications using P2P networks are, however, often prone to long startup delays, which disrupt the smooth playback and undermine users’ perceived quality of service. In addition, P2P networks must be able to support a potential number of users while ensuring that the resources are efficiently utilized. In this paper, by addressing these shortcomings in the traditional P2P framework, we envision a novel scheme to effectively provide a Video-on-Demand (VoD) using P2P-based
mesh overlay networks. The proposed scheme covers two main phases, namely requesting and scheduling modes. The former aims at dynamically selecting the required contents from the available peers. On the other hand, in the scheduling mode, the incoming requests are scheduled in a priority-based manner for minimizing the startup latency and sustaining the playback rate to an acceptable level. Computer simulations have been conducted to verify the effectiveness of the proposed scheme. The obtained results demonstrate the scalability of our envisioned scheme in addition to its capability to reduce the startup delay and provide a sustainable playback rate.
Research Interests:
Available doorbell interphone systems are designed under the assumption that residents would be at home to enable the communication between them and their visitors. However, people spend a large fraction of their time away from home, thus... more
Available doorbell interphone systems are designed
under the assumption that residents would be at home to enable the communication between them and their visitors. However, people spend a large fraction of their time away from home, thus undermining the basic assumptions of existing doorbell solutions. Recent developments in 3GPP Home Node B (HNB or Femtocell) and home gateway technologies, along with the growing proliferation of smart-phones, can offer interesting opportunities for the design and development of innovative doorbell solutions. Along this line, the paper describes a 3GPP enhanced eDoorbell application prototype that relies on IMS to enable video-based communication between visitors and (possibly remote available) home residents. In our prototype, the visibility
of context information, such as current location of residents, their diary, and their personal preferences, provides solid basis for definition and enactment of customizable management policies that determine the best suited home resident whom to route the notification of a visit to. While the paper presents no experimental results, it aims at assisting organizations such as the Femto Forum or the ETSI TISPAN to identify the requirements for standards and the different methods used to implement HNB-based or Home Gateway-based services, respectively.
under the assumption that residents would be at home to enable the communication between them and their visitors. However, people spend a large fraction of their time away from home, thus undermining the basic assumptions of existing doorbell solutions. Recent developments in 3GPP Home Node B (HNB or Femtocell) and home gateway technologies, along with the growing proliferation of smart-phones, can offer interesting opportunities for the design and development of innovative doorbell solutions. Along this line, the paper describes a 3GPP enhanced eDoorbell application prototype that relies on IMS to enable video-based communication between visitors and (possibly remote available) home residents. In our prototype, the visibility
of context information, such as current location of residents, their diary, and their personal preferences, provides solid basis for definition and enactment of customizable management policies that determine the best suited home resident whom to route the notification of a visit to. While the paper presents no experimental results, it aims at assisting organizations such as the Femto Forum or the ETSI TISPAN to identify the requirements for standards and the different methods used to implement HNB-based or Home Gateway-based services, respectively.
Research Interests:
TCP experiences severe performance degradation in cislunar communications because of some assumptions built into its design. Delay/disruption tolerant networking (DTN) is a class of network techniques that is developed to work over... more
TCP experiences severe performance degradation in cislunar communications because of some assumptions built into its design. Delay/disruption tolerant networking (DTN) is a
class of network techniques that is developed to work over
internet protocols to accommodate long link delay and frequent link disruptions in space communication environment. Most of the work concerning DTN protocols and techniques focused on its application in terrestrial wireless network and sensor-based networks. In this paper, we present an experimental evaluation of the DTN protocols with BP/TCPCL running on top of TCP/IP over a long-delay cislunar communication channel with and without link disruption. We hope the experiment results and analysis in this paper will apply equally well in any deep space mission with a round-trip time (RTT) that is comparable to that of the Earth-Moon system.
class of network techniques that is developed to work over
internet protocols to accommodate long link delay and frequent link disruptions in space communication environment. Most of the work concerning DTN protocols and techniques focused on its application in terrestrial wireless network and sensor-based networks. In this paper, we present an experimental evaluation of the DTN protocols with BP/TCPCL running on top of TCP/IP over a long-delay cislunar communication channel with and without link disruption. We hope the experiment results and analysis in this paper will apply equally well in any deep space mission with a round-trip time (RTT) that is comparable to that of the Earth-Moon system.
Research Interests:
—For an efficient usage of the sensor technology, several design factors (e.g., topology and sensing coverage) should be taken into account. In this paper, we focus on the underlying topology of sensor networks in two-dimensional... more
—For an efficient usage of the sensor technology,
several design factors (e.g., topology and sensing coverage)
should be taken into account. In this paper, we focus on
the underlying topology of sensor networks in two-dimensional environments and enhance a set of recently proposed graphs [1]. The new enhanced graphs are referred to as the Derived Circles version 2 (DCα v2) graphs. We show that DCα v2 graphs are locally constructed, connected, have the rotationability property, and have the Euclidean Minimum Spanning Tree (EMST) as their subgraphs. Moreover, we show that the new set of graphs has a bounded Euclidean/length and power dilation when 0.5 ≤ α ≤ 1. Furthermore, via simulations, we confirm most of these properties, and demonstrate that the DCα v2 graphs also have bounded Euclidean and power dilations when 0 <α< 0.5. In addition, we demonstrate that DCα v2 graphs outperform the Half Space Proximal (HSP ) and the Relative Neighbourhood Graph (RNG) graphs in terms of the network dilation, Euclidean dilation, and power dilation. This, in turn, increases the speed for message delivery, reduces the energy consumption of nodes and accordingly prolongs the network lifetime.
several design factors (e.g., topology and sensing coverage)
should be taken into account. In this paper, we focus on
the underlying topology of sensor networks in two-dimensional environments and enhance a set of recently proposed graphs [1]. The new enhanced graphs are referred to as the Derived Circles version 2 (DCα v2) graphs. We show that DCα v2 graphs are locally constructed, connected, have the rotationability property, and have the Euclidean Minimum Spanning Tree (EMST) as their subgraphs. Moreover, we show that the new set of graphs has a bounded Euclidean/length and power dilation when 0.5 ≤ α ≤ 1. Furthermore, via simulations, we confirm most of these properties, and demonstrate that the DCα v2 graphs also have bounded Euclidean and power dilations when 0 <α< 0.5. In addition, we demonstrate that DCα v2 graphs outperform the Half Space Proximal (HSP ) and the Relative Neighbourhood Graph (RNG) graphs in terms of the network dilation, Euclidean dilation, and power dilation. This, in turn, increases the speed for message delivery, reduces the energy consumption of nodes and accordingly prolongs the network lifetime.
Research Interests:
In the System Architecture Evolution (SAE) study of the next generation mobile network in 3GPP, Serving Gateways (SGWs) and Mobility Management Entities (MMEs) are grouped to form a number of service and pool areas, respectively. While... more
In the System Architecture Evolution (SAE) study of the next generation mobile network in 3GPP, Serving Gateways (SGWs)
and Mobility Management Entities (MMEs) are grouped to form a number of service and pool areas, respectively. While this concept of SGW service areas in the Evolved Packet Core is interesting to limit the administrative scope of SGWs and also provides a means to optimize the routing, the use of fixed/hard area boundaries can result in frequent unnecessary SGW relocations and can severely impact the Quality of Experience (QoE) of users. To avoid the drawback of fix/hard service (or pool) area boundaries, this paper
proposes a scheme whereby every SGW can have a flexibly
configurable service area, which is defined by a set of LTE (Long Term Evolution) cells or Tracking Areas (TAs). The service area of a SGW defines the LTE area (e.g., cells or TAs) that the SGW can serve. The working of the proposed mechanism is validated via computer simulations and encouraging results are obtained.
and Mobility Management Entities (MMEs) are grouped to form a number of service and pool areas, respectively. While this concept of SGW service areas in the Evolved Packet Core is interesting to limit the administrative scope of SGWs and also provides a means to optimize the routing, the use of fixed/hard area boundaries can result in frequent unnecessary SGW relocations and can severely impact the Quality of Experience (QoE) of users. To avoid the drawback of fix/hard service (or pool) area boundaries, this paper
proposes a scheme whereby every SGW can have a flexibly
configurable service area, which is defined by a set of LTE (Long Term Evolution) cells or Tracking Areas (TAs). The service area of a SGW defines the LTE area (e.g., cells or TAs) that the SGW can serve. The working of the proposed mechanism is validated via computer simulations and encouraging results are obtained.
Research Interests:
The current Internet framework is, no longer, able to support the heterogeneous networking technologies, mobile devices, increased number of users, and also the high user requirements for sophisticated services and applications. As a... more
The current Internet framework is, no longer, able
to support the heterogeneous networking technologies, mobile devices, increased number of users, and also the high user requirements for sophisticated services and applications. As a
consequence, researchers envision the “future Internet” whereby
all these issues may be effectively addressed. The future Internet
architecture, amongst many components, is expected to
comprise Peer-to-Peer (P2P) Video on Demand (VoD) streaming
technologies. Since the conventional streaming techniques over
P2P frameworks have a number of shortcomings, design issues
pertaining to the P2P VoD schemes need to be seriously reconsidered.
In this paper, we envision a scheme to effectively
provide a VoD using P2P-based mesh overlay networks that
may be part of the future Internet. Our scheme also comprises
domain-based localization and congestion awareness strategies
for the selection of the most appropriate peers. Empirical results
have demonstrated the effectiveness of this scheme in terms of
scalability and capability to reduce the startup latency and total
link cost, and to also ensure a sustainable playback rate that is
crucial for providing VoD services over the future Internet
to support the heterogeneous networking technologies, mobile devices, increased number of users, and also the high user requirements for sophisticated services and applications. As a
consequence, researchers envision the “future Internet” whereby
all these issues may be effectively addressed. The future Internet
architecture, amongst many components, is expected to
comprise Peer-to-Peer (P2P) Video on Demand (VoD) streaming
technologies. Since the conventional streaming techniques over
P2P frameworks have a number of shortcomings, design issues
pertaining to the P2P VoD schemes need to be seriously reconsidered.
In this paper, we envision a scheme to effectively
provide a VoD using P2P-based mesh overlay networks that
may be part of the future Internet. Our scheme also comprises
domain-based localization and congestion awareness strategies
for the selection of the most appropriate peers. Empirical results
have demonstrated the effectiveness of this scheme in terms of
scalability and capability to reduce the startup latency and total
link cost, and to also ensure a sustainable playback rate that is
crucial for providing VoD services over the future Internet
Research Interests:
—Delay/disruption tolerant networking (DTN) technology offers a new solution to highly stressed communications in space environments, especially those with long link delay and frequent link disruptions in deep space missions. To date,... more
—Delay/disruption tolerant networking (DTN)
technology offers a new solution to highly stressed
communications in space environments, especially those with long link delay and frequent link disruptions in deep space missions. To date, little work has been done in evaluating the effectiveness of the available DTN protocols when they are applied to an interplanetary Internet. In this paper, we present an experimental evaluation of the Bundle Protocol (BP) running over various “convergence layer” protocols in a simulated cislunar communications environment characterized by varying degrees of signal propagation delay and data loss. We focus on the Licklider Transmission Protocol (LTP) convergence layer adapter running on top of UDP/IP (i.e., BP/LTPCL/UDP/IP). The performance of
BP/LTPCL/UDP/IP in realistic file transfers over a PC-based
testbed is compared with that of two other DTN protocol stacks, BP/TCPCL/TCP/IP and BP/UDPCL/UDP/IP. The experiment results show that LTPCL has a significant performance advantage over TCPCL for link delays longer than 4 sec when bit error rate (BER) is 10-6 or lower. For a lossy channel with a BER of around 10-5, LTPCL has a significant goodput advantage over TCPCL at all the link delay levels studied, with an advantage of around 3000 bytes/s for delays longer than 1.5 sec.
technology offers a new solution to highly stressed
communications in space environments, especially those with long link delay and frequent link disruptions in deep space missions. To date, little work has been done in evaluating the effectiveness of the available DTN protocols when they are applied to an interplanetary Internet. In this paper, we present an experimental evaluation of the Bundle Protocol (BP) running over various “convergence layer” protocols in a simulated cislunar communications environment characterized by varying degrees of signal propagation delay and data loss. We focus on the Licklider Transmission Protocol (LTP) convergence layer adapter running on top of UDP/IP (i.e., BP/LTPCL/UDP/IP). The performance of
BP/LTPCL/UDP/IP in realistic file transfers over a PC-based
testbed is compared with that of two other DTN protocol stacks, BP/TCPCL/TCP/IP and BP/UDPCL/UDP/IP. The experiment results show that LTPCL has a significant performance advantage over TCPCL for link delays longer than 4 sec when bit error rate (BER) is 10-6 or lower. For a lossy channel with a BER of around 10-5, LTPCL has a significant goodput advantage over TCPCL at all the link delay levels studied, with an advantage of around 3000 bytes/s for delays longer than 1.5 sec.
Research Interests:
Along with recent Internet security threats, different security measures have emerged. Whilst these security schemes ensure a level of protection against security threats, they often have significant impact on the perceived Quality of... more
Along with recent Internet security threats, different
security measures have emerged. Whilst these security schemes ensure a level of protection against security threats, they often have significant impact on the perceived Quality of Service (QoS). There is thus need to retrieve ways for an efficient integration of security requirements with their QoS counterparts. In this paper, we devise a Quality of Protection framework that tunes between security requirements and QoS using a multi-attribute decision making model. The performance of the proposed approach is evaluated and verified via a use-case study using computer simulations.
security measures have emerged. Whilst these security schemes ensure a level of protection against security threats, they often have significant impact on the perceived Quality of Service (QoS). There is thus need to retrieve ways for an efficient integration of security requirements with their QoS counterparts. In this paper, we devise a Quality of Protection framework that tunes between security requirements and QoS using a multi-attribute decision making model. The performance of the proposed approach is evaluated and verified via a use-case study using computer simulations.
Research Interests:
Vehicle Ad Hoc Networks (VANETs), based on IEEE 802.11p, and 3G & beyond networks are characterized by their high data transmission rates and wide range communication, respectively. This paper presents an architecture that integrates... more
Vehicle Ad Hoc Networks (VANETs), based on IEEE 802.11p, and 3G & beyond networks are characterized by their high data transmission rates and wide range communication,
respectively. This paper presents an architecture that integrates between the two, making advantage of the features
of each. Design guidelines pertaining to vehicle clustering and gateway management are defined. The former aims for enhancing the link stability within the VANET, whereas the latter sustains inter-connectivity of the VANET with the backhaul 3G & beyond network. Simulations are carried out using NS2 to evaluate the performance of the integrated network architecture and encouraging results are obtained in terms of high data packet delivery ratio, reduced control packet overhead, and reduced packet drop rate.
respectively. This paper presents an architecture that integrates between the two, making advantage of the features
of each. Design guidelines pertaining to vehicle clustering and gateway management are defined. The former aims for enhancing the link stability within the VANET, whereas the latter sustains inter-connectivity of the VANET with the backhaul 3G & beyond network. Simulations are carried out using NS2 to evaluate the performance of the integrated network architecture and encouraging results are obtained in terms of high data packet delivery ratio, reduced control packet overhead, and reduced packet drop rate.
Research Interests:
In this paper, we consider the Selected IP Traffic Offload (SIPTO) approach to handle increased data traffic of both local and macro-cellular networks. We devise different approaches based on operator defined offload policies on a per... more
In this paper, we consider the Selected IP Traffic Offload (SIPTO) approach to handle increased data traffic of both local and macro-cellular networks. We devise different approaches based on operator defined offload policies on a per destination domain name basis, which offer operators fine-grained control of whether a new IP connection should be offloaded or provided via the core network. Two of our solutions are based on Network Address Translation (NAT) named simple-NATing and twice-NATing, while a third one employs simple tunneling. These solutions support all kinds of UEs including those that support a single Packet Data Protocol (PDP) context/Packet Data Network (PDN) connection. In a forth solution, we consider the case where a User Equipment (UE) supports multiple PDP contexts/PDN
connections, with at least one dedicated for SIPTO traffic. A
qualitative analysis and a simulation study are presented.
connections, with at least one dedicated for SIPTO traffic. A
qualitative analysis and a simulation study are presented.
Research Interests:
—In the Evolved Packet System (EPS), service resiliency can be heavily impacted by a node failure, especially in its control plane. Ensuring service resiliency via defining efficient and proactive restoration mechanisms is of vital... more
—In the Evolved Packet System (EPS), service resiliency
can be heavily impacted by a node failure, especially in
its control plane. Ensuring service resiliency via defining efficient and proactive restoration mechanisms is of vital importance. In this paper, we address the case of Mobility Management Entity (MME) failure. We propose schemes for MME failure detection and restoration considering User Equipments (UEs) in both idle and active mode. As a MME failure may impact a potential number of UEs, network signaling overload control, via randomized paging and handling signaling messages in bulk, is considered. The proposed schemes are evaluated through
simulations and encouraging results are obtained.
can be heavily impacted by a node failure, especially in
its control plane. Ensuring service resiliency via defining efficient and proactive restoration mechanisms is of vital importance. In this paper, we address the case of Mobility Management Entity (MME) failure. We propose schemes for MME failure detection and restoration considering User Equipments (UEs) in both idle and active mode. As a MME failure may impact a potential number of UEs, network signaling overload control, via randomized paging and handling signaling messages in bulk, is considered. The proposed schemes are evaluated through
simulations and encouraging results are obtained.
Research Interests:
In mobile multimedia streaming services, important requirements consist of the support of service continuity, the guarantee of acceptable Quality of Service (QoS) and insurance of steady Quality of Experience (QoE). How to get a uniform... more
In mobile multimedia streaming services, important
requirements consist of the support of service continuity, the
guarantee of acceptable Quality of Service (QoS) and insurance of steady Quality of Experience (QoE). How to get a uniform data exchange rate during the entire (or partial) course of a streaming service while a user is on the move is an important challenge. Generally speaking, the streaming rate of a multimedia service may heavily fluctuate due to the unavailability or deficiency of resources along the movement path of a user. To cope with this challenge, this paper proposes a framework that integrates user mobility prediction models with resource availability prediction
models to keep a constant or less fluctuating streaming rate and to ultimately ensure steady QoE. Simulations are conducted to evaluate the performance of the proposed framework in achieving its design objectives and encouraging results are obtained.
requirements consist of the support of service continuity, the
guarantee of acceptable Quality of Service (QoS) and insurance of steady Quality of Experience (QoE). How to get a uniform data exchange rate during the entire (or partial) course of a streaming service while a user is on the move is an important challenge. Generally speaking, the streaming rate of a multimedia service may heavily fluctuate due to the unavailability or deficiency of resources along the movement path of a user. To cope with this challenge, this paper proposes a framework that integrates user mobility prediction models with resource availability prediction
models to keep a constant or less fluctuating streaming rate and to ultimately ensure steady QoE. Simulations are conducted to evaluate the performance of the proposed framework in achieving its design objectives and encouraging results are obtained.
Research Interests:
Mobile Wireless Network technology has enabled the development of increasingly diverse applications and devices resulting in an exponential growth in usage and services. One challenge in mobility management is the movement prediction.... more
Mobile Wireless Network technology has enabled the development of increasingly diverse applications and devices
resulting in an exponential growth in usage and services. One
challenge in mobility management is the movement prediction. Prediction of the user’s longer-term movement (e.g., 10 min in advance) with reasonable accuracy is very important to a broad range of services. To cope with this challenge, this paper proposes a new method to estimate a user’s future destination, called Destination Prediction Model (DPM). This method combines two types of approaches: one based on the use of filtered historical movement pattern and another based on contextual knowledge; both approaches use spatial conceptual maps. The filter is based on the day and the time of the day to increase accuracy. The current movement direction, that takes into account the recent data, is used by the proposed method to reduce historical and contextual knowledge mistakes. Simulations are conducted using real-life data to evaluate the performance of the proposed model. For subjects with low predictability degree, DPM reaches an average prediction accuracy of 79%; it reaches 91% for subjects with high predictability and 86% for other subjects. Simulation results also indicate that DPM significantly reduces the impact of learning period and the remaining distance to reach the destination on prediction performance. In the future, we plan to extend our research work by proposing a full Path Prediction Model (PPM) based on the Destination Prediction Model (DPM).
resulting in an exponential growth in usage and services. One
challenge in mobility management is the movement prediction. Prediction of the user’s longer-term movement (e.g., 10 min in advance) with reasonable accuracy is very important to a broad range of services. To cope with this challenge, this paper proposes a new method to estimate a user’s future destination, called Destination Prediction Model (DPM). This method combines two types of approaches: one based on the use of filtered historical movement pattern and another based on contextual knowledge; both approaches use spatial conceptual maps. The filter is based on the day and the time of the day to increase accuracy. The current movement direction, that takes into account the recent data, is used by the proposed method to reduce historical and contextual knowledge mistakes. Simulations are conducted using real-life data to evaluate the performance of the proposed model. For subjects with low predictability degree, DPM reaches an average prediction accuracy of 79%; it reaches 91% for subjects with high predictability and 86% for other subjects. Simulation results also indicate that DPM significantly reduces the impact of learning period and the remaining distance to reach the destination on prediction performance. In the future, we plan to extend our research work by proposing a full Path Prediction Model (PPM) based on the Destination Prediction Model (DPM).
Research Interests:
Along with the recent and ongoing advances in the wireless and mobile access technologies, a wide plethora of mobile multimedia services have emerged. Ensuring an acceptable level of Quality of Service (QoS) is a crucial requirement to... more
Along with the recent and ongoing advances in the wireless
and mobile access technologies, a wide plethora of mobile multimedia services have emerged. Ensuring an acceptable level of Quality of Service (QoS) is a crucial requirement to allow users enjoy these mobile multimedia services. One means to ensure QoS is to minimize the frequency and magnitude of fluctuations in the mobile multimedia
streaming rates during the multimedia service and while users are on the move. For this purpose, there is need for tools to predict a user's long-term movement. In this vein, this paper proposes a Path Prediction Model (PPM) to predict a user's movement path. PPM is based on historical movement trace, current movement data and spatial conceptual maps; it assumes a priori knowledge of the destination. At each road intersection, the probability of selecting the next road segment is evaluated, based on historical data, towards the
destination. These probabilities are computed via (a) filtering historical data according to the day of the week (e.g., weekend, holiday) and the time of the day; and (b) applying conditional probability rules taking into account the path used between the origin of movement, current position, and the destination. Simulations are conducted using real-life data to evaluate the performance of the proposed model. Encouraging results are obtained in terms of average prediction accuracy and mitigation of the impact of learning period and the remaining distance to reach the destination on the path prediction performance.
and mobile access technologies, a wide plethora of mobile multimedia services have emerged. Ensuring an acceptable level of Quality of Service (QoS) is a crucial requirement to allow users enjoy these mobile multimedia services. One means to ensure QoS is to minimize the frequency and magnitude of fluctuations in the mobile multimedia
streaming rates during the multimedia service and while users are on the move. For this purpose, there is need for tools to predict a user's long-term movement. In this vein, this paper proposes a Path Prediction Model (PPM) to predict a user's movement path. PPM is based on historical movement trace, current movement data and spatial conceptual maps; it assumes a priori knowledge of the destination. At each road intersection, the probability of selecting the next road segment is evaluated, based on historical data, towards the
destination. These probabilities are computed via (a) filtering historical data according to the day of the week (e.g., weekend, holiday) and the time of the day; and (b) applying conditional probability rules taking into account the path used between the origin of movement, current position, and the destination. Simulations are conducted using real-life data to evaluate the performance of the proposed model. Encouraging results are obtained in terms of average prediction accuracy and mitigation of the impact of learning period and the remaining distance to reach the destination on the path prediction performance.
Research Interests:
Scheduling real-time and non-real time packets at the sensor nodes is significantly important to reduce processing overhead, energy consumptions, communications bandwidth, and end-to-end data transmission delay of Wireless Sensor Network... more
Scheduling real-time and non-real time packets at the sensor nodes is significantly important to reduce processing overhead, energy consumptions, communications bandwidth, and end-to-end data transmission delay of Wireless Sensor Network (WSN). Most of the existing packet scheduling algorithms of WSN use assignments based on First-Come First-Served (FCFS), non-preemptive priority, and preemptive priority scheduling. However, these algorithms incur a large processing overhead and data transmission delay and are not
dynamic to the data traffic changes. In this paper, we propose threeclass priority packet scheduling scheme. Emergency real-time packets are placed into the highest priority queue and can preempt the processing of packets at other queues. Other packets are prioritized based on the location of sensor nodes and are placed into two other queues. Lowest priority packets can preempt the processing of their immediate higher priority packets after waiting for a certain number
of timeslots. Simulation results show that the proposed three-class priority packet scheduling scheme outperforms FCFS and multi-level queue schedulers in terms of end-to-end data transmission delay.
dynamic to the data traffic changes. In this paper, we propose threeclass priority packet scheduling scheme. Emergency real-time packets are placed into the highest priority queue and can preempt the processing of packets at other queues. Other packets are prioritized based on the location of sensor nodes and are placed into two other queues. Lowest priority packets can preempt the processing of their immediate higher priority packets after waiting for a certain number
of timeslots. Simulation results show that the proposed three-class priority packet scheduling scheme outperforms FCFS and multi-level queue schedulers in terms of end-to-end data transmission delay.
Research Interests:
One of the most important problems posed by cellular-based machine type communications is congestion. Congestion concerns both the radio access network and the mobile core network, impacting both the user data and the control planes. In... more
One of the most important problems posed by
cellular-based machine type communications is congestion. Congestion concerns both the radio access network and the mobile core network, impacting both the user data and the control planes. In this paper, we address the problem of congestion in machine type communications. We propose a congestionaware admission control solution that selectively rejects signaling messages from MTC devices at the radio access network following a probability that is set based on a proportional integrative derivative controller reflecting the congestion level of a relevant core network node. We evaluate the performance of our proposed solution using computer simulations. The obtained results are encouraging. In fact, we succeed in reducing the amount of signaling, to reach a target utilization ratio of resources in the core network.
cellular-based machine type communications is congestion. Congestion concerns both the radio access network and the mobile core network, impacting both the user data and the control planes. In this paper, we address the problem of congestion in machine type communications. We propose a congestionaware admission control solution that selectively rejects signaling messages from MTC devices at the radio access network following a probability that is set based on a proportional integrative derivative controller reflecting the congestion level of a relevant core network node. We evaluate the performance of our proposed solution using computer simulations. The obtained results are encouraging. In fact, we succeed in reducing the amount of signaling, to reach a target utilization ratio of resources in the core network.
Research Interests:
In this paper, we propose a new method for assessing the sociability scalar of a mobile peer by the network, most importantly with no involvement of the mobile peer. The sociability metric can help in the Application Layer Traffic... more
In this paper, we propose a new method for assessing
the sociability scalar of a mobile peer by the network,
most importantly with no involvement of the mobile peer. The
sociability metric can help in the Application Layer Traffic
Optimization (ALTO) guidance in Mobile Peer-to-Mobile Peer
(MP2MP) scenario to scale up the database search of an ALTO
server. The proposed method models encounters of mobile peers with predetermined areas, such as cells, tracking areas, gateway service areas, etc, depending on the targeted granularity. The obtained metrics, pertaining to inter-mobile peer relationship (i.e., sociability) and mobile peers mobility, are adopted to ALTO in a MP2MP scenario. In addition, metrics reflecting the energy budget of a mobile peer, the type of a mobile terminal, history of a mobile terminal in sharing contents with other mobile peers, etc, can be also taken into account by ALTO in the peer recommendation.
the sociability scalar of a mobile peer by the network,
most importantly with no involvement of the mobile peer. The
sociability metric can help in the Application Layer Traffic
Optimization (ALTO) guidance in Mobile Peer-to-Mobile Peer
(MP2MP) scenario to scale up the database search of an ALTO
server. The proposed method models encounters of mobile peers with predetermined areas, such as cells, tracking areas, gateway service areas, etc, depending on the targeted granularity. The obtained metrics, pertaining to inter-mobile peer relationship (i.e., sociability) and mobile peers mobility, are adopted to ALTO in a MP2MP scenario. In addition, metrics reflecting the energy budget of a mobile peer, the type of a mobile terminal, history of a mobile terminal in sharing contents with other mobile peers, etc, can be also taken into account by ALTO in the peer recommendation.
Research Interests:
Due to their numerous advantages, current trends show a growing number of femtocell deployments. However, femtocells would become less attractive to the general consumers if they cannot keep up with the service quality that the macro... more
Due to their numerous advantages, current trends
show a growing number of femtocell deployments. However,
femtocells would become less attractive to the general consumers if they cannot keep up with the service quality that the macro cellular network should provide. Given the fact that the quality of mobile services provided at femtocells depends largely on the level of congestion on the backhaul link, this paper introduces a flow mobility/handover admission control method that makes decisions on layer-three handovers from macro network to femtocell network and/or on entire or partial flow mobility between the two networks based on predicted QoS taking into account
metrics such as network load/congestion indications and based on predicted QoE metrics. The performance of the proposed admission control is evaluated via simulations and encouraging results are obtained
show a growing number of femtocell deployments. However,
femtocells would become less attractive to the general consumers if they cannot keep up with the service quality that the macro cellular network should provide. Given the fact that the quality of mobile services provided at femtocells depends largely on the level of congestion on the backhaul link, this paper introduces a flow mobility/handover admission control method that makes decisions on layer-three handovers from macro network to femtocell network and/or on entire or partial flow mobility between the two networks based on predicted QoS taking into account
metrics such as network load/congestion indications and based on predicted QoE metrics. The performance of the proposed admission control is evaluated via simulations and encouraging results are obtained
Research Interests:
There is a general trend towards the decentralization of mobile operator networks. Such network decentralization will not be efficient without rethinking mobility management schemes, particularly for users moving for a long distance... more
There is a general trend towards the decentralization
of mobile operator networks. Such network decentralization
will not be efficient without rethinking mobility management
schemes, particularly for users moving for a long distance and/or at a high speed (e.g., vehicles). To support such highly mobile users, this paper introduces a data anchor gateway relocation method based on user mobility, history information, and user activity patterns. The performance of the proposed schemes is evaluated through simulations and encouraging results are obtained.
of mobile operator networks. Such network decentralization
will not be efficient without rethinking mobility management
schemes, particularly for users moving for a long distance and/or at a high speed (e.g., vehicles). To support such highly mobile users, this paper introduces a data anchor gateway relocation method based on user mobility, history information, and user activity patterns. The performance of the proposed schemes is evaluated through simulations and encouraging results are obtained.
Research Interests:
This paper designs a complete framework that anticipates QoS/QoE (Quality of Experience) degradation and proactively defines policies for LTE-connected cars (UEs) to select the most adequate radio access out of WiFi and LTE. For a... more
This paper designs a complete framework that anticipates QoS/QoE (Quality of Experience) degradation and proactively defines policies for LTE-connected cars (UEs) to select the most adequate radio access out of WiFi and LTE. For a
particular application, the proposed framework considers the
application type, the mobility feature (e.g., speed, user mobility entire/partial path, user final/intermediate destination), and the traffic dynamics over the backhauls of both LTE and WiFi networks in order to predict and allow the UE to select the best network that maximize user QoE throughout the mobility path. Simulations are conducted to evaluate the performance of the proposed framework in achieving its design objectives and encouraging results are obtained.
particular application, the proposed framework considers the
application type, the mobility feature (e.g., speed, user mobility entire/partial path, user final/intermediate destination), and the traffic dynamics over the backhauls of both LTE and WiFi networks in order to predict and allow the UE to select the best network that maximize user QoE throughout the mobility path. Simulations are conducted to evaluate the performance of the proposed framework in achieving its design objectives and encouraging results are obtained.
Research Interests:
A good understanding of the behaviour of the traffic of a mobile network is essential for an efficient planning and management of the mobile network’s scarce bandwidth resources. In this paper, we propose a probabilistic approach, called... more
A good understanding of the behaviour of the traffic of a
mobile network is essential for an efficient planning and management of the mobile network’s scarce bandwidth resources. In this paper, we propose a probabilistic approach, called Handoff Time Estimation MODel (HTEMOD), to estimate the time window when a user will perform handoffs along his/her movement/path to a destination. We derive the probability distribution function of time taken to transit
each road segment along the path, using a sample of users that is selected according to navigation zone characteristics, current data on road segments, and current behaviour of users on the road segment. We evaluate our model via simulations, and compare it with the model proposed in [1]. Regardless of the given probability value to obtain a time window, the road segment density and the number of
road segments to handoff, HTEMOD provides a better accuracy and good duration of predicted time window when handoff will occur. Whilst the proposed HTEMOD model can be applied to any type of user equipment, its efficiency becomes more appealing in the context of vehicles (i.e., for the support of road to vehicles communications -
RVC) or highly mobile nodes travelling in urban areas constrained by predefined roads and whose velocities are also restricted according to speed limits, level of congestion in roads, and traffic control mechanisms (e.g., stop signs and traffic lights).
mobile network is essential for an efficient planning and management of the mobile network’s scarce bandwidth resources. In this paper, we propose a probabilistic approach, called Handoff Time Estimation MODel (HTEMOD), to estimate the time window when a user will perform handoffs along his/her movement/path to a destination. We derive the probability distribution function of time taken to transit
each road segment along the path, using a sample of users that is selected according to navigation zone characteristics, current data on road segments, and current behaviour of users on the road segment. We evaluate our model via simulations, and compare it with the model proposed in [1]. Regardless of the given probability value to obtain a time window, the road segment density and the number of
road segments to handoff, HTEMOD provides a better accuracy and good duration of predicted time window when handoff will occur. Whilst the proposed HTEMOD model can be applied to any type of user equipment, its efficiency becomes more appealing in the context of vehicles (i.e., for the support of road to vehicles communications -
RVC) or highly mobile nodes travelling in urban areas constrained by predefined roads and whose velocities are also restricted according to speed limits, level of congestion in roads, and traffic control mechanisms (e.g., stop signs and traffic lights).
Research Interests:
Existing gateway selection mechanisms base their selection on gateway load and/or geographical proximity of users to the gateways. In this paper, we mainly argue the need for other metrics to improve the gateway selection mechanisms in... more
Existing gateway selection mechanisms base their selection on gateway load and/or geographical proximity of users to the gateways. In this paper, we mainly argue the need for other metrics to improve the gateway selection mechanisms in
distributed mobile networks. We therefore propose considering the end-to-end connection and the service/application type as two important additional metrics in the selection of data anchor gateways in the context of the Evolved Packet System (EPS). To enable this, two solution variants are proposed. Simulations were also conducted to evaluate the performance of the proposed solutions and encouraging results are obtained.
distributed mobile networks. We therefore propose considering the end-to-end connection and the service/application type as two important additional metrics in the selection of data anchor gateways in the context of the Evolved Packet System (EPS). To enable this, two solution variants are proposed. Simulations were also conducted to evaluate the performance of the proposed solutions and encouraging results are obtained.
Research Interests:
Emerging social media applications are expected to cause severe congestion to mobile networks, both mobile core network and mobile radio access network. These social media applications are characterized by the fact that they involve... more
Emerging social media applications are expected to cause severe congestion to mobile networks, both mobile core
network and mobile radio access network. These social media applications are characterized by the fact that they involve sessions with frequently and dynamically updated content, shared with a potential number of mobile users sharing the same location, or being dispersed over a wide area. A method to dynamically identify such applications/sessions and initiate multicast based delivery of the relevant content is proposed. The performance of the proposed method is evaluated through computer simulations, taking Twitter as an example. Encouraging results are obtained.
network and mobile radio access network. These social media applications are characterized by the fact that they involve sessions with frequently and dynamically updated content, shared with a potential number of mobile users sharing the same location, or being dispersed over a wide area. A method to dynamically identify such applications/sessions and initiate multicast based delivery of the relevant content is proposed. The performance of the proposed method is evaluated through computer simulations, taking Twitter as an example. Encouraging results are obtained.
Research Interests:
Services are increasingly provided by cloud computing systems. Such services are often accessed while on the move. If the distance between the user and the service is getting large, quality-of-experience, in particular for interactive... more
Services are increasingly provided by cloud computing
systems. Such services are often accessed while on the
move. If the distance between the user and the service is getting large, quality-of-experience, in particular for interactive services, deteriorates. To counter this, the provisioning location of the service should be as close to the user as possible. This paper describes the concept of follow-me cloud, according to which services are migrating in unison with the user’s movements. The key components required for such integrated user mobility/service mobility management are introduced and mappings to an OpenFlow-based implementation are described
systems. Such services are often accessed while on the
move. If the distance between the user and the service is getting large, quality-of-experience, in particular for interactive services, deteriorates. To counter this, the provisioning location of the service should be as close to the user as possible. This paper describes the concept of follow-me cloud, according to which services are migrating in unison with the user’s movements. The key components required for such integrated user mobility/service mobility management are introduced and mappings to an OpenFlow-based implementation are described
Research Interests:
The increasing adoption of Machine Type Communication (MTC) applications using the Long Term Evolution (LTE) brings new challenges for the traditional bearer allocation and network management. MTC devices are high in number, each... more
The increasing adoption of Machine Type Communication
(MTC) applications using the Long Term Evolution (LTE) brings new challenges for the traditional bearer allocation and network management. MTC devices are high in number,
each requiring an individual bearer for a short data transmission; an inefficient process considering the signaling and management effort to the duration of the actual bearer use. This paper introduces the notion of a virtual bearer that can be shared among a number of MTC devices with similar Quality of Service (QoS) characteristics. The virtual bearer support at the MTC device side is based on the paradigm of Network Function Virtualization (NFV) and can migrate from one MTC device to another eliminating the need for individual device bearer establishment for both the radio and backhaul. The use of virtual bearers is enhanced by considering additionally MTC device-to-device (D2D) connectivity allowing devices without direct access to the network to use the virtual bearer via other devices, which act as gateways. Gateway devices may also be re-located dynamically based on NFV principles. In this way, a finer control is achieved on prioritizing certain services and providing load balancing. Our simulation results demonstrate the benefits of our proposed scheme compared to conventional approaches wherein MTC devices use individual bearers to send data in response to a trigger or according to a predetermined schedule.
(MTC) applications using the Long Term Evolution (LTE) brings new challenges for the traditional bearer allocation and network management. MTC devices are high in number,
each requiring an individual bearer for a short data transmission; an inefficient process considering the signaling and management effort to the duration of the actual bearer use. This paper introduces the notion of a virtual bearer that can be shared among a number of MTC devices with similar Quality of Service (QoS) characteristics. The virtual bearer support at the MTC device side is based on the paradigm of Network Function Virtualization (NFV) and can migrate from one MTC device to another eliminating the need for individual device bearer establishment for both the radio and backhaul. The use of virtual bearers is enhanced by considering additionally MTC device-to-device (D2D) connectivity allowing devices without direct access to the network to use the virtual bearer via other devices, which act as gateways. Gateway devices may also be re-located dynamically based on NFV principles. In this way, a finer control is achieved on prioritizing certain services and providing load balancing. Our simulation results demonstrate the benefits of our proposed scheme compared to conventional approaches wherein MTC devices use individual bearers to send data in response to a trigger or according to a predetermined schedule.
Research Interests:
This paper introduces the concept of dynamic Service Boost and proposes deployment solutions in mobile networks focusing on the 3GPP Long Term Evolution (LTE) architecture. The main idea is to introduce a time bound preferential service... more
This paper introduces the concept of dynamic Service Boost
and proposes deployment solutions in mobile networks focusing on the 3GPP Long Term Evolution (LTE) architecture. The main idea is to introduce a time bound preferential service to subscribers based on predefined service contracts. By applying a light-weight, dynamic Quality of Service (QoS) control, operators achieve both, efficient network utilization and adequate QoS for users and content/application providers. This helps operators to use resources more efficiently, for example to enable a more efficient capacity sharing in the presence of increasing mobile traffic. We initially investigate the impact of Service Boost on
Over-The-Top (OTT) traffic transmitted without any specific
QoS guarantees over the so-called default bearer in LTE. Then
we consider the design and analysis of a Service Boost
architecture and framework for managing and prioritizing
service requirements for certain applications within LTE.
Finally, we elaborate the realization of Service Boost through
congestion accountability.
and proposes deployment solutions in mobile networks focusing on the 3GPP Long Term Evolution (LTE) architecture. The main idea is to introduce a time bound preferential service to subscribers based on predefined service contracts. By applying a light-weight, dynamic Quality of Service (QoS) control, operators achieve both, efficient network utilization and adequate QoS for users and content/application providers. This helps operators to use resources more efficiently, for example to enable a more efficient capacity sharing in the presence of increasing mobile traffic. We initially investigate the impact of Service Boost on
Over-The-Top (OTT) traffic transmitted without any specific
QoS guarantees over the so-called default bearer in LTE. Then
we consider the design and analysis of a Service Boost
architecture and framework for managing and prioritizing
service requirements for certain applications within LTE.
Finally, we elaborate the realization of Service Boost through
congestion accountability.
Research Interests:
—This paper introduces an analytical model for the Follow-Me Cloud (FMC) concept whereby service mobility is enabled across data centers following the mobility of a mobile user. Given a network and cloud setup and a mobility pattern of a... more
—This paper introduces an analytical model for the
Follow-Me Cloud (FMC) concept whereby service mobility is
enabled across data centers following the mobility of a mobile user. Given a network and cloud setup and a mobility pattern of a mobile user, the proposed analytical model provides the performance of the FMC concept related to: (i) the user experience with the service (such as: UE average distance from the optimal DC, average end-to-end delay, service disruption duration); and (ii) to the cloud/mobile operator (such as the service migration cost). Obtained results are encouraging. They confirm the advantage
of the FMC concept, but stress the need for careful consideration when triggering the service migration.
Follow-Me Cloud (FMC) concept whereby service mobility is
enabled across data centers following the mobility of a mobile user. Given a network and cloud setup and a mobility pattern of a mobile user, the proposed analytical model provides the performance of the FMC concept related to: (i) the user experience with the service (such as: UE average distance from the optimal DC, average end-to-end delay, service disruption duration); and (ii) to the cloud/mobile operator (such as the service migration cost). Obtained results are encouraging. They confirm the advantage
of the FMC concept, but stress the need for careful consideration when triggering the service migration.
Research Interests:
Whilst Machine Type Communication (MTC) represents an important business opportunity for mobile operators, mobile operators fear the congestion that could come with the deployment of billions/trillions of MTC devices. In this paper, we... more
Whilst Machine Type Communication (MTC) represents an
important business opportunity for mobile operators, mobile operators fear the congestion that could come with the deployment of billions/trillions of MTC devices. In this paper, we present a new mechanism that anticipates system overload due to MTC signaling messages in 3GPP networks. This mechanism proactively avoids system congestion by compacting the signaling message content for a group of MTC devices sharing redundant Information Elements (IE) by creating a profile ID for this group. Furthermore, along with this solution, we propose a dynamic grouping solution, which groups MTC devices with common subscription features in
order to control the MTC signaling traffic when the network is overloaded. Simulation results show that compared to the Access Class Baring (ACB) mechanism, introduced by 3GPP, our proposed solution can avoid system overload without dropping MTC signaling messages, which is highly
beneficial for MTC applications requiring service reliability.
important business opportunity for mobile operators, mobile operators fear the congestion that could come with the deployment of billions/trillions of MTC devices. In this paper, we present a new mechanism that anticipates system overload due to MTC signaling messages in 3GPP networks. This mechanism proactively avoids system congestion by compacting the signaling message content for a group of MTC devices sharing redundant Information Elements (IE) by creating a profile ID for this group. Furthermore, along with this solution, we propose a dynamic grouping solution, which groups MTC devices with common subscription features in
order to control the MTC signaling traffic when the network is overloaded. Simulation results show that compared to the Access Class Baring (ACB) mechanism, introduced by 3GPP, our proposed solution can avoid system overload without dropping MTC signaling messages, which is highly
beneficial for MTC applications requiring service reliability.
Research Interests:
With the increasing number of mobile users on one hand, and the scarce resources in wireless networks on the other hand, there is need for efficient bandwidth utilization in order to avoid/reduce calls blocking/dropping. In this paper,... more
With the increasing number of mobile users on one hand, and the scarce resources in wireless networks on the
other hand, there is need for efficient bandwidth utilization in order to avoid/reduce calls blocking/dropping. In this paper, we propose a framework that aims at ensuring QoS in terms of bandwidth reservation along a user’s path (i.e., from his source location to his destination). For this objective, knowledge of user’s path from source to destination and his handoff times is required. Therefore, we exploit user mobility prediction schemes [1, 2] to predict users’ mobility and handoff time windows estimation schemes [3] to predict bandwidth availability for efficient call admission; however, these schemes [1-3] allow for processing individual user requests. Thus, to make the proposed framework scalable (with the number of users), we also propose a group-based path prediction model that estimates path to destination for a group of users (not only for a single user). The simulation results show that the proposed framework is effective in reducing the dropping rate of handoff calls and new call blocking rate, and in improving bandwidth utilization.
other hand, there is need for efficient bandwidth utilization in order to avoid/reduce calls blocking/dropping. In this paper, we propose a framework that aims at ensuring QoS in terms of bandwidth reservation along a user’s path (i.e., from his source location to his destination). For this objective, knowledge of user’s path from source to destination and his handoff times is required. Therefore, we exploit user mobility prediction schemes [1, 2] to predict users’ mobility and handoff time windows estimation schemes [3] to predict bandwidth availability for efficient call admission; however, these schemes [1-3] allow for processing individual user requests. Thus, to make the proposed framework scalable (with the number of users), we also propose a group-based path prediction model that estimates path to destination for a group of users (not only for a single user). The simulation results show that the proposed framework is effective in reducing the dropping rate of handoff calls and new call blocking rate, and in improving bandwidth utilization.
Research Interests:
Recently, issues of power consumption at base stations (BSs) in wireless cellular networks have attracted great interest in both research communities and the industry. In this paper, we investigate the BS power consumption in... more
Recently, issues of power consumption at base stations
(BSs) in wireless cellular networks have attracted great
interest in both research communities and the industry. In this paper, we investigate the BS power consumption in multiple-input single-output (MISO) Poisson-Voronoi tessellation (PVT) random cellular networks. Taking into account the inter-cell interference, the impact of the traffic demands of users and the spatial traffic intensity on the BS power consumption are jointly considered for MISO PVT random cellular networks. Furthermore, the power consumption required at the BS in a typical PVT cell is modeled through characteristic functions. Simulation results are employed to evaluate the BS power consumption and the performance of the random cellular networks.
(BSs) in wireless cellular networks have attracted great
interest in both research communities and the industry. In this paper, we investigate the BS power consumption in multiple-input single-output (MISO) Poisson-Voronoi tessellation (PVT) random cellular networks. Taking into account the inter-cell interference, the impact of the traffic demands of users and the spatial traffic intensity on the BS power consumption are jointly considered for MISO PVT random cellular networks. Furthermore, the power consumption required at the BS in a typical PVT cell is modeled through characteristic functions. Simulation results are employed to evaluate the BS power consumption and the performance of the random cellular networks.
Research Interests:
—Carrier Cloud is a promising concept towards the decentralization of mobile networks, to, in turn, alleviate mobile traffic load and reduce mobile operator cost. Carrier cloud is enabled by two main approaches, namely virtualization of... more
—Carrier Cloud is a promising concept towards the
decentralization of mobile networks, to, in turn, alleviate mobile traffic load and reduce mobile operator cost. Carrier cloud is enabled by two main approaches, namely virtualization of the mobile network functions and networking over federated cloud. For intelligent carrier cloud dimensioning, the placement of mobile network functions over federated cloud is of vital importance. In this vein, this paper argues the need for adopting service/application type and requirements as metrics for (i) creating virtual instances of the Packet Data Network Gateways (PDN-GW) and (ii) selecting adequate virtual PDN-GWs for User Equipment receiving specific application type. After modeling this
procedure as a nonlinear Optimization Problem and proving it as a NP-hard problem, we propose three solutions to solve it. The proposed solutions are evaluated through computer simulations and encouraging results are obtained.
decentralization of mobile networks, to, in turn, alleviate mobile traffic load and reduce mobile operator cost. Carrier cloud is enabled by two main approaches, namely virtualization of the mobile network functions and networking over federated cloud. For intelligent carrier cloud dimensioning, the placement of mobile network functions over federated cloud is of vital importance. In this vein, this paper argues the need for adopting service/application type and requirements as metrics for (i) creating virtual instances of the Packet Data Network Gateways (PDN-GW) and (ii) selecting adequate virtual PDN-GWs for User Equipment receiving specific application type. After modeling this
procedure as a nonlinear Optimization Problem and proving it as a NP-hard problem, we propose three solutions to solve it. The proposed solutions are evaluated through computer simulations and encouraging results are obtained.
Research Interests:
Machine-type-Communication (MTC) is seen as a major service in next generation cellular mobile networks. However, the forecasted very large number of MTC devices may overload the RAN (Radio Access Network) part of the network, which may... more
Machine-type-Communication (MTC) is seen as a major service in next generation cellular mobile networks. However, the forecasted very large number of MTC devices may overload the RAN (Radio Access Network) part of the network,
which may impact Non-MTC communications. Group paging is considered as one of the most efficient mechanisms proposed to alleviate the problem of the RAN overload. In this paper, we introduce a new solution to improve the performance of the current group paging method and overcome its disadvantages. The proposed solution is intended for MTC devices in the RRC CONNECTED OUT OF SYNC state, in which MTC devices have an RRC context without being synchronized with the network. Numerical results demonstrate that the proposed solution highly improves the performance of existing group paging mechanisms.
which may impact Non-MTC communications. Group paging is considered as one of the most efficient mechanisms proposed to alleviate the problem of the RAN overload. In this paper, we introduce a new solution to improve the performance of the current group paging method and overcome its disadvantages. The proposed solution is intended for MTC devices in the RRC CONNECTED OUT OF SYNC state, in which MTC devices have an RRC context without being synchronized with the network. Numerical results demonstrate that the proposed solution highly improves the performance of existing group paging mechanisms.
Research Interests:
This paper describes a device triggering optimization technique for controlling system overload when deploying massive Machine Type Communication (MTC) devices in 3GPP-based cellular networks. Triggering a large number of MTC devices can... more
This paper describes a device triggering optimization technique for controlling system overload when deploying massive Machine Type Communication (MTC) devices in 3GPP-based cellular networks. Triggering a large number of MTC devices can dramatically overload the underlying transport network system and incur congestion in both the
Radio Access Network (RAN) and the Evolved Packet Core (EPC). The proposed solution aims at controlling the rate of device trigger requests that MTC servers can generate in order to reduce the system overload. For this purpose, we propose that the Mobility Management Entity (MME), or an
alike core network node, computes the device trigger rate that alleviates congestion, and communicates this value to the MTC-Interworking Function (MTC-IWF) element that enforces MTC traffic control, via admission control or data aggregation, on the device trigger request rate received from the different MTC servers. The proposed solution is evaluated through computer simulations and encouraging results are obtained.
Radio Access Network (RAN) and the Evolved Packet Core (EPC). The proposed solution aims at controlling the rate of device trigger requests that MTC servers can generate in order to reduce the system overload. For this purpose, we propose that the Mobility Management Entity (MME), or an
alike core network node, computes the device trigger rate that alleviates congestion, and communicates this value to the MTC-Interworking Function (MTC-IWF) element that enforces MTC traffic control, via admission control or data aggregation, on the device trigger request rate received from the different MTC servers. The proposed solution is evaluated through computer simulations and encouraging results are obtained.
Research Interests:
This paper describes a device triggering optimization technique for controlling system overload when deploying massive Machine Type Communication (MTC) devices in 3GPP-based cellular networks. Triggering a large number of MTC devices can... more
This paper describes a device triggering optimization technique for controlling system overload when deploying massive Machine Type Communication (MTC) devices in 3GPP-based cellular networks. Triggering a large number of MTC devices can dramatically overload the
underlying transport network system and incur congestion in both the Radio Access Network (RAN) and the Evolved Packet Core (EPC). The proposed solution aims at controlling the rate of device trigger requests that MTC servers can generate in order to reduce the system overload. For this purpose, we propose that the Mobility Management Entity (MME), or an
alike core network node, computes the device trigger rate that alleviates congestion, and communicates this value to the MTC-Interworking Function (MTC-IWF) element that enforces MTC traffic control, via admission control or data aggregation, on the device trigger request rate received from the different MTC servers. The proposed solution is evaluated through computer simulations and encouraging results are obtained.
underlying transport network system and incur congestion in both the Radio Access Network (RAN) and the Evolved Packet Core (EPC). The proposed solution aims at controlling the rate of device trigger requests that MTC servers can generate in order to reduce the system overload. For this purpose, we propose that the Mobility Management Entity (MME), or an
alike core network node, computes the device trigger rate that alleviates congestion, and communicates this value to the MTC-Interworking Function (MTC-IWF) element that enforces MTC traffic control, via admission control or data aggregation, on the device trigger request rate received from the different MTC servers. The proposed solution is evaluated through computer simulations and encouraging results are obtained.
Research Interests:
Long Term Evolution (LTE) represents the fourth generation (4G) technology which is capable of providing high data rates as well as support of high speed mobility. The EU FP7 Mobile Cloud Networking (MCN) project integrates the use of... more
Long Term Evolution (LTE) represents the fourth
generation (4G) technology which is capable of providing high
data rates as well as support of high speed mobility. The EU FP7
Mobile Cloud Networking (MCN) project integrates the use of
cloud computing concepts in LTE mobile networks in order to
increase LTE’s performance. In this way a shared distributed
virtualized LTE mobile network is built that can optimize the
utilization of virtualized computing, storage and network
resources and minimize communication delays. Two important
features that can be used in such a virtualized system to improve
its performance are the user mobility and bandwidth prediction.
This paper introduces the architecture and challenges that are
associated with user mobility and bandwidth prediction
approaches in virtualized LTE systems.
generation (4G) technology which is capable of providing high
data rates as well as support of high speed mobility. The EU FP7
Mobile Cloud Networking (MCN) project integrates the use of
cloud computing concepts in LTE mobile networks in order to
increase LTE’s performance. In this way a shared distributed
virtualized LTE mobile network is built that can optimize the
utilization of virtualized computing, storage and network
resources and minimize communication delays. Two important
features that can be used in such a virtualized system to improve
its performance are the user mobility and bandwidth prediction.
This paper introduces the architecture and challenges that are
associated with user mobility and bandwidth prediction
approaches in virtualized LTE systems.
Research Interests:
Abstract—In this paper, we consider the Selected IP Traffic Offload (SIPTO) approach to handle increased data traffic of both local and macro-cellular networks. We devise different approaches based on operator defined offload policies on... more
Abstract—In this paper, we consider the Selected IP Traffic
Offload (SIPTO) approach to handle increased data traffic of
both local and macro-cellular networks. We devise different approaches
based on operator defined offload policies on a per destination
domain name basis, which offer operators fine-grained
control of whether a new IP connection should be offloaded or
provided via the core network. Two of our solutions are based on
Network Address Translation (NAT) named simple-NATing and
twice-NATing, while a third one employs simple tunneling. These
solutions support all kinds of UEs including those that support a
single Packet Data Protocol (PDP) context/Packet Data Network
(PDN) connection. In a forth solution, we consider the case where
a User Equipment (UE) supports multiple PDP contexts/PDN
connections, with at least one dedicated for SIPTO traffic. A
qualitative analysis and a simulation study are presented.
Offload (SIPTO) approach to handle increased data traffic of
both local and macro-cellular networks. We devise different approaches
based on operator defined offload policies on a per destination
domain name basis, which offer operators fine-grained
control of whether a new IP connection should be offloaded or
provided via the core network. Two of our solutions are based on
Network Address Translation (NAT) named simple-NATing and
twice-NATing, while a third one employs simple tunneling. These
solutions support all kinds of UEs including those that support a
single Packet Data Protocol (PDP) context/Packet Data Network
(PDN) connection. In a forth solution, we consider the case where
a User Equipment (UE) supports multiple PDP contexts/PDN
connections, with at least one dedicated for SIPTO traffic. A
qualitative analysis and a simulation study are presented.
Research Interests: Computer Networks, Virtualization, Mobile Computing, Cloud Computing, QoS and QoE, and 5 more5G, EPC, NFV, EPS, and 4g
Vehicle Ad Hoc Networks (VANETs), based on IEEE 802.11p, and 3G & beyond networks are characterized by their high data transmission rates and wide range communication, respectively. This paper presents an architecture that integrates... more
Vehicle Ad Hoc Networks (VANETs), based on
IEEE 802.11p, and 3G & beyond networks are characterized
by their high data transmission rates and wide range communication,
respectively. This paper presents an architecture that
integrates between the two, making advantage of the features
of each. Design guidelines pertaining to vehicle clustering and
gateway management are defined. The former aims for enhancing
the link stability within the VANET, whereas the latter sustains
inter-connectivity of the VANET with the backhaul 3G & beyond
network. Simulations are carried out using NS2 to evaluate
the performance of the integrated network architecture and
encouraging results are obtained in terms of high data packet
delivery ratio, reduced control packet overhead, and reduced
packet drop rate.
IEEE 802.11p, and 3G & beyond networks are characterized
by their high data transmission rates and wide range communication,
respectively. This paper presents an architecture that
integrates between the two, making advantage of the features
of each. Design guidelines pertaining to vehicle clustering and
gateway management are defined. The former aims for enhancing
the link stability within the VANET, whereas the latter sustains
inter-connectivity of the VANET with the backhaul 3G & beyond
network. Simulations are carried out using NS2 to evaluate
the performance of the integrated network architecture and
encouraging results are obtained in terms of high data packet
delivery ratio, reduced control packet overhead, and reduced
packet drop rate.
Research Interests:
Delay/disruption tolerant networking (DTN) technology offers a new solution to highly stressed communications in space environments, especially those with long link delay and frequent link disruptions in deep space missions. To date,... more
Delay/disruption tolerant networking (DTN)
technology offers a new solution to highly stressed
communications in space environments, especially those with long
link delay and frequent link disruptions in deep space missions.
To date, little work has been done in evaluating the effectiveness
of the available DTN protocols when they are applied to an
interplanetary Internet. In this paper, we present an experimental
evaluation of the Bundle Protocol (BP) running over various
“convergence layer” protocols in a simulated cislunar
communications environment characterized by varying degrees of
signal propagation delay and data loss. We focus on the Licklider
Transmission Protocol (LTP) convergence layer adapter running
on top of UDP/IP (i.e., BP/LTPCL/UDP/IP). The performance of
BP/LTPCL/UDP/IP in realistic file transfers over a PC-based
testbed is compared with that of two other DTN protocol stacks,
BP/TCPCL/TCP/IP and BP/UDPCL/UDP/IP. The experiment
results show that LTPCL has a significant performance
advantage over TCPCL for link delays longer than 4 sec when bit
error rate (BER) is 10-6 or lower. For a lossy channel with a BER
of around 10-5, LTPCL has a significant goodput advantage over
TCPCL at all the link delay levels studied, with an advantage of
around 3000 bytes/s for delays longer than 1.5 sec.
technology offers a new solution to highly stressed
communications in space environments, especially those with long
link delay and frequent link disruptions in deep space missions.
To date, little work has been done in evaluating the effectiveness
of the available DTN protocols when they are applied to an
interplanetary Internet. In this paper, we present an experimental
evaluation of the Bundle Protocol (BP) running over various
“convergence layer” protocols in a simulated cislunar
communications environment characterized by varying degrees of
signal propagation delay and data loss. We focus on the Licklider
Transmission Protocol (LTP) convergence layer adapter running
on top of UDP/IP (i.e., BP/LTPCL/UDP/IP). The performance of
BP/LTPCL/UDP/IP in realistic file transfers over a PC-based
testbed is compared with that of two other DTN protocol stacks,
BP/TCPCL/TCP/IP and BP/UDPCL/UDP/IP. The experiment
results show that LTPCL has a significant performance
advantage over TCPCL for link delays longer than 4 sec when bit
error rate (BER) is 10-6 or lower. For a lossy channel with a BER
of around 10-5, LTPCL has a significant goodput advantage over
TCPCL at all the link delay levels studied, with an advantage of
around 3000 bytes/s for delays longer than 1.5 sec.
Research Interests:
Along with recent Internet security threats, different security measures have emerged. Whilst these security schemes ensure a level of protection against security threats, they often have significant impact on the perceived Quality of... more
Along with recent Internet security threats, different
security measures have emerged. Whilst these security schemes
ensure a level of protection against security threats, they often
have significant impact on the perceived Quality of Service (QoS).
There is thus need to retrieve ways for an efficient integration
of security requirements with their QoS counterparts.
In this paper, we devise a Quality of Protection framework
that tunes between security requirements and QoS using a
multi-attribute decision making model. The performance of the
proposed approach is evaluated and verified via a use-case study
using computer simulations.
security measures have emerged. Whilst these security schemes
ensure a level of protection against security threats, they often
have significant impact on the perceived Quality of Service (QoS).
There is thus need to retrieve ways for an efficient integration
of security requirements with their QoS counterparts.
In this paper, we devise a Quality of Protection framework
that tunes between security requirements and QoS using a
multi-attribute decision making model. The performance of the
proposed approach is evaluated and verified via a use-case study
using computer simulations.
Research Interests:
Along with recent Internet security threats, different security measures have emerged. Whilst these security schemes ensure a level of protection against security threats, they often have significant impact on the perceived Quality of... more
Along with recent Internet security threats, different
security measures have emerged. Whilst these security schemes
ensure a level of protection against security threats, they often
have significant impact on the perceived Quality of Service (QoS).
There is thus need to retrieve ways for an efficient integration
of security requirements with their QoS counterparts.
In this paper, we devise a Quality of Protection framework
that tunes between security requirements and QoS using a
multi-attribute decision making model. The performance of the
proposed approach is evaluated and verified via a use-case study
using computer simulations.
security measures have emerged. Whilst these security schemes
ensure a level of protection against security threats, they often
have significant impact on the perceived Quality of Service (QoS).
There is thus need to retrieve ways for an efficient integration
of security requirements with their QoS counterparts.
In this paper, we devise a Quality of Protection framework
that tunes between security requirements and QoS using a
multi-attribute decision making model. The performance of the
proposed approach is evaluated and verified via a use-case study
using computer simulations.
Research Interests:
Research Interests:
ABSTRACT There is a general trend towards the decentralization of mobile operator networks. Such network decentralization will not be efficient without rethinking mobility management schemes, particularly for users moving for a long... more
ABSTRACT There is a general trend towards the decentralization of mobile operator networks. Such network decentralization will not be efficient without rethinking mobility management schemes, particularly for users moving for a long distance and/or at a high speed (e.g., vehicles). To support such highly mobile users, this paper introduces a data anchor gateway relocation method based on user mobility, history information, and user activity patterns. The performance of the proposed schemes is evaluated through simulations and encouraging results are obtained.