Hi I am caca i would like to get details on matlab code for dsr routing and PDORP Routing
Protocol . i last studied in the college madi from moscow and now am doing a search about routing in the wsn i need to your help . thank you .
Dynamic Source Routing (DSR) is a routing protocol for wireless mesh networks. It is similar to AODV in that it forms an on-demand route when a transmitting node requests one. However, it uses source routing instead of relying on the routing table on each intermediate device.
Dynamic Source Routing (DSR) is a self-maintained routing protocol for wireless networks. The protocol can also work with cell phone systems and mobile networks with up to 200 nodes. A dynamic source routing network can be configured and organized independently of the supervision by human administrators.
In dynamic source routing, each source determines the route that will be used to transmit its packets to the selected destinations. There are two main components, called Route Discovery and Route Maintenance. Route Discovery determines the optimal route for a transmission between a particular destination and destination. Route Maintenance ensures that the transmission path remains optimally free of loops as network conditions change, even if this requires changing the route during a transmission.
Microsoft has developed a version of Dynamic Source Routing known as Link Quality Source Routing (LQSR) specifically for use with its Mesh Connectivity Layer (MCL) technology. MCL facilitates the interconnection of equipment in a wireless mesh network using Wi-Fi or WiMax services.
The determination of source routes requires the accumulation of the address of each device between the source and the destination during the discovery of the route. The accumulated path information is cached by the nodes processing the path discovery packets. The learned paths are used to route packets. To achieve source routing, the routed packets contain the address of each device that will traverse the packet. This can result in high overhead for long routes or large addresses, such as IPv6. To avoid using source routing, DSR optionally defines a flow id option that allows packets to be forwarded in a hop-by-hop.
This protocol is actually based on source routing, in which all routing information (continuously updated) is maintained on mobile nodes. It has only two main phases, which are route discovery and route maintenance. The route response will only be generated if the message has reached the intended destination node (the route record initially contained in Route Request would be inserted in the route response).
To return the path response, the destination node must have a path to the source node. If the route is in the destination node's route cache, the route is used. Otherwise, the node will reverse the path based on the route record in the header of the Route Request message (this requires all links to be symmetric). In case of fatal transmission, the Route Maintenance Phase is initiated by which Route Error packets are generated in a node. The wrong hop will be removed from the node's route cache; All routes containing the jump are truncated at that point. Once again, the route discovery phase begins to determine the most viable route.
For information about other similar protocols, see the list of ad hoc routing protocols.