Pub Date : 2018-04-18DOI: 10.1504/IJSSC.2018.10012309
S. Tajima, N. Funabiki, T. Higashino
Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers (PCs), and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs with different types into the network field, depending on the host type distribution, has become another important task to design high-performance WLANs. In this paper, we first define this holding access-point assignment problem as a combinatorial optimisation problem and propose its two-phase heuristic algorithm. Then, since plural partially overlapping channels are available in IEEE802.11 WLANs, we present the channel assignment extension to the APs such that the communication time of the APs is minimised, and the model to estimate the communication time increase by interferences. The effectiveness of our proposal is verified through simulations in six instances using the WIMNET simulator.
{"title":"A holding access-point assignment algorithm for IEEE802.11 wireless local-area networks","authors":"S. Tajima, N. Funabiki, T. Higashino","doi":"10.1504/IJSSC.2018.10012309","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10012309","url":null,"abstract":"Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers (PCs), and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs with different types into the network field, depending on the host type distribution, has become another important task to design high-performance WLANs. In this paper, we first define this holding access-point assignment problem as a combinatorial optimisation problem and propose its two-phase heuristic algorithm. Then, since plural partially overlapping channels are available in IEEE802.11 WLANs, we present the channel assignment extension to the APs such that the communication time of the APs is minimised, and the model to estimate the communication time increase by interferences. The effectiveness of our proposal is verified through simulations in six instances using the WIMNET simulator.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"48 1","pages":"50-58"},"PeriodicalIF":0.0,"publicationDate":"2018-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78998648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-04-18DOI: 10.1504/IJSSC.2018.10012308
Kazuaki Togawa, K. Hashimoto
In recent years, network traffic has been increasing and when large events or natural disasters occur more network resources are requested at end points of network. Also, with the spread of smart devices can communicate with high-speed such as LTE, anyone are becoming to be able to communicate with high-speed. In order to efficiently handle traffic that locally and temporarily increases, it is effective to utilise smart devices owned by users. However, because there is a limit to the amount of the traffic that a smart device can handle, it is necessary to cooperate smart devices, nevertheless a system that cooperates smart devices and aggregates network resources has not been established. In this paper, we proposed a dynamic resource adaptation method that aggregates the network resources of smart devices and increases the available bandwidth. In evaluation experiments, a relationship between the amount of smart devices and network throughput was evaluated.
{"title":"Cooperative and priority based on dynamic resource adaptation method in wireless network","authors":"Kazuaki Togawa, K. Hashimoto","doi":"10.1504/IJSSC.2018.10012308","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10012308","url":null,"abstract":"In recent years, network traffic has been increasing and when large events or natural disasters occur more network resources are requested at end points of network. Also, with the spread of smart devices can communicate with high-speed such as LTE, anyone are becoming to be able to communicate with high-speed. In order to efficiently handle traffic that locally and temporarily increases, it is effective to utilise smart devices owned by users. However, because there is a limit to the amount of the traffic that a smart device can handle, it is necessary to cooperate smart devices, nevertheless a system that cooperates smart devices and aggregates network resources has not been established. In this paper, we proposed a dynamic resource adaptation method that aggregates the network resources of smart devices and increases the available bandwidth. In evaluation experiments, a relationship between the amount of smart devices and network throughput was evaluated.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"39 1","pages":"40-49"},"PeriodicalIF":0.0,"publicationDate":"2018-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77989294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-04-18DOI: 10.1504/IJSSC.2018.10012303
B. B. Bista, Jiahong Wang, T. Takata
Recently, device-to-device (D2D) communications have been proposed for efficient utilisation of resources of cellular networks by offloading some traffic of base station (BS) to direct links between user equipments (UEs), i.e., cellular users. While there are many works on optimisation of resources sharing in D2D communications in cellular networks, a little works has been done to promote D2D communications and attract users to adopt and take part in it. In this paper, in order to encourage users to adopt D2D communications, we present users achievable data rate both in D2D link and cellular link when they ask base station (BS) for contents. If the data rate in D2D link is less than cellular link, users will ask for reward for taking part in D2D communications. We also present how much reward will be awarded for taking part in D2D communications. By simulation, we show the percentage of users asking for rewards and the amount of reward they ask for taking part in D2D communications under various scenarios. The simulation results show that all users do not ask reward and may wilfully take part in D2D communications without reward.
{"title":"Incentive mechanisms for promoting D2D communications in cellular networks","authors":"B. B. Bista, Jiahong Wang, T. Takata","doi":"10.1504/IJSSC.2018.10012303","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10012303","url":null,"abstract":"Recently, device-to-device (D2D) communications have been proposed for efficient utilisation of resources of cellular networks by offloading some traffic of base station (BS) to direct links between user equipments (UEs), i.e., cellular users. While there are many works on optimisation of resources sharing in D2D communications in cellular networks, a little works has been done to promote D2D communications and attract users to adopt and take part in it. In this paper, in order to encourage users to adopt D2D communications, we present users achievable data rate both in D2D link and cellular link when they ask base station (BS) for contents. If the data rate in D2D link is less than cellular link, users will ask for reward for taking part in D2D communications. We also present how much reward will be awarded for taking part in D2D communications. By simulation, we show the percentage of users asking for rewards and the amount of reward they ask for taking part in D2D communications under various scenarios. The simulation results show that all users do not ask reward and may wilfully take part in D2D communications without reward.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"61 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2018-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90923098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-04-18DOI: 10.1504/IJSSC.2018.10012306
Tetsuro Kuniyasu, Tetsuya Shigeyasu
Recently, the popularity of the internet of things technology has highlighted the importance of performance for gathering data over multi-hop wireless sensor nodes. Data obtained from the sensor nodes is used by individual as well as multiple users. Therefore, a data-centric communication strategy is ideal for efficient data gathering and delivery. This paper proposes the implementation of a new data-centric communication strategy based on the named data network (NDN) to wireless sensor network (WSN) for achieving efficient communication performance. We discuss the modification of the NDN, which is originally developed for a wired network, for achieving better communication performance even in wireless communication networks. Specifically, we discuss the methods for constructing the reverse path of the required contents and for selecting the adequate next hop relay node of the forwarding interest. We propose new methods considering the broadcast nature of the wireless channels. Using computer simulations, we confirm that our proposed methods reduce the redundant transmissions by selecting a proper route based on network conditions.
{"title":"Data-centric communication strategy for wireless sensor networks","authors":"Tetsuro Kuniyasu, Tetsuya Shigeyasu","doi":"10.1504/IJSSC.2018.10012306","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10012306","url":null,"abstract":"Recently, the popularity of the internet of things technology has highlighted the importance of performance for gathering data over multi-hop wireless sensor nodes. Data obtained from the sensor nodes is used by individual as well as multiple users. Therefore, a data-centric communication strategy is ideal for efficient data gathering and delivery. This paper proposes the implementation of a new data-centric communication strategy based on the named data network (NDN) to wireless sensor network (WSN) for achieving efficient communication performance. We discuss the modification of the NDN, which is originally developed for a wired network, for achieving better communication performance even in wireless communication networks. Specifically, we discuss the methods for constructing the reverse path of the required contents and for selecting the adequate next hop relay node of the forwarding interest. We propose new methods considering the broadcast nature of the wireless channels. Using computer simulations, we confirm that our proposed methods reduce the redundant transmissions by selecting a proper route based on network conditions.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"55 1","pages":"30-39"},"PeriodicalIF":0.0,"publicationDate":"2018-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91377597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-04-18DOI: 10.1504/IJSSC.2018.10012304
Miki Kuroki, Michitoshi Niibori, Tomoyuki Ishida, T. Yonekura
While the aging of social infrastructure in Japan is advancing, the number of technical experts responsible for infrastructure management has drastically decreased, which has become the major problem to solve social infrastructure aging problems. In order to build a social infrastructure management system with the collaboration from citizens, a 'citizens' participation with ICT technology' was constructed in this research to make it possible for citizens to report the malfunction of social infrastructure, including the situation, the position and the details to the administration of the government. Then a social experiment utilising this system was conducted in two different municipalities with the participation of citizens. Finally, the effectiveness of the system and the problems for dissemination were verified through a questionnaire survey.
{"title":"Implementation of information collecting tools using mobile terminals useful for efficient infrastructure maintenance","authors":"Miki Kuroki, Michitoshi Niibori, Tomoyuki Ishida, T. Yonekura","doi":"10.1504/IJSSC.2018.10012304","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10012304","url":null,"abstract":"While the aging of social infrastructure in Japan is advancing, the number of technical experts responsible for infrastructure management has drastically decreased, which has become the major problem to solve social infrastructure aging problems. In order to build a social infrastructure management system with the collaboration from citizens, a 'citizens' participation with ICT technology' was constructed in this research to make it possible for citizens to report the malfunction of social infrastructure, including the situation, the position and the details to the administration of the government. Then a social experiment utilising this system was conducted in two different municipalities with the participation of citizens. Finally, the effectiveness of the system and the problems for dissemination were verified through a questionnaire survey.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"60 1","pages":"9-19"},"PeriodicalIF":0.0,"publicationDate":"2018-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84655976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.1504/IJSSC.2018.097287
Dilawaer Duolikun, T. Enokido, M. Takizawa
In this paper, we newly propose a dynamic migration of a group of υ virtual machines [DMG(υ)] algorithm to reduce the total electric energy consumption of servers in a cluster. Here, virtual machines are dynamically resumed and suspended so that the number of processes on each virtual machine can be kept fewer. In addition, a group of υ (υ ≥ 1) virtual machines migrate from a host server to a guest server so that the total electric energy consumed by the servers can be reduced. In our previous studies, time to migrate each virtual machine is assumed to be zero. In reality, there is migration time every process is suspended on a virtual machine migrating even in the live manner. Hence, the more often a virtual machine migrates, the longer time it takes to perform processes on the virtual machine. We propose a model to estimate electric energy to be consumed by servers through considering the migration time of each virtual machine. By using the estimation model, we can decide on which virtual machines on a host server to which guest server so that the total electric energy consumption of the host and guest servers can be reduced. In the evaluation, we show the total electric energy consumption of servers can be reduced by the DMG(υ) algorithm compared with other algorithms.
{"title":"A dynamic model for energy-efficiently migrating a group of virtual machines from a host server to a guest server","authors":"Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1504/IJSSC.2018.097287","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.097287","url":null,"abstract":"In this paper, we newly propose a dynamic migration of a group of υ virtual machines [DMG(υ)] algorithm to reduce the total electric energy consumption of servers in a cluster. Here, virtual machines are dynamically resumed and suspended so that the number of processes on each virtual machine can be kept fewer. In addition, a group of υ (υ ≥ 1) virtual machines migrate from a host server to a guest server so that the total electric energy consumed by the servers can be reduced. In our previous studies, time to migrate each virtual machine is assumed to be zero. In reality, there is migration time every process is suspended on a virtual machine migrating even in the live manner. Hence, the more often a virtual machine migrates, the longer time it takes to perform processes on the virtual machine. We propose a model to estimate electric energy to be consumed by servers through considering the migration time of each virtual machine. By using the estimation model, we can decide on which virtual machines on a host server to which guest server so that the total electric energy consumption of the host and guest servers can be reduced. In the evaluation, we show the total electric energy consumption of servers can be reduced by the DMG(υ) algorithm compared with other algorithms.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"20 1","pages":"138-150"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91057561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.1504/IJSSC.2018.098667
Tetsuya Shigeyasu
Nowadays, internet has became most important infrastructure used by the population over the 38.8 billion. The internet is the inseparable from our daily life. The internet based on such location centric communication, however, may induces high risk of network congestion and network service down due to network traffic dominated by contents delivery and multimedia applications. Then, the concept of content centric network (CCN) or information centric network (ICN) has been attracting the attention to resolve the problems under the location based network architecture. This paper explains the overview of the overview of network architectures based on CCN concept in order to help researchers developing well suited next-generation CCN-based network architectures.
{"title":"Introduction to content centric network architectures replacing traditional location centric network","authors":"Tetsuya Shigeyasu","doi":"10.1504/IJSSC.2018.098667","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.098667","url":null,"abstract":"Nowadays, internet has became most important infrastructure used by the population over the 38.8 billion. The internet is the inseparable from our daily life. The internet based on such location centric communication, however, may induces high risk of network congestion and network service down due to network traffic dominated by contents delivery and multimedia applications. Then, the concept of content centric network (CCN) or information centric network (ICN) has been attracting the attention to resolve the problems under the location based network architecture. This paper explains the overview of the overview of network architectures based on CCN concept in order to help researchers developing well suited next-generation CCN-based network architectures.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"87 1","pages":"180-187"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85624157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.1504/IJSSC.2018.098678
M. Yamanaka, Daiki Hashimoto, Y. Sato, Kohei Shimada, Y. Matsuura
Due to heavy maritime traffic, wireless systems play an important role to maintain the traffic safety. In this paper, we try to analyse the radio propagation of wireless systems in maritime environments. Although, there are many wireless systems should be covered, we picked up a radar system focusing a line-of-sight radio propagation in this paper. In general, radar antennas are set in the highest location to get a line-of-sight view for a wide area. However, there are cases when high islands hamper the line-of-sight. In this case, the system is not able to see the area through the radio waves, which will cause serious problems for navigation safety. We will try to assess the area using a ray-tracing method. The procedure of using the geospatial information authority of Japan (GSI)'s topographical data is given, to assess the area where the radio waves are unable to reach, through simulation.
{"title":"Ray-tracing analysis of the radio propagation on the line-of-sight maritime wireless environments","authors":"M. Yamanaka, Daiki Hashimoto, Y. Sato, Kohei Shimada, Y. Matsuura","doi":"10.1504/IJSSC.2018.098678","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.098678","url":null,"abstract":"Due to heavy maritime traffic, wireless systems play an important role to maintain the traffic safety. In this paper, we try to analyse the radio propagation of wireless systems in maritime environments. Although, there are many wireless systems should be covered, we picked up a radar system focusing a line-of-sight radio propagation in this paper. In general, radar antennas are set in the highest location to get a line-of-sight view for a wide area. However, there are cases when high islands hamper the line-of-sight. In this case, the system is not able to see the area through the radio waves, which will cause serious problems for navigation safety. We will try to assess the area using a ray-tracing method. The procedure of using the geospatial information authority of Japan (GSI)'s topographical data is given, to assess the area where the radio waves are unable to reach, through simulation.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"1 1","pages":"196-203"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78743744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.1504/IJSSC.2018.098686
Kazunori Ueda, M. Iwata, K. Baba, S. Shimojo
In the IoT environment, network applications such as various content/resource sharing, remote sensing, and so on play an important role to realise flexible and efficient communication on the network. If requested content/resource is retrieved from a huge number of various IoT devices, the amount of content/resource management information increases tremendously and most of IoT devices might not have enough computing/networking resource to maintain such management information. Thus, it is indispensable to introduce scalable management scheme and powerful delegate server for the IoT environment. This paper proposes a peer-to-peer information management scheme using multi-overlay network. The peer-to-peer networking is one of the promising ways to achieve scalability of the network applications and the multi-overlay network plays a role to provide a logical network structure adaptive to requested content/resource distribution. The evaluation results of a prototype with content-based and distance-based overlay networks revealed that we can implement IoT-oriented network applications while keeping practical search efficiency as well as saving network resource.
{"title":"Multi-overlay information management for IoT-oriented P2P network applications","authors":"Kazunori Ueda, M. Iwata, K. Baba, S. Shimojo","doi":"10.1504/IJSSC.2018.098686","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.098686","url":null,"abstract":"In the IoT environment, network applications such as various content/resource sharing, remote sensing, and so on play an important role to realise flexible and efficient communication on the network. If requested content/resource is retrieved from a huge number of various IoT devices, the amount of content/resource management information increases tremendously and most of IoT devices might not have enough computing/networking resource to maintain such management information. Thus, it is indispensable to introduce scalable management scheme and powerful delegate server for the IoT environment. This paper proposes a peer-to-peer information management scheme using multi-overlay network. The peer-to-peer networking is one of the promising ways to achieve scalability of the network applications and the multi-overlay network plays a role to provide a logical network structure adaptive to requested content/resource distribution. The evaluation results of a prototype with content-based and distance-based overlay networks revealed that we can implement IoT-oriented network applications while keeping practical search efficiency as well as saving network resource.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"58 1","pages":"204-213"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81226989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.1504/IJSSC.2018.097294
Narjes Boulila, Mohamed Hadded, A. Laouiti, L. Saïdane
Several medium access control (MAC) protocols were proposed to provide high-performance for vehicular ad hoc network (VANET). For instance, the contention-free MAC allows several vehicles to share the same communication channel. However, contention-based MAC protocols do not require any predefined schedule where each node competes for channel access when it needs to transmit data without any guarantee of success transmission. Hence, a hybrid MAC protocol that adopts time division multiple access (TDMA) and carrier sense multiple access (CSMA/CA) is required to enhance the network performance. Nevertheless, hybrid MAC protocols cannot ensure services differentiation so that critical messages and non-security messages have the same priority. To overcome such limitation, this paper focuses on the design of a novel access method integrating TDMA and enhanced distributed channel access (EDCA) in unique architecture called QoS-aware centralised hybrid MAC protocol (QCH-MAC). To prove the efficiency of our proposal, the latter was implemented in ns-3.
{"title":"Hybrid centralised MAC protocol for reliable broadcast of safety messages in vehicular ad hoc network","authors":"Narjes Boulila, Mohamed Hadded, A. Laouiti, L. Saïdane","doi":"10.1504/IJSSC.2018.097294","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.097294","url":null,"abstract":"Several medium access control (MAC) protocols were proposed to provide high-performance for vehicular ad hoc network (VANET). For instance, the contention-free MAC allows several vehicles to share the same communication channel. However, contention-based MAC protocols do not require any predefined schedule where each node competes for channel access when it needs to transmit data without any guarantee of success transmission. Hence, a hybrid MAC protocol that adopts time division multiple access (TDMA) and carrier sense multiple access (CSMA/CA) is required to enhance the network performance. Nevertheless, hybrid MAC protocols cannot ensure services differentiation so that critical messages and non-security messages have the same priority. To overcome such limitation, this paper focuses on the design of a novel access method integrating TDMA and enhanced distributed channel access (EDCA) in unique architecture called QoS-aware centralised hybrid MAC protocol (QCH-MAC). To prove the efficiency of our proposal, the latter was implemented in ns-3.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"300 1","pages":"169-178"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79682719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：