Keywords

1 Introduction

As wireless LAN has flexible as well as simple architectures, it has been utilized in many applications of wireless networks. However, the technical growth in wireless networks relied on infrastructures like an access point and a router. So, many researchers proposed ad hoc networks with no need of infrastructures and still the research is continued. Ad hoc networks are made up of mobile nodes with router functions as well as wireless media (Figs. 1 and 2).

Fig. 1
figure 1

Ad hoc network [3]

Full size image
Fig. 2
figure 2

Cross-layer design for information sharing

Full size image

2 Theory

2.1 MANET

Wireless mobile ad hoc networks include a collection of mobile nodes which forms a network to communicate with each other without the help from stationary infrastructure like access points. So as to forward packets nodes communicate directly through wireless links when in radio range but nodes which are not in each other’s radio range utilize other nodes as intermediate routers via multiple-hop routing. The nodes that communicate directly are said to be neighboring nodes. Furthermore, due to the movement of nodes, the network topology changes rapidly. Therefore, an efficient routing protocol is needed in order to do better communication between the nodes in ad hoc network [1]. Numerous advantages coming out of wireless technology are not the physical setup for data transfer. They are lower installation and maintenance costs [2]. Mobile ad hoc network has many real life applications such as in business meetings, outside the offices, in Bluetooth, Wi-Fi Protocols, etc. [3].

2.2 AODV

This topic tells about AODV, which is the routing protocol of on-demand types under study by MANET. Here, every node consists of the routing table, and the newly produced routes use sequence number with every routing information. At the reception of control packet which occurs in on-demand by each node the routing table updation is done dependent upon the sequence number or the number of hops. Route discovery phase establishes the route while route maintenance phase maintains the route (Figs. 3 and 4).

Fig. 3
figure 3

Flow diagram of the cross-layer protocol with different values of x

Full size image
Fig. 4
figure 4

Time versus throughput

Full size image

AODV is based on two steps

  1. 1.

    Route Discovery: It has RREQ (Route Request) and RREP (Route Reply)

  2. 2.

    Route Maintenance: It has RERR (Route Error) and Hello message [4].

3 System Modeling

3.1 Proposed Cross Layer Design

The advanced technology for ad hoc networks is a cross-layer design. This approach enhances the possibilities to improve the adaptability and performance of MANET. Coincident points like adaptation loop avoidance as well as protocol stack improvement are the concentrating areas of the cross-layer architectures. Along with this advanced architectures for rapid and systematic deployment of current and new Cross Layer optimizations are also necessary [5].

Jing and Hassibi gave the idea of DSTC transmission strategy. It has the concept of simultaneous relaying and is used for mutirelay networks. Where total relays are allowed to send the source signal in the same subchannel simultaneously. Only time slots are needed instead of the quantity of relays considering a single data transmission [6].

Kennedy and Eberhart has given PSO algorithm in IEEE Evocomp, 1995 which is reliant on stochastic techniques, alike evolutionary techniques. The modification of pBest and gBest by the particle swarm optimizer is logically same as that of the crossover procedure used by genetic algorithms. Here, a group of particles as potential results are used to find a better solution at the end [6].

3.2 Proposed System Flow Chart

Proposed system for improving performance of MANET based on AODV protocol by using RSS as an interaction parameter for implementing CLD. Strong route will be selected in AODV as RSS values are being used and updated in NT (Neighbor Table) [7]. This will result in improving throughput of system. This can be understood by following flow chart under different values of x, as below

  1. 1.

    x = 0 (Using only RSS values),

  2. 2.

    x = 1 (Using RSS values with DSTC),

  3. 3.

    x = 2 (Using RSS values with PSO)

Now to improve route formation in AODV, DSTC and PSO algorithms are implemented.

3.3 Steps of DSTC

  1. 1.

    DSTC technique has two stages which utilizes a concept of listen and transmit protocol.

  2. 2.

    Relays carry the vector of symbols transmitted by the source node, which is the first stage of transmission.

  3. 3.

    Second stage performs multiplication operation of the distributed relays with received vectors with a quite arbitrary matrix. Further transmission of the obtained vectors toward the destination is done.

  4. 4.

    In the received signal of destination, i.e., final stage of DSTC, a linear space–time codeword is generated [6].

