Professional Documents
Culture Documents
Design Project I
V) Wireless channel
B.Development history
-Build up a server with full infrastructure is so costly and not reasonable. Some
places don’t have condition: Sponsor, Geography location, Facilities,… So, we
need to build a wireless communication network without infrastructure to ensure
that mobile device or electronics can transmiss and get information conveniently
over nodes and interconnection of server. It is model of mobile ad hoc
netwook(MANETs)
MANETs architecture
Result:
Signal-hop Model
-Multihop: Nodes can route with other nodes through intermediate nodes in
the network. In order for this model to work properly, a routing protocol that is
compatible with the MANET network model is required.
Multihop Model
-Mobie-multihop: This model is similar to the second model, but the difference
here is that this model focuses on real-time applications such as audio, video..
Mobile-multihop Model
-Mobile server network: in this topology, devices are only linked to a single server
The network has inhomogeneous mobile devices
-The network has inhomogeneous mobile devices: in this topology, machines can
link directly to each other within their coverage area
2) Operation mode
-IEEE-ad hoc mode: In this mode, mobile nodes communicate directly with each
other without the need for any infrastructure. In this mode, links can not be made
over multiple hops
-Infrastructure mode: In this mode, the network includes fixed AP access points
and mobile nodes participating in the network, performing communication through
the access points. In this mode, links can be made over multiple hops
III) ROUTING OF MANETs
-Bellman-ford routing:
+In the Bellman-Ford algorithm, every node maintains a routing table or
information matrix, its distance and information about its next node on the shortest
path to any destination, where the distance is the shortest length from the node to
the destination. To update information about the shortest path, each node will
exchange frequently routing table with buttons next to it.
+Based on the routing table from those neighboring nodes, any node knows the
shortest distance from its neighbors to any destination node. Therefore, for each
destination node, the starting node will choose an intermediate node for the next
hop such that the distance from it through the intermediate node to the destination
node is minimal
-Path routing:
+New protocols such as DSDV (Destination Sequenced Distance Vector) and
WRP (Wireless Routing Protocol) is based on DBF to provide repeater routing
do. Even if the problem has been solved, there is still a problem of lack correctly in
DBF routing, this problem can cause performance degradation network.
+The cause of the inaccuracy is that the network node is not available network-
wide state information leads to only optimal decisions in the local scope, it does
not guarantee an optimal solution in the environment of mobile.
-On-demand routing:
On-demand routing is known as DC (Diffusion Computation) as well used in
wireless networks. In the On-demand routing scheme, a node constructs a path by
interrogating all the nodes in the network. Package query finds the IDs of the
intermediate nodes and stores them in the Path section. When detecting the query,
the destination node or the nodes that know the way to the destination answer the
quality of query by responding “source routed” to the sender
-Area Routing:
This is a hybrid protocol between On-demand routing and an arbitrary protocol
period existed. In zone routing, each node defines its own zone when the node is at
certain distance. The advantage of zone routing is scalability level when the storage
need for the routing table decreases
*Main routing protocol of MANETs:
-Proactive(định tuyến theo bảng):
+DSDV(Destination Sequence Distance
Vector)
+OLSR(Optimized Link State Routing)
-Reactive(định tuyến theo yêu cấu):
+DSR(Dynamic State Routing)
+AODV(Ad hoc On-Demand Distance Vector Routing)
Beside that, we can classify by to types: Link State Protocol, Distance Vector
Protocol
-Ask only a subset of neighbors to forward link states. This subset is “Multipoint
Relay”(MPR) .For instance, if X is your MPR, you are X’s “MPR selector”. Each
MPR has set of MPR selectors. Each node sends link state to all its neighbors.
MPRs forward link state of MPR selectors. Other neighbors use information to
compute routing table, but it is not forward. OLSR significantly reduces the link
state control traffic
Example of OSLR:
- This is a protocol in the form of Distance Vector used in Manet. When a network
node needs to transfer data but does not know the path to a certain address, this
network node initiates the process of route discovery (Route discovery). So DSR is
a passive protocol (Only updates the network state and finds the path when
required). One advantage of DSR is that no routing packets are sent periodically
(since there is no need to update the network state as often – in contrast to the Link
state protocol). The DSR is also capable of operating a one-way link. Because DSR
finds its way on demand, it is not suitable for high-capacity and highly mobile
networks. The DSR protocol also has two main operations: Route finding and path
maintenance. The following figure shows a simple example of DSR. Routers A, B
and C form a Manet network. Router A and C are not connected to each other
while both are connected to router
DSR Model
+During routing, routers maintain a list of the IDs of intermediate routers in recent
search requests to avoid having to process the same (repeated) lookup request.
Lookup requests are ignored in cases where they have already been processed near
that point and are identified as a duplicate request. When a router receives a
request and realizes that its ID is already in the intermediate router list for that
request, the request is ignored.
+ Path maintenance occurs when the path becomes unusable because of the
unpredictable movement of routers (characteristic of MANET). Each router
manages all paths to forward packets, when a path fails, a packet of route error
reporting (Route error) is immediately sent to the source router and the
corresponding path. So the broken path will be ignored.
4) AODV(Ad hoc On-Demand Distance Vector Routing)
-In AODV, route reply comeback on the reverse path(intermediate record node
from which the first copy was received), so intermediate nodes update their
following table, old entries are time out
-AODV supports only symmetric links. If a source node moves, it must reinitiate
route request. If an intermediate node moves, all upstream nodes broadcast a link
failure to their upstream neighbors until source node is reached. But this protocol
has disadvantage: Intermediate nodes may send more up-to-date but still state
routes
-Example of AODV:
The main network elements used to construct the protocol layer for each mobile
node include: channel, network interface, radio propagation model, and protocols.
MAC, interface queue, link layer, ARP address resolution protocol model, and
routing agent.
There are currently several pre-installed protocols in NS3 namely DSDV, AODV,
TORA,OLSR,DSR,….
B.Shared media model
The wireless model is based on the shared media model (Ethernet in the air),
illustrated in below figure. All mobile nodes have one or more connected network
interfaces
The basic operation is as follows, every packet sent or placed into the channel will
be received or copied by all mobile nodes connected to the same channel. When
the mobile node receives the packet, the node first considers whether it received
the packet or not. This is dictated by the radio broadcast model, based on the
communication band, the distance the packet has traveled, and the amount of bit
errors.
Each mobile node uses a routing agent to calculate the route to other nodes in the
AD HOC network. Packets are sent from the application and received by the
routing component. This part will decide the path of the packet to reach the
destination and attach this information to the packet. The packet is then sent down
to the link layer. The link layer uses the ARP address resolution protocol to decide
on the hardware address of the neighbor node and maps the IP address to the
correct interface. When the information is received, the packet is sent down the
interface queue and waits for the signal from the MAC protocol. When the MAC
layer decides which packets can be sent into the channel, the packet is taken from
the queue to the network interface and then sent out over the air channel. The
packet is copied and delivered to all network interfaces at the time the first bit of
the packet begins to arrive at the interface in the physical system. Each network
interface marks the packet with properties of the receiving interface and then
invokes the broadcast model.
-The initial location and destination for a mobilenode can be established using the
following APIs:
-There are four types of traffic generators: exponential, pareto, CBR and file trace
traffic generators.
-In AD HOC network simulation, migration patterns play a very important role.
They need to accurately represent the possible contexts of the network and help
determine the correct performance of the protocols before being implemented in
practice. For wireless networks, two types of migration models are used, the trace
model and the synthetic model. Trace models are patterns of movement observed
in the real system. Trace models provide accurate information, especially when
they involve many participants and the observation period is long enough.
However, with the new network environment, AD HOC networks are not easily
traceable. In this case it is necessary to use synthesize models.
Large-scale Fading
Small-scale Fading
C.FREE SPACE MODEL & GROUND REFLECTION MODEL
-Path loss can be expressed as the ratio of the power of the transmitted signal
to the power of the same signal received by the receiver, on a given path.
-Two-way model also called as two path models is widely used path loss model.
The free space model described above assumes that there is only one single path
from the transmitter to the receiver.
-In reality, the signal reaches the receiver through multiple paths
A)SCHEMATIC OF SYSTEM
QPSK Transmitter
QPSK Receiver
*QPSK modulator and demodulator :
=> [0, 3, 1, 2, 0, 3, 2, 1]
Simulated symbol error rate performance of M-PSK modulation over AWGN channel
Given a specific SNR point to simulate, we wish to generate a white Gaussian noise
vector of appropriate strength and add it to the incoming signal. The method
described can be applied for both waveform simulations and the complex baseband
simulations.SNR (γ) refers to γb = Eb/N0 when the modulation is of binary type (example:
BPSK). For multilevel modulations such as QPSK and MQAM, the term SNR refers
to γs = Es/N0.
-Error:
A.MANETs network:
b)Wireless channel