Now showing1 - 7 of 7
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Mobility support for content centric networking
    The current Internet architecture was designed more than 30 years ago for a very different set of services than those used today. Several new architectures have been proposed for a Future Internet to better meet today’s and future requirements. Content centric networking (CCN) is a prominent information centric networking (ICN) architecture which gains worldwide attention by researchers and the focus of this article. CCN, like other ICN architectures, is based on the idea of naming content instead of hosts, allowing routers to cache popular content. It has been shown that CCN can support point-to-point real-time conversations, for example voice or video calls. However, it has not been defined how node mobility can be achieved in such a scenario with real-time requirements. This article illustrates the problems of mobility in CCN for real-time applications and proposes three different solutions. A testbed has been established to emulate the handover procedures of the different proposals and analyze the quality of experience (QoE) score during handover. The results show that the presented approaches can reduce the handover delay time and also reduce signaling overhead in CCN.
    Publicationtype: Journal Article
      127
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A novel handover prediction scheme in Content Centric Networking using nonlinear autoregressive exogenous model
    Content Centric Networking (CCN) has been recently proposed as a potential candidate for the future Internet architecture. It allows users to focus on the data they are interested in, rather than having to connect to a specific physical host where the data locates. CCN is claimed to inherently support mobility. While this is true for content receivers, source mobility as well as handovers still remain a challenging tasks in CCN. This paper proposes a novel handover prediction mechanism based on received signal strength (RSS), delay and handover cost using the nonlinear autoregressive exogenous model (NARX). We first introduce a mathematical model using Integer Linear Programming (ILP) to solve the handover decision problem assuming that the mobility scenario is known. This ILP model minimizes the overall cost over the considered time period including the cost of handover and the cost of using a certain network. The ILP model guarantees an optimal handover solution, which is then used to train the NARX. After the learning phase, the NARX can automatically make the handover decision based on RSS and delay information. The performance evaluation shows that our new mechanism can avoid the "ping-pong" effect usually seen in threshold-based approaches, and also outperforms the threshold-based handover in terms of delay, which results in a better Quality of Service.
    Publicationtype: Conference Paper
      209
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Handover prediction for wireless networks in office environments using Hidden Markov Model
    User mobility can cause severe degradation of QoS, which can be counteracted by performing handovers at the right moment. However, to perform a robust handover is a challenging task. In this paper, we study the handover problem for mobile wireless networks in the office environment, where the users' mobility is predictable. We propose a new mechanism using the Hidden Markov Model (HMM) to predict the Received Signal Strength (RSS) values. Based on the predicted values, each mobile user can perform the handover decision on his own using his preferred decision making algorithm. Extensive simulations were carried out for an office environment to evaluate the performance of the prediction handover scheme. The results showed that our HMM model can predict the RSS values accurately. The knowledge obtained from prediction is considered in the handover decision making algorithm, which can result in a seamless handover. Moreover, with the knowledge about the future RSS, mobile users can avoid multiple handovers in a short time known as 'Ping-Pong' effect, which in turn reduces the signaling overheads on the network.
    Publicationtype: Conference Paper
      100
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Switching of routing algorithms in wireless networks for fire fighting
    (Springer, 2013) ; ;
    Fire fighters often work in dangerous and dynamic environments, which results in frequent change of network topologies and routing requirements. While the existing routing protocols are not able to cope with such a changeable environment, this paper proposes a self adaptive hybrid routing algorithm. This routing algorithm can switch between the proactive routing algorithm and reactive routing algorithm for each node pair automatically. An analytical model is created to describe the routing switch decision making algorithm. This model is based on a set of the cost functions. A numerical example shows the necessity of switching routing algorithms to reduce the overall control message overhead. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2013.
    Publicationtype: Conference Paper
      71
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Adaptive routing in wireless sensor networks for fire fighting
    (Springer, 2012-09-03) ; ;
    Fire fighters often work in dangerous and dynamic environments, which results in frequent change of network topologies and routing requirements. While the existing routing protocols are not able to cope with such a changeable environment, this paper proposes a self adaptive hybrid routing algorithm. This routing algorithm can switch between the proactive routing algorithm and reactive routing algorithm for each node pair automatically. An analytical model is created to describe the routing switch decision making algorithm. This model is based on a set of the cost functions. A numerical example shows the necessity of switching routing algorithms to reduce the overall control message overhead. © 2012 IFIP International Federation for Information Processing.
    Publicationtype: Conference Paper
      108
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Automatic handover decision in content centric networking
    (Springer, 2012-09-03) ; ; ;
    The current Internet architecture was designed more than 30 years ago for a very different set of services than those used today. Several new architectures have been proposed for a Future Internet to better meet todays and future requirements. Content Centric Networking (CCN) is one of those new architectures gaining worldwide attention by researchers and the focus of this article. CCN is based on naming content instead of hosts allowing routers to cache popular content. It has been shown that CCN can also support point-to-point real-time conversations, for example voice or video calls. However, it has not been defined how node mobility can be achieved in such a real-time scenario with strong time constraints. In this paper a close study to the handover algorithms has been carried out. A handover decision maker, which is based on neuro-fuzzy system (NFS) is proposed and evaluated. The results show that the proposed decision maker meets the design targets. © 2012 IFIP International Federation for Information Processing.
    Publicationtype: Conference Paper
      195
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Mobility support for content centric networking: case study
    The current Internet architecture was not designed to fullfil the requirements of nowadays services, therefore it faces a lot of challenges. There exist several projects, which target to redesign the Internet architecture completely. Content Centric Networking (CCN) is one of them. CCN is based on naming content instead of hosts. It has been shown that CCN can also support point-to-point conversions, for example voice calls. However, it has not been defined how node mobility can be achieved in such a real-time scenario with strong time constraints. This paper illustrates the arising problems of mobility in CCN for real-time applications and proposes three different solutions. The results and the analyses show that the presented approaches can reduce the delay time and also reduce signaling overhead. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.
    Publicationtype: Conference Paper
      32