Towards optimal sensor deployment for location tracking in smart home

International audienceAmbient Assisted Living (AAL) aims to ease the daily living and working environmentfor disabled/elderly peopleat home. AAL use information and communication technology based on sensors data. These sensors are generally placed randomly without taking into account the layout of buildings and rooms. In this paper, we develop a mathematical model foroptimal sensor placement in order (i) to optimize the sensor number with regard to room features, (ii) to ensure a reliability level in sensor networkconsidering a sensor failure rate. This placement ensures the targettracking in smart home sinceoptimizing sensorplacement allow us to distinguish different zonesand consequently, to identify the target location, according to the activated sensors

Location Based Services with Location Centric Profiles

Abstract Android operating system supports most applications in today's technical world. It is an open source operating system which highly satisfies the user's needs. In this paper, the applications that are location based i.e. the applications that make use of the Global Positioning System (GPS) is discussed. It is a space based satellite navigation system which provides details of time and location in all weather conditions anywhere on or near earth

A HIERARCHICAL SYSTEM VIEW AND ITS USE IN THE DATA DISTRIBUTION OF COMPOSED CONTAINERS IN STAPL

In parallel programming, a concurrent container usually distributes its elements to all processing units (locations) equally to maximize the processing ability. However, this distribution strategy does not perform well when we apply nested parallel func- tions on a composed concurrent container, such as a concurrent vector of vectors or a concurrent map of lists. The distribution of the inner concurrent containers across the system will mess up the locality of the elements in the composed containers, generating a lot of inter-process communication when the nested parallel operations are called to access the container's elements. As the hierarchy in modern high per- formance computing (HPC) systems become large and complex, a large amount of inter-process communication, especially those between two remote processing units (such as two cores on different nodes), will have dramatic negative impact on the performance of the parallel applications. In this thesis, we introduce a hierarchical system view that represents the topol- ogy of the processing units in a HPC system, and use it to guide the distribution of the composed concurrent containers. It reduces the number of processing elements involved in storing in the inner concurrent containers, which reduces memory usage and improves construction time. It also reduces the amount of inter-process com- munication by improving the locality of the elements when we apply nested parallel functions on a composed concurrent container. To evaluate our approach, we implement two concurrent associative multi-key containers, multimap and multiset, in the Standard Template Adaptive Parallel Li- brary (STAPL), and use the hierarchical system view on the distribution of composed 2D and 3D containers. Finally, we show great improvement on both the construction time and the execution time of the nested parallel functions with various numbers of cores and hierarchies

Multi-Objective Routing for Distributed Controllers

A long-term goal of future naval shipboard power systems is the ability to manage energy flow with sufficient flexibility to accommodate future platform requirements such as better survivability, continuity, and support of pulsed and other demanding loads. To facilitate scalable, low-latency global distributed system control, each control module can include an integrated network interface connected through multiple channels onto a direct, multi-hop network topology. In this work, we focus on a 2D Torus, in which control nodes are arranged in a regular 2D grid, with each node connected through point-to-point connections to its four immediate neighbors. An important advantage of 2D Tori is their redundant topology where there is more than one minimal path between any source and destination as long as they do not share the same row or column in the grid. For the static, all-to-one traffic pattern used by a central controller, the number of minimal routing tables grows as O(N!N2). This dissertation presents a novel approach to generating routing tables that achieve two performance objectives: (1) minimal control period latency, the lower bound of which is the round trip latency of the messages exchanged between the controller and the node having the longest route, and (2) minimal latency jitter. Our approach relies on creating a large system of integer linear algebra equations describing (i) functionality of a network and (ii) constraints needed for perfect load balance and low jitter. We use Gurobi ILA solver to find a satisfying assignment of all boolean variables representing where packets are scheduled to be in a certain timeframe. Experimental results show that our software pipeline generates routing tables that (i) are guaranteed to have perfect load balance regardless of shape and size of the network and (ii) lower jitter than any of randomly generated routing tables which we simulated. Our software also has an option of generating routing tables that allow packets to follow non minimum hop count paths as well as being held in the source nodes for some time instead of immediately rushing to the master node. That helps packets avoid congested areas, and, as the results show, achieves up to 2x improvement in jitter

Sketching as a support mechanism for the design and development of shape-changing interfaces

Shape-changing interfaces are a novel computational technology which incorporate physical, tangible, and dynamic surfaces to create a true 3-Dimensional experience. As is often the case with other novel hardware, the current research focus is on iterative hardware design, with devices taking many years to reach potential markets. Whilst the drive to develop novel hardware is vital, this usually occurs without consultation of end-users. Due to the prototypical nature of shape-change, there is no specific current practice of User-Centred Design (UCD). If this is not addressed, the resulting field may consist of undirected, research-focused hardware with little real world value to users. Therefore, the goal of this thesis is to develop an approach to inform the direction of shape-change research, which uses simple, accessible tools and techniques to connect researcher and user. I propose the development of an anticipatory, pre-UCD methodology to frame the field. Sketching is an established methodology. It is also accessible, universal, and provides us with a low-fidelity tool-kit. I therefore propose an exploration of how sketching can support the design and development of shape-changing interfaces. The challenge is approached over five stages: 1) Analysing and categorising shape-changing prototypes to provide the first comprehensive overview of the field; 2) Conducting a systematic review of sketching and HCI research to validate merging sketching, and its associated UCD techniques with highly technological computing research; 3) Using these techniques to explore if non-expert, potential end-users can ideate applications for shape change; 4) Investigating how researchers can utilise subjective sketching for shape-change; 5) Building on ideation and subjective sketching to gather detailed, sketched data from non-expert users with which to generate requirements and models for shape-change. To conclude, I discuss the dialogue between researcher and user, and show how sketching can bring these groups together to inform and elucidate research in this area