1/28/2012

ADHOC NETWORKS
1

INTRODUCTION
Adhoc networks are formed by devices that are able to communicate with each other using a wireless physical medium without having to resort to pre-existing network infrastructure. These are also known as MANETS ie Mobile Adhoc Networks.

Fundamental characteristics of ADHOC networks

They are able to configure themselves on the fly without the intervention of a centralized administration. The terminals in ADHOC networks can function not only as end systems (executing applications, sending information) as source nodes and receiving the data as destination nodes. They also act as intermediate system i.e. forwarding the packets from the other nodes. Adhoc networks are also called multihop wireless networks.

Adhoc networks
Compared to cellular networks adhoc networks are more adaptive to changing demands and physical conditions. Attenuation characteristics of wireless networks are non linear. Energy efficiency will be potentially superior and the increased spatial reuse will yield superior capacity with increased spectral efficiency. These characteristics make adhoc networks attractive and is tightly linked to heterogeneous network and 4G architecture.

Challenges in adhoc networks

The need for self configurability and flexibility at various levels i.e. (Dynamic Routing or distributed MAC arrangements). Gross layer optimization can significantly improve the system performance.

Classification of adhoc networks

ADHOC networks are classified as follows

Body

area network (BAN)

It is the set of variable devices that have a communication range of 2 meters.

Personal area network (PAN)

It refers to the communication between different BANs , between a BAN and its intermediate surroundings. Range of communication is approx 10 meters .

 Wireless

local area network (WLAN)

WLAN has the range of 100s of meters. For WLAN the main option is the family of standards i.e. IEEE 802.11 The main existing technology for implementing BANs and PANs is Bluetooth.

Routing is the most active research field in the adhoc networks as it is related with different communication layers . Minimizing the hops is no longer the objective of the routing algorithm but optimization of multiple parameters such as packets error rate over the route, energy consumption, network survivability, routing overheads, possibility of establishing a parallel route.

Use of TCP over wireless links poses many problems .it results in additional problems for wireless links. Communication over wireless Route failures lead to unnecessary congestion control. MAC congestion reduces throughput on longer routes.

Power awareness

: since most of the w/l terminals can be expected to have limited energy storage, power awareness is very important. This subject spans over several communication layers so attention is given to different power saving approaches. The objectives are not only the reduction of transmission power but also the management of sleep states or extention of network survivability through the routing which isenergy aware ..

However if the medium remains idle for this period the station will go to the back off state. When entering the back off state MS selects aback off interval (BI) between zero and the contention window period (CW). CW is the integer no of basic tine slots, if the medium remains idle for the duration of BI time (i.e the value of chosen BI minus the elapsed time since entering the back off state).

CSMA CD
Carrier

sensed multiple access technique/collision detection.

When the mobile gets a frame to transmit, it first senses the channel to determine whether another MS is transmitting. If MS senses the channel to be idle for a period which is equal to the inter space frame, then it starts transmitting the frame.

When it senses the channel to be busy it will differ the transmission and the station will keep on sensing the channel. At the point of time when the media becomes idle the station will continue sensing and will wait for the period which is equal to inter frame space to elapse again. If the medium becomes busy during this period, the station will go to the deffering state again.

Collision will occur if two or more MSs select the same BI provided the condition stated above , that the frame coexist spatially at one or more of the receiving stations. When the collision occurs the station that have caused the collision senses the medium again for the inter frame space and go again to back off state. Selecting a new BI. Randomly with the value of contention window period doubled

The other station which stored their remaining BI times also waits for inter frame space and then go to the back off state.

Basic principal
Mobile devices communicate in Peer to Peer fashion. Self organizing network without the need to fixed network infrastructure. Multihop communication. Decentralized mobility-adaptive operation. This is the art of networking without a network .

Applications
Accident warning Floating car data Multihop extensions of Info stations. Application for wireless sensor networks Temperature. Measurement details Detect vibrations Make photos. Environmental monitoring Intrusion detection , detection of bush fires , earth quake warning.

ADHOC NETWORKS
1/28/2012

Medical sector : Monitoring of body functions and Implants. Biological sector : Animal tracking , undersea exploration Industrial sector : Remote sensing in power plants Home automation : Remote monitoring of resources such as Electricity , Water and Gas Aerospace sector : Sensor equipped Robots on a plant
18

1/28/2012

Key advantages :y y y

No expensive infrastructure must be involved. Making use of unlicensed frequency spectrum. Quick distribution of information around sender.

19

 KEY CHALLENGES
1/28/2012

All network entities must be mobile requirement of very dynamic technology.

Network functions must have high degree of adaptability (mobility , outage).

No central entities operation in completely distributed manner.

20

ROUTING FOR ADHOC MOBILE NETWORKS :

1/28/2012

Well known routings are:

Link state routing Distance vector routing

The Pro-active approach for routing

Always maintain all routes

Problems :

Topologies changes

significant network traffic

21

Even when the route is not used

UNICAST ROUTING PROTOCOLS :

1/28/2012

Many protocols have been proposed some have been invented specifically for MANETs other are adopted from previously proposed protocols for wired networks.

No single protocol works well in all environments. Some attempts made to develop adaptive protocols.

22

ROUTING PROTOCOLS :
1/28/2012

Proactive
y y

Protocols :

Determines the route independent of traffic pattern Traditionally link state and distance vector routing protocols are proactive

Reactive
y

protocols :

Maintain routes only if needed

Hybrid
y

protocols :
23

