发布求助
文献互助 智能选刊 最新文献

International Journal of Space-Based and Situated Computing最新文献

筛选
英文 中文
Acceleration of the K-means algorithm by removing stable items 通过去除稳定项加速K-means算法
International Journal of Space-Based and Situated Computing Pub Date : 2017-10-03 DOI: 10.1504/IJSSC.2017.10008032
A. Mexicano, Ricardo Rodriguez Jorge, Pascual Noradino Montes Dorantes, Joaquín Pérez Ortega
{"title":"Acceleration of the K-means algorithm by removing stable items","authors":"A. Mexicano, Ricardo Rodriguez Jorge, Pascual Noradino Montes Dorantes, Joaquín Pérez Ortega","doi":"10.1504/IJSSC.2017.10008032","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10008032","url":null,"abstract":"This work presents an approach for enhancing the K-means algorithm in the classification phase. The approach consists in a heuristic, which at each time that an object remains in the same group, between the current and the previous iteration, it is identified as stable and it is removed from computations in the classification phase in the current and subsequent iterations. This approach helps to reduce the execution time of the standard version. It can be useful in big data applications. For evaluating computational results, both the standard and the proposal were implemented and executed using three synthetic and seven well-known real instances. After testing both versions, it was possible to validate that the proposed approach spends less time than the standard one. The best result was obtained for the transactions instance when it was grouped into 200 clusters, achieving a time reduction of 90.1% with a reduction in quality of 3.97%.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"75 1","pages":"72-81"},"PeriodicalIF":0.0,"publicationDate":"2017-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72699994","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}
引用次数: 1
Proactive vs. reactive multipath routing for mobility enabled RPL 支持移动性的RPL的主动与被动多路径路由
International Journal of Space-Based and Situated Computing Pub Date : 2017-10-03 DOI: 10.1504/IJSSC.2017.10008039
Fatma Somaa, I. Korbi, L. Saïdane
{"title":"Proactive vs. reactive multipath routing for mobility enabled RPL","authors":"Fatma Somaa, I. Korbi, L. Saïdane","doi":"10.1504/IJSSC.2017.10008039","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10008039","url":null,"abstract":"The IPv6 routing protocol for low power and lossy networks (RPL) was proposed as a routing standard for wireless sensor networks (WSNs). However, the RPL performance drastically degrade in the case of nodes' mobility. Therefore, we propose in this paper multipath routing schemes to adapt RPL to mobility scenarios. The first mobility-based braided multipath RPL (MBM-RPL) scheme establishes an alternative path braided with the primary one to replace the loose link (the up to fail link) along the first network route. The second proactive multipath mobility-based RPL (PMM-RPL) approach establishes all node disjoint routes between each node in the network and the sink. Data would not be duplicated on secondary paths until a primary path vulnerability detection. Both MBM-RPL and PMM-RPL performance are evaluated in terms of packet loss rate (PLR), average transmission delay (ADT) and the generated network overhead using the Cooja/Contiki simulation environment.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"148 1","pages":"94-107"},"PeriodicalIF":0.0,"publicationDate":"2017-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86204495","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}
引用次数: 0
Scalable and adaptive overlay for efficient forwarding in volunteer clouds 可扩展和自适应覆盖在志愿者云有效转发
International Journal of Space-Based and Situated Computing Pub Date : 2017-10-01 DOI: 10.1504/IJSSC.2017.10010831
F. Hrizi, A. Laouiti
{"title":"Scalable and adaptive overlay for efficient forwarding in volunteer clouds","authors":"F. Hrizi, A. Laouiti","doi":"10.1504/IJSSC.2017.10010831","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010831","url":null,"abstract":"Volunteer cloud is a new concept of cloud computing where volunteers, i.e., user machines are used instead of or in addition to dedicated resources. Although volunteer clouds offer potential benefits in terms of energy and cost saving as well as elasticity, the volatility and the scalability of the volunteer resources are still open challenges that need to be investigated. In this paper, we focus on managing the connectivity in a scalable and dynamic fashion in volunteer clouds. We show that volunteer clouds could be modelled by a hierarchical small-world structure, characterised by short average path lengths among nodes, and strong local clustering, which implies small latency between nodes and therefore robust forwarding. Furthermore, we explore the benefits of the use of the recursive internetwork architecture (RINA) as a networking solution. Finally, simulation results show that our proposal achieves a trade-off between bounding the routing table size and ensuring transmission efficiency.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"49 1","pages":"217-228"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91088097","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}
引用次数: 0
Implementation and experimental evaluation of an omnidirectional wheelchair for sports and moving in rooms with narrow spaces 窄空间运动及移动全向轮椅的实现与实验评估
International Journal of Space-Based and Situated Computing Pub Date : 2017-05-15 DOI: 10.1504/IJSSC.2017.10004976
Keita Matsuo
{"title":"Implementation and experimental evaluation of an omnidirectional wheelchair for sports and moving in rooms with narrow spaces","authors":"Keita Matsuo","doi":"10.1504/IJSSC.2017.10004976","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10004976","url":null,"abstract":"The aged tendency of population and rapid growth in the number of disabled people caused by diseases or injuries require to build wheelchairs with good performance. Also, the wheelchair should provide the user with many benefits, such as maintaining mobility, continuing or broadening community and social activities, conserving strength and energy, and enhancing quality of life. The wheelchair body must be compact enough and should be able to make different movements in order to have many applications. In this paper, we present the implementation and experimental evaluation of an omnidirectional wheelchair for sports and moving in rooms with narrow spaces. The experimental evaluation shows that the implemented wheelchair has a good behaviour and can be used for real applications.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"39 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77696255","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}
引用次数: 3
Design and evaluation of an ambient intelligence testbed for improving quality of life 提高生活质量的环境智能试验台的设计与评价
International Journal of Space-Based and Situated Computing Pub Date : 2017-05-15 DOI: 10.1504/IJSSC.2017.10004982
Ryoichiro Obukata, Miralda Cuka, Donald Elmazi, Tetsuya Oda, Makoto Ikeda, L. Barolli
{"title":"Design and evaluation of an ambient intelligence testbed for improving quality of life","authors":"Ryoichiro Obukata, Miralda Cuka, Donald Elmazi, Tetsuya Oda, Makoto Ikeda, L. Barolli","doi":"10.1504/IJSSC.2017.10004982","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10004982","url":null,"abstract":"Ambient intelligence (AmI) deals with a new world of ubiquitous computing devices, where physical environments interact intelligently and unobtrusively with people. AmI environments can be diverse, such as homes, offices, meeting rooms, schools, hospitals, control centers, vehicles, tourist attractions, stores, sports facilities, and music devices. In this paper, we present the design and implementation of a testbed for AmI using Raspberry Pi mounted on Raspbian OS. We analyse the optimised link state routing (OLSR) and wired equivalent privacy (WEP) protocol in an indoor scenario, and mean shift clustering algorithm considering sensing data. For evaluation we considered throughput, delay and jitter metrics, and respiratory rate and heart rate metrics. The experimental and simulation results show that the nodes in the testbed were communicating smoothly and the mean shift clustering algorithm have a good performance.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"124 1","pages":"8-15"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76373482","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}
引用次数: 3
An energy-aware algorithm to migrate virtual machines in a server cluster 一种能量感知算法，用于迁移服务器集群中的虚拟机
International Journal of Space-Based and Situated Computing Pub Date : 2017-05-15 DOI: 10.1504/IJSSC.2017.10004986
Dilawaer Duolikun, T. Enokido, M. Takizawa
{"title":"An energy-aware algorithm to migrate virtual machines in a server cluster","authors":"Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1504/IJSSC.2017.10004986","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10004986","url":null,"abstract":"In order to realise eco-society, we have to reduce the electric energy consumed by servers in a cluster in addition to satisfying performance requirements. Virtual machines are now widely used to support applications with virtual computation service in clusters of servers. Here, a virtual machine on a host server can migrate to a guest server while processes are being performed on the virtual machine. In this paper, we propose an energy-aware migration of virtual machines (EAMV) algorithm where not only a virtual machine is selected to perform a process issued by a client but also a virtual machine migrates to a guest server which is expected to consume smaller electric energy to perform processes on the virtual machine. In the evaluation, we show the total electric energy consumption of servers and the average execution time of processes can be reduced in the EAMV algorithm compared with non-migration algorithms.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"34 1","pages":"32-42"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81718476","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}
引用次数: 20
Using trust to detect denial of service attacks in the internet of things over MANETs 基于信任的物联网manet拒绝服务攻击检测
International Journal of Space-Based and Situated Computing Pub Date : 2017-05-15 DOI: 10.1504/IJSSC.2017.10004987
Albandari Alsumayt, J. Haggerty, Ahmad Lotfi
{"title":"Using trust to detect denial of service attacks in the internet of things over MANETs","authors":"Albandari Alsumayt, J. Haggerty, Ahmad Lotfi","doi":"10.1504/IJSSC.2017.10004987","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10004987","url":null,"abstract":"The rapid growth of employing devices as tools in daily life and the technological revolution have led to the invention of a novel paradigm; the Internet of Things (IoT). It includes a group of ubiquitous devices that communicate and share data with each other. These devices use the Internet Protocol (IP) to manage network nodes through mobile ad hoc networks (MANET). IoT is beneficial to MANET as the nodes are self-organising and the information reach can be expanded according to the network range. Due to the nature of MANET, such as dynamic topology, a number of challenges are inherent, such as Denial of Service (DoS) attacks. DoS attacks prohibit legitimate users from accessing their authorised services. In addition, because of the high mobility of MANET, the network can merge with other networks. In this situation, two or more networks of untrusted nodes may join one another leaving each of the networks open to attack. This paper proposes a novel method to detect DoS attacks immediately prior to the merger of two MANETs. To demonstrate the applicability of the proposed approach, a Grayhole attack is used in this study to evaluate the performance of the proposed method in detecting attacks.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"31 1","pages":"43-56"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85081928","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}
引用次数: 8
Adaptive security provisioning for vehicular safety applications 车辆安全应用的自适应安全配置
International Journal of Space-Based and Situated Computing Pub Date : 2017-05-15 DOI: 10.1504/IJSSC.2017.10004983
Elyes Ben Hamida, M. Javed, Wassim Znaidi
{"title":"Adaptive security provisioning for vehicular safety applications","authors":"Elyes Ben Hamida, M. Javed, Wassim Znaidi","doi":"10.1504/IJSSC.2017.10004983","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10004983","url":null,"abstract":"Vehicular ad hoc network provides safety applications for next generation intelligent transport systems. By periodically transmitting mobility information in basic safety messages (BSMs), vehicles get an overview of the neighbourhood. As applications involving vehicular networks impact human safety, reliability of BSMs is a key requirement, which however is a challenging task in heavy traffic scenarios where many BSMs are queued up simultaneously for signature verification. This results in long verification delays for many critical BSMs from nearby vehicles. To overcome this challenge, we propose two adaptive security mechanisms in this paper that can be used by the ITS applications to enhance their QoS and maintain good level of security. The first technique is a receiver-oriented technique that uses channel aware mechanism to prioritise the signature verification of BSMs from closer neighbours. The second technique is transmitter based that can adaptively select the best security level for BSMs according to cryptographic loss rate. Simulation results verify the performance enhancement achieved by the proposed framework in terms of several safety awareness metrics as compared with the existing schemes.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"103 1","pages":"16-31"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79470445","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}
引用次数: 15
An intelligent approach for qualified voting in P2P mobile collaborative team: a comparison study for two fuzzy-based systems 一种P2P移动协同团队中合格投票的智能方法——基于两种模糊系统的比较研究
International Journal of Space-Based and Situated Computing Pub Date : 2017-01-01 DOI: 10.1504/IJSSC.2017.10010830
Yi Liu, Kosuke Ozera, Keita Matsuo, L. Barolli
{"title":"An intelligent approach for qualified voting in P2P mobile collaborative team: a comparison study for two fuzzy-based systems","authors":"Yi Liu, Kosuke Ozera, Keita Matsuo, L. Barolli","doi":"10.1504/IJSSC.2017.10010830","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010830","url":null,"abstract":"Mobile computing has many application domains. One important domain is that of mobile applications supporting collaborative work. In a collaborative work, the members of the team have to take decision or solve conflicts in project development and therefore members have to vote. In this work, we present a voting model, that we call qualified voting, in which every member has a voting score according to four parameters: number of activities that member participates (NAMP), number of activities that member successfully finished (NAMSF), number of online discussions that member participated (NODMP), number of activities the member fails (NAMF). Then, we use fuzzy approach to compute a voting score for the member. We present two fuzzy based voting systems (called FPVS1 and FPVS2). The simulation results show that when NAMP, NAMSF and NODMP are high, the voting score is high, but with increasing of the NAMF, the VS is decreased. Comparing the complexity of FPVS1 and FPVS2, the FPVS2 is more complex than FPVS1, but FPVS2 can select better peers for the collaborative work.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"128 1","pages":"207-216"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76553831","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}
引用次数: 7
Implementation and comparison of two intelligent systems based on fuzzy logic for actor selection in WSANs: effect of node density on actor selection 基于模糊逻辑的WSANs行为者选择智能系统的实现与比较:节点密度对行为者选择的影响
International Journal of Space-Based and Situated Computing Pub Date : 2017-01-01 DOI: 10.1504/IJSSC.2017.10010832
Donald Elmazi, Miralda Cuka, Elis Kulla, Tetsuya Oda, Makoto Ikeda, L. Barolli
{"title":"Implementation and comparison of two intelligent systems based on fuzzy logic for actor selection in WSANs: effect of node density on actor selection","authors":"Donald Elmazi, Miralda Cuka, Elis Kulla, Tetsuya Oda, Makoto Ikeda, L. Barolli","doi":"10.1504/IJSSC.2017.10010832","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010832","url":null,"abstract":"Wireless sensor and actor network (WSAN) is formed by the collaboration of micro-sensor and actor nodes. Whenever there is any special event, i.e., fire, earthquake, flood or enemy attack in the network, sensor nodes are responsible to sense it and send information towards an actor node. The actor node is responsible to take prompt decision and react accordingly. In this work, we propose and implement two fuzzy based actor selection systems (FBASS): FBASS1 and FBASS2 for actor selection in WSANs. The systems decide whether the actor will be selected for the required job or not based on data supplied by sensors and actual actor condition. We evaluated the proposed system by computer simulations. Comparing FBASS1 with FBASS2, the FBASS2 is more complex than FBASS1, because it has more rules in fuzzy rule base (FRB). By increasing node density, the FBASS2 can save better the energy.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"1 1","pages":"229-238"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89549874","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信