M. Mitsuishi, Daiki Nobayashi, T. Ikenaga, Y. Oie, H. Ishinishi, Akira Nagata, Katsuichi Nakamura
{"title":"On demand routing scheme for real-spatial information based group communication","authors":"M. Mitsuishi, Daiki Nobayashi, T. Ikenaga, Y. Oie, H. Ishinishi, Akira Nagata, Katsuichi Nakamura","doi":"10.1109/PACRIM.2015.7334860","DOIUrl":null,"url":null,"abstract":"Widespread high-performance mobile stations and wireless communication technologies make it possible to enjoy various network services anywhere at any time. In particular, social network services (SNSs) provide a wide variety of communication among users. We aim to achieve real-space communication that directly integrates information exchange and real-space activity in our daily lives. Therefore, we develop three subsystems: (i) gathering personal and location information of users, (ii) managing huge quantities of user information and creating a group of users on a request basis, and (iii) delivering a message for all users in a requested group. In this paper, we focus on the third subsystem, especially in a combinational configuration of wide-area wireless networks (WiMAX, LTE, and so on) and device-to-device (ad hoc) communication with WLANs. We assume that some users who should receive a message cannot use wide-area wireless networks due their inaccessible communication range or the occurrence of a disaster, and that supplemental device-to-device WLAN communication covers such users. Although multicast communication can provide effective message delivery to users in a group, the overhead increases with the increased number of messages multicast to many users and groups. We propose an on-demand routing scheme for group communication based on a real-spatial information system and evaluate the efficiency of the proposed scheme by a simulation.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2015.7334860","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Widespread high-performance mobile stations and wireless communication technologies make it possible to enjoy various network services anywhere at any time. In particular, social network services (SNSs) provide a wide variety of communication among users. We aim to achieve real-space communication that directly integrates information exchange and real-space activity in our daily lives. Therefore, we develop three subsystems: (i) gathering personal and location information of users, (ii) managing huge quantities of user information and creating a group of users on a request basis, and (iii) delivering a message for all users in a requested group. In this paper, we focus on the third subsystem, especially in a combinational configuration of wide-area wireless networks (WiMAX, LTE, and so on) and device-to-device (ad hoc) communication with WLANs. We assume that some users who should receive a message cannot use wide-area wireless networks due their inaccessible communication range or the occurrence of a disaster, and that supplemental device-to-device WLAN communication covers such users. Although multicast communication can provide effective message delivery to users in a group, the overhead increases with the increased number of messages multicast to many users and groups. We propose an on-demand routing scheme for group communication based on a real-spatial information system and evaluate the efficiency of the proposed scheme by a simulation.