The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] wireless multi-hop networks(6hit)

1-6hit
  • Performance Evaluation of Breadcrumbs in Wireless Multi-Hop Cache Networks

    Kento IKKAKU  Miki YAMAMOTO  

     
    PAPER-Network

      Pubricized:
    2018/10/18
      Vol:
    E102-B No:4
      Page(s):
    845-854

    In this paper, we first evaluate Breadcrumbs in wireless multi-hop networks and reveal that they brings throughput improvement of not only popular content but also less popular content. Breadcrumbs can distribute popular content traffic towards edges of a wireless network, which enables low-popularity content to be downloaded from the gateway node. We also propose a new caching decision, called receiver caching. In receiver caching, only the receiver node caches the transmitted content. Our simulation results show that receiver caching prevents frequent replacement of cached content, which reduces invalid Breadcrumbs trails to be remained. And they also show that receiver caching significantly improves the total throughput performance of Breadcrumbs.

  • Prediction-Based Cross-Layer Resource Allocation for Wireless Multi-Hop Networks with Outdated CSI

    Wei FENG  Suili FENG  Yuehua DING  Yongzhong ZHANG  

     
    PAPER-Network

      Vol:
    E97-B No:4
      Page(s):
    746-754

    The rapid variation of wireless channels and feedback delay make the available channel state information (CSI) outdated in dynamic wireless multi-hop networks, which significantly degrades the accuracy of cross-layer resource allocation. To deal with this problem, a cross-layer resource allocation scheme is proposed for wireless multi-hop networks by taking the outdated CSI into account and basing compensation on the results of channel prediction. The cross-layer resource allocation is formulated as a network utility maximization problem, which jointly considers congestion control, channel allocation, power control, scheduling and routing with the compensated CSI. Based on a dual decomposition approach, the problem is solved in a distributed manner. Simulation results show that the proposed algorithm can reasonably allocate the resources, and significantly improve the throughput and energy efficiency in the network.

  • Generating Realistic Node Mobility and Placement for Wireless Multi-Hop Network Simulation Open Access

    Bratislav MILIC  Miroslaw MALEK  

     
    INVITED PAPER

      Vol:
    E95-B No:9
      Page(s):
    2682-2690

    There exists a considerable number of node placement models and algorithms for simulation of wireless multihop networks. However, the topologies created with the existing algorithms do not have properties of real networks. We have developed NPART (Node Placement Algorithm for Realistic Topologies) in order to resolve this fundamental issue in simulation methodology. We compare topologies generated by NPART with open wireless multihop network in Berlin. The NPART generated topologies have almost identical node degree distribution, number of cut-edges and vertices as the real network. Unlike them, topologies generated with the common node placement models have their own characteristics which are considerably different both from NPART and from reality. NPART algorithm has been developed into a tool. We propose a method and present a tool for integration of NPART with various realistic node mobility algorithms and tools, such as Citymob [1] and MOVE [2]. This integrated tool allows easy and time-efficient generation of highly complex, realistic simulation scenarios. We use the tool to evaluate effects of integration between existing open community wireless multi-hop networks and vehicular ad-hoc networks (VANETs). The evaluation shows that despite partial coverage and peculiar topological properties of open networks, they offer high levels of performance and network availability to the mobile end users, virtually identical to performance and availability of planned, dedicatedly deployed networks. Our results indicate that the integration of these networks may bring considerable benefits to all parties involved.

  • Analysis and Experiments of Maximum Throughput in Wireless Multi-Hop Networks for VoIP Application

    Masahiko INABA  Yoshihiro TSUCHIYA  Hiroo SEKIYA  Shiro SAKATA  Kengo YAGYU  

     
    PAPER-Network

      Vol:
    E92-B No:11
      Page(s):
    3422-3431

    This paper quantitatively analyzes the maximum UDP (User Datagram Protocol) throughput for two-way flows in wireless string multi-hop networks. The validity of the analysis is shown by the comparison with the simulation and the experiment results. The authors also clarify the difference fundamental characteristics between a one-way flow and a two-way flow in detail based on the simulation results. The result shows that collisions at both ends' nodes are decisive in determining the throughput for two-way flows. The analyses are applicable to the estimation of VoIP (Voice over Internet Protocol) capacity for string multi-hop networks represented by WLAN (Wireless Local Area Network) mesh networks.

  • Network-Adaptive Video Streaming over Wireless Multi-Hop Networks: Cross-Layered Hop-by-Hop Control

    SangHoon PARK  Jaeyong YOO  JongWon KIM  

     
    LETTER-Network

      Vol:
    E92-B No:7
      Page(s):
    2496-2499

    In this letter, we propose a network-adaptive video streaming scheme based on cross-layered hop-by-hop video rate control in wireless multi-hop networks. We argue that existing end-to-end network-adaptive video rate control schemes, which utilize end-to-end statistics, exhibit serious performance degradation in severely interfered wireless network condition. To cope with this problem, in the proposed scheme, intermediate wireless nodes adjust video sending rate depending upon wireless channel condition measured at MAC (Medium Access Control) layer. Extensive experimental results from an IEEE 802.11a-based testbed show that the proposed scheme improves the perceptual video quality compared to an end-to-end scheme.

  • A Cross-Layer Design of User Cooperation for Rate Adaptive Wireless Local Area Networks

    Akeo MASUDA  Shigeru SHIMAMOTO  

     
    PAPER

      Vol:
    E92-B No:3
      Page(s):
    776-783

    In this paper, we propose a cross-layer design of packet level cooperation for wireless LANs that support rate adaptation. While keeping compatibility with legacy wireless LANs, distributed control of multi-hop packet transmission is enabled without pre-negotiation of routing or pairing. These features are provided by prioritization scheme based on IEEE 802.11e EDCF in which we set the parameters according to the measured link condition at each terminal. Relaying packets with high transmission rate makes much efficient use of radio resource, and it leads not only to improve performance of the total system, but also to overcome the fairness issue known in rate adaptation, where the terminals with good link conditions cannot gain enough resource because of the time consumed by low data rate transmission. These advantages are confirmed through computer simulations considering packet error rate at each transmission which is assumed by receiving power calculated from the distance between source, relay, and destination terminals. Furthermore, we also discuss about the fairness between cooperation-enabled and legacy terminals when they coexist in the same system, in order to make gradual deployment feasible.