Handbook of Intelligent Computing and Optimization for Sustainable Development. Группа авторов

Чтение книги онлайн.

СКАЧАТЬ DLSR, there are two types of messages sent to the destination node. First is hello message to check the connectivity of the network nodes with each other. Second is control message to refresh the routes of the transmission of data. Large overhead is present in the network. To reduce overheads, multiple relay is used for forwarding schemes [20].

      6.2.6.3.2.2.2 Destination-Sequenced Distance Vector (DSDV)

      DSDV contains the UAVs. They all know everything about every other node. Assignment of sequence numbers are the main feature of DSDV. By doing this, loop system is avoided and system becomes simple. Main disadvantage is the overheads [21].

      6.2.6.3.3 Reactive Routing Protocols

      Reactive protocols are on demand protocols, they find out path during transmission. It consists of two request, send request and reply request. First request is sent to the destination nodes via flooding procedure. Reply request is send from destination to source through unicast method. It delays the transmission due to finding of path.

      6.2.6.3.3.1 Dynamic Source Routing (DSR)

      It is different in the sense of the ID. Each node has different ID. Route is stored in the in the header of the nodes. It is a multihop system, in the case of hop fail, there is need of another path.

      6.2.6.3.3.2 AdHoc On-Demand Distance Vector (AODV)

      It is table-driven protocol. It uses sequence numbers to transfer the data from source to destination. It stores the data of the next hop nodes. It maximizes the bandwidth and decrease the delay in data packet delivery. In the case of path failure, path refreshes again and again due to which congestion occurs. In AODV, time slot is present along with the hop information.

6.2.6.4 MANETs

      6.2.6.4.1 Tunneling

      In tunneling forward strategy [22], to send the data, we use AODV or searching in tables. Sink is available within the MANET zone and then we can easily send the data. To send outside the network, we encapsulated the data to gateway and then send it to the destination by slandered IP address.

      6.2.6.4.2 Non-Tunneling

      For non-tunneling approach, we used to transfer the data from the sender to the receiver node which is located outside the zone. Gateway approach is used to send the data. IP address is used to forward data.

       6.2.6.5 VANETs

      6.2.6.5.1 Greedy

      Frequent change of topology is the main point of greedy routing protocol. This is the main disadvantage of the previous work of the routing protocols. Weak signal is the drawback of the protocol. It involves near most node and intermediate nodes scheme for transmission. It will approach node. Change of topology and time delay is less and throughput is high.

      6.2.6.5.2 V2I/I2V Forwarding

      It is designed for urban areas; data is transferred within vehicles and with the road side units. It is used in dense areas or populated areas. Nodes are highly available and node mobility is high [23–26].

      6.2.6.5.3 V2V Forwarding Flooding

      It is used to communicate between the vehicles. In this scenario, vehicle sends the data to the other for transmission of data for many uses/application regarding to the traffic problems such as traffic jam and bomb blast.

      6.2.6.5.4 Geographical Forwarding

      Here, forwarding scheme is location-based. Information is stored in nodes and forward it to the kneeboard hops. Geocaching is used to convey the message.

      6.2.6.5.5 Opportunistic Forwarding

      It uses opportunistic approach for storing and forwarding scheme. It is information driven device which do not merge the information.

      6.2.6.5.6 Cluster-Based Forwarding

      In cluster-based forward, network considers a node as a midhub before delivering the data to the destination node. To perform this arrangement, we have to arrange the node in such a manner that nodes other than destination node carry the information as the midhub or middle node of network.

6.2.6.5.7 Peer-to Peer Forwarding

      In peer-to-peer forwarding, source store data in storage and not send again to nodes until another nodes request the data. This technique is designed to make applications delay tolerant.

       6.2.6.6 FANETs

      1 1. Store-carry and forward.

      2 2. Greedy forwarding.

      3 3. Path discovery.

      4 4. Single path.

      5 5. Multi path.

      6 6. Prediction.

      6.2.6.6.1 Store-Carry and Forward

      In store-and-carry forwarding, when nodes could not find the next nodes to deliver, the data then they store the data and wait for the node to transmit it. It happens to faint when the node density is very low.

      6.2.6.6.2 Greedy Forwarding

      This method is used to minimize the number of hops during transmission of data. It is used to observe the close nodes to transfer the data. In the absence of any close node, it will block the data.

      6.2.6.6.3 Path Discovery

      To minimize the cost and use of bandwidth during a transmission, we use this path. This follows RREQ method. First of all, we will observe all the possible paths and then select a suitable path to deliver the data.

      6.2.6.6.3.1 Single Path

      In this technique, we establish a single path for transmission from source to target, and it simplifies the handling of table. But if transmission will be stop, there will be no way to start it again.

      6.2.6.6.3.2 Multi Path

      It is a multipath communication between two nodes. But there is complex table for routing of data. In case of any problem there will be an alternate path.

      6.2.6.6.3.3 Prediction

      In this FANET, nodes use to predict the next nodes by using the parameters of location, node size, and its communication model technique. СКАЧАТЬ