Академический Документы
Профессиональный Документы
Культура Документы
Context-aware computing refers to a general class of mobile systems that can sense their
physical environment, and adapt their behavior accordingly. Context-aware systems are a
component of a ubiquitous computing or pervasive computing environment.
Adapting Functionality
SCS5619-MOBILE AND PERVASIVE COMPUITNG-UNIT-IV
Adapting Data
SCS5619-MOBILE AND PERVASIVE COMPUITNG-UNIT-IV
Types of Context
SCS5619-MOBILE AND PERVASIVE COMPUITNG-UNIT-IV
Software that supports mediation between other software components across heterogeneous
platforms.
• To provide abstractions that reduce development effort, to offer programming paradigms that
make developing powerful applications easier.
• A collection of protocols for developing highly dynamic client server applications that
standardizes a number of common mechanisms for interaction between clients and
services.
• Service advertisement allows services to announce their presence when they enter the
network and to announce their departure from the network.
• Service Discovery allows clients to discover dynamically services present either in their
local network or in internet.
Service advertisement allows services to announce their presence when they enter the network
and to announce their departure from the network. Service Discovery allows clients to discover
dynamically services present either in their local network or in internet.
• Universal Plug and Play UPnP- a programming language and platform independent discovery
mechanism by relying on HTTP and XML
• Service Location Protocol - a vendor independent discovery mechanism
Jini • A runtime infrastructure that resides on the network and provides mechanisms that enable
to add, remove, locate, and access services. • The runtime infrastructure resides on the network
in three places: • in lookup services that sit on the network; • in the service providers (such as
Jini-enabled devices) • in clients.
Protocols used
• Lookup - a client to query a lookup service for services that can help the client accomplish its
goals.
Jini provides a spontaneous discovery and service interaction framework. Jini functions on top
of the Java RMI distribution middleware. A Jini-enabled device can function as both a service
consumer and provider.
Jini contains three different types of processes: discovery, joining and service lookup. In
discovery the Jini device broadcasts an announcement upon joining a new network. The
announcement contains both information on how to contact services provided by the device as
well as groups it intends to join.
In joining the device provides information about the services to the Jini lookup service through a
RMI stub it receives in joining from the lookup service.
In service lookup the Jini device queries the lookup service. The query produces a set of stubs
that can be used to interact with the remote object. Java Reflection API can be used to inspect
what methods are implemented by each of the objects accessible through the stubs.
Universal Plug and Play, UPnP, provides a programming language and platform independent
discovery mechanism by relying on HTTP and XML. UPnP relies on listening and responding to
HTTP-based requests on a particular multicast channel. UPnP architecture consists of control
points (i.e. UPnP client devices) and UPnP devices. UPnP can be seen to contain five phases:
discovery, description, control, event notification and presentation.
SCS5619-MOBILE AND PERVASIVE COMPUITNG-UNIT-IV
user agents perform the discovery, service agents announce the services and directory agents
act as the lookup service, collecting the service addresses (i.e. service URLs) and responds to
user agent service lookup requests. Directory agents can be found by service and user agents
through passive discovery, in which case both parties listen to directory agent periodic
multicasts on a protocol-specific multicast address.
Transcoding – Introduction
• As the number of networks, types of devices, and content formats increase,
interoperability between different systems and networks is becoming more important.
• We need provide a seamless interaction between content creation and consumption.
• In general, a transcoder relays video signals from a transmitter in one system to a
receiver in another.
• In earlier works, the majority of interest focused on reducing the bit rate to meet an
available channel capacity.
– Conversions between CBR (constant bit-rate) streams and VBR (variable bit-rate.)
– Achieve spatial & temporal resolution reduction due to mobile devices with limited
computing power & display.
Bit-Rate Reduction
• The objective of bit-rate reduction is to reduce the bit-rate while maintaining low
complexity and achieve the highest quality possible.
– Application: broadcasting, Internet streaming
• The most straightforward:
– decode the video bit stream and fully re-encode the reconstructed signal.
• The best performance can be achieved by calculating new motion vectors and model
decisions for every MB at the new rate.
• By re-using information contained in the original bit stream and consider simplified
architectures, significant complexity saving can be achieved while still maintaining
acceptable quality.
• Over the years, focus has been centered on two specific aspects, complexity& drift
effect.
Complexity & Drift Reduction
• Drift can be explained as the blurring or smoothing of successively predicted frames.
• It is caused by the loss of high frequency data, which creates a mismatch between the
actual reference frame used for prediction in the encoder and the degraded reference
frame.
To demonstrate the tradeoff between complexity and quality, we will consider two types of
systems, a closed-loop system and an open-looped system
Transcoding Architecture
• Simplified transcoding for bit-rate reduction:
–(a) open-looped, partial decoding to DCT coefficients, then re-quantize
–(b) closed-looped, drift compensation for re-quantized data.
SCS5619-MOBILE AND PERVASIVE COMPUITNG-UNIT-IV
open-looped System
• Another alternative way is to directly cut high frequency data from each MB, which is
less complex.
–To cut the high frequency data without VLD, a bit profile for the AC coefficients is maintained.
• As MBs are processed, code words corresponding to high frequency coefficients are
eliminated to meet the target bit-rate.
• Along similar lines, techniques to determine the optimal breakpoint of non-zero DCT
coefficients (in zig-zagorder).
–Carried out for each MB, so that distortion is minimized and rate constraints are satisfied.
• Above two alternatives may also be used in the closed-loop system, but their impact on
the overall complexity is less.
• Regardless of the techniques used to achieve the reduced rate, open-looped system are
relatively simply since a frame memory is not required and there is no need for IDCT.
Drift Effect
• Beginning with the I-frame, information is discarded by the transcoder to meet the new
target bit rate. Incoming residual blocks are also subject to loss.
• When a decoder receives the transcoded bit stream, it will decode the I-frame with
reduced quality.
• When it’s time to decode the next P,B frames the degraded I-frame is used as a
predictive component and added to a degraded residual component.
Location aware computing is the ability to find the geographical location of the mobile device and
provide services based on this location information.
• The ability to detect the exact location of the device or maybe its relative location,
especially a wireless device is called location aware computing system.
• Devices that are aware of where they are located are location aware devices.
SCS5619-MOBILE AND PERVASIVE COMPUITNG-UNIT-IV
• Human-centric
– “Finding” applications
• Embedded
– Sensors & actuators
– Devices
– Monitoring and control
• System should support both forms
Large scale embedded systems introduce many fascinating and difficult problems…
– This makes them much more difficult to use…
– BUT it couples them to the physical world
• Localization measures that coupling, giving raw sensor readings a physical context
– Temperature readings temperature map
– Asset tagging asset tracking
– “Smart spaces” context dependent behavior
– Sensor time series coherent beam forming.
Taxonomy of Localization Mechanisms
• Active Localization
– System sends signals to localize target
• Cooperative Localization
– The target cooperates with the system
• Passive Localization
– System deduces location from observation of signals that are “already present”
• Blind Localization
– System deduces location of target without a priori knowledge of its characteristics
Active Mechanisms
• Non-cooperative
– System emits signal, deduces target location from distortions in signal returns
– e.g. radar and reflective sonar systems
• Cooperative Target
– Target emits a signal with known characteristics; system deduces location by
detecting signal
– e.g. ORL Active Bat, GALORE Panel, AHLoS
• Cooperative Infrastructure
– Elements of infrastructure emit signals; target deduces location from detection of
signals
– e.g. GPS, MIT Cricket
Passive Mechanisms
• Passive Target Localization
– Signals normally emitted by the target are detected (e.g. birdcall)
SCS5619-MOBILE AND PERVASIVE COMPUITNG-UNIT-IV
Each node has 4 speaker/ microphone pairs, arranged along the circumference of the
enclosure. The node also has a radio system and an orientation sensor.
Angulation:
Use primarily angle or bearing measurements.
2D angulation requires two angle measurements and one length measurement such as the
distance between the reference points.
Scene Analysis
Static
Observed features are looked up in a predefined dataset that maps them to
object locations.
Differential
Tracks the difference between successive scenes to estimate location.
Advantages
The location of objects can be inferred using passive observation and features
that do not correspond to geometric angles or distances.
Disadvantages
The observer needs to have access to the features of the environment against
which it will compare its observed scenes.
Cost
Limitations
Verona Diagram
1644: informal use by Descartes
1850: Dirichlet used 2-dimensional and 3-dimensional Voronoi diagrams in his study of
quadratic forms
1854: British physician John Snow used a Voronoi diagram in 1854 to illustrate how the
majority of people who died in the Soho cholera epidemic lived closer to the infected
Broad Street pump than to any other water pump.
1908: Voronoi diagrams are named after Russian mathematician Georgy Fedoseevich
Voronoi (or Voronoy) who defined and studied the general n-dimensional case.
Voronoi diagrams are used in geophysics and meteorology to analyze spatially
distributed data
Def : Given two points Pi, Pj S, let H(Pi,Pj) denote the half plane containing Pi. The Voronoi
polygon associated with Pi is defined as
V (i) H (P , P )
i j
i j
Voronoi Polygon
• Given a set of n points, the Voronoi diagram consists of all the Voronoi polygons of
these points.
• The vertices of the Voronoi diagram are called Voronoi points and its segments are
called Voronoi edges.
Divide-and-Conquer approach
• Step 2 Find a median line L perpendicular to the X-axis which divides S into SL and SR
such that SL (SR) lies to the left(right) of L and the sizes of S L and SR are equal.
• Step 4 Construct a dividing piece-wise linear hyper plane HP which is the locus of points
simultaneously closest to a point in S L and a point in SR. Discard all segments of VD(S L)
which lie to the right of HP and all segments of VD(S R) that lie to the left of HP. The
resulting graph is the Voronoi diagram of S.
References: