The proposal contains the brief introduction of the topic. Now I am giving an overview of the routing protocols of Ad hoc wireless networks by reviewing some IEEE papers related to my topic.
In Multi-hop Wireless Ad hoc Networks, transmission of data from source to destination takes place through the nodes (which acts as a router) present in the network. There are types of routing protocols designed for the operation of Ad hoc networks. Routing protocols generally classified as Table Driven and On Demand Routing protocols. The further classified routing protocols and their operations are discussed below.
Destination Sequenced Distance Vector Routing (DSDV): It is a table driven protocol which is pro-active. This technique is developed by modifying the Bellman Ford algorithm. Here each node has their routing table which contains next hop on path, distance to reach destination. Every node has a sequence number assigned by the destination node to keep the current route. It enables the nodes to differentiate old routes from new ones there by avoiding the formation of routing loops. Routing table updates full routing and incremental updates to their neighbors throughout the network periodically to maintain table reliability. Nodes have an additional table to store the data sent in the incremental routing information packets. If two updates have a same sequence number in an event, the route with small metric is used to shorten the path. Nodes should keep a track on the time taken to reach destination as it changes with the different routes. Network traffic can be reduced and optimize routes by eliminating the broadcasts that take more time to reach destination if a better route was discovered in future.
Cluster head Gateway Sw...
... middle of paper ...
...pplications and Challenges are some of the topics to be studied from the survey papers to complete the Term Paper.
Time Schedule:
Third week of March : Performance Comparison of these protocols.
Last week of March : Interference in Ad hoc networks.
First week of April : Fair Scheduling techniques for bandwidth allocation and power control.
Second week of April : Applications and Challenges.
Last week of April : Write the paper in IEEE format and submit the paper.
I faced problem while reviewing and understanding the routing protocols from different papers as all the protocols are almost similar to each other with slight changes.
So I want to spend more time for the research on the paper by reviewing more IEEE papers and also books related to that topic to grasp the content and write a good Term Paper.
When using routers, you need many routers in order to route the information to the correct location, as one router will not be able to manage this task. Explain how the routing schemes handle this problem.
[3] The Design Philosophy of the DARPA Internet Protocols by David D. Clark [M.I.T. Laboratory for Computer Science]
Johnson, D., Maltz, D. (1996). Dynamic Source Routing in Ad-hoc Wireless network. Print ISBN: 0 79239697 0
8) Ian F. Akyildiz, Ismail H. Kasimoglu, “Ad Hoc Networks’’, Wireless sensor and actor networks: Research Challenges, Georgia Institute of Technology, USA, May-2004.
The OSI network reference model was developed by the International Organization for Standardization (ISO) to facilitate communication between networks by keeping certain standards open rather than proprietary (Serpanos & Wolf, 2011). Each layer is stacked with the physical layer as the lowest and the application layer as the highest and one can think of each layer as containing stacks of protocols that make network communications function (Serpanos & Wolf, 2011). A protocol is a set of rules written in a common language that allows computers to communicate with each other. Each communication network is a node and the corresponding layer on each node communicates with each other.
Open Shortest Path First (OSPF) is a link-state routing protocol which uses link state routing algorithm for Internet Protocol (IP) networks.Using OSPF, th convergence of a network can be done in very few seconds, loop-free paths can be guaranteed and better load-sharing on external links can be achievd. Every change in the topology of the network is identified within seconds using OSPF and it instantaneously computes the “shortest path tree” for every route using “Dijkstra's algorithm” . For that reason, OSPF requires a router which have a more powerful processor and more memory than any other routing protocols which leads to more elect...
There are many characteristics and challenges that should be taken into consideration when developing multicast routing protocols, like the dynamically changing network topology, limitation of network scalability. There are different types of protocols like unicast protocols [1], [2], cluster based protocols [3] In this paper we discuss about multicast routing for vehicular Ad hoc network which is different from other Ad Hoc networks [4]. Generally there are two types of multicast routing protocols in wireless networks. Tree-based multicast routing protocol, mesh based routing protocol [5]-[8]. In the tree-based multicasting, structure can be very much unstable in multicast ad-hoc routing protocols, as it needs frequent re-configuration in dynamic network. One such example is Multicast extension for Ad-Hoc On-Demand Distance Vector (MAODV) and Adaptive Demand- Driven Multicast Routing protocol (ADMR). The second type is mesh-based multicast protocol. Mesh-based multicast routing protocols are more than one path may exist between a source destination pair, Core-Assisted Mesh Protocol (CAMP) and On-Demand Multicast Routing Protocol (ODMRP) are an example for these type of classification[9]. One approach to multicast is to maintain a multicast tree in straight roads. Existing protocols for multicasting encounters quite a lot of troubles in mesh maintenance and regular reconfiguration when link breakage occurs. The extreme dependency of these protocols on upstream and downstream nodes leads to storage and control overhead. Furthermore, various protocols consider the shortest path as a decisive factor for path selection, Existing forwarding state for the multicast distribution mesh for the source and the group. The nonexistence of data...
Robust Vehicular Routing Protocol (ROVER) [9] is geographical multicast protocol. In ROVER, control packets are using broadcasting and data packets are using unicasting mechanism. The main goal of this protocol is to broadcast a message to all presented vehicles in the specified zone of relevance (ZOR). ZOR can be designate as a rectangle specified by its corner coordinates. In this, a message can be described by using three terms called triplet (application, message, ZOR). If the vehicle within its ZOR and received a message then it accepts that message.
Protocol compatibility is an important issue. Since a protocol is like a language for computers on a network, it is important that the devices on a network speak the same language, or use the same protocol, so that data can be successfully delivered. For example, if a computer on a network needs to print a document, it is necessary for the computer and the network printer to have the same protocol. Once a standard is established, all the devices on a network will be able to work together in a network environment. If two devices on a network are not using the same protocol, the two devices will be unable to communicate (Whitehead 125).
Despite its simplicity and reliability the bus network does have several limitations. The cable length of the bus is limited due to data loss. Also, a bus network may have performance issues if the nodes are located a...
The next group of routing protocols utilize the exact location of the sensor nodes for the purpose of routing. The nodes geographic location can be obtained directly by using Global Positioning System (GPS) devices or indirectly through exchanging some information regarding to the signal strengths received at each node. Since the localization imposes significant computation overhead and also requires special hardware support, this approach becomes infeasible to be used in resource constrained wireless sensor networks. Geographic and Energy-Aware Routing (GEAR) and Geographic Adaptive Fidelity (GAF) can be referred as the geographic routing protocols.
The set standards and mechanisms for enabling high quality performance for applications are known as quality of service routing. Its main goal is to provide special service for applications that need it by making sure the required bandwidth is provided, controlling latency and making sure the loss of data is reduced. Some of its useful features are:
At SRM, I was introduced to the true expanse of computer science. Subjects such as Computer Networks, Algorithms, Probability theory, Principles of programming languages and Data Structures piqued my interest as they allowed me to explore my analytical, logical and creative attributes. Computer Networks, in particular, taught me the importance of sharing of information – the first and foremost thing that we care about. Gradually, my tryst with computer networks become intense as I began to explore more and more about their significance and applications in various facets of life: education, social media, research, entertainment, etc. This fascination and exploration led me to do my final year project on mobile ad hoc networks under the guidance of Professor Velmurugan P. It presents a lifetime prediction routing algorithm that maximizes the network lifetime of MANETS by selecting the least dynamic route with long lifetime for maintaining the uninterrupted data flow. Later on, the pap...
Mueller S, Tsang T, Ghosal D, Multipath Routing in Mobile Ad Hoc Networks:Issues and Challenges,Accessed on May 21 2014,
The second type is token-passing. Token-passing controls network access by passing an electronic token sequentially to each host. When a host receives the token that means that the host can send data on the network. If the host has no data to send, it passes the token to the next host and the process repeats itself.