International Journal of Space-Based and Situated Computing最新文献_第5页

Location-based applications, services and technologies in aid of flight planning and GPS-based navigation for visual flight rules in developing countries: with a case study 基于位置的应用程序、服务和技术，帮助飞行计划和基于gps的视觉飞行规则导航在发展中国家:一个案例研究

International Journal of Space-Based and Situated Computing Pub Date : 2018-01-01 DOI: 10.1504/IJSSC.2018.098695

E. Rogova, A. Maraj, Blerat Ukaj

引用次数: 0

An implementation and evaluation of IoT application development method based on real object-oriented model 一种基于真实面向对象模型的物联网应用开发方法实现与评价

International Journal of Space-Based and Situated Computing Pub Date : 2018-01-01 DOI: 10.1504/IJSSC.2018.097291

Hiroyuki Suzuki, A. Koyama

引用次数: 4

On the target channel sequence selection for multiple handoffs in cognitive radio-based wireless regional area networks 基于认知无线电的无线局域网中多切换目标信道序列选择研究

International Journal of Space-Based and Situated Computing Pub Date : 2018-01-01 DOI: 10.1504/IJSSC.2018.098691

Nitin Gupta, S. K. Dhurandher, I. Woungang, J. Rodrigues

{"title":"On the target channel sequence selection for multiple handoffs in cognitive radio-based wireless regional area networks","authors":"Nitin Gupta, S. K. Dhurandher, I. Woungang, J. Rodrigues","doi":"10.1504/IJSSC.2018.098691","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.098691","url":null,"abstract":"In cognitive radio networks, handoff occurs when an unlicensed spectrum user has to switch to a new target channel from its current operating channel which a secondary user was using opportunistically. This situation raises whenever either the licensed primary user appears again or the channel's condition get worst. Substantial sensing time can be saved if a secondary user can make a proactive decision about selecting the future vacant target channel to resume the unfinished transmission before starting its transmission. This paper proposes a novel target channel sequence selection scheme for cognitive radio networks, which minimises the estimated service time of a secondary user by reducing the multiple handoffs. A non-iterative algorithm is implemented, which does not require the use of an exhaustive search technique as usual to determine the target channel sequence. Simulation results show that the proposed scheme outperforms both the random scheme and a considered benchmark scheme in terms of service time, cumulative handoff delay and throughput achieved by the secondary user.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73659280","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

Distance measurement correction based on feedback filter for RSSI localisation technique in WSNs 基于反馈滤波器的wsn RSSI定位测距校正

International Journal of Space-Based and Situated Computing Pub Date : 2018-01-01 DOI: 10.1504/IJSSC.2018.097293

Dhouha El Houssaini, Zinab Mohamed, Sabrine Khriji, K. Besbes, O. Kanoun

引用次数: 4

A throughput estimation model under two-link concurrent communications with partially overlapping channels and its application to channel assignment in IEEE 802.11n WLAN 信道部分重叠的双链路并发通信吞吐量估计模型及其在IEEE 802.11n无线局域网信道分配中的应用

International Journal of Space-Based and Situated Computing Pub Date : 2018-01-01 DOI: 10.1504/IJSSC.2018.097286

Kwenga Ismael Munene, N. Funabiki, M. Kuribayashi, R. Sudibyo, W. Kao

{"title":"A throughput estimation model under two-link concurrent communications with partially overlapping channels and its application to channel assignment in IEEE 802.11n WLAN","authors":"Kwenga Ismael Munene, N. Funabiki, M. Kuribayashi, R. Sudibyo, W. Kao","doi":"10.1504/IJSSC.2018.097286","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.097286","url":null,"abstract":"Currently, the IEEE 802.11n wireless local-area network (WLAN) has been deployed world-wide due to flexibility and low costs. A key challenge in the WLAN deployment is to provide high data-rate under strong interferences due to the limited frequency channels. In WLAN, the adjacent channels are partially overlapped with each other, called partially overlapping channels (POCs). Then, the optimal POC assignment to the access-points (APs) in WLAN using the mathematical model is important to improve the performance, particularly for usage of the channel bonding. In this paper, we propose the throughput estimation model extension for concurrent communications of two IEEE 802.11n links under interferences using POCs and the channel bonding, from extensive measurement results under a variety of conditions. Then, based on this model, we present the channel assignment extension in the active AP configuration algorithm for the elastic WLAN system, which dynamically optimises the topology depending on network conditions. For the evaluation, we verify the model accuracy through comparing estimated throughputs with measured ones under various conditions. On top of that, we confirm throughput improvements by adopting POCs from using merely orthogonal channels (OCs) in simulations and experiments in several topologies.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90055510","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}

引用次数: 5

Design and evaluation of a utility tool for recorded class B AIS data in an unstable maritime environment 在不稳定的海上环境中记录B类AIS数据的实用工具的设计和评估

International Journal of Space-Based and Situated Computing Pub Date : 2018-01-01 DOI: 10.1504/IJSSC.2018.098675

Misako Urakami, Hisaya Motogi, Tomohiro Sunada, Kenshiro Okamura, Takayuki Watanabe, N. Wakabayashi

引用次数: 0

A design-aware test code approach for code writing problem in Java programming learning assistant system 针对Java编程学习辅助系统中代码编写问题的设计感知测试代码方法

International Journal of Space-Based and Situated Computing Pub Date : 2017-12-29 DOI: 10.1504/IJSSC.2017.10010062

Khin Khin Zaw, N. Funabiki

引用次数: 3

Leader election and computation of a spanning tree in dynamic distributed networks using local computations and mobile agents 基于本地计算和移动代理的动态分布式网络中生成树的领导者选举和计算

International Journal of Space-Based and Situated Computing Pub Date : 2017-10-03 DOI: 10.1504/IJSSC.2017.10008018

Mouna Ktari, M. Mosbah, A. Kacem

{"title":"Leader election and computation of a spanning tree in dynamic distributed networks using local computations and mobile agents","authors":"Mouna Ktari, M. Mosbah, A. Kacem","doi":"10.1504/IJSSC.2017.10008018","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10008018","url":null,"abstract":"Leader election problem is among the important problems in distributed computing. The continued evolution of distributed systems keeps the distributed computing an open area of research. Distributed algorithms are hard to design and much harder to prove. To make designing distributed algorithm easier, we model this latter with a local computations model. Distributed algorithms are formally presented by rewriting rules. Beyond a formal presentation of these algorithms, local computations theory proposes not only a correctness proof by the use of invariants but also a termination proof by the use of the graph mathematical tool-box. Based on both, the local computations model and the mobile agent paradigms, we present in this paper a distributed algorithm that elects a leader and computes a spanning tree in a dynamic graph. Computations in dynamic graphs can be affected by a set of topological events: we address the appearance and the disappearance of places and communication channels. Our goal is to always maintain a tree by a single leader or a forest of sub-trees where each one has its own leader.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84398469","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}

引用次数: 5

Classification extension based on IoT-big data analytic for smart environment monitoring and analytic in real-time system 基于物联网大数据分析的分类扩展，用于智能环境监测与实时系统分析

International Journal of Space-Based and Situated Computing Pub Date : 2017-10-03 DOI: 10.1504/IJSSC.2017.10008038

Riyadh Arridha, S. Sukaridhoto, D. Pramadihanto, N. Funabiki

引用次数: 70

Efficient listen before technique for LTE-WiFi co-existence in unlicensed bands 高效听前技术，LTE-WiFi共存无授权频段

International Journal of Space-Based and Situated Computing Pub Date : 2017-10-03 DOI: 10.1504/IJSSC.2017.10008041

Visali Mushunuri, B. Panigrahi, H. Rath, Anantha Simha

引用次数: 1