Sezaki & Nishiyama Laboratory
Institute of Industrial Science / Center for Spatial Information Science in The University of Tokyo
Institute of Industrial Science / Center for Spatial Information Science in The University of Tokyo
Yu Nakayama, Kazuki Maruta, Takuya Tsutsumi, Kaoru Sezaki
Optically Backhauled Moving Network for Local Trains: Architecture and Scheduling Journal Article Open Access
In: IEEE Access, 6 , pp. 31023-31036, 2018, ISSN: 2169-3536.
Abstract | BibTeX | タグ: Communication networks, mobile communication, optical fiber networks | Links:
@article{8374407,
title = {Optically Backhauled Moving Network for Local Trains: Architecture and Scheduling},
author = {Yu Nakayama and Kazuki Maruta and Takuya Tsutsumi and Kaoru Sezaki},
doi = {10.1109/ACCESS.2018.2844865},
issn = {2169-3536},
year = {2018},
date = {2018-06-07},
journal = {IEEE Access},
volume = {6},
pages = {31023-31036},
publisher = {IEEE},
abstract = {The concept of moving cell in cellular systems has been discussed for 5G group mobility where rapidly moving platforms such as trains carry a large number of user terminals. It has been considered to employ wireless backhaul for moving cell, the problem of which is its limited and unstable bandwidth. To realize high bandwidth with wireless backhaul, a large number of base stations (BSs) are required along the railway. Therefore, this paper proposes the concept of optically backhauled moving network (OBMN) for local trains to efficiently provide backhaul links for local trains. In the OBMN, an autonomous BS (ABS) is set on the top of a train and is connected to a gateway via optical backhaul. While the user terminals onboard move, the ABS set on the train always satisfies the moving demands through high-bandwidth optical backhaul. The effectiveness of the proposed architecture and scheduling was confirmed by examining two case studies in the suburban and urban areas in Tokyo. The number of required BSs and deployment cost are reduced by half with the proposed OBMN compared with the existing static deployment.},
keywords = {Communication networks, mobile communication, optical fiber networks},
pubstate = {published},
tppubtype = {article}
}
Yu Nakayama, Kazuki Maruta, Takuya Tsutsumi, Kaoru Sezaki
Wired and Wireless Network Cooperation for Wide-Area Quick Disaster Recovery Journal Article Open Access
In: IEEE Access, 6 , pp. 2410–2424, 2017, ISSN: 2169-3536.
Abstract | BibTeX | タグ: Communication networks, communication system traffic control, routing, system recovery, wireless application protocol | Links:
@article{articlec,
title = {Wired and Wireless Network Cooperation for Wide-Area Quick Disaster Recovery},
author = {Yu Nakayama and Kazuki Maruta and Takuya Tsutsumi and Kaoru Sezaki},
doi = {10.1109/ACCESS.2017.2783050},
issn = {2169-3536},
year = {2017},
date = {2017-12-13},
journal = {IEEE Access},
volume = {6},
pages = {2410--2424},
abstract = {It is a significant challenge for telecommunication network operators to immediately restore communication services in the disaster area. To quickly recover telecommunication services in the affected area, this paper proposes a wired and wireless network cooperation system. When the wired communication for leaf nodes of optical tree networks is disrupted, surviving leaf nodes relay packets to and from these nodes via wireless bypass routes. The advantages of the proposed method are promptness and high-throughput, which is achieved with single-hop wireless bypass routes backhauled by wired networks. The optimal routes for wireless links are calculated to maximize the expected throughput by solving a binary integer programming problem. The proposed system is cost effective, because it can be deployed with minimum additional functions for leaf nodes of optical networks. To overcome the limitation of the proposed approach that the distribution of leaf nodes is determined by the demand distribution, additional recovery nodes can be deployed to improve the expected throughput. The numerical simulations including a medium access control level simulation conducting carrier sense multiple access with collision avoidance behavior showed that the proposed method can achieve a higher throughput than an existing bypass routing method, irrespective of the topology of the wired networks.},
keywords = {Communication networks, communication system traffic control, routing, system recovery, wireless application protocol},
pubstate = {published},
tppubtype = {article}
}