Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

STORM: A Framework for Integrated Routing, Scheduling and Traffic Management in Ad Hoc Networks

Platform : DOT NET

IEEE Projects Years : 2012 - 13

STORM: A Framework for Integrated Routing, Scheduling and Traffic Management in Ad Hoc Networks

Abstract

 

A cross-layer framework is introduced for the effective dissemination of real time and elastic traffic in multi-hop wireless networks called STORM (Scheduling and Traffic Management in Ordered Routing Meshes). Unicast and multicast routes are established in coordination with the scheduling of transmissions and bandwidth reservations in a way that bandwidth and delay guarantees can be enforced on a per-hop and end-to-end basis. The routes established in STORM are shown to be loop-free and real-time packets forwarded along these routes are shown to have bounded end-to-end delays. Results from detailed simulation experiments show that, compared to a protocol stack consisting of 802.11 DCF for channel access, AODV or OLSR for unicast routing, and ODMRP for multicast routing, STORM attains similar or better performance for elastic traffic, and up to two orders of magnitude improvement in endto-end delays, with twice the amount of data delivery for real-time traffic while inducing considerably less communication overhead.

 

Existing System:

                   

            Unicast and multicast routes are established in coordination with the scheduling of transmissions and bandwidth reservations in a way that bandwidth and delay guarantees can be enforced on a per-hop and end-to-end basis. Results from detailed simulation experiments show that, compared to a protocol stack consisting of 802.11 DCF for channel access, AODV or OLSR for unicast routing, and ODMRP for multicast routing.

 

Proposed System:

 

                   A cross-layer framework is introduced for the effective dissemination of real-time and elastic traffic in multi-hop wireless networks called STORM (Scheduling and Traffic Management in Ordered Routing Meshes). STORM assumes that nodes share a single wireless channel organized into time frames consisting of a fixed number of time slots. The objective in STORM is to orchestrate the scheduling, routing and traffic management functions of a multi-hop wireless network in a way that sources and destinations of flows perceive the network as a virtual link dedicated to the dissemination of those flows. AODV or OLSR for unicast routing, and ODMRP for multicast routing, STORM attains similar or better performance for elastic traffic, and up to two orders of magnitude improvement in end-to- end delays, with twice the amount of data delivery for real-time traffic while inducing considerably less communication overhead.

 

 

 

MODULES:

 

1.CHANNEL STRUCTURE AND TRAFFIC MANAGEMENT

                                           Nodes share the same frequency band, and we assume

that clock synchronization among the nodes in the network is achieved through a multi hop time synchronization scheme such as the one implemented in Soft-TDMAC which is a TDMA based MAC protocol that runs over commodity 802.11 hardware. Nodes access the common channel assuming that it is organized using a time-division multiple access structure, which we call STORM frame. A STORM frame does not have any particular structure and any time slot can be used to transmit a sequence of packets (signaling or data).There is only one special purpose time slot used to admit new nodes to the network.

 

2.TRANSMISSION SCHEDULING:

                              The channel access algorithm used in STORM  consists of three simple ways to determine which node should transmit in a time slot. On every slot t with identifier (t mod N), node u with identifier idu first checks if it is the owner of the slot (i.e., if (t+idu) mod N = 0) and if so, u can access the channel. If node u does not own the slot, it checks if the owner is present in its two-hop neighborhood (i.e., if there is v N(N(u)) such that (t+idv) mod N = 0). If this is the case, then node u listens to the channel. the owner of the time slot is not present in the two-hop neighborhood node u checks if it has a reservation on the slot (t mod N), in which case it can access the channel. Otherwise, node u checks if there is v N(N(u)) such that v has reserved the slot (t mod N)

 

3.LOOP-FREE INTEREST-DRIVEN ROUTING AND END-TO-END SCHEDULING

   

3.1 Meshes and Enclaves

            

      Routing in STORM is based on destination meshes,routing meshes, and enclaves. To integrate unicast and multicast routing, a destination D is treated as a connected destination mesh containing one or more nodes. the rest of this paper, unless otherwise stated, we refer to routing meshes for elastic or real-time flows simply as routing meshes.

 

 

 

3.2 Information Stored

 

                           STORM uses mesh announcements (MA) to establish and maintain routing and destination meshes, to publish the availability of time slots in their corresponding  flow ordered intervals, to coordinate end-to-end schedules for real-time flows and, in the case of a multicast group, to elect the core of the group. As long as there are active sources, the elected core or unicast destination periodically floods the enclave of the destination with MAs that contain monotonically increasing sequence numbers.

 

4. MULTICAST TRAFFIC:

                 

                  In these experiments, each MCBR source transmits 10 packets of 200 bytes (which is the output size of the G.711 VoIP coder [10]) per second and the multicast group is composed of 20 nodes. In the first set of experiments nodes move around inside of a mobile square region of 900 ?900m2 and the remaining 80 nodes move following the random waypoint mobility model. In the second set of experiments the totality of the nodes move following the random waypoint mobility model. Sources are not group members. For STORM simulations, one out of three sources is defined as real-time. For instance, in a scenario with 6 MCBR sources, two of them are defined as real-time and the other four are defined as elastic. The selection of the real-time sources is random

 

HARDWARE & SOFTWARE REQUIREMENTS:

 

HARDWARE REQUIREMENTS:

 

  • System                                    :           Pentium IV 2.4 GHz.
  • Hard Disk                   :           40 GB.
  • Floppy Drive               :           1.44 Mb.
  • Monitor                       :           15 VGA Colour.
  • Mouse                         :           Logitech.
  • Ram                             :           256 Mb.

 

 

SOFTWARE REQUIREMENTS:

 

  • Operating system        : -         Windows XP Professional.
  • Front End                    : -         Visual Studio 2008.
  • Coding Language       : -         Visual C# .Net.



NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1