Combines Pro-active and re-active elements

1/28/2012

Position

based protocols

Use the geographic position of nodes for forwarding decisions

24

TRADE OFF
1/28/2012

Latency of route discovery Proactive protocols may have lower latency since the routes are maintained at all times

Reactive protocols may have higher latency because a route from X to Y will be found only when X attempts to send Y

Overhead of route discovery /maintenance

25

1/28/2012

Reactive protocols may have lower overhead since routes are determined only if needed

Proactive protocols can (but not necessarily) result in higher overhead due to continuous route updating

Which of the protocols achieve a better trade off depends on the traffic and mobility patterns

26

FLOODING FOR DATA DELIVERY

1/28/2012

Sender S broadcast data packet P to all neighbours Each node receiving P forwards P to its neighbours Sequence no's are used which avoid the possibility of forwarding the same packet more than once

Packet P reaches the destination D provided that D is reachable from sender S

27

S E

Node D does not forward a packet

1/28/2012

B H

J A C K I L G M

i.e. S represent a node that has received packet P represents that connected nodes are within each other transmission range

D
28

RELIABILITY OF ADHOC NETWORKS

1/28/2012

Wireless links are prone to errors Either because of interference y Or because of collisions (collision detection does not work for half duplex networks)
y

High packet loss rate detrimental to transport layer performance

29

THE MECHANISM ARE NEEDED TO INCREASE THE RELIABILITY :

1/28/2012

Forward error correction (FEC) include the redundancy in the packet

Automatic repeat request (ARQ) use acknowledgements and re-transmission y ARQ for multi hop AD-HOC networks Implicit assumptions :y Packet loss is caused by interference or collisions y Retransmission seems to be appropriate

30

WHAT HAPPENS IF PACKET LOSS OCCURS DUE TO

A NODE LEAVING THE TRANSMISSION RANGE
1/28/2012

i. ii.

Multiple re-transmission before a sender gives up Massive increase in network congestion

Unlikely
y

No route discover strategies favour shortest (i.e. minimal) path

Note:- Broadcast (used for rote discovery) are not

31

protected by ARQ

PROBLEM WITH RANGES FOR MULTI-HOP ADHOC NETWORKS :

1/28/2012

1. 2.

Large interference , dramatically reduces the capacity Ranges depend on the transmission rate
Low rate less vulnerable to interference

3.

Broadcast use a lower rate than Uni casts in IEEE 802.11

( to make the transmission more reliable)

4. 5.

Broadcasts are used for route discovery Uni casts used for data delivery
32

CONSEQUENCES :1/28/2012

Routes found via broadcast may not be usable for data traffic y It is called Grey zone IEEE 802.11 is used and will be used for multi hop ADHOC networks Inter-vehicle communication Also as access networks It is certainly not optimal : focus is on single hop networks There are many pit falls when blindly using existing MAC mechanism There is also the need & integrated routing /MAC approach Building a new MAC is hard and expensive

33

SECURITY IN MOBILE ADHOC NETWORKS

1/28/2012

1.

Security needs and threats Privacy /Anonymity features and need

Confidentiality sort off

Security features and need

Dependability features and need

Subject /object authentication Data integrity

Availability

No unauthorized Availability dissemation of personal data Location , Address ,service privacy

34

Accountability

NETWORK SECURITY SEEN AS CUSTOMERPROVIDER RELATIONSHIP

1/28/2012

End user perspective : wants secure end to end communication Operator perspective : Has to provide secure n/w organization as basis for offering a secure communication service

Attack types and building blocks of counter measures

y y y y

Passive attack Get content Profiling Other types of attacks

- Fabricating or stealing of packets - modification of packets -Active attacks

35

SECURITY GOALS WITH RESPECT TO ADHOC ROUTING

1/28/2012

Routing signaling cannot be spoofed Fabricating routing messages can not be integrated in the network Routing messages cannot be altered in transit except according to the normal functionality of the routing protocol Routing loops cannot be formed through malicious action route cannot be re-directed from the shortest path by malicious action

Managed open environment

36

Unauthorized nodes should be excluded from route computation and discovery

 Managed hostile environment The network topology must be exposed neither to adversaries nor to authorized nodes by the routing messages
1/28/2012

The solutions for secure routing

ARAN : Authenticated routing for Adhoc networks Assumptions : MOE (Managed Open Environment ) Trusted certificate server to its public key is known to all nodes Each nodes has non certificate signed by T
37

Counter measures used are :

1/28/2012

Cryptography Monitoring Difference in service classes and ADHOC network 1)Key managed infrastructure 2)Intrusion detection 3)Single administration domain 4)Transiently unavailable Only local monitoring Multiple domains , no clear line of defense
38

ADHOC SPECIFIC ATTACK TYPES ARE AS FOLLOWS :

1/28/2012

Equipment/battery : no obvious line of defense ,Side channel attacks

Radio jamming DLC : attacks on MAC , MAC address Routing : no infrastructure support , no clear line of defense

Co-ordination : based on principal of mutual assistance , simple attacks and packet drops
39

Security procedures:
1/28/2012

Route y Signed discovery packet (RDP) propagates to sought destination y Destination sends back signed route reply (REP) y At each hop the following action is taken Validation of original signature Validation of last hop signature When last hop is neither source nor destination replace the last hop signature by your own signature
40

ARAN (authentication routing for ADHOC networks )

1/28/2012

check list : Unauthorized participation , managed by trusted authority Spoofed route signaling everything is signed Fabricated routing messages

41