1. Karpagam Institute of Technology, Coimbatore-105
Department of Electronics and Communication Engineering
Course Code/ Name:EC8702 Adhoc and Wireless Sensor
Networks
Staff Name/Designation:S.Suganya /Assistant Professor
Department: ECE
Year/Semester: IV/VII
Dr. M.S.Gowtham/Assistant
Professor
2. Course Syllabus
EC8702 Adhoc and Wireless Sensor Networks
• UNIT I ADHOC NETWORKS – INTRODUCTION AND ROUTING PROTOCOLS
Elements of Ad hoc Wireless Networks, Issues in Ad hoc wireless networks,
Example commercial applications of Ad hoc networking, Ad hoc wireless Internet,
Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks,
Classifications of Routing Protocols, Table Driven Routing Protocols - Destination
Sequenced Distance Vector (DSDV), On–Demand Routing protocols –Ad hoc On–
Demand Distance Vector Routing (AODV).
• UNIT II SENSOR NETWORKS – INTRODUCTION & ARCHITECTURES
Challenges for Wireless Sensor Networks, Enabling Technologies for Wireless
Sensor Networks, WSN application examples, Single-Node Architecture - Hardware
Components, Energy Consumption of Sensor Nodes, Network Architecture -
Sensor Network Scenarios, Transceiver Design Considerations, Optimization Goals
and Figures of Merit.
• UNIT III WSN NETWORKING CONCEPTS AND PROTOCOLS
MAC Protocols for Wireless Sensor Networks, Low Duty Cycle Protocols And
Wakeup Concepts - S-MAC, The Mediation Device Protocol, Contention based
protocols - PAMAS, Schedule based protocols – LEACH, IEEE 802.15.4 MAC
protocol, Routing Protocols- Energy Efficient Routing, Challenges and Issues in
Transport layer protocol.
3. Syllabus
UNIT IV SENSOR NETWORK SECURITY
Network Security Requirements, Issues and Challenges in Security Provisioning,
Network Security Attacks, Layer wise attacks in wireless sensor networks, possible
solutions for jamming, tampering, black hole attack, flooding attack. Key
Distribution and Management, Secure Routing – SPINS, reliability requirements in
sensor networks.
UNIT V SENSOR NETWORK PLATFORMS AND TOOLS
Sensor Node Hardware – Berkeley Motes, Programming Challenges, Node-level
software platforms – TinyOS, nesC, CONTIKIOS, Node-level Simulators – NS2 and
its extension to sensor networks, COOJA, TOSSIM, Programming beyond individual
nodes – State centric programming.
TOTAL:45 PERIODS
• OUTCOMES:
• At the end of the course, the student would be able to:
• Know the basics of Ad hoc networks and Wireless Sensor Networks
• Apply this knowledge to identify the suitable routing algorithm based on the
network and user requirement
• Apply the knowledge to identify appropriate physical and MAC layer protocols
• Understand the transport layer and security issues possible in Ad hoc and sensor
networks.
• Be familiar with the OS used in Wireless Sensor Networks and build basic modules
4. Syllabus
TEXT BOOKS:
• 1. C. Siva Ram Murthy and B. S. Manoj, ―Ad Hoc Wireless Networks
Architectures and Protocols‖, Prentice Hall, PTR, 2004. (UNIT I)
• 2. Holger Karl , Andreas willig, ―Protocol and Architecture for Wireless
Sensor Networks‖, John wiley publication, Jan 2006.(UNIT II-V)
REFERENCES:
• 1. Feng Zhao, Leonidas Guibas, ―Wireless Sensor Networks: an
information processing approach‖, Elsevier publication, 2004.
• 2. Charles E. Perkins, ―Ad Hoc Networking‖, Addison Wesley, 2000.
• 3. I.F. Akyildiz, W. Su, Sankarasubramaniam, E. Cayirci, ―Wireless
sensor networks: a survey‖, computer networks, Elsevier, 2002, 394 -
422.
5. Course Objectives
The student should be made to:
• Learn Adhoc Network and Sensor Network fundamentals
• Understand the different routing protocols
• Have an in depth knowledge on sensor network architecture
and design issues
• Understand the transport layer and security issues possible in
Adhoc and sensor networks
• Have an exposure to mote programming platforms and tools
6. Course Outcomes
The student would be able to:
• Know the basics of adhoc networks and wireless sensor
networks
• Apply this knowledge to identify the suitable routing
algorithm based on network and user requirement
• Apply the knowledge to identify appropriate physical and
MAC layer protocols
• Understand the transport layer and security issues in adhoc
and sensor networks
• Be familiar with the OS used in Wireless Sensor Networks and
build basic modules
7. PROGRAM OUTCOMES
Engineering Graduates will be able to:
• Engineering knowledge: Apply the knowledge of mathematics, science,
engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.
• Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
• Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified
needs with appropriate consideration for the public health and safety, and the
cultural, societal, and environmental considerations.
• Conduct investigations of complex problems: Use research-based knowledge and
research methods including design of experiments, analysis and interpretation of
data, and synthesis of the information to provide valid conclusions.
• Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to
complex engineering activities with an understanding of the limitations.
• The engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
• Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
8. • Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.
• Individual and team work: Function effectively as an individual, and as a
member or leader in diverse teams, and in multidisciplinary settings.
• Communication: Communicate effectively on complex engineering
activities with the engineering community and with society at large, such
as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear
instructions.
• Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and apply
these to one‘s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
• Life-long learning: Recognize the need for, and have the preparation and
ability to engage in independent and life-long learning in the broadest
context of technological change.
9. Program Specific Outcomes
• To analyze, design and develop solutions by applying
foundational concepts of electronics and communication
engineering.
• To apply design principles and best practices for developing
quality products for scientific and business applications.
• To adapt to emerging information and communication
technologies (ICT) to innovate ideas and solutions to
existing/novel problems.
10. Course Outcome Vs. Program Outcomes and
Program Specific Outcomes Mapping
CO
’S
PO
1
PO
2
PO
3
PO
4
PO
5
PO
6
PO
7
PO
8
PO
9
PO
10
PO
11
PO
12
PS
O1
PS
O2
PS
O3
CO
1
3 3 3 3 3 3 - - - - 3 3 3 1 2
CO
2
3 3 3 2 2 1 - - - - 1 2 2 3 2
CO
3
3 3 2 3 1 2 - - - - 2 1 3 2 3
CO
4
3 3 2 2 3 - - - - 2 2 1 2 2 1
CO
5
3 3 2 2 3 - - - - 2 2 1 2 2 1
3 3 2.4 2.4 2.4 1.2 - - - 0.8 2 1.6 2.4 2 1.8
12. Unit I-ADHOC NETWORKS INTRODUCTION AND
ROUTING PROTOCOLS
Elements of Ad hoc Wireless Networks, Issues in Ad hoc
wireless networks, Example commercial applications of Ad
hoc networking, Ad hoc wireless Internet, Issues in Designing
a Routing Protocol for Ad Hoc Wireless Networks,
Classifications of Routing Protocols, Table Driven Routing
Protocols - Destination Sequenced Distance Vector (DSDV),
On–Demand Routing protocols –Ad hoc On–Demand Distance
Vector Routing (AODV).
13. Introduction
• Introduction -Ad Hoc Network definition
• Characteristic/features and application
• Heterogeneity in Mobile Devices
• Wireless Sensor Networks
• Traffic Profiles
• Types of Ad Hoc Mobile Communications
• Types of Mobile Host Movements
• Challenges Facing Ad Hoc Mobile Networks
• Issues and Challenges Facing Ad Hoc Mobile network
• Ad Hoc wireless Internet
14. A BSS without an AP is called an ad hoc network;
a BSS with an AP is called an infrastructure network
15. What Is an Ad Hoc Network?
• An ad hoc wireless network is a collection of two or more
devices equipped with wireless communications and
networking capability.
• Such devices can communicate with another node that is
immediately within their radio range or one that is
outside their radio range.
• For the latter scenario, an intermediate node is used to
relay or forward the packet from the source toward the
destination.
• Since an ad hoc wireless network does not rely on any fixed
network entities, the network itself is essentially
infrastructure-less. There is no need for any fixed radio
base stations, no wires or fixed routers.
16. • An ad hoc wireless network is self-organizing and adaptive.
• This means that a formed network can be de-formed on-the-
fly without the need for any system administration.
• The term "ad hoc" tends to imply "can take different forms"
and "can be mobile, standalone, or networked.“
• Ad hoc nodes or devices should be able to detect the
presence of other such devices and to perform the necessary
handshaking to allow communications and the sharing of
information and services.
17. Wireless Ad-hoc Network
• A wireless adhoc network is a decentralized type of wireless
network.
• The network is adhoc because it does not rely on a pre-
existing infrastructure, such as routers in wired networks or
access points in managed (infrastructure) wireless networks.
• Each node participates in routing by forwarding data for other
nodes, and so the determination of which nodes forward data
is made dynamically based on the network connectivity.
• In addition to the classic routing, adhoc networks can use
flooding for forwarding the data
18. Mobile Ad Hoc Networks (MANET)
• Selfconfiguring network of mobile routers (and associated
hosts) connected by wireless links
• This union forms a random topology
• Routers move randomly free
• Topology changes rapidly and unpredictably
• Standalone fashion or connected to the larger Internet
• While MANETs are selfcontained, they can also be tied to an
IP-based global or local network–Hybrid MANETs
• Suitable for emergency situations like natural or human-
induced disasters, military conflicts, emergency medical
situations, etc.
19. Issues in Ad-Hoc
• Ad hoc wireless devices can take different forms (for example,
palmtop, laptop, Internet mobile phone, etc.),the
computation, storage, and communications capabilities and
interoperability of such devices will vary tremendously.
• Ad hoc devices should not only detect the presence of
connectivity with neighbouring devices/nodes, but also
identify what type the devices are and their corresponding
attributes.
• Due to the presence of mobility, routing information will have
to change to reflect changes in link connectivity.
• The diversity of ad hoc mobile devices also implies that the
battery capacity of such devices will also vary. Since ad hoc
networks rely on forwarding data packets sent by other
nodes, power consumption becomes a critical issue.
20. INTRODUCTION TO WSN
• A wireless sensor network is one form of an ad hoc wireless
network.
• A sensor network is a collection of a large number of sensor
nodes that are deployed in a particular region.
• Sensors are wirelessly connected and they, at appropriate
times, relay information back to some selected nodes.
• These selected nodes then perform some computation based
on the collected data to derive an ultimate statistic to allow
critical decisions to be made.
• There are a variety of sensors, including acoustic(sound
related) , seismic (Subject to an earthquake or earth
vibration), image, heat, direction, smoke, and temperature
sensors.
21. Basic features of sensor networks
• A large number of low-cost, low-power,multifunctional, and
small sensor nodes
• Sensor node consists of sensing, data processing, and
communicating components
• A sensor network is composed of a large number of sensor
nodes, which are densely deployed either inside the
phenomenon or very close to it.
• The position of sensor nodes need not be engineered or pre-
determined.
• sensor network protocols and algorithms must possess self-
organizing capabilities.
22. • Self-organizing capabilities
• Short-range broadcast communication and multihop routing
• Dense deployment and cooperative effort of sensor nodes
• Frequently changing topology due to fading and node failures
• Limitations in energy, transmit power, memory, and
computing power
24. Sensor Networks Architecture
• Sensor node
• Made up of four basic components
• Sensing unit, Processing unit, Transceiver unit, and Power unit
• Additional application-dependent components
• Location finding system, power generator, and mobilizer
• Scattered in a sensor field
• Collect data and route data back to the sink to Sink
• Communicate with the task manager node (user) via Internet
or satellite
25. Components of Sensor Node
• A sensor node is made up of four basic components
sensing unit
• usually composed of two subunits: sensors and analog to
digital converters (ADCs).
• processing unit,
• Manages the procedures that make the sensor node
collaborate with the other nodes to carry out the assigned
sensing tasks.
• Transceiver unit
• Connects the node to the network.
• Power units (the most important unit)
27. Challenges in Ad Hoc Networks
• Limited wireless transmission range
• Broadcast nature of the wireless medium
• Packet losses due to transmission errors
• Mobility-induced route changes
• Mobility-induced packet losses
• Battery constraints
• Potentially frequent network partitions
• Ease of snooping on wireless transmissions (security hazard)
28. Issues in Ad Hoc Networks
1.Spectrum Allocation and Purchase
2.Medium access scheme
3.Routing
4.Multicasting
5.Transport layer protocol Performance
6.Pricing scheme
7.QoS provisioning
8.Security
9.Energy management
10.Addressing and service discovery
11.Scalability
12.Deployment considerations
29. Spectrum Allocation and Purchase
• FCC control the regulations regarding the use of radio
spectrum.
• Who regulates the use of radio spectrum in INDIA??
• To prevent interference, ad hoc networks operate over
some form of allowed or specified spectrum range.
• Most microwave ovens operate in the 2.4GHz band, which
can therefore interfere with wireless LAN systems.
• Frequency spectrum is not only tightly controlled and
allocated, but it also needs to be purchased.
• With ad hoc networks capable of forming and deforming
on-the-fly, it is not clear who should pay for this spectrum.
30. Medium Access Scheme
• Distributed operation
• Synchronization
• Hidden terminal problem
• Exposed terminal problem
• Throughput
• Access delay
• Fairness: especially for relaying nodes
• Real-time traffic support
• Resource reservation
• Ability to measure resource availability
• Capability for power control
• Adaptive rate control
• Use of directional antennas
31. Routing
• Challenges
• Mobility
• results in path breaks, packet collisions, transient loops, stale
routing information, and difficulty in resource reservation
• BW constraints
• Error-prone and shred channel
• Bit error rate BER:10-5~ 10-3wireless vs. 10-12~ 10-9 wired
• Location-dependent contention
• Distribute load uniformly
32. • The presence of mobility implies that links make and break often
and in an indeterministic fashion.
• Classical distributed Bellman-Ford routing algorithm is used to
maintain and update routing information in a packet radio
network.
• Yet distance-vector-based routing not designed for wireless
networks, still applicable to packet radio networks since the rate
of mobility is not high.
• Mobile devices are now small, portable, and highly integrated.
• Ad hoc mobile networks are different from packet radio networks
since nodes can move more freely, resulting in a dynamically
changing topology.
• Existing distance-vector and link-state-based routing protocols are
unable to catch up with such frequent link changes in ad hoc
wireless networks, resulting in poor route convergence and very
low communication throughput. Hence, new routing protocols are
needed
33. Multicasting
• Multiparty communications are enabled through the presence
of multicast routing protocols.
• The multicast backbone (MBone) comprises an
interconnection of multicast routers that are capable of
tunnelling multicast packets through non-multicast routers.
• Some multicast protocols use a broadcast-and-prune
approach to build a multicast tree rooted at the source .
Others use core nodes where the multicast tree originates.
• All such methods rely on the fact that routers are static, and
once the multicast tree is formed, tree nodes will not move.
However, this is not the case in ad hoc wireless networks.
34. 5. Energy Efficiency
• Mobile devices today are mostly operated by batteries.
Battery technology is still lagging behind microprocessor
technology.
• The lifetime of an Li-ion battery today is only 2-3 hours. Such a
limitation in the operating hours of a device implies the need
for power conservation.
• For ad hoc mobile networks, mobile devices must perform
both the role of an end system (where the user interacts and
where user applications are executed) and that of an
intermediate system (packet forwarding).
• Hence, forwarding packets on the behalf of others will
consume power, and this can be quite significant for nodes in
an ad hoc wireless network.
35. 6. TCP Performance
• TCP is an end-to-end protocol designed to provide flow and
congestion control in a network. TCP is a connection-oriented
protocol ; hence, there is a connection establishment phase
prior to data transmission. The connection is removed when
data transmission is completed.
• TCP(Transmission Control Protocol) assumes that nodes in the
route are static, and only performs flow and congestion
activities at the SRC and DEST nodes.
36. 7. Service Location, Provision, and
Access
• Ad hoc networks comprise heterogeneous devices and
machines and not every one is capable of being a server.
• The concept of a client initiating task requests to a server
for execution and awaiting results to be returned may not
be attractive due to limitations in bandwidth and power.
• Concept of remote programming as used in mobile agents
is more applicable since this can reduce the interactions
exchanged between the client and server over the wireless
media.
• Also, how can a mobile device access a remote service in an
ad hoc network? How can a device that is well-equipped
advertise its desire to provide services to the rest of the
members in the network? All these issues demand
research.
37. 8. Security & Privacy
• Ad hoc networks are intranets and remain as intranets unless
connected to Internet.
• Such confined communications have already isolated
attackers who are not local in the area.
• Through neighbor identity authenication, a user can know if
neighboring users are friendly or hostile.
• Information sent in an ad hoc route can be protected in some
way but since multiple nodes are involved, the relaying of
packets has to be authenicated by recognizing the originator
of the packet and the flow ID or label
38. 9. Deployment Consideration
• Adv. in ad hoc net
• Low cont of deployment
• Incremental deployment
• Short deployment time
• Reconfigurablity
• Scenario of deployment
• Military deployment: data-centric or user-centric
• Emergency operation deployment: hand-held, voice/data, <
100 nodes
• Commercial wide-area deployment: e.g. WMN
• Home network deployment
39. ISSUES IN DESIGNING A ROUTING PROTOCOL
• Mobility
• Bandwidth constraint
• Error prone shared broadcast radio channel
• hidden and exposed terminal problems
• Resource Constraints
40. DSDV
• DSDV: Destination-Sequenced Distance-Vector
• Adds two things to distance-vector routing
• Sequence number; avoid loops
• Damping; hold advertisements for changes of short duration.
41. DSDV routing updates
• Each node periodically transmits updates
• Includes its own sequences number, routing table updates
• Nodes also send routing table updates for important link
changes
• When two routes to a destination received from two different
neighbors
• Choose the one with greatest destination sequence
number
• If equal, choose the smaller metric (hop count)
42. DSDV full dump
• Full Dumps
• Carry all routing table information
• Transmitted relatively infrequently
• Incremental updates
• Carry only information changed since last full
dump
• Fits within one network protocol data unit
• If can’t, send full dump
43. DSDV link addition
When A joins network
–Node A transmits routing table: <A, 101, 0>
–Node B receives transmission, inserts <A, 101, A, 1>
–Node B propagates new route to neighbors <A, 101, 1>
–Neighbors update their routing tables: <A, 101, B, 2> and
continue propagation of information
44. DSDV link breaks
Link between B and D breaks
– Node B notices break
• Update hop count for D and E to be infinity
• Increments sequence number for D and E
– Node B sends updates with new route information
• <D, 203, infinite>
• <E, 156, infinite>
45. DSDV routing updates
• Each node periodically transmits updates
• Includes its own sequences number, routing table updates
• Nodes also send routing table updates for important link
changes
• When two routes to a destination received from two different
neighbors
• Choose the one with greatest destination sequence
number
• If equal, choose the smaller metric (hop count)
46. • Routes maintained through periodic and event triggered
routing table exchanges
• Incremental dumps and settling time used to reduce control
overhead
• Lower route request latency, but higher overhead
• Perform best in network with low to moderate mobility, few
nodes and many data sessions
Problems:
• Not efficient for large ad-hoc networks
• Nodes need to maintain a complete list of routes.
47. AODV(ADHOC ON DEMAND DISTANCE VECTOR
ROUTING)
• DSR includes source routes in packet headers
• Resulting large headers can degrade performance
• When data content is small
• AODV improves on DSR by maintaining routing
tables (reverse paths) at nodes, instead of in
• data packets.
• AODV retains the desirable feature of DSR that
routes are only maintained between
• communicating nodes.
48. • The Ad-hoc On-Demand Distance Vector
• Algorithm
• Descendant of DSDV
• Reactive
• Route discovery cycle used for route finding
• Maintenance of active routing
• Sequence number used for loop prevention and route
freshness criteria
• Provides unicast and multicast communication
49. Goal of AODV
• Quick adaptation under dynamic link
• conditions
• Lower transmission latency
• Consume less network bandwidth (less broadcast)
• Loop-free property
• Scalable to large network
50. AODV – unicast route discovery
• RREQ (route request) is broadcast
• Sequence Number:
• Source SN: freshness on reverse route to source
• Destination SN: freshness on route to destination RREQ
message
• <bcast_id, dest_ip, dest_seqno, src_seqno, hop_count>
RREP (route reply) is unicast back
• From destination if necessary
• From intermediate node if that node has a recent route
51. AODV multicast route discovery
• Message types
• RREQ, with new flags:
• Join and Repair
• RREP
• MACT (Multicast activation message)
• Multicast routes have destination
• sequence number and multiple next hops
• Multicast group leader extension for RREQ
and RREP
52. AODV route discovery
Node S needs a route to D
2. Create a route request (RREQ)
– Enters D’s IP address, sequence number, S’s IP
address, sequence number
– Broadcasts RREQ to neighbors
53. Node A receives RREQ
Makes reverse route entry for S
• Dest = S, nexthop = S, hopcount = 1
It has no route to D, so it broadcasts RREQ
4. Node C receives RREQ
Makes reverse route entry for S
• Dest = S, nexthop = A, hopcount = 2
It has route to D && seq# for route D > seq# in RREQ
• Creates a route reply (RREP)
Enters D’s IP address, sequence number, S’s IP address,
hopcount
• Unicasts RREP to A
54. Node A receives RREP
– Unicasts RREP to S
– Makes forward route entry to D
• Dest = D, nexthop = C hopcount = 2
6. Node S receives RREP
– Makes forward route entry to D
• Dest = D, nexthop = A hopcount = 3
– Sends data packets on route to D
55. Link between C and D breaks
– Node C invalidates route to D in routing table
– Node C creates route error (RERR) message
• Lists all destinations with are now unreachable
• Sends to upstream neighbors
– Node A receives RERR
• Checks whether C is its next hop on route to D
• Deletes route to D, and forwards RERR to S
AODV --- route maintenance (1)
56. AODV --- route maintenance (2)
Node S receives RERR
• Checks whether A is its next hop
on route to D
• Deletes route to D
• Rediscovers route if still needed
57. AODV --- Optimizations
• Expanding ring search
• Prevents flooding of network during route discovery
• Control Time to Live of RREQ
• Local repair
• Repair breaks in active routes locally instead of notifying
source
• Use small TTL because destination probably has not
moved far
• If first repair attempt is unsuccessful, send RERR to
source
58. • Reactive / On-demand
• Sequence numbers used for route freshness
and loop prevention
• Route discovery cycle
• Maintains only active routes
• Optimization can be used to reduce overhead
and increase scalability
59. Summary
• Discussed about the basic concepts of adhoc networks
• Had a thorough knowledge on the routing protocols and its
classification
• Learned about the various protocols
60. Assignments
S.No Assignment Topic K Level
1. Issues in designing a
routing protocol fro Adhoc
Wireless Networks
K3
2. Analyze the Commercial
applications of Adhoc
networking
K4
3. Design a wireless network
for commercial
applications
K5
61. Quiz
1.The mobile nodes add or leave a mobile adhoc network , changing the _______ of this network over
time.
a.Infrastructure
b.Topology
c. Transmission range
d.Transmission speed
2. Mobile adhoc networks are less secure because___
a.The nodes are autonomous
b.The MANET is a centralized network
c. The MANET uses multihop transmission
3. Providers of certain types of services on a network are called ?
a.Routing
b.database
c.Corba
d.Server
4. Here are the types of adhoc network except
a.WARNET
b.WANET
c.MANET
d.VANET
5.Can adhoc network be used by multiple devices?
a.yes,because adhoc is a WLAN network
B yes, adhoc is a WAN network
c.It cant because adhoc is one of the WLAN network
62. 6.Strength of signal doesn’t depend upon which of the following factors?
a) Energy flux
b) Dwell time
c) Altitude
d) Reflection
7.Which of the following indicates the correct set of bands operated in LISS- III
satellite?
a) Visible ray, near IR
b) Near IR, radio wave
c) Radio wave, near IR
d) Far IR, near IR
8.Energy flux may affect which of the following?
a) Lens
b) Strength of the signal
c) Aperture
d) Declination
9.Which of the following can merge the imagery of LISS-III and PAN?
a) IRS 1B
b) IRS 1A
c) IRS 1C
d) IRS multi sensor
10.Which among the following indicates the correct expansion of WiFS?
a) Wide Field Sensor
b) Wireless Fidelity Sensor
c) Wide Fidelity Sensor
d) Wireless Field Sensor
63. 11.IRS P3 satellite uses which of the following sensors?
a) PAN
b) LISS-III
c) MOS
d) LISS-II
12.PAN sensor uses two band operators.
a) True
b) False
13.While mapping land use and land cover, which scale is recommended?
a) 1: 25000
b) 1: 50000
c) 1: 250000
d) 1: 25
14.The sensor used in the digital elevation model can identify contour
heights greater than _____
a) 5 m
b) 30 m
c) 20 m
d) 10 m
15.IRS 1A and 1B satellites can carry which of the following sensors?
a) LISS-IV
b) LISS-III
c) LISS-I
d) LISS-V
64. 16.Which of the following indicates the correct set of M’s used in the case of GIS?
a) Manipulating, monitoring, mapping, modeling
b) Measuring, manipulating, mapping, modeling
c) Measuring, monitoring, marketing, modeling
d) Measuring, monitoring, mapping, modeling
17.Which of the following works involves modeling?
a) Tectonic plate movement
b) Drainage network
c) Roadway line
d) Railway line
18.Mapping involves which of the following?
a) Soil details
b) Boundary details
c) Cadastral details
d) Population details
19.In which aspect of agriculture GIS is used?
a) Soil analysis
b) Seed requirement
c) Fertilizer
d) Pesticides
20.Which of the following software can be used in case of property tax assessment?
a) STAAD Pro
b) Revit
c) Remote sensing
d) GIS
65. 21.Which of the following software’s are used for developing vehicle route?
a) Autodesk Revit
b) STAAD Pro
c) GIS
d) Remote sensing
22.Population forecast can be done by using GIS.
a) False
b) True
23.Which of the following is not a property of coordinate in GIS?
a) Line of sight
b) Origin
c) Axis
d) Units of measurement
24.Which of the following represents the correct set of coordinate
classification in GIS?
a) Spherical, projected systems
b) Geographic, projected systems
c) Geographic, spherical systems
d) Geographic, geometric systems
25.Longitudes are used to represent which of the following directions?
a) North–East
b) South
c) North
d) East
66. 26.Which of the following are transport layer protocols used in networking?
a) TCP and FTP
b) UDP and HTTP
c) TCP and UDP
d) HTTP and FTP
27.User datagram protocol is called connectionless because _____________
a) all UDP packets are treated independently by transport layer
b) it sends data as a stream of related packets
c) it is received in the same order as sent order
d) it sends data very quickly
28.Transmission control protocol ___________
a) is a connection-oriented protocol
b) uses a three way handshake to establish a connection
c) receives data from application as a single stream
d) all of the mentioned
29.An endpoint of an inter-process communication flow across a computer network
is called __________
a) socket
b) pipe
c) port
d) machine
30. Socket-style API for windows is called ____________
a) wsock
b) winsock
c) wins
d) sockwi
67. Unit II-SENSOR NETWORKS – INTRODUCTION &
ARCHITECTURES
Enabling technology for WSN-Wireless Sensor Network
applications , eg. Single node architecture, Hardware
components, energy consumption of sensor nodes, network
architecture-sensor network scenarios, transceiver design
considerations, optimization goals and figures of merit.
68. Wireless Sensor Network
• A wireless sensor network (WSN) is a wireless network
• consisting of spatially distributed autonomous devices using
• sensors to cooperatively monitor physical or environmental
• conditions, such as temperature, sound, vibration, pressure,
• motion or pollutants, at different locations.
• A collection of sensing devices that can communicate
• wirelessly.
69. Wireless Sensor Network Architecture
Architecture for a WSN
• Special addressing requirement
• Local unique addresses
• Data-centric
• Example: Each node has an unique number.
• Attribute-based naming architecture
• Data is named by one or more attributes.
• Example: Each node is distinguished by an attribute – GPS
sensors are practical for this.
71. Wireless Sensor Node
sensor
• A transducer
• converts physical phenomenon e.g. heat, light, motion, vibration,
and
• sound into electrical signals
sensor node
• basic unit in sensor network
• contains on-board sensors, processor, memory, transceiver, and
• power supply
sensor network
• consists of a large number of sensor nodes
• nodes deployed either inside or very close to the sensed
phenomenon
73. Characteristics
• Power consumption constraints for nodes using
• batteries or energy harvesting
• Ability to cope with node failures (resilience)
• Mobility of nodes
• Heterogeneity of nodes
• Scalability to large scale of deployment
• Ability to withstand harsh environmental conditions
• Ease of use
• Cross-layer design
74. Factors Influencing WSN Design
• Fault tolerance
• Scalability
• Production costs
• Hardware constraints
• Sensor network topology
• Environment
• Transmission media
• Power Consumption
• Sensing
– Communication
– Data processing
75. Applications
• Military Applications
• Environmental Applications
• Health Applications
• Home and Office Applications
• Automotive Applications
• Other Commercial Applications
Advantages
• It avoids a lot of wiring .
• It can accommodate new devices at any time .
• It's flexible to go through physical partitions .
• It can be accessed through a centralized monitor
76. Disadvantages
• Lower speed compared to wired network.
• Less secure because hacker's laptop can act as Access Point. If
you connected to their laptop, they'll read all your
information (username, password.. etc).
• More complex to configure than wired network.
• Gets distracted by various elements like Blue-tooth .
• Still Costly at large.
• It does not make sensing quantities in buildings easier.
• It does not reduce costs for installation of sensors.
• It does not allow us to do more than can be done with
a wired system
77. Energy consumption of sensor nodes
Power breakdown
• The communication subsystem > computation subsystem
• The radio energy consumption is of the same order in the
reception = transmission = and idle
• states, while the power consumption drops of at least one
order of magnitude in the sleep state.
• Depending on the specific application, the sensing subsystem
might be another significant source of energy consumption
78. Design considerations
Heterogeneity
• The devices deployed may be of various types and need to
collaborate with each other.
Distributed Processing
• The algorithms need to be centralized as the processing is carried
out on different nodes.
Low Bandwidth Communication
• The data should be transferred efficiently between sensors
Large Scale Coordination
• The sensors need to coordinate with each other to produce
required results.
Utilization of Sensors
• The sensors should be utilized in a ways that produce the maximum
performance and use less energy.
Real Time Computation
• The computation should be done quickly as new data is always
being generated.
79. Optimization goals and figure of merit
• Collect data at regular intervals.
• Then transform data into an electrical signal.
• Finally, send the signals to the sink or the base nod.
80. Summary
• Learned about sensor network and its architecture
• Discussed about the design considerations and WSN examples
• Had a thorough knowledge on the enabling technologies for
wireless sensor networks
81. Assignment
S.No Assignment Topic K Level
1 Compare the
performance of the
hardware
components used
in single node
architecture.
K3
2 Explain the
transceiver design
considerations in
sensor networks.
K4
3 Design and explain
a suitable example
for wireless sensor
networks.
K5
82. Quiz
1.What is the access point (AP) in a wireless LAN?
a) device that allows wireless devices to connect to a wired network
b) wireless devices itself
c) both device that allows wireless devices to connect to a wired network and wireless devices itself
d) all the nodes in the network
2.In wireless ad-hoc network _________
a) access point is not required
b) access point is must
c) nodes are not required
d) all nodes are access points
3.Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?
a) CDMA
b) CSMA/CA
c) ALOHA
d) CSMA/CD
4.In wireless distribution system __________
a) multiple access point are inter-connected with each other
b) there is no access point
c) only one access point exists
d) access points are not required
5.A wireless network interface controller can work in _______
a) infrastructure mode
b) ad-hoc mode
c) both infrastructure mode and ad-hoc mode
d) WDS mode
83. 6.In wireless network an extended service set is a set of ________
a) connected basic service sets
b) all stations
c) all access points
d) connected access points
7.Mostly ________ is used in wireless LAN.
a) time division multiplexing
b) orthogonal frequency division multiplexing
c) space division multiplexing
d) channel division multiplexing
8.Which one of the following event is not possible in wireless LAN?
a) collision detection
b) acknowledgement of data frames
c) multi-mode data transmission
d) connection to wired networks
9.What is Wired Equivalent Privacy (WEP)?
a) security algorithm for ethernet
b) security algorithm for wireless networks
c) security algorithm for usb communication
d) security algorithm for emails
10.What is WPA?
a) wi-fi protected access
b) wired protected access
c) wired process access
d) wi-fi process access
84. 11._____________ allows LAN users to share computer programs and data.
a) Communication server
b) Print server
c) File server
d) Network
12.STP stands for _________
a) Shielded twisted pair cable
b) Spanning tree protocol
c) Static transport protocol
d) Shielded two power cable
13.The __________ portion of LAN management software restricts access, records
user activities and audit data etc.
a) Configuration management
b) Security management
c) Performance management
d) Recovery management
14.What is the max cable length of STP?
a) 100 ft
b) 200 ft
c) 100 m
d) 200 m
15.What is the max data transfer rate of STP?
a) 10 mbps
b) 100 mbps
c) 1000 mbps
d) 10000 mbps
85. 16.Which connector does STP use?
a) BNC
b) RJ-11
c) RJ-45
d) RJ-69
17.What is the central device in star topology?
a) STP server
b) Hub/switch
c) PDC
d) Router
18.What is the max data transfer rate for optical fiber cable?
a) 10 mbps
b) 100 mbps
c) 1000 mbps
d) 10000 mbps
19.Which of the following architecture uses CSMA/CD access method?
a) ARC net
b) Ethernet
c) Router
d) STP server
20.Both HDLC and PPP are Data link layer protocols.
a) True
b) False
86. 21.Which protocol does the PPP protocol provide for handling the capabilities of the
connection/link on the network?
a) LCP
b) NCP
c) Both LCP and NCP
d) TCP
22.PPP provides the _______ layer in the TCP/IP suite.
a) Link
b) Network
c) Transport
d) Application
23.PPP consists of ________components
a) Three (encapsulating, the Domain Name system)
b) Three (encapsulating, a link control protocol, NCP)
c) Two (a link control protocol, Simple Network Control protocol)
d) One (Simple Network Control protocol)
24.The PPP encapsulation ____________
a) Provides for multiplexing of different network-layer protocols
b) Requires framing to indicate the beginning and end of the encapsulation
c) Establishing, configuring and testing the data-link connection
d) Provides interface for handling the capabilities of the connection/link on the
network
25.A Link Control Protocol (LCP) is used for ____________
a) Establishing, configuring and testing the data-link connection
b) Establishing and configuring different network-layer protocols
c) Testing the different network-layer protocols
d) Provides for multiplexing of different network-layer protocols
87. 26.A family of network control protocols (NCPs) ____________
a) Are a series of independently defined protocols that provide a dynamic
b) Are a series of independently-defined protocols that encapsulate
c) Are a series of independently defined protocols that provide
transparent
d) The same as NFS
27.Choose the correct statement from the following.
a) PPP can terminate the link at any time
b) PPP can terminate the link only during the link establishment phase
c) PPP can terminate the link during the authentication phase
d) PPP can terminate the link during the callback control phase
28.The link necessarily begins and ends with this phase. During the ______
phase, the LCP automata will be in INITIAL or STARTING states.
a) Link-termination phase
b) Link establishment phase
c) Authentication phase
d) Link dead phase
29.An RPC (remote procedure call) is initiated by the _________
a) server
b) client
c) client after the sever
d) a third party
88. Unit III- WSN NETWORKING CONCEPTS AND
PROTOCOLS
• MAC protocol for Wireless Sensor Networks-Low Duty Cycle
protocol & wakeup concepts-SMAC-Mediation device
protocol, contention based protocol,PAMAS-schedule based
protocol,LEACH-IEEE 802.15.4 MAC protocol-Routing protocol-
Energy Efficient routing-challenges and issues in transport
layer protocol
89. MAC Protocol for WSN
• Schedule- vs. contention-based MACs
• Schedule-based MAC
• A schedule exists, regulating which participant may use which resource
at which time (TDMA component)
• Typical resource: frequency band in a given physical space (with a given
code, CDMA)
• Schedule can be fixed or computed on demand
• Usually: mixed – difference fixed/on demand is one of time scales
• Usually, collisions, overhearing, idle listening no issues
• Needed: time synchronization!
• Contention-based protocols
• Risk of colliding packets is deliberately taken
• Hope: coordination overhead can be saved, resulting in overall improved
efficiency
• Mechanisms to handle/reduce probability/impact of collisions required
• Usually, randomization used somehow
90. Contention-Based MAC
• Basic ideas for a distributed MAC
• ALOHA – no good in most cases
• Listen before talk (Carrier Sense Multiple Access, CSMA) –better,
but suffers from sender not knowing what is going on at receiver,
might destroy packets despite first listening for a
• Receiver additionally needs some possibility to inform possible
senders in its vicinity about impending transmission (to “shut them
up” for this duration)
Sensor-MAC (S-MAC)
• MACA’s idle listening is particularly unsuitable if average data rate is
low
• Most of the time, nothing happens
• Idea: Switch nodes off, ensure that neighboring nodes turn on
simultaneously to allow packet exchange (rendez-vous)
91. • Only in these active periods, packet exchanges happen
• Need to also exchange wakeup schedule between neighbors
• When awake, essentially perform RTS/CTS
• Use SYNCH, RTS, CTS phases
S-MAC synchronized islands
• Nodes try to pick up schedule synchronization from neighboring nodes
• If no neighbor found, nodes pick some schedule to start with
• If additional nodes join, some node might learn about two different
schedules from different nodes “Synchronized islands”
Power Aware Multiaccess with Signaling – PAMAS
Idea: combine busy tone with RTS/CTS
• Results in detailed overhearing avoidance, does not address idle
listening
• Uses separate data and control channels
Procedure
• Node A transmits RTS on control channel, does not sense channel
• Node B receives RTS, sends CTS on control channel if it can receive and
does not know about ongoing transmissions
• B sends busy tone as it starts to receive data
92. PAMAS – Already ongoing transmission
• Suppose a node C in vicinity of A is already receiving a packet when A
initiates RTS
• Procedure
• A sends RTS to B
• C is sending busy tone (as it receives data)
• CTS and busy tone collide, A receives no CTS, does not send data
Low-Energy Adaptive Clustering Hierarchy (LEACH)
• Given: dense network of nodes, reporting to a central sink,
• each node can reach sink directly
• Idea: Group nodes into “clusters”, controlled by clusterhead
• Setup phase; details: later
• About 5% of nodes become clusterhead (depends on scenario)
• Role of clusterhead is rotated to share the burden
• Clusterheads advertise themselves, ordinary nodes join CH with strongest
signal
• Clusterheads organize
• CDMA code for all member transmissions
• TDMA schedule to be used within a cluster
93. Low-Energy Adaptive Clustering Hierarchy (LEACH)
In steady state operation
• CHs collect & aggregate data from all cluster members
• Report aggregated data to sink using CDMA
94. SMACS
• Given: many radio channels, super frames of known length
• (not necessarily in phase, but still time synchronization
required!)
• Goal: set up directional links between neighboring nodes
• Link: radio channel + time slot at both sender and receiver
• Free of collisions at receiver
• Channel picked randomly, slot is searched greedily until a collision free slot
is found
• Receivers sleep and only wake up in their assigned time slots, once per
super frame
• In effect: a local construction of a schedule
SMACS link setup
• Case 1: Node X, Y both so far unconnected
• Node X sends invitation message
• Node Y answers, telling X that is unconnected to any other node
• Node X tells Y to pick slot/frequency for the link
• Node Y sends back the link specification
95. SMACS link setup
• Case 2: X has some neighbors, Y not
• Node X will construct link specification and
instruct Y to use it (since Y is unattached)
• Case 3: X no neighbors, Y has some
• Y picks link specification
• Case 4: both nodes already have links
• Nodes exchange their schedules and pick free slots/frequencies in
mutual agreement
96. IEEE 802.15.4
• IEEE standard for low-rate WPAN applications
• Goals: low-to-medium bit rates, moderate delays without too stringent guarantee
requirements, low energy consumption
• Physical layer
• 20 kbps over 1 channel @ 868-868.6 MHz
• 40 kbps over 10 channels @ 905 – 928 MHz
• 250 kbps over 16 channels @ 2.4 GHz
• MAC protocol
• Single channel at any one time
• Combines contention-based and schedule-based schemes
• Asymmetric: nodes can assume different roles
IEEE 802.15.4 MAC overview
• Star networks: devices are associated with coordinators
• Forming a PAN, identified by a PAN identifier
• Coordinator
• • Bookkeeping of devices, address assignment, generate beacons
• • Talks to devices and peer coordinators
• • Beacon-mode superframe structure
• • GTS assigned to devices upon request
98. Transport Layer Protocol
• TCP dominates in wired Internet with the trac share in between
80%-90%.
• It is characterized by the following properties:
• TCP is reliable;
• TCP incorporates congestion control mechanism;
• TCP incorporates end-to-end flow control mechanism.
• The following observations can be made concerning ad-hoc
networks:
• it is preferable to seamlessly integrate TCP in ad-hoc networks:
• to enable seamless operation of higher layer protocols such as FTP,
SMTP, HTTP.
• if not, to make as less modications to TCP as possible:
• to make "wireless" and "wired" TCPs understand each other
seamlessly.
• if not, to split the TCP into wireless and wired part:
• to concentrate internetworking functions in gateways.
100. Traditional TCP
• The major responsibilities of TCP in an active session are to:
• provide reliable in-order transport of data:
• {to not allow losses of data.
• control congestions in the networks:
• to not allow degradation of the network performance.
• control a packet flow between the transmitter and the receiver:
• to not exceed the receiver's capacity.
• In general, we distinguish between the following operational phases
in TCP:
• slow-start phase (also known as exponential start);
• congestion avoidance phase;
• congestion control phase;
• fast retransmit phase;
• fast recovery.
102. Summary
• Learned MAC protocols for wireless sensor networks
• Discussed about the various MAC protocols architecture and
frame structures
• Had a thorough knowledge on the energy efficiency of MAC
protocols
103. Assignment
S.No Assignment Topic K Level
1 Compare the different
WSN protocols
K3
2 Analyze the energy
efficiency of routing
protocols.
K4
3 Design a low duty cycle
protocol and explain its
wakeup concepts.
K5
104. Quiz
1.Hardware address is known as _________
a) MAC address
b) IP Address
c) Network Interface Card
d) Address Resolution Protocol
2.MAC stands for ________
a) Media Area Control
b) Memory Access Control
c) Memory Area Control
d) Media Access Control
3.What translates IP address into MAC address?
a) Organizationally Unique Identifier
b) Address Resolution Protocol
c) Network Interface Card
d) Burned In Address
4.Networking Hardware Address is referred with ________
a) IP address
b) MAC address
c) NIC
d) Organizationally Unique Identifier
5.Does MAC address contain characters.
a) True
b) False
105. 6.MAC addresses are very useful in diagnosing network issues.
a) True
b) False
7.On wireless networks ________ filtering is the security measure.
a) OUI
b) IP
c) NIC
d) MAC
8.MAC addresses are used as ________
a) Network addresses
b) IP address
c) Hardware address
d) Burned in address
9.IEEE standards for Institute of Electrical and Electronics Engineers.
a) False
b) True
10.The original IEEE 802 MAC address comes from________
a) MAC address
b) IP address
c) Ethernet address
d) Http
106. 11.Gateway provides the connection between _________ and _________
a) Cloud and controller
b) Network and Cloud
c) Network and Controller
d) Controller and device
12.A sensor uses which network?
a) LAN and HAN
b) HAN and PAN
c) LAN and PAN
d) LAN, PAN and HAN
13.Gateway software should be smart enough to handle ___________
a) GPS
b) Message
c) Logging
d) Sensors
14.Number of approaches gateway can be installed?
a) 2 approaches
b) 3 approaches
c) 2 approaches
d) 2 approaches
15.Drawback of Factory Bootstrap?
a) It should not have many gateways
b) It should not have many devices
c) Complex circuit can’t be handled
d) It should have many gateways
107. 16.Transport layer aggregates data from different applications into a single stream
before passing it to ____________
a) network layer
b) data link layer
c) application layer
d) physical layer
17.Which of the following are transport layer protocols used in networking?
a) TCP and FTP
b) UDP and HTTP
c) TCP and UDP
d) HTTP and FTP
18.User datagram protocol is called connectionless because _____________
a) all UDP packets are treated independently by transport layer
b) it sends data as a stream of related packets
c) it is received in the same order as sent order
d) it sends data very quickly
19.Transmission control protocol ___________
a) is a connection-oriented protocol
b) uses a three way handshake to establish a connection
c) receives data from application as a single stream
d) all of the mentioned
20.An endpoint of an inter-process communication flow across a computer network
is called __________
a) socket
b) pipe
c) port
d) machine
108. 21.Socket-style API for windows is called ____________
a) wsock
b) winsock
c) wins
d) sockwi
22.Which one of the following is a version of UDP with congestion control?
a) datagram congestion control protocol
b) stream control transmission protocol
c) structured stream transport
d) user congestion control protocol
23.A _____ is a TCP name for a transport service access point.
a) port
b) pipe
c) node
d) protocol
24.Transport layer protocols deals with ____________
a) application to application communication
b) process to process communication
c) node to node communication
d) man to man communication
25.Which of the following is a transport layer protocol?
a) stream control transmission protocol
b) internet control message protocol
c) neighbor discovery protocol
d) dynamic host configuration protocol
109. 26.What are the functions of the transport layer?
a) Multiplexing/ Demultiplexing
b) Connection less Services
c) Connection oriented service
d) Congestion control
27.Which services are provided by transport layer?
a) Error control
b) Connection service
c) Connection less service
d) Congestion control
28.TCP and UDP are called ________
a) Application protocols
b) Session protocols
c) Transport protocols
d) Network protocols
29.Security based connection is provided by which layer?
a) Network layer
b) Session layer
c) Application layer
d) Transport layer
30.TCP is the standard protocol with std no?
a) 5
b) 4
c) 7
d) 3