3.4 Steps of PSO

  1. 1.

    A group of particles as potential solutions is taken in search space for few iterations. We have to initialize pBest and gBest where pBest represents best location having best fitness value which the particle has individually inspected since the first stage and gBest denotes the location of best fitness experienced.

  2. 2.

    Initialization of random position and velocity of particles is done, i.e., x n p (t) and v n p (t) for a particle p(1 ≤ p ≤ N Particle).

  3. 3.

    For tth iteration (1 ≤ t ≤ N Iteration) in the nth dimension of search space (1 ≤ n ≤ N Dimension) the position of particle is modified as

$$ {x_{{p}}}^{n} \left( {t} + 1 \right) = {x_{p}}^{n}\left( t \right) + \, {v_{p}}^{n} (t + 1) $$
(1)
  1. 4.

    As per the upgradation velocity of pth particle is

$$ {v_{p}}^n (t + 1) = \omega . \, {v_{p}}^n \left( t \right) \, + c_{1} .{\text{ rand}}_{{ 1 { }.}} \left( {{{\text{pBest}_{p}}}^{n} - {x_{{p}}}^{n} \left( t \right)} \right) \, + c_{2} .{\text{ rand}}_{{ 2 { }.}} \left( {{{\text{gBest}_{p}}^n} - {x_p}^n \left( t \right)} \right) $$
(2)

Factor ω is a constant in between the scale 0 and 1 which denotes the velocity rising range towards gBest and pBest. The cognitive and social rates are scaled in respective to acceleration factors, i.e., constants c 1, c 2. Factors rand1 and rand2 return uniformly distributed random numerals in the range 0 and 1 [6].

4 Implementation of Proposed System

For formation of strong route in AODV following steps are implemented.

  1. (1)

    RSS values are used for selecting route.

  2. (2)

    DSTC algorithm is applied in AODV for selecting route.

  3. (3)

    DSTC algorithm is applied in AODV for selecting route by using RSS as an interaction parameter in CLD.

  4. (4)

    Power is allocated to all nodes and PSO algorithm is used to select strong route.

  5. (5)

    Power is allocated to all nodes and PSO algorithm is used to select strong route by using RSS as an interaction parameter in CLD.

5 Simulation Scenario

Simulation setup can be summarized in following table:

Parameter

Meaning

Value

x * y

Size of the scenario

1000 * 1000 (m)

Nn

Number of nodes

50

Initial energy

Initial energy in Joules

100

Relay

Relay

35

Simulator

ns-2.32

Routing protocol

AODV

Traffic

Constant Bit Ratio (CBR)

Mac layer

IEEE 802.11

Antenna type

Omni antenna

Total energy consumption

25.9315

5.1 Simulation Steps

  1. (i)

    Creation of wireless network topology for DSTC algorithm only.

  2. (ii)

    Creation of wireless network topology for DSTC algorithm along with RSS values (CLD).

  3. (iii)

    Creation of wireless network topology for PSO algorithm only.

  4. (iv)

    Creation of wireless network topology for PSO algorithm along with RSS values(CLD).

6 Results

6.1 Throughput Graph for RSS, DSTC and PSO

See (Fig. 5).

Fig. 5
figure 5

Time versus packet delivery ratio

Full size image

6.2 Packet Delivery Ratio Calculation for RSS, DSTC, and PSO

Above graph shows the improvement of throughput and PDR for CLD with DSTC and CLD with PSO.

7 Conclusion

Mobile ad hoc networks serve as a promising technology to increase coverage area and capacity of wireless networks with no infrastructure. With the use of received signal strength as an interaction parameter for a cross-layer design for AODV-based MANET with the help of DSTC and PSO algorithms performance of the system improves. The proposed system for formation of best route in AODV by using RSS, DSTC, and PSO algorithm shows better results for wireless mobile network. Proposed system will provide reliable network for wireless communication. As future scope, we can implement energy-based sleep scheduling algorithm for AODV protocol and compare its performance with the proposed technique.