Pub Date : 2016-01-01DOI: 10.1504/IJSSC.2016.082760
S. Shoji, A. Koyama
A large number of isomorphic polygons are included in design data of LSI. Fast search and classification for isomorphic polygons are expected for compactness and fast pattern search of design data. In this paper, we propose a high speed and high accuracy classification method of isomorphic polygons. The proposed method can reduce a shape comparison process significantly by using a geometric invariant feature value for a polygon. The feature value is calculated by summation of distance from centre of gravity to each vertex, and a polygon contour length. This value does not be affected by parallel shift, rotation and reduced scale. The feature value is same among isomorphic polygons and it is possible to access an isomorphic polygon group quickly by using this value. From evaluation results, we verified that the proposed method can realise fast classification for isomorphic polygons, and compactness of design data.
{"title":"A fast search and classification method of isomorphic polygons in LSI design data using geometric invariant feature value","authors":"S. Shoji, A. Koyama","doi":"10.1504/IJSSC.2016.082760","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.082760","url":null,"abstract":"A large number of isomorphic polygons are included in design data of LSI. Fast search and classification for isomorphic polygons are expected for compactness and fast pattern search of design data. In this paper, we propose a high speed and high accuracy classification method of isomorphic polygons. The proposed method can reduce a shape comparison process significantly by using a geometric invariant feature value for a polygon. The feature value is calculated by summation of distance from centre of gravity to each vertex, and a polygon contour length. This value does not be affected by parallel shift, rotation and reduced scale. The feature value is same among isomorphic polygons and it is possible to access an isomorphic polygon group quickly by using this value. From evaluation results, we verified that the proposed method can realise fast classification for isomorphic polygons, and compactness of design data.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"2 1","pages":"199-208"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76894194","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 : 2016-01-01DOI: 10.1504/IJSSC.2016.082770
Po-Yu Chen, Li-Pei Peng, Herng-Dar Bih, Cheng-Fu Chou
Online social networks are an increasingly popular means of making new friends or maintaining existing friendships. These social networks have replaced some traditional spaces in the real world, but few studies have examined what these new spaces look like in terms of virtual geographies. Facebook is the world's largest online social network, with billions of users sharing content and messages every day. This huge amount of traffic attracts researchers' interest in the behaviour of Facebook users. Facebook can also adjust their policies based on the user behaviour. While previous studies of Facebook user behaviour have relied on questionnaires which are subject to potential risks and limitations. This study directly analyses Facebook user behaviour by designing a model to predict how various types of users analogise their use of Facebook to everyday spaces.
{"title":"A metaphorical house of Facebook: usage based on space syntax","authors":"Po-Yu Chen, Li-Pei Peng, Herng-Dar Bih, Cheng-Fu Chou","doi":"10.1504/IJSSC.2016.082770","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.082770","url":null,"abstract":"Online social networks are an increasingly popular means of making new friends or maintaining existing friendships. These social networks have replaced some traditional spaces in the real world, but few studies have examined what these new spaces look like in terms of virtual geographies. Facebook is the world's largest online social network, with billions of users sharing content and messages every day. This huge amount of traffic attracts researchers' interest in the behaviour of Facebook users. Facebook can also adjust their policies based on the user behaviour. While previous studies of Facebook user behaviour have relied on questionnaires which are subject to potential risks and limitations. This study directly analyses Facebook user behaviour by designing a model to predict how various types of users analogise their use of Facebook to everyday spaces.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"124 1","pages":"252-261"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86434834","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}
With the popularisation of mobile devices such as smart phones, many device communicate over wireless local area networks (WLANs). The IEEE 802.11e standard is an important extension of the IEEE 802.11 standard focusing on QoS that works with any PHY implementation. The IEEE 802.11e standard introduces EDCA and HCCA. Both these schemes are useful for QoS provisioning to support delay-sensitive voice and video applications. The EDCA uses the contention window to differentiate between high priority and low priority services. However, it does not consider the priority of users. In this paper, in order to deal with this problem, we propose and implement a fuzzy-based admission control system (FACS). We carried out many simulations to evaluate the performance of the proposed system. The simulation results show that our proposed system has a good performance.
{"title":"Performance evaluation of a QoS-aware fuzzy-based CAC for LAN access","authors":"Takaaki Inaba, Ryoichiro Obukata, Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli","doi":"10.1504/IJSSC.2016.082768","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.082768","url":null,"abstract":"With the popularisation of mobile devices such as smart phones, many device communicate over wireless local area networks (WLANs). The IEEE 802.11e standard is an important extension of the IEEE 802.11 standard focusing on QoS that works with any PHY implementation. The IEEE 802.11e standard introduces EDCA and HCCA. Both these schemes are useful for QoS provisioning to support delay-sensitive voice and video applications. The EDCA uses the contention window to differentiate between high priority and low priority services. However, it does not consider the priority of users. In this paper, in order to deal with this problem, we propose and implement a fuzzy-based admission control system (FACS). We carried out many simulations to evaluate the performance of the proposed system. The simulation results show that our proposed system has a good performance.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"92 1","pages":"228-238"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79505413","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 : 2015-12-17DOI: 10.1504/IJSSC.2015.073696
Wafa Ben Jaballah, M. Mosbah, H. Youssef, A. Zemmari
Providing source authentication service in wireless sensor networks (WSNs) is still a potential stumbling block to the wide deployment of these resource constrained devices. In this paper, we present several broadcast authentication solutions that have been developed for secure group communications in WSNs, and we come up with two novel symmetric-key-based authentication schemes. Our protocols are built upon the integration of a reputation generator on each node, a key binary tree for the efficient distribution and updating of the authentication group keys. Moreover, we refer to a Bloom filter data structure to reduce the communication overhead. We assess the feasibility of our two proposed schemes with a thorough mathematical study, estimating the average number of concatenated message authentication code, the energy consumption overhead, and the probability of detection of two state-of-the-art attacks.
{"title":"Lightweight secure group communications for resource constrained devices","authors":"Wafa Ben Jaballah, M. Mosbah, H. Youssef, A. Zemmari","doi":"10.1504/IJSSC.2015.073696","DOIUrl":"https://doi.org/10.1504/IJSSC.2015.073696","url":null,"abstract":"Providing source authentication service in wireless sensor networks (WSNs) is still a potential stumbling block to the wide deployment of these resource constrained devices. In this paper, we present several broadcast authentication solutions that have been developed for secure group communications in WSNs, and we come up with two novel symmetric-key-based authentication schemes. Our protocols are built upon the integration of a reputation generator on each node, a key binary tree for the efficient distribution and updating of the authentication group keys. Moreover, we refer to a Bloom filter data structure to reduce the communication overhead. We assess the feasibility of our two proposed schemes with a thorough mathematical study, estimating the average number of concatenated message authentication code, the energy consumption overhead, and the probability of detection of two state-of-the-art attacks.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"130 1","pages":"187-200"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74694649","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 : 2015-12-17DOI: 10.1504/IJSSC.2015.073719
K. Fujisaki, M. Tateiba
Satellite communication is playing an important role in the communication infrastructure supporting multi-media services. Nowadays, satellite communication networks using very small aperture terminals (VSAT) are useful communication infrastructures supporting various application demands. To make more reliable communication link by using VSAT, it is important to accumulate certain knowledge concerned with transmission characteristics via satellite communication channels through experimental research. In this paper, we collect the measured data on bit errors due to airplanes by using four VSAT satellite communication systems, and present effective countermeasures against airplane effects on satellite channels when airplanes fly over a town at a low altitude of less than 1,000 m and cross an antenna beam.
{"title":"Investigation of airplanes effects on VSAT satellite communication systems","authors":"K. Fujisaki, M. Tateiba","doi":"10.1504/IJSSC.2015.073719","DOIUrl":"https://doi.org/10.1504/IJSSC.2015.073719","url":null,"abstract":"Satellite communication is playing an important role in the communication infrastructure supporting multi-media services. Nowadays, satellite communication networks using very small aperture terminals (VSAT) are useful communication infrastructures supporting various application demands. To make more reliable communication link by using VSAT, it is important to accumulate certain knowledge concerned with transmission characteristics via satellite communication channels through experimental research. In this paper, we collect the measured data on bit errors due to airplanes by using four VSAT satellite communication systems, and present effective countermeasures against airplane effects on satellite channels when airplanes fly over a town at a low altitude of less than 1,000 m and cross an antenna beam.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"1 1","pages":"222-229"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79222003","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 : 2015-12-17DOI: 10.1504/IJSSC.2015.073700
T. Tokuyasu, Wakou Okamura, T. Kusano, M. Inomata, N. Shiraishi, S. Kitanou
Presently, the number of cases of endoscopic surgery which can reduce both physical and mental burdens of a patient has been increasing. Although a variety of training environments has been prepared, more effective training methods have been expected from the doctors who are engaging in medical education. This study is focused on an approach for teaching calligraphy, where a teacher grasps both an ink brush and the student's hand and moves them to an appropriate direction with befitting force. In order to streamline the training efficiency of endoscopic surgery, we propose a function of haptic guidance for the operation of endoscopic forceps. We develop the experimental devices which dynamically control the movement of endoscopic forceps in order to realise the haptic guide function. This paper introduces the system structure and its software, and we discuss about the training effects through the experimental results.
{"title":"Training system for endoscopic surgery with haptic guide function and augmented reality","authors":"T. Tokuyasu, Wakou Okamura, T. Kusano, M. Inomata, N. Shiraishi, S. Kitanou","doi":"10.1504/IJSSC.2015.073700","DOIUrl":"https://doi.org/10.1504/IJSSC.2015.073700","url":null,"abstract":"Presently, the number of cases of endoscopic surgery which can reduce both physical and mental burdens of a patient has been increasing. Although a variety of training environments has been prepared, more effective training methods have been expected from the doctors who are engaging in medical education. This study is focused on an approach for teaching calligraphy, where a teacher grasps both an ink brush and the student's hand and moves them to an appropriate direction with befitting force. In order to streamline the training efficiency of endoscopic surgery, we propose a function of haptic guidance for the operation of endoscopic forceps. We develop the experimental devices which dynamically control the movement of endoscopic forceps in order to realise the haptic guide function. This paper introduces the system structure and its software, and we discuss about the training effects through the experimental results.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"979 1","pages":"201-208"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77103384","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 : 2015-12-17DOI: 10.1504/IJSSC.2015.073737
Jiaqing Lin, Hiroaki Nishino
Rapid progresses of 3D depth sensing and 3D printing technologies make digital fabrication an affordable technology for general public on daily life. Both experienced and novice users, who want to design and create new 3D geometric models, can readily acquire 3D object data by capturing their surrounding environments with consumer depth sensors, and produce physical prototypes by using desktop 3D printers. Although 3D modelling is a key technology to bridge a gap between the 3D acquisition with the depth sensors and the 3D printing, there is technically a deep valley preventing the novices from readily practicing the digital fabrication. We designed and developed a system enabling novices to edit the acquired 3D models with a set of simple operations for producing original 3D models. The system supports them to perform all phases, acquiring, modelling, and printing 3D models, through an integrated graphical user interface (GUI). We describe basic principle, architecture, implementation method, and some experiments conducted for verifying the effectiveness of the proposed system.
{"title":"A construction-from-parts-type 3D modeller for digital fabrication","authors":"Jiaqing Lin, Hiroaki Nishino","doi":"10.1504/IJSSC.2015.073737","DOIUrl":"https://doi.org/10.1504/IJSSC.2015.073737","url":null,"abstract":"Rapid progresses of 3D depth sensing and 3D printing technologies make digital fabrication an affordable technology for general public on daily life. Both experienced and novice users, who want to design and create new 3D geometric models, can readily acquire 3D object data by capturing their surrounding environments with consumer depth sensors, and produce physical prototypes by using desktop 3D printers. Although 3D modelling is a key technology to bridge a gap between the 3D acquisition with the depth sensors and the 3D printing, there is technically a deep valley preventing the novices from readily practicing the digital fabrication. We designed and developed a system enabling novices to edit the acquired 3D models with a set of simple operations for producing original 3D models. The system supports them to perform all phases, acquiring, modelling, and printing 3D models, through an integrated graphical user interface (GUI). We describe basic principle, architecture, implementation method, and some experiments conducted for verifying the effectiveness of the proposed system.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"5 1","pages":"230-241"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91297103","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 : 2015-12-17DOI: 10.1504/IJSSC.2015.073718
Jiahong Wang, Eiichiro Kodama, T. Takata
In modern business world, very often two companies collaborate with each other for their mutual benefit in such a way that, the one starts a transaction and processes a part of it, then the other processes the remainder. Similarly, in cloud computing, as a means to avoid leakage of secret information, a company may use two independent cloud management domains to store separate partitions of its database. For many users in such application environment, it would be beneficial and important to discover the relations between frequent patterns mined at respective site, and share the frequent pattern relation identifiers. The frequent pattern relation mining should be conducted without disclosing any other private data to each other site. This paper identifies a new data mining problem called pattern relation mining, introduces a new computing model called IF-THEN computing to capture the problem, and proposes a privacy-preserving pattern relation mining algorithm called CPRM. Extensive experiments were conducted to demonstrate the effectiveness of CPRM.
{"title":"Identifying relations between frequent patterns mined at two collaborative websites","authors":"Jiahong Wang, Eiichiro Kodama, T. Takata","doi":"10.1504/IJSSC.2015.073718","DOIUrl":"https://doi.org/10.1504/IJSSC.2015.073718","url":null,"abstract":"In modern business world, very often two companies collaborate with each other for their mutual benefit in such a way that, the one starts a transaction and processes a part of it, then the other processes the remainder. Similarly, in cloud computing, as a means to avoid leakage of secret information, a company may use two independent cloud management domains to store separate partitions of its database. For many users in such application environment, it would be beneficial and important to discover the relations between frequent patterns mined at respective site, and share the frequent pattern relation identifiers. The frequent pattern relation mining should be conducted without disclosing any other private data to each other site. This paper identifies a new data mining problem called pattern relation mining, introduces a new computing model called IF-THEN computing to capture the problem, and proposes a privacy-preserving pattern relation mining algorithm called CPRM. Extensive experiments were conducted to demonstrate the effectiveness of CPRM.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"1 1","pages":"209-221"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72922227","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 : 2015-08-04DOI: 10.1504/IJSSC.2015.070954
R. Hegarty, J. Haggerty
Cloud-based architectures have become the predominant paradigm for organisational infrastructure development due to the flexibility and scalability that these systems provide. However, issues around privacy and trust in such environments remain as has been demonstrated in recent attacks. There are two security challenges for cloud providers to resolve. First, they must ensure that only authorised downloads of potentially sensitive data can be made and they should have a means by which to detect any malicious activities. Second, any files that are uploaded to cloud providers must adhere to geographical legalities. Current security mechanisms employed in the cloud, such as firewalls and intrusion detection systems, find these issues problematic. This paper therefore presents a novel approach, XDet, for the extrusion detection of illegal files being maliciously uploaded to or downloaded from the cloud, which can be used in conjunction with other security countermeasures to ensure robust and secure cloud systems. This is achieved through the creation and detection of signatures from files of interest within the cloud network environment. The feasibility and performance study in this paper, whereby XDet has been applied to network traffic to detect files of interest, demonstrates the applicability of this approach.
{"title":"Extrusion detection of illegal files in cloud-based systems","authors":"R. Hegarty, J. Haggerty","doi":"10.1504/IJSSC.2015.070954","DOIUrl":"https://doi.org/10.1504/IJSSC.2015.070954","url":null,"abstract":"Cloud-based architectures have become the predominant paradigm for organisational infrastructure development due to the flexibility and scalability that these systems provide. However, issues around privacy and trust in such environments remain as has been demonstrated in recent attacks. There are two security challenges for cloud providers to resolve. First, they must ensure that only authorised downloads of potentially sensitive data can be made and they should have a means by which to detect any malicious activities. Second, any files that are uploaded to cloud providers must adhere to geographical legalities. Current security mechanisms employed in the cloud, such as firewalls and intrusion detection systems, find these issues problematic. This paper therefore presents a novel approach, XDet, for the extrusion detection of illegal files being maliciously uploaded to or downloaded from the cloud, which can be used in conjunction with other security countermeasures to ensure robust and secure cloud systems. This is achieved through the creation and detection of signatures from files of interest within the cloud network environment. The feasibility and performance study in this paper, whereby XDet has been applied to network traffic to detect files of interest, demonstrates the applicability of this approach.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"1 1","pages":"150-158"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85007849","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 : 2015-08-04DOI: 10.1504/IJSSC.2015.070946
Tetsuya Shigeyasu, Junko Nagamine
Recently, many MAC protocols have been proposed for effective communication in the single transceiver multi-channel environment. In these MAC protocols, however, the multi-channel hidden terminal problem degrades the throughput of the communication systems. In order to mitigate the effects of the multi-channel hidden terminals, two MAC protocols have been proposed: cooperative asynchronous multi-channel MAC (CAM-MAC), where neighbouring terminals inform a sender of its bad channel selection and virtual topology MAC (VT-MAC), where redundant channel usage information is reduced by considering the network topology. However, these MAC protocols mainly focus on avoiding bad channel selections by the sender, and not on increasing good channel selections (concurrent transmissions). Therefore, in this paper, to further improve throughput performance by concurrent transmissions, we propose new multi-channel MAC protocols in which neighbour terminals of a sender recommend a better transmission channel prior to the data transmission. The performance evaluations verify that the proposed MAC protocol effectively improves the throughput performance when compared to existing MAC protocols, especially when the channel negotiation process induces the larger overhead at the short data transmission.
{"title":"DCR-MAC: a data channel recommending MAC for multi-channel WLANs toward the higher throughput performance","authors":"Tetsuya Shigeyasu, Junko Nagamine","doi":"10.1504/IJSSC.2015.070946","DOIUrl":"https://doi.org/10.1504/IJSSC.2015.070946","url":null,"abstract":"Recently, many MAC protocols have been proposed for effective communication in the single transceiver multi-channel environment. In these MAC protocols, however, the multi-channel hidden terminal problem degrades the throughput of the communication systems. In order to mitigate the effects of the multi-channel hidden terminals, two MAC protocols have been proposed: cooperative asynchronous multi-channel MAC (CAM-MAC), where neighbouring terminals inform a sender of its bad channel selection and virtual topology MAC (VT-MAC), where redundant channel usage information is reduced by considering the network topology. However, these MAC protocols mainly focus on avoiding bad channel selections by the sender, and not on increasing good channel selections (concurrent transmissions). Therefore, in this paper, to further improve throughput performance by concurrent transmissions, we propose new multi-channel MAC protocols in which neighbour terminals of a sender recommend a better transmission channel prior to the data transmission. The performance evaluations verify that the proposed MAC protocol effectively improves the throughput performance when compared to existing MAC protocols, especially when the channel negotiation process induces the larger overhead at the short data transmission.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"86 2 1","pages":"168-177"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90970387","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
扫码关注我们
求助内容：
应助结果提醒方式：