210 likes | 367 Views
New Mac Protocol Idea. Jeong Young-Hwan. MAC Idea. Basic. Initialization. Data Trans. Pseudorandom time. R. S1. Wake up at predicted time. S2. S3. S4. Beacon. DATA. Receive. Node active. MAC Idea. Continuing. Initialization. Data Trans. Pseudorandom time. R. S1. Beacon.
E N D
New Mac ProtocolIdea Jeong Young-Hwan
MAC Idea • Basic Initialization Data Trans Pseudorandom time R S1 Wake up at predicted time S2 S3 S4 Beacon DATA Receive Node active
MAC Idea • Continuing Initialization Data Trans Pseudorandom time R S1 Beacon DATA Receive Node active
MAC Idea • No Data Initialization Data Trans Pseudorandom time R S1 Beacon DATA Receive Node active
MAC Idea • IEEE 802.15.4 standard • Format of Beacon frame • Format of Signal frame New mac Specific Optional Field
MANET Routing Protocol(EXPERIMENTATION) Jeong Young-Hwan
Contents • 1. Introduction • 2. Ad-hoc Routing Protocol • Properties of ad-hoc routing protocols • DSDV • AODV • 3. Simulation • Installation Steps • Simulation Setup • Simulation Result • 4. Conclusion
Introduction • Performance comparison between two routing protocols, namely, AODV (Ad hoc On Demand Distance Vector) and DSDV (Destination Sequenced Distance Vector). • AODV is a reactive protocol (routes are only generated on demand, in order to reduce routing loads), and DSDV is a proactive protocol (with frequent updates of routing tables regardless of need). • Deals with a comparison of both routing algorithms while varying parameters of importance. • The analysis of adhoc routing protocol is done in the above mentioned Ratio of average received and Average delay time.
Dynamic Destination-Sequenced Distance Vector (DSDV) • C. Perkins and P. Bhagwat. “Highly dynamic Destination-sequenced distance vector routing (DSDV) for mobile computers” ACM SIGCOMM '94 p234-244, 1994. • Each node knows the state and topology of the entire network • Routes are chosen by a metric (least delay, best signal strength, etc..) • Periodically and when triggered transmits the entire routing table to neighbors • Full dumps • Incremental dumps • Avoids loops by using sequence numbers
DSDV Recovery • When a link loss is detected at node N: • the metric of the route to the destination through the lost link is advertised as infinity (the worst value), and • An incremental update is flooded to the neighbors
DSDV Evaluation • Loop avoidance • Constant routing overhead versus mobility • Overhead increases as the number of nodes increases • DSDV can no longer find a route reliably when there is high mobility
Ad Hoc On-Demand Distance Vector (AODV) • C. Perkins. “Ad Hoc On-Demand Distance Vector (AODV) Routing” IETF Internet Draft. http://www.ietf.org/internet-drafts/draft-ietf-manet-aodv-10.txt. • Each node only keeps next-hop information • Source broadcasts ROUTE REQUEST packets • Each node that sees the request and forwards it creates a reverse route to the source • If the node knows the route to the destination, it responds with a ROUTE REPLY • All nodes along the reply route create a forward route to the destination
AODV Recovery • When a link loss is detected at node N: • any upstream nodes that have recently sent packets through this node are notified with an UNSOLICITED ROUTE REPLY with an infinite metric for that destination
AODV Evaluation • Routing overhead increases as mobility increases, but not as the number of nodes increases • Sends many packets, but they are small • Costs to access the medium (RTS/CTS packets) • Always delivers at least 95% of packets sent in all cases (Broch, et. al.)
Simulation • NS is a discrete event simulator targeted at networking research. • Ns provides substantial support for simulation of TCP, routing, and multicast protocols over wired and wireless (local and satellite) networks. • NS2 is an object oriented simulator, written in C++, with an OTcl interpreter as a frontend. This means that most of the simulation scripts are created in Tcl(Tool Command Language). • If the components have to be developed for ns2, then both tcl and C++ have to be used
Installation Step • Vmware player installed • Ubuntu 11.04 installed • Ns-allinone-2.35 installed $/.install • Then, $gedit ~/.bashrc, added PATH below # environment # LD_LIBRARY_PATH OTCL_LIB=/home/yhwan/simulator/ns-allinone-2.35/otcl-1.14 NS2_LIB=/home/yhwan/simulator/ns-allinone-2.35/lib X11_LIB=/usr/X11R6/lib USR_LOCAL_LIB=/usr/local/lib export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:$OTCL_LIB:$NS2_LIB:$X11_LIB:$USR_LOCAL_LIB # TCL_LIBRARY TCL_LIB=/home/yhwan/simulator/ns-allinone-2.35/tcl8.5.10/library USR_LIB=/usr/lib export TCL_LIBRARY=$TCL_LIB:$USR_LIB # PATH XGRAPH=/home/yhwan/simulator/ns-allinone-2.35/bin:/home/simulator/ns- allinone2.35/tcl8.5.10/unix:/home/yhwan/simulator/ns-allinone-2.35/tk8.5.10/unix NS=/hme/yhwan/simulator/ns-allinone-2.35/ns-2.35/ NAM=/home/yhwan/simulator/ns-allinone-2.35/nam-1.15/ export PATH=$PATH:$XGRAPH:$NS:$NAM • It is validated by the command • $cd ns-2.35 • $./validate
Simulation Setup • The performance analysis is done on Windows 7 Operating System. Ns –allinone-2.35 was installed on the platform using VMware Player and Ubuntu 11.04
Simulation Result • Figure3. DSDV, Result of nam Figure4. DSDV, Result of Trace File • Figure6. AODV, Result of nam Figure7. AODV, Result of Trace
Simulation Result Figure5. DSDV, Result of Performance Figure8. AODV, Result of Performance Figure 5, 8, where each node of the figures recorded in the packet is transmitted from sensor nodes to sink node reception means passed
5. Conclusion • The analysis of adhoc routing protocol is done in the above mentioned Ratio of average received and Average delay time. • DSDV has low and stable routing overhead as comparison to AODV that varies a lot.