ASN Notes
ASN Notes
Basics of Wireless:
Introduction
Wireless Sensor Networks can be considered as a special case of ad hoc networks
with reduced or no mobility
WSNs enable reliable monitoring and analysis of unknown and untested
environments
These networks are "data centric", i.e., unlike traditional ad hoe networks where
data is requested from a specific node, data is requested based on certain attributes
such as, "which area has temperature over 35°C or 95°F**
A sensor has many functional components as shown in Figure 8.1
A typical sensor consists of a transducer to sense a given physical quantity, an
embedded processor, small memory and a wireless transceiver to transmit or
receive data and an attached battery
Applications:
Thousands of sensors over strategic locations are used in a structure such as an
automobile or an airplane, so that conditions can be constantly monitored both from
the inside and the outside and a real-time warning can be issued whenever a major
problem is forthcoming in the monitored entity
These wired sensors are large (and expensive) to cover as much area is desirable
Each of these need a continuous power supply and communicates their data to the
end-user using a wired network
The organization of such a network should be pre-planned to find strategic position
to place these nodes and then should be installed appropriately
The failure of a single node might bring down the whole network or leave that region
completely un-monitored
Unattendability and some degree of fault tolerance in these networks are desirable
in those applications where the sensors may be embedded in the structure or places
in an inhospitable terrain and could be inaccessible for any service
Undoubtedly, wireless sensor networks have been conceived with military
applications in mind, including battlefield surveillance and tracking of enemy
activities
However, civil applications considerably outnumber the military ones and are
applicable to many practical situations
Judging by the interest shown by military, academia, and the media, innumerable
applications do exist for sensor networks
Examples include weather monitoring, security and tactical surveillance, distributed
computing, fault detection and diagnosis in machinery, large bridges and tall
structures, detecting ambient conditions such as temperature, movement, sound,
light, radiation, vibration, smoke, gases, or the presence of certain biological and
chemical objects
Under the civil category, envisioned applications can be classified into environment
observation and forecast system, habitat monitoring equipment and human health,
large structures and other commercial applications
Habitat Monitoring
A prototype test bed consisting of iPAQs (i.e., a type of handheld device) has been
built to evaluate the performance of these target classification and localization
methods
As expected, energy efficiency is one of the design goals at every level: hardware,
local processing (compressing, filtering, etc.: MAC and topology control, data
aggregation, data-centric routing and storage
Pre-processing is proposed in for habitat monitoring applications, where it is argued
that the tiered network in GDI is solely used for communication
The proposed 2-tier network architecture consists of micro nodes and macro nodes,
wherein the micro nodes perform local filtering and data to significantly reduce the
amount of data transmitted to macro nodes
Applications The Grand Duck Island Monitoring Network
Researchers from the University of California at Berkeley (UCB) and Intel Research
Laboratory deployed in August 2002 a mote-based tiered sensor network in Great
Duck Island (GDI), Maine, aimed at monitoring the behaviour of storm petrel
The overall system architecture is depicted in Figure 8.13
A total of 32 motes have been placed in the area to be sensed grouped into sensor
patches to transmit sensed data to a gateway which is responsible for forwarding the
information from the sensor patch to a remote base station through a local transit
network
The base station then provides data logging and replicates the data every 15 minutes
to a database in Berkeley over a satellite link
Remote users can access the replica database server in Berkeley, while local users
make use of a small PDA-size device to perform local interactions such as adjusting
the sampling rates, power management parameters, etc.
"The idea is to interface gas sensors with custom-made devices and wireless radio
and transmit sensed data for further analysis
Deployment of a large number of sensors allows real-time monitoring of gases being
emitted by the waste material or from industrial spills
"Place a large number of sensors throughout the area of interest and appropriate
type of sensors can be placed according to the type of pollutant anticipated in a
given area
A large volume of raw data from sensors, can be collected, processed and efficiently
retrieval
A generic set up of a WSN, has been covered and various associated issues have
been clearly pointed out
The scheme can be easily used and adopted for other applications as well
LOWER-LAYER:
Introduction
Classifications of WSNs
WNs can be classified on the basis of their mode of operation or functionality,
and the type of target applications
Accordingly, we classify WNs into three types:
1. Proactive Networks - The nodes in this network periodically switch on their sensors
and transmitters, sense the environment and transmit the data of interest and they
provide a snapshot of the relevant parameters at regular intervals and are well
suited for applications requiring periodic data monitoring
2. Reactive Networks - In this scheme, the nodes react immediately to sudden and
drastic changes in the value of a sensed attribute and as such, these are well suited
for time critical applications
3. Hybrid Networks - This is a combination of both proactive and reactive networks
where sensor nodes not only send data periodically, but also respond to sudden
changes in attribute values
2.Network Architecture:
The architecture of WSNs must ensure both sensing coverage and communication
connectivity, which relies on the density of the sensor deployment.
- Density and Lifetime:
- The network's lifetime can be defined by either the failure of individual sensors or by a
percentage failure rate (e.g., 95% area coverage). Denser sensor deployment provides
redundancy, but increasing density can also lead to higher energy consumption and
transmission delays due to collisions. The optimal sensor density maximizes sensor lifetime
by balancing communication distance and energy consumption.
- Transmission Strategies:
- Energy consumption varies depending on whether data is transmitted directly between
two sensors or via intermediate nodes. Using intermediate sensors can save energy
compared to long-range transmissions (Figure 9.3 illustrates these strategies).
- Energy-Driven Protocols:
- WSN protocols must be energy-efficient, focusing on data aggregation and reducing
unnecessary transmissions. Redundant or correlated sensor readings can be aggregated to
minimize the number of packets sent.
- Addressing and QoS:
- Address-free structures may be essential for scalability and energy efficiency, using
geographic or data-centric addressing systems. QoS, redundancy, and sensor reading
imprecision must be accounted for in the design of the network.
In-Network Processing:
- WSNs often perform in-network processing, such as data aggregation and distributed
signal processing, to reduce the number of transmitted packets. The exact nature of WSN
services is not fully defined, as they do not simply transmit bits like traditional networks.
- Gateway and Integration:
- WSNs must be integrated into larger networks via a gateway to bridge different
communication protocols. Integration into middleware architectures, like CORBA or Web
Services, and services described in WSDL or UDDI present challenges in representing the
unique functionality of WSNs.
- Reconfiguring Tasks:
- It may be necessary to update the tasks or software of sensor nodes over time, requiring
remote reconfiguration capabilities for the WSN.
Physical Layer
The physical layer in the context of wireless sensor networks (WSNs) refers to the hardware
and communication technologies used to transmit data between sensor nodes. However,
limited research has been conducted on developing protocols specifically tailored to the
unique needs of WSNs at the physical layer, particularly in terms of energy efficiency and
handling the overhead related to radio transmission (e.g., retransmissions and
communication costs).
Several points about the physical layer include:
- Energy-Efficient Transmission: A key focus is on how to transmit data with minimal energy
consumption while considering potential retransmissions and overhead. Some energy-
efficient modulation techniques have been explored in previous research (e.g., Schurgers
2001).
- Modulation Techniques for Sensor Nodes: Research such as that by Gao (2001) addresses
the hardware aspects of CDMA (Code Division Multiple Access) and other modulation issues,
emphasizing how these impact sensor nodes' performance.
- Communication Protocol Design: Shih (2001b) provides discussions on communication
protocol designs that are based on the physical layer, offering insights into how the physical
layer impacts overall network performance.
- Standardization Efforts: Although specific details are not covered, the work being done by
organizations like the IEEE (notably the IEEE 802.15.4 standard) is recognized as relevant.
IEEE 802.15.4 focuses on low-rate wireless personal area networks (LR-WPANs), which are
critical for many WSN applications due to their low power consumption and cost-effective
communication.
MAC LAYER
The MAC (Medium Access Control) layer plays a vital role in wireless sensor networks
(WSNs), mainly in regulating how sensor nodes share the communication medium
efficiently while minimizing energy consumption. The main focus of MAC layer research for
WSNs is to keep sensor nodes in sleep mode as long as possible to conserve energy, making
it a crucial area of study.
Key concepts of MAC layer include:
Channel Allocation Schemes:
- Static Channel Allocation: Bandwidth is divided among sensor nodes using techniques like
FDMA (Frequency Division Multiple Access), TDMA (Time Division Multiple Access), CDMA
(Code Division Multiple Access), or SDMA (Space Division Multiple Access). These methods
minimize interference but work best in static, low-node-count environments where nodes
have predictable data loads.
- Dynamic Channel Allocation: This is more suited for environments where the number of
active nodes varies, and data generation is bursty (i.e., sporadic). Contention-based
protocols such as CSMA (Carrier Sense Multiple Access) are used here. Although these can
minimize collisions, they may lead to energy wastage and delays due to retransmissions.
Hierarchical Clustering and TDMA:
- In a hierarchical clustering model, TDMA can be used to allocate time slots to each sensor
node within a cluster. Nodes transmit data in their designated slots and can sleep during
other periods to save energy. This is especially beneficial in both proactive networks (where
nodes transmit periodically) and reactive networks (where nodes respond to sudden
events).
CDMA and Intra/Inter-Cluster Collisions:
- CDMA can be used to avoid collisions between clusters. Though more energy is required
per bit transmitted, CDMA allows multiple transmissions using the same frequency, making
it useful for inter-cluster communication.
MAC Design Challenges:
1. Node Failure: When sensor nodes fail, MAC protocols must adapt by forming new routes
and adjusting power levels to maintain network connectivity.
2. Energy Consumption Sources:
- Collisions: Corrupted packets due to collisions lead to retransmissions, consuming more
energy.
- Overhearing: Nodes may waste energy by listening to transmissions not intended for
them.
- Control Packet Overhead: The need for control packets to manage network operations
increases energy usage as the number of nodes rises or nodes fail.
- Idle Listening: Nodes may waste energy waiting to receive data that is never sent.
Energy Conservation Techniques:
- One of the most effective methods for conserving energy in WSNs is periodic sleeping:
nodes turn off their radios and synchronize based on a sleep schedule. This reduces the idle
listening problem, a major energy drain in sensor networks.
Scheduling and Reservation vs. Contention-based MAC:
- Scheduling-based MAC protocols (like TDMA) save more energy compared to contention-
based protocols (like IEEE 802.11). However, TDMA requires careful management of cluster
formation, inter-cluster communication, and dynamic adaptation to changes in the number
of nodes in the network.
In summary, the MAC layer in WSNs faces unique challenges related to energy efficiency,
node failure, and dynamic network environments. Various strategies, including static and
dynamic channel allocation, hierarchical clustering, and scheduled sleeping, are employed
to balance energy conservation with reliable communication.
The Sensor-MAC (S-MAC) protocol:
1. Energy Efficiency in WSNs:
- WSNs are designed for prolonged operation, making energy conservation crucial since
recharging batteries is often impractical.
- Nodes typically spend much of their time in an idle state, consuming similar energy levels
in both idle and receiving modes.
2. Low Duty Cycle Operation:
- Nodes in S-MAC operate on a low duty cycle, alternating between listening and sleeping
to conserve energy.
- By doing this, S-MAC addresses four primary sources of energy consumption: collision,
control overhead, overhearing, and idle listening.
3. Coordinated Sleep Schedules:
- S-MAC nodes communicate and coordinate their sleep schedules to minimize energy
waste.
- Each node broadcasts its schedule to neighbours using SYNC packets, helping to prevent
clock drift and ensuring nodes follow similar wake and sleep patterns.
4. Handling Different Schedules:
- If two neighbouring nodes have different schedules, they can either:
- Listen to both schedules, or
- Transmit data according to both schedules.
- Neighbour discovery is periodically performed to ensure nodes are aware of each other's
presence and schedules.
5. Communication Process:
- During communication, a node first performs carrier sensing during its neighbour's
listening periods.
- If the channel is clear, it sends a Request to Send (RTS) followed by a Clear to Send (CTS)
from the receiver, enabling data transfer during their scheduled times.
- Broadcasts do not use RTS/CTS to avoid potential collisions from multiple responses.
6. Adaptive Listening:
- To reduce latency in multi-hop transmissions, nodes that overhear transmissions can
briefly wake up to receive data, rather than waiting for their next scheduled listen time.
SMACS
The SMACS is an infrastructure-building protocol that forms a flat topology (as
opposed to a cluster hierarchy) for sensor networks
SMACS is a distributed protocol which enables a collection of SNs to discover
their neighbours and establish transmission/reception schedules for
communicating with them without the need for any local or global master nodes
In order to achieve this ease of formation, SMACS combines the neighbour
discovery and channel assignment phases
SMACS assigns a channel to a link immediately after the link's existence is
discovered
This way, links begin to form concurrently throughout the network
By the time all nodes hear all their neighbours, they would have formed a
connected network
In a connected network, there exists at least one multi-hop path between any
two distinct nodes
Since only partial information about radio connectivity in the vicinity of a SN is
used to assign time intervals to links, there is a potential for time collisions with
slots assigned to adjacent links whose existence is not known at the time of
channel assignment
To reduce the likelihood of collisions, each link is required to operate on a
different frequency
This frequency band is chosen at random from a large pool of possible choices
when the links are formed
This idea is described in Figure 9.6(a) for the topology of Figure 9.5
Here, nodes A and D wake up at times Ta and Td
After they find each other, they agree to transmit and receive during a pair of
fixed time slots
This transmission/reception pattern is repeated periodically every Tframe
Nodes B and C, in turn, wake up later at times Tb, and Tc, respectively
The method by which SNs find each other and the scheme by which time slots
and operating frequencies are determined constitute an important part of
SMACS
To illustrate this scheme, consider nodes B, C, and D shown in Figure 9.6(b)
These nodes are engaged in the process of finding neighbours and wake up at
random times
Upon waking up, each node listens to the channel on a fixed frequency band for
some random time duration
A node decides to transmit an invitation by the end of this initial listening time if
it has not heard any invitations from other nodes
This is what happens to node C, which broadcasts an invitation or TYPE1 message
Nodes B and D hear this TYPE1 message and broadcasts a response, or TYPE2,
message addressed to node C during a random time following reception of
TYPE.1
1. Reactive Monitoring: STEM is particularly suited for applications where the network
primarily senses the environment, such as detecting forest fires. The goal is to keep the
network operational for long periods while using minimal energy during monitoring.
2. Energy-Efficient Operation: During the monitoring state, only the sensors and some pre-
processing circuits of the nodes are active. The main processor and communication radio
remain off to save energy until an event is detected.
3. Event Detection: When a potential event is detected, the node's main processor wakes
up to analyze the data and determine if communication with other nodes is necessary.
However, the radios of neighbouring nodes may remain off if they did not detect the same
event.
4. Beacon Communication: To initiate communication, a node (the initiator) periodically
sends out a beacon signal targeting another node (the target). This beacon alerts the target
node to wake up and establish a communication link.
5. Link Activation: Upon receiving the beacon, the target node responds, and both nodes
keep their radios on. If the data needs to be forwarded, the target becomes the initiator for
the next hop, repeating the process.
6. Separate Frequency Bands: STEM uses different frequency bands for the wakeup
protocol and data transmission to avoid interference. The wakeup messages are sent over
one frequency (the "wakeup plane"), while actual data packets are transmitted over another
frequency (the "data plane").
7. Hardware Support: Some commercially available sensors support this dual-band
operation, allowing for effective implementation of the STEM protocol.
ROUTING LAYER
This section explores energy-efficient routing techniques developed specifically for WSNs,
focusing on extending network lifetime.
Key concepts of WSN routing include:
Routing Approaches:
1. Multi-Hop Routing: In WSNs, data is usually sent over multiple hops from a source
node to the BS. The BS can be fixed or mobile, serving as a gateway between the
sensor network and external systems, such as the Internet. Multi-hop routing is
energy-efficient, as direct communication with the BS can be energy-intensive for
distant nodes.
2. Energy-Efficient Routing Goals: The primary aim is to minimize energy consumption
and maximize network lifetime. WSN routing protocols use specific strategies,
including data aggregation, clustering, in-network processing, and data-centric
techniques to meet this goal.
Classification of Routing Protocols for WSNs:
Routing protocols in WSNs can be classified based on network structure and protocol
operation.
By Network Structure:
Flat-based Routing: All nodes have equal roles, and data is typically forwarded based
on query responses. This approach is suitable for small networks.
Hierarchical-based Routing: Nodes play distinct roles; some nodes (cluster heads)
are designated with additional responsibilities, such as aggregating data and
forwarding it to the BS. This approach conserves energy by reducing redundant data
Transmission and is commonly used in large WSNs.
Adaptive Routing: Protocols adapt parameters based on current network conditions,
such as energy availability, to maintain efficiency.
By Protocol Operation:
Multipath-based Routing: Utilizes multiple paths for data transmission to increase
reliability and load balancing.
Query-based Routing: Nodes send data in response to specific queries, saving
energy by limiting transmissions to relevant data only.
Negotiation-based Routing: Prevents redundant data transmission through
negotiation among nodes before data forwarding.
Location-based Routing: Nodes use location information to route data, optimizing
routes and reducing transmission energy costs.
Adaptive Routing protocols are designed to dynamically adjust to the available resources
and network environment, aiming to conserve energy and improve communication
efficiency in Wireless Sensor Networks (WSNs). One prominent family of adaptive routing
protocols is the
Sensor Protocols for Information via Negotiation (SPIN)
Key Concepts of Adaptive Routing with SPIN
1. Data-Centric Communication: SPIN protocols assign high-level metadata to data
packets, allowing nodes to negotiate the data before transmission. This data-centric
approach prevents the transmission of redundant information since nodes only send
data that their neighbours lack.
2. Energy Adaptation: SPIN adapts to each node’s available resources, ensuring that
low-energy nodes reduce participation when energy is scarce. This energy-
awareness prevents nodes from expending energy on unnecessary transmissions,
prolonging the network’s operational lifespan.
3. Three-Stage Communication: SPIN protocols follow a three-stage communication
process using three types of messages:
o ADV: Advertises new data.
o REQ: Requests specific data that the node does not possess.
o DATA: Transmits the actual data when requested.
This process continues iteratively until all nodes in the network have the information they
need.
Types of SPIN Protocols
SPIN-1 and SPIN-2: These are the foundational protocols of the SPIN family. SPIN-1
handles basic data negotiation, while SPIN-2 includes a threshold-based energy
mechanism. When a node's energy level drops below a certain point, it only
participates in data transmission if it can complete the process without falling below
the threshold.
SPIN-BC (Broadcast Channel): SPIN-BC is optimized for broadcast environments.
Nodes delay their responses with random timers, avoiding redundant requests when
multiple nodes request the same data.
SPIN-PP (Point-to-Point): For point-to-point communication, SPIN-PP operates with
a three-way handshake similar to SPIN-1 but requires only single-hop neighbour
awareness. This protocol is effective for networks where energy and data reliability
are less of a concern.
SPIN-EC (Energy-Constrained): This variant uses an energy threshold heuristic.
Nodes participate only if they can complete all stages without reducing energy below
a predefined threshold.
SPIN-RL (Reliable): In error-prone environments, SPIN-RL adds mechanisms to SPIN-
PP to manage lossy channels. Nodes track received ADV messages and can request
retransmissions for data not received within a time window, ensuring reliable data
transfer.
Advantages of SPIN
Energy Efficiency: By negotiating metadata before full data transfer, SPIN reduces
unnecessary data exchanges and conserves energy.
Adaptability: SPIN adjusts to the network’s energy levels and only participates when
feasible, extending node life.
Reduced Redundancy: By eliminating redundant data transfers and only transmitting
unique data, SPIN conserves bandwidth and energy.
Limitations
SPIN protocols, while energy efficient and suitable for mobile WSNs, are not always ideal for
networks with strict latency requirements or real-time demands. The delay from
negotiation and the overhead from ADV and REQ messaging can be excessive in dense
networks or environments where rapid data dissemination is needed.
Negotiation-Based Routing protocols in Wireless Sensor Networks (WSNs) aim to eliminate
redundant data transmissions by using high-level data descriptors to negotiate and decide
what data should be sent. This approach addresses common issues of traditional flooding,
such as implosion (nodes receiving duplicate data) and data overlap (when nearby nodes
collect similar data). These problems lead to unnecessary energy consumption and
bandwidth use, which is particularly problematic in resource-constrained WSN
environments.
Negotiation-Based Routing
1. High-Level Data Descriptors: Nodes use metadata to describe the data, allowing them to
negotiate on the data's necessity before initiating a full transmission. This negotiation avoids
sending redundant data to neighbouring nodes.
2. Resource-Based Communication Decisions: By evaluating the available resources, nodes
can make adaptive decisions on whether to participate in data transmission, thus conserving
energy.
3. Avoiding Redundant Data: Protocols like SPIN (Sensor Protocols for Information via
Negotiation) are classic examples of negotiation-based routing. In SPIN, each sensor node
describes its data using metadata and broadcasts this information through ADV
(advertisement) messages. Neighbouring nodes then request data they need, minimizing
duplicate data transmissions.
Advantages
- Energy Efficiency: By preventing redundant transmissions, negotiation-based protocols
conserve energy across the network, especially vital for WSNs.
- Reduced Data Overlap: Nodes avoid receiving unnecessary duplicates of data, which
reduces data processing and storage demands.
Multipath-Based Routing is a routing approach in Wireless Sensor Networks (WSNs) that
maintains multiple paths from a source to a destination, instead of relying on a single path.
This routing method aims to improve network fault tolerance and reliability by providing
alternative paths, especially useful in the event of primary path failure. However,
maintaining these paths incurs extra energy consumption and overhead as they require
periodic messages to keep the alternate paths active.
Key Features of Multipath-Based Routing:
1. Enhanced Fault Tolerance: The likelihood of having an alternative route when the
primary path fails increases with multiple paths, which improves overall network resilience.
2. Node-Disjoint and Overlapping Paths: Paths can be node-disjoint (no shared nodes) or
overlapping. Node-disjoint paths increase reliability but are more resource-intensive, while
overlapping paths reduce resource consumption.
3. Energy-Optimized Path Selection: Paths can be selected based on residual energy to
avoid rapid depletion of energy in any single path, thus extending network lifetime. For
instance, the primary path may be used until its energy drops below that of a backup path.
These applications often require service differentiation, where critical queries take the
shortest path, and non-critical, periodic updates are distributed over longer paths. This
differentiation extends network life by reducing battery depletion in specific nodes, as it
spreads out the workload across the network, particularly in mesh or rectangular grid-based
WSNs.