CSC 413 Part 2
CSC 413 Part 2
WIRELESS NETWORK
Wireless Network
Wireless networks are s i m p l y computer networks that are connected without cables of any kind.
The use of a wireless network enables enterprises to avoid the costly process of introducing cables
into buildings or as a connection between different equipment locations. The basis of wireless systems
are radio waves, an implementation that takes place at the physical level of network structure.
Wireless networks use radio waves to connect devices such as laptops to the Internet, the business
network and applications. When laptops are connected to Wi-Fi hot spots in public places, the
connection is established to that business’s wireless network.
A decentralized type of wireless network that does not rely on any preexisting infrastructure such as
routers in wired networks or access points in wireless networks
WiMAX
This is a wireless broadband communications technology based around the IEE 802.16 standard providing
high speed data over a wide area. The acronmy WiMAX stand for Worldwide Interoperability for
Microwave Access (AXess), and it is a technology for point to multipoint wireless networking. WiMAX
technology is able to meet the needs of a large variety of users for wireless connection and also use for
mobile applications, providing high speed data to users on the move.
WiMAX technology standard is for Wireless Metropolitan Area Networks (WMANs) that has been
developed by working group number 16 of IEEE 802, specializing in point-to-multipoint broadband
wireless access. Initially 802.16a was developed and launched, but now it has been further refined.
802.16d or 802.16-2004 was released as a refined version of the 802.16a standard aimed at fixed
applications. Another version of the standard, 802.16e or 802.16-2005 was also released and aimed at the
roaming and mobile markets.
WiMAX broadband technology key technologies for providing, the high-speed data rates are:
OFDM (Orthogonal Frequency Division Multiplex): OFDM, form of signal format that uses a large
number of close spaced carriers modulated with low-rate data stream has been incorporated into WiMAX
technology for provision of high-speed data without the selective fading and other issues of other forms
of signal format.
MIMO (Multiple Input Multiple Output): WiMAX technology makes use of multipath propagation using
MIMO. By using the existing the multiple signals, the MIMO either enables operation with lower signal
strength levels, or it allows for higher data rates.
Wi-Fi
Wireless Fidelity, commonly known as Wi-Fi is defined under the IEEE 802.11x standards lays down the
architecture and specifications of wireless LANs. Wi-Fi networks have a bandwidth of 20MHz, whereas
WiMAX networks have a flexible bandwidth option which ranges from 1.25MHz to 20MHz. Users
connected by WLANs can move around within the area of network coverage.
The main fields of a frame of wireless LANs as laid down by IEEE 802.11 are −
• Frame Control: It is a 2 bytes starting field composed of 11 subfields. It contains control
information of the frame.
• Duration: It is a 2-byte field that specifies the time period for which the frame and its
acknowledgment occupy the channel.
• Address fields: There are three 6-byte address fields containing addresses of source, immediate
destination, and final endpoint respectively.
• Sequence: It a 2 bytes field that stores the frame numbers.
• Data: This is a variable-sized field that carries the data from the upper layers. The maximum size
of the data field is 2312 bytes.
• Check Sequence: It is a 4-byte field containing error detection information.
Advantages of WLANs
• They provide clutter free homes, offices and other networked places.
• The LANs are scalable in nature, i.e. devices may be added or removed from the network
at a greater ease than wired LANs.
• The system is portable within the network coverage and access to the network is not bounded
by the length of the cables.
• Installation and setup is much easier than wired counterparts.
• The equipment and setup costs are reduced.
Disadvantages of WLANs
•Since radio waves are used for communications, the signals are noisier with more interference
from nearby systems.
• Greater care is needed for encrypting information. Also, they are more prone to errors. So,
they require greater bandwidth than the wired LANs.
• WLANs are slower than wired LANs.
WiMax Vs WiFi
The WiMax Vs Wi-Fi table below provides the differences at a glance between the two. Or three, since
there are differences in various version as well.
Frequency Band Licensed/Unlicensed 2.4 GHz ISM 2.4 GHz ISM (g)
2 G to 11 GHz 5 GHz U-NII (a)
Modulation BPSK, QPSK, QPSK (Quadrature Phase Shifting key) BPSK, QPSK,
16-, 64-, 256-QAM 16-, 64-QAM
Neither WiFi nor WiMAX is an internet rather with other connectivity protocols are networking mediums
to eventually get to another network from where you can get to some server or somebody else’s computer.
The devices in the ad hoc network can access each other's resources directly through basic peer-to-
peer (P2P) or point-to-multipoint modes, therefore, central servers are unnecessary for functions
such as file sharing or printing. In a WANET, a collection of devices, or nodes -- such as a wireless-
capable PC or smartphone -- is responsible for network operations, such as routing, security,
addressing and key management.
Ad hoc networks require minimal configuration and can be deployed quickly, which makes them
suitable for emergencies, such as natural disasters, military conflicts or when traveling. Thanks to
the presence of dynamic and adaptive routing protocols, these networks can be configured quickly.
These impromptu, on-demand networks are useful for putting together a small, inexpensive all-
wireless LAN without the need for wireless infrastructure equipment. They also work well as
temporary access to the internet if wireless access points or routers fail.
iii. Non-scalability: As the number of devices in an ad hoc network increases, it becomes harder
to manage because often there is not a central device through which all traffic flows. For
example, when several devices are connected via a P2P MANET ad hoc network, more
wireless interference can occur, as each device must establish a direct P2P connection to
each of the other devices, instead of going through a single access point in a hub-and-spoke
architecture. When a device is too far from a device it needs to connect to, it will pass the
data through other devices on the way; this is slower than passing it through a single access
point acting as a centralized wireless bridge.
iv. Devices in an ad hoc network cannot disable SSID broadcasting like devices in infrastructure
mode can. As a result, attackers can find and connect to an ad hoc device if they are within
signal range.
v. Security options are limited due to a lack of network infrastructure services, such as access
to a RADIUS (remote authentication dial-in user service) server for 802.1x authentication
purposes.
vi. Some wireless ad hoc networks cannot bridge wired LANs or connect to the internet without
installing a special-purpose network gateway.
vii. Devices can only use the internet if one of them is connected to and sharing it with the others,
such as a cellular-connected smartphone operating in "hotspot" mode, which is a variation
of an ad hoc network. When internet sharing is enabled, the client performing this function
may face performance problems, especially if there are many interconnected devices. Ad
hoc mode requires the use of more endpoint system resources, as the physical network layout
changes when devices are moved around; in contrast, an access point in infrastructure mode
typically remains stationary from an endpoint perspective.
Terminology in Mobil IP
• Mobile node: Any hand-held communication device or router that changes its point of
attachment from one network to another. It may change its location while its IP address remains
unchanged. It continues communication with other nodes in the Internet from anywhere
maintaining its (constant) IP address, assuming link layer connectivity to a point of attachment is
available.
• Home network: It is a network possibly virtual, to which a mobile node originally belong to as is
indicated by its assigned IP address (Home address). Note that standard IP routing mechanism
will deliver datagrams destined to a mobile node’s home address to the mobile node’s home
network
• Home address: It is the permanent IP address assigned to the mobile node (within its home
network). It remains unchanged regardless of where the node is attached to the internet
• Home agent: It is a router in home network to which the mobile node was originally connected.
It tunnels datagram for delivery to the mobile node when it is away from home and maintains
current location information for the mobile node.
• Foreign network: Any network other than the mobile node’s home network to which the mobile
node is visiting.
• Foreign Agent: A router on a mobile node’s visited network which provides routing services to
the mobile node while registered. The packets from the home agent are sent to the foreign agent
which delivers it to the mobile node. The foreign agent detunnels and deliver datagrams to the
mobile node that were tunneled by the mobile node’s home agent. For datagram sent by a mobile
node, the foreign agent may serve as a default router for registered mobile nodes.
• Care of address (CoA): It is the temporary address used by a mobile node while it is moving
away from its home network.
• Correspondent Node: A peer with which a mobile node is communicating which can be any
mobile or stationery device on the internet..
• Link: A facility or medium over which nodes can communicate at the link layer. A link underlies
the network layer
• Node: Any communication device or a router
• Tunnel: The path followed by an encapsulated. While it is encapsulated, a datagram is routed to
knowledgeable decapsulating agent, which decapsulates the datagram and then correctly deliver
to its ultimate destination.
Working
Correspondent node sends the data to the mobile node. Data packets contains correspondent node’s
address (Source) and home address (Destination). Packets reaches to the home agent. But now mobile
node is not in the home network, it has moved into the foreign network. Foreign agent sends the care-
of-address to the home agent to which all the packets should be sent. Now, a tunnel will be established
between the home agent and the foreign agent by the process of tunneling.
Tunneling establishes a virtual pipe for the packets available between a tunnel entry and an
endpoint. It is the process of sending a packet via a tunnel and it is achieved by a mechanism called
encapsulation.
Now, home agent encapsulates the data packets into new packets in which the source address is the
home address and destination is the care-of-address and sends it through the tunnel to the foreign agent.
Foreign agent, on other side of the tunnel receives the data packets, decapsulates them and sends them
to the mobile node. Mobile node in response to the data packets received, sends a reply in response to
foreign agent. Foreign agent directly sends the reply to the correspondent node.
Protocols Support Mobile IP
ii. Registration:
Mobile node after discovering the foreign agent, sends registration request (RREQ) to the foreign
agent. Foreign agent in turn, sends the registration request to the home agent with the care-of-
address. Home agent sends registration reply (RREP) to the foreign agent. Then it forwards the
registration reply to the mobile node and completes the process of registration.
iii. Tunnelling
It establishes a virtual pipe for the packets available between a tunnel entry and an endpoint. It is
the process of sending a packet via a tunnel and it is achieved by a mechanism called encapsulation.
It takes place to forward an IP datagram from the home agent to the care-of-address. Whenever
home agent receives a packet from correspondent node, it encapsulates the packet with source
address as home address and destination as care-of- address.
WAP Model:
The user opens the mini-browser in a mobile device. He selects a website that he wants to view. The
mobile device sends the URL encoded request via network to a WAP gateway using WAP protocol.
The WAP gateway translates this WAP request into a conventional HTTP URL request and sends it
over the internet. The request reaches to a specified Web server and it processes the request just as it
would have processed any other request and sends the response back to the mobile device through
WAP gateway in WML file which can be seen in the micro-browser.
1. Application Layer:
This layer contains the Wireless Application Environment (WAE). It contains mobile device
specifications and content development programming languages like WML.
2. Session Layer:
This layer contains Wireless Session Protocol (WSP). It provides fast connection suspension and
reconnection.
3. Transaction Layer:
This layer contains Wireless Transaction Protocol (WTP). It runs on top of UDP (User
Datagram Protocol) and is a part of TCP/IP and offers transaction support.
4. Security Layer:
This layer contains Wireless Transaction Layer Security (WTLS). It offers data integrity, privacy and
authentication.
5. Transport Layer:
This layer contains Wireless Datagram Protocol. It presents consistent data format to higher
layers of WAP protocol stack.
Mobile Routing
Packets in a network may need to transverse multiple links to get to destination. Mobility causes route
changes due to dynamic topology.
Figure 4.12: Mobile Route
Suppose MN is currently in the subnet 130.111.*, hence as shown in the figure, 130.111.111.111
becomes the FA for MN. If CN sends a packet to MN, it reaches the HA of MN (130.103.202.050)
along Path I. HA cannot find MN in the home network, but if it knows the location of MN, it can send
the packet along Path II by creating a tunnel,
Table-driven (proactive) routing: this maintains fresh lists of destinations and their routes by
periodically distributing routing tables throughout the network.
Advantages
• Route immediately available
• Minimize flooding
Optimized Link State Routing Protocol (OSLR) is a proactive and table driven protocol in which nodes
periodically floods status of its links. Each node re-broadcasts link state information received from its
neighbour. Each node keep tracks of link state information received from other nodes, and uses this
information to determine next hope to each destination.
Link-State Algorithms
O-P P S
P-Q O-P
Q-R P-Q
R-S Q-R
R-S
Figure 4.13a Link State algorithm
• Each node shares its link information for all nodes can build a map of the full network topology
• For a sufficiently long period of a stable topology, all nodes will have the same topology
information
O-P
O-P
O-P O-Q
O-Q
O-Q P-Q
P-Q
P-Q Q-R
Q-R
Q-R R-S
R-S
R-S
O-Q O-Q
Q
O-P R
O O-P
O-Q
O-Q
P-Q
P-Q
Q-R
Q-R
R-S O-Q
S R-S
P
Figure 4.13b Updating Link information
• Link information is updated when a link changes state (goes up or down) by sending small “hello”
packets to neighbors.
• Nodes O and Q propagate the existence of link O-Q to their neighbors and, eventually, to the
entire network
i. Dynamic Source Routing (DSR) protocol is a simple and efficient reactive protocol for multi-
hop wireless ad-hoc network for mobile nodes. It allows a completely self-organizing and self-
configuring network without the need for existing network infrastructure or administration.
It works on the concept of source routing, that is a routing technique in which the sender of a
packet determines the complete sequence of nodes through which, the packets are forwarded.
The protocol is composed of the two main mechanisms:
a) Route Discovery
b) Route Maintenance
DSR requires each node to maintain a route – cache of all known self – to – destination pairs (a
header of each packet contains a route). If a node has a packet to send, it attempts to use this
cache to deliver the packet. If the destination does not exist in the cache, then a route discovery
phase is initiated to discover a route to destination, by sending a route request.
This request includes the destination address, source address and a unique identification number.
If a route is available from the route – cache, but is not valid any more, a route maintenance
procedure may be initiated.
A node processes the route request packet only if it has not previously processes the packet and
its address is not present in the route cache. A route reply is generated by the destination or by
any of the intermediate nodes when it knows about how to reach the destination.
Figure 4.14a shows the route discovery procedure where S1 is the source node and S7 is the destination
node.
Figure 4.14b: Using Route record to send the Route reply
In Figure 4.14b, the destination S7, gets the request through two paths. It chooses one path based on the
route records in the incoming packet and sends a reply using the reverse path to the source node. At each
hop, the best route with minimum hop is stored. In this example the route record status at
each hop to reach the destination from the source node is shown. Here, the chosen route is S1-S2-S4-S5-
S7.
Advantages:
DSR uses a reactive approach which eliminates the need to periodically flood the network with table
update messages which are required in a table-driven approach. The intermediate nodes also utilize the
route cache information efficiently to reduce the control overhead.
Disadvantages
The disadvantage of DSR is that the route maintenance mechanism does not locally repair a broken
down link. The connection setup delay is higher than in table- driven protocols. Even though the
protocol performs well in static and low-mobility environments, the performance degrades rapidly with
increasing mobility. Also, considerable routing overhead is involved due to the source- routing
mechanism employed in DSR. This routing overhead is directly proportional to the path length.
When a node requires to share a packet, and it doesn’t understand the route to the destination, it starts
route discovery, by sharing a RREQ multicast message. The neighbouring nodes detect where the
message came from and forwards it to their neighbours until the message is received to the destination
node.
The RERR message denotes the destination which is inaccessible. Nodes taking the message produce
the route inactive (and usually the route is eliminated). The next packet to be sent triggers route
finding.
AODV: Summary
i. Routes need not be included in packet headers
ii. Nodes maintain routing tables containing entries only for routes that are in active use
iii. At most one next-hop per destination maintained at each node
iv. DSR may maintain several routes for a single destination
v. Sequence numbers are used to avoid old/broken routes
vi. Sequence numbers prevent formation of routing loops
vii. Unused routes expire even if topology does not change
In Location based routing, routing decisions are taken using the location information. It is very efficient in
terms of routing data packets as they take advantage of pure location information instead of global topology
information. The source node (a node that has a packet to send) adds a destination location (Sink) in each
data packet. Intermediate nodes in the path receive this packet and send it to next one-hop neighbour which
are geographically nearest to the destination. The process continues until the data packet gets to the
destination node. Location-based routing does not require establishment or maintenance of routes, thereby
conserves energy and bandwidth since route request and state propagation are not required after one-hop
distance.
LBR uses the location information for nodes obtained from location broker (GPS) to provide higher
efficiency and scalability.
Three basic facts in LBR are:
• Each node in the network must know its location information by GPS or any other method
• Each node must know its one-hop away neighbour’s information
• Source node must be aware of Destination node location
Types of LBR
a. Unicast: single destination
b. Multicast: multiple destinations
c. Geocast: data is propagated to nodes within certain geographic area
Unicast destination
• Each forwarding node makes localized decision based on the location
of the destination and the node’s neighbors (greedy forwarding)
• Challenge: packet may arrive at a node without neighbors that could
bring packet closer to the destination (voids or holes)
Geocasting
• Packet is sent to all or some nodes within specific geographic region
• Example: query sent to all sensors within geographic area of interest
Challenge of geocasting:
• propagate a packet near the target region (similar to unicast routing)
• distribute packet within the target region (similar to multicast routing)
Hybrid (both proactive and reactive) routing protocol (HRP)also known as Balanced Hybrid
Routing (BHR)
This combines proactive and reactive routing features. It is used to determine optimal network destination
routes and reports network topology data modifications.
Features of HRP
• The features are as follows:
• Requires less memory and processing power than LSRP
• Integrates reactive and proactive routing advantages
• Serves activated nodes through reactive flooding.