Smartphone software for department of computer science

The presented document provides an overview of the Smartphone Software for Department of Computer Science project development through out several phases: analysis of the project proposal, preliminary study of the concepts involved in the project, design decisions and modeling, implementation, experiments and conclusions obtained in the end, as well as a reflection on possible future system improvements. The final version of the system, which was built after the design and implementation decisions made through out the development of the project, is a prototype mainly composed of an application for Android smartphones leaning on a distributed architecture in order to provide all its expected functionalities. Thus, the system is based on a mixture of the two main distributed systems architectural models: client-server and peer-to-peer. The functionalities that lean on the client-server architecture are those whose data are relative to information of general interest and need to be always (ideally) available: consulting news, information and schedules for courses, frequently asked questions, maps and indoors positioning. On the other hand, functionalities such as the chat system and the possibility of contacting with the students of a certain course depend on the availability of the users, so a peer-to-peer architectural model was developed to support them. Regarding the system functionalities, the in-door localization and the chat system were determined as the most relevant ones. With the aim to provide those functionalities, the choice made was to implement an in-door positioning based on the RedPin model and, on the other hand, to make use of an already existing Java solution to build a chat system by means of multicast DNS and DNS Service Discovery: JmDNS

A Systematic Review on Social Robots in Public Spaces: Threat Landscape and Attack Surface

There is a growing interest in using social robots in public spaces for indoor and outdoor applications. The threat landscape is an important research area being investigated and debated by various stakeholders. Objectives: This study aims to identify and synthesize empirical research on the complete threat landscape of social robots in public spaces. Specifically, this paper identifies the potential threat actors, their motives for attacks, vulnerabilities, attack vectors, potential impacts of attacks, possible attack scenarios, and mitigations to these threats. Methods: This systematic literature review follows the guidelines by Kitchenham and Charters. The search was conducted in five digital databases, and 1469 studies were retrieved. This study analyzed 21 studies that satisfied the selection criteria. Results: Main findings reveal four threat categories: cybersecurity, social, physical, and public space. Conclusion: This study completely grasped the complexity of the transdisciplinary problem of social robot security and privacy while accommodating the diversity of stakeholders’ perspectives. Findings give researchers and other stakeholders a comprehensive view by highlighting current developments and new research directions in this field. This study also proposed a taxonomy for threat actors and the threat landscape of social robots in public spaces.publishedVersio

Estimation of Distributed Fermat-Point Location for Wireless Sensor Networking

This work presents a localization scheme for use in wireless sensor networks (WSNs) that is based on a proposed connectivity-based RF localization strategy called the distributed Fermat-point location estimation algorithm (DFPLE). DFPLE applies triangle area of location estimation formed by intersections of three neighboring beacon nodes. The Fermat point is determined as the shortest path from three vertices of the triangle. The area of estimated location then refined using Fermat point to achieve minimum error in estimating sensor nodes location. DFPLE solves problems of large errors and poor performance encountered by localization schemes that are based on a bounding box algorithm. Performance analysis of a 200-node development environment reveals that, when the number of sensor nodes is below 150, the mean error decreases rapidly as the node density increases, and when the number of sensor nodes exceeds 170, the mean error remains below 1% as the node density increases. Second, when the number of beacon nodes is less than 60, normal nodes lack sufficient beacon nodes to enable their locations to be estimated. However, the mean error changes slightly as the number of beacon nodes increases above 60. Simulation results revealed that the proposed algorithm for estimating sensor positions is more accurate than existing algorithms, and improves upon conventional bounding box strategies

An enhanced evolutionary algorithm for requested coverage in wireless sensor networks

Wireless sensor nodes with specific and new sensing capabilities and application requirements have affected the behaviour of wireless sensor networks and created problems. Placement of the nodes in an application area is a wellknown problem in the field. In addition, high per-node cost as well as need to produce a requested coverage and guaranteed connectivity features is a must in some applications. Conventional deployments and methods of modelling the behaviour of coverage and connectivity cannot satisfy the application needs and increase the network lifetime. Thus, the research designed and developed an effective node deployment evaluation parameter, produced a more efficient node deployment algorithm to reduce cost, and proposed an evolutionary algorithm to increase network lifetime while optimising deployment cost in relation to the requested coverage scheme. This research presents Accumulative Path Reception Rate (APRR) as a new method to evaluate node connectivity in a network. APRR, a node deployment evaluation parameter was used as the quality of routing path from a sensing node to sink node to evaluate the quality of a network deployment strategy. Simulation results showed that the behaviour of the network is close to the prediction of the APRR. Besides that, a discrete imperialist competitive algorithm, an extension of the Imperialist Competitive Algorithm (ICA) evolutionary algorithm was used to produce a network deployment plan according to the requested event detection probability with a more efficient APRR. It was used to reduce deployment cost in comparison to the use of Multi-Objective Evolutionary Algorithm (MOEA) and Multi-Objective Deployment Algorithm (MODA) algorithms. Finally, a Repulsion Force and Bottleneck Handling (RFBH) evolutionary-based algorithm was proposed to prepare a higher APRR and increase network lifetime as well as reduce deployment cost. Experimental results from simulations showed that the lifetime and communication quality of the output network strategies have proven the accuracy of the RFBH algorithm performance

Shopping center tracking and recommendation systems

Anacleto R., Luz N., Almeida A., Figueiredo L., Novais P., Shopping Center Tracking and Recommendation Systems, in Soft Computing Models in Industrial and Environmental Applications, 6th International Conference SOCO 2011, Corchado E.; Snasel V., Sedano J., Hassanien A.E.; Calvo J.L., Slezak D. (Eds.), Springer - Series Advances in Intelligent and Soft Computing, vol. 87, ISBN 978-3-642-19643-0, pp 299-308, 2011.Shopping centers present a rich and heterogeneous environment, where IT systems can be implemented in order to support the needs of its actors. However, due to the environment complexity, several feasibility issues emerge when designing both the logical and physical architecture of such systems. Additionally, the system must be able to cope with the individual needs of each actor, and provide services that are easily adopted by them, taking into account several sociological and economical aspects. In this sense, we present an overview of current support systems for shopping center environments. From this overview, a high-level model of the domain (involving actors and services) is described along with challenges and possible features in the context of current Semantic Web, mobile device and sensor technologies

A critical analysis of mobility management related issues of wireless sensor networks in cyber physical systems

Mobility management has been a long-standing issue in mobile wireless sensor networks and especially in the context of cyber physical systems; its implications are immense. This paper presents a critical analysis of the current approaches to mobility management by evaluating them against a set of criteria which are essentially inherent characteristics of such systems on which these approaches are expected to provide acceptable performance. We summarize these characteristics by using a quadruple set of metrics. Additionally, using this set we classify the various approaches to mobility management that are discussed in this paper. Finally, the paper concludes by reviewing the main findings and providing suggestions that will be helpful to guide future research efforts in the area

A critical analysis of mobility management related issues of wireless sensor networks in cyber physical systems

Mobility management has been a long-standing issue in mobile wireless sensor networks and especially in the context of cyber physical systems its implications are immense. This paper presents a critical analysis of the current approaches to mobility management by evaluating them against a set of criteria which are essentially inherent characteristics of such systems on which these approaches are expected to provide acceptable performance. We summarize these characteristics by using a quadruple set of metrics. Additionally, using this set we classify the various approaches to mobility management that are discussed in this paper. Finally, the paper concludes by reviewing the main findings and providing suggestions that will be helpful to guide future research efforts in the area. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Muhammad Imran” is provided in this record*