Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks

In the asymptotic regime, we show that each node’s probability that the node serves a packet arriving to the network approaches the products of half the length of the Voronoi cell perimeter and the load density function that a packet goes through the node’s location. The density function depends on the traffic pattern generated by straight line routing, and determines where the hot spot is created in the network. Hence, contrary to conventional wisdom, straight line routing can balance the load over the network, depending on the traffic patterns.

Existing System:

A dust mote is an autonomous node incorporating sensing, computing, communications and a power source in a mm3 volume. A collection of dust motes is dispersed throughout an environment. Dust motes use wireless communication to relay information to a base station over distances of 10s to 1000s of m.

Proposed System:

We analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of packets served at a node, induced by straight line routing. For a given total offered load on the network, our analysis shows that the nodal load at each node is a function of the node’s Voronoi cell, the node’s location in the network, and the traffic pattern specified by the source and destination randomness and straight line routing.

Modules:

  • Networking Module

  • Shortest Path Module

  • Straight Line Routing Module

  • Multi Hop Module

  • Graphical Module

Tools Used:

Front End : Visual Studio Dot Net 2005
Coding Language : C#.NET