Wireless indoor positioning systems have become very popular in recent years. These systems have been successfully used in many applications such as asset tracking and inventory management. This paper provides an overview of the existing wireless indoor positioning solutions and attempts to classify different techniques and systems. Three typical location estimation schemes of triangulation, scene analysis, and proximity are analyzed. We also discuss location fingerprinting in detail since it is used in most current system or solutions. We then examine a set of properties by which location systems are evaluated, and apply this evaluation method to survey a number of existing systems. Comprehensive performance comparisons including accuracy, precision, complexity, scalability, robustness, and cost are presented.

Survey of Wireless Indoor Positioning Techniques and Systems

On robust estimation of the location parameter

Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. This paper surveys recent routing protocols for sensor networks and presents a classification for the various approaches pursued. The three main categories explored in this paper are data-centric, hierarchical and location-based. Each routing protocol is described and discussed under the appropriate category. Moreover, protocols using contemporary methodologies such as network flow and quality of service modeling are also discussed. The paper concludes with open research issues. � 2003 Elsevier B.V. All rights reserved.

/pdf/a-survey-on-routing-protocols-for-wireless-sensor-networks-540ow5cp1r.pdf

A survey on routing protocols for wireless sensor networks

Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of applications. In cooperative localization, sensors work together in a peer-to-peer manner to make measurements and then forms a map of the network. Various application requirements influence the design of sensor localization systems. In this article, the authors describe the measurement-based statistical models useful to describe time-of-arrival (TOA), angle-of-arrival (AOA), and received-signal-strength (RSS) measurements in wireless sensor networks. Wideband and ultra-wideband (UWB) measurements, and RF and acoustic media are also discussed. Using the models, the authors have shown the calculation of a Cramer-Rao bound (CRB) on the location estimation precision possible for a given set of measurements. The article briefly surveys a large and growing body of sensor localization algorithms. This article is intended to emphasize the basic statistical signal processing background necessary to understand the state-of-the-art and to make progress in the new and largely open areas of sensor network localization research.

Locating the nodes: cooperative localization in wireless sensor networks

As we are moving towards the Internet of Things (IoT), the number of sensors deployed around the world is growing at a rapid pace. Market research has shown a significant growth of sensor deployments over the past decade and has predicted a significant increment of the growth rate in the future. These sensors continuously generate enormous amounts of data. However, in order to add value to raw sensor data we need to understand it. Collection, modelling, reasoning, and distribution of context in relation to sensor data plays critical role in this challenge. Context-aware computing has proven to be successful in understanding sensor data. In this paper, we survey context awareness from an IoT perspective. We present the necessary background by introducing the IoT paradigm and context-aware fundamentals at the beginning. Then we provide an in-depth analysis of context life cycle. We evaluate a subset of projects (50) which represent the majority of research and commercial solutions proposed in the field of context-aware computing conducted over the last decade (2001-2011) based on our own taxonomy. Finally, based on our evaluation, we highlight the lessons to be learnt from the past and some possible directions for future research. The survey addresses a broad range of techniques, methods, models, functionalities, systems, applications, and middleware solutions related to context awareness and IoT. Our goal is not only to analyse, compare and consolidate past research work but also to appreciate their findings and discuss their applicability towards the IoT.

/pdf/context-aware-computing-for-the-internet-of-things-a-survey-3nibvvc921.pdf

Context Aware Computing for The Internet of Things: A Survey

The core-stateless service architecture alleviates the scalability problems of the integrated service framework while maintaining its guaranteed service semantics. The admission control methods proposed to support core-stateless guaranteed services have significant drawbacks: We propose a scalable and robust distributed admission control architecture to support core-stateless guaranteed services. Our architecture maintains high network utilization while ensuring that resources are not over-allocated. In our architecture, admission control is performed at the ingress edge routers of a request on an edge-to-edge path basis. A token-passing mechanism is used as the resource management framework. The token helps in dynamic and fair division of bandwidth and allows completely distributed resource allocation on a link unless it is close to saturation. The edge routers co-operate to provide fault tolerance effectively acting as a resilient overlay network. Our admission control framework can support statistical guarantees and diffserv architecture's premium service as well. The resource management part of our architecture is well-suited to aid QoS routing algorithms. Analytical and simulation results are presented to show the effectiveness of our architecture.

/pdf/distributed-admission-control-to-support-guaranteed-services-4etze8wust.pdf

Distributed admission control to support guaranteed services in core-stateless networks

Traffic engineering enhances an ISP's capability to manage and utilize its resources effectively. MPLS has emerged as an efficient packet forwarding tool that gives a significant boost to the traffic engineering capabilities of an ISP. A fundamental problem in MPLS is to reduce label space usage by label switched paths while meeting the requirements of the flows traversing the network. Using multipoint-to-point LSP trees has been proposed as one of the techniques to reduce label space usage. We look at the problem of creating multipoint-to-point LSPs given a set of precomputed point-to-point LSPs. We propose a heuristic for multipoint-to-point LSP creation and show its effectiveness.

Creating multipoint-to-point LSPs for traffic engineering

In this paper, we take a retrospective look at the problem of querying and updating location dependent data in massively distributed mobile environments. Looking forward, we paint our vision of the future dataspace - physical space enhanced with embedded digital information. Finally we describe a few of the applications enabled by dataspace due to the availability of large scale ad-hoc sensor networks, short-range wireless communications, and fine-grain location information.

Wireless graffiti: data, data everywhere

A method and system for communicating the identity of devices detected in a wireless communication system. The devices connect to a mobile wireless network comprising a wireless access network and a core Internet Protocol (IP) network. The identities of devices so detected are specified by a combination of device and network-level identities and is communicated to a management server. In an exemplary embodiment, network elements of the core IP network are used to detect and convey the identity of wireless devices to a management server.

System and method for automatic detection and reporting of the mapping between device identity and network address in wireless networks

A system and method for wireless device management in a telecommunications network (110) that includes a wireless device (120A-120Z) and a server (130A). An agent (225) executing on a wireless identity module (220) that is operatively connected to the wireless device (120A-120Z) communicates with a service manager executing on the serve (130A). The information communicated by the agent (225) may include the identity of the wireless device (120A-120Z), the network identity of the wireless identity module (220), the physical location of the wireless device (120A-120Z) in the telecommunications network (110), the signal strength and bit error rate of the primary communication channel used by the wireless device (120A-120Z) , and a list of features supported by the wireless device (120A-120Z). The service manager may then monitor the wireless device (120A-120Z), and may proactively query the wireless device (120A-120Z) via the agent (225) to ascertain the status of the wireless device (120A-120Z) and the quality of service provided to the wireless device (120A-120Z) by the telecommunications network (110).

Badri Nath

Papers

Distributed admission control to support guaranteed services in core-stateless networks

Creating multipoint-to-point LSPs for traffic engineering

Wireless graffiti: data, data everywhere

System and method for automatic detection and reporting of the mapping between device identity and network address in wireless networks

System and method for over the air (ota) wireless device and network management