Forthcoming articles

 


International Journal of Space-Based and Situated Computing

 

These articles have been peer-reviewed and accepted for publication in IJSSC, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

 

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

 

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

 

Articles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

 

Register for our alerting service, which notifies you by email when new issues of IJSSC are published online.

 

We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.

 

International Journal of Space-Based and Situated Computing (11 papers in press)

 

Regular Issues

 

  • Content Sharing Method Using Expected Acquisition Rate in Hybrid Peer-to-Peer Networks with Cloud Storages   Order a copy of this article
    by Masashi Tomimori, Shinji Sugawara 
    Abstract: Recently, various content sharing methods that are available on Peer-to-Peer (P2P) networks, have been actively researched; a P2P network generally consists of a number of peers and evenly connected to each other. In most of previous studies, shared content items are supposed to be kept only in the storages of the peers, and effective ways of content sharing under the environment where not only the storages of peers, but also ones of a cloud system are available have not sufficiently researched yet. In this paper, we propose an efficient content sharing method in which an appropriate content acquisition rate can be set preliminarily according to the payable storage cost, and actually the rate can be maintained by keeping sufficient number of content replicas under the environment where storages of both peers and a cloud system are available.
    Keywords: Hybrid Peer-to-Peer; Content Sharing; Cloud Storage.

  • Consistency Preservation of Replicas Based on Access Frequency for Content Sharing in Hybrid Peer-to-Peer Networks   Order a copy of this article
    by Ryota Yoichi, Shinji Sugawara 
    Abstract: Various consistency maintenance strategies of content sharing in Pure Peer-to-Peer (P2P) networks have been researched recently. However, the ones applied in Hybrid P2P networks have not been investigated enough. In Hybrid P2P networks, when an update of a content item happens on a peer, it is necessary to propagate the update to all the peers which have obsolete replicas of the same content item. In this paper, we propose a method which maintains consistency among the replicas of content items in a practical way when a content item is updated. In this method, the peers which have the replicas of frequently accessed content items are previously selected, and when an update occurs, the updating data is propagated to the peers on a priority basis. Furthermore, we discuss the effectiveness of the proposal by using computer simulations.
    Keywords: Hybrid Peer-to-Peer; Replication; Consistency.

  • An Intelligent Approach for Qualified Voting in P2P Mobile Collaborative Team: A Comparison Study for Two Fuzzy-based Systems   Order a copy of this article
    by Liu Yi, Kosuke Ozera, Keita Matsuo, Leonard Barolli 
    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 has 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 Failures~(NAMF). Then, we use fuzzy approach to compute a voting score for the member. rnWe present two fuzzy-based voting systems (calles FPVS1 and FPVS2). rnThe simulation results show that when NAMP, NAMSF and NODMP are high, the voting sore 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.
    Keywords: P2P; Fuzzy-based Systems; Collaborative Teamwork; Voting Score.

  • Scalable and Adaptive Overlay for Efficient Forwarding in Volunteer Clouds   Order a copy of this article
    by Fatma Hrizi, Anis Laouiti 
    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, i.e. data centers. 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, characterized 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. The advantages that RINA brings comparing to the IP protocol is its recursiveness and its layer management functions. RINA is based on a textit{"divide and conquer"} strategy enabling scalability over large networks. On the other hand, in RINA there is a common layer management protocol that could be leveraged to design a flexible and dynamic forwarding management layer to efficiently maintain our hierarchical small world overlay network. Finally, simulation experiments are provided to evaluate the performance of our proposal. The results show that our hierarchical small world overlay network, compared to a random based overlay topology, achieves a trade-off between bounding the routing table size and ensuring transmission efficiency.
    Keywords: Volunteer Clouds; Forwarding; Small world paradigm; Hierarchy; RINA; Recursive architecture; Simulation.

  • Implementation and Comparison of Two Intelligent Systems based on Fuzzy Logic for Actor Selection in WSANs: Effect of Node Density on Actor Selection   Order a copy of this article
    by Donald Elmazi, Miralda Cuka, Elis Kulla, Tetsuya Oda, Makoto Ikeda, Leonard Barolli 
    Abstract: Wireless Sensor and Actor Network (WSAN) is formed by the collaborationrnof micro-sensor and actor nodes. Whenever there is any special event i.e., fire, earthquake, flood or enemy attack in the network, sensor nodes have responsibility 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.
    Keywords: WSN; WSAN; Fuzzy-Logic; Actor Selection; Node Density.

  • Design and Implementation of Disaster Management GIS System Based on Ultra High Definition Display Environment   Order a copy of this article
    by Yoshitaka Shibata 
    Abstract: This paper introduces a new design of disaster state presentation system using large size and ultra high definition displaying system to satisfy requirement of quick and wide collecting and sharing disaster state information from disaster areas to make decision by the officers as decision makers who work in the headquarters. The proposed presentation system, we call LIVEWall, displays both GIS based location information and multimedia information in parallel on the same display to provide quick and correct understanding the disaster state in wide area. The collected disaster state information are processed as workspace and interactively controlled using workspace controller to display on the Tiled Display Wall (TDW). We designed and implemented our system using current available technology as a prototype. Through performance evaluation, the effects and future works of our proposed system are discussed.
    Keywords: Disaster Information System; GIS; Tiled Display.

  • Incentive Mechanisms for Promoting D2D Communications in Cellular Networks   Order a copy of this article
    by Bhed Bahadur Bista, Jiahong Wang, Toyoo Takata 
    Abstract: Recently, Device-to-Device (D2D) communications have been proposed for efficient utilization 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 optimization 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 willfully take part in D2D communications without reward.
    Keywords: D2D communications; LTE; cellular networks; SINR; achievable data rate; reward.

  • Implementation of information collecting tools using mobile terminals useful for efficient infrastructure maintenance   Order a copy of this article
    by Miki Kuroki, Michitoshi Niibori, Tomoyuki Ishida, Tatsuhiro Yonekura 
    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 utilizing this system was conducted in 2 different municipalities with the participation of citizens. Finally, the effectiveness of the system and the problems for dissemination were verified through a questionnaire survey.
    Keywords: infrastructure management; maintenance; citizens' participation; ICT; social experiments.

  • Non-transferable Proxy Re-encryption for Multiple Groups   Order a copy of this article
    by Ei Mon Cho, Lwin San, Takeshi Koshiba 
    Abstract: In proxy re-encrytpion (PRE) scheme, the message is sent by a delegator to a delegatee with a help of the trusted third party proxy without knowing the existing plaintext. PRE schemes are widely used in various applications. However, the standard PRE scheme has some proxy problems called private key generator (PKG) despotism problem. This means that PKG can make re-encryption key without permission from the delegator. And also, if someone can attack on PKG in a PRE scheme, they can decrypt both the original ciphertext and the re-encrypted ciphertext which is known as the key-escrow problem. A solution for these two problems is to use non-transferable PRE schemes. Non-transferable PRE schemes solve the above PKG despotism problem and key-escrow problem. Some non-transferable PRE scheme is extended to group-based schemes, where the proxy diverts a ciphertext for a group into another group, but the existing schemes have the proxy colluding problem. To resolve the proxy colluding problem for group-based PRE schemes, we propose a non-transferable PRE scheme for multiple groups. In our scheme, there are three sub-processes, which are based on a nontransferable PRE scheme and a group signature. We show that our scheme provides the security for a delegator Alice, a delegatee Bob who is in the same group with Alice, and another delegatee Charlie who is in a different group with Alice.
    Keywords: proxy re-encryption; non-transferability; group signature; multiple groups.

  • Data-Centric Communication Strategy for Wireless Sensor Networks   Order a copy of this article
    by Tetsuro Kuniyasu, Tetsuya Shigeyasu 
    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.
    Keywords: data-centric communication; data collecting system; in-network cache; wireless sensor network.

  • Cooperative and Priority Based on Dynamic Resource Adaptation Method in Wireless Network   Order a copy of this article
    by Kazuaki Togawa, Koji Hashimoto 
    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 utilize 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.
    Keywords: priority control; resource adaptation method; SDN.