Converge-Cast network

NANO SCIENTIFIC RESEARCH CENTRE PVT.LTD.,  AMEERPET, HYD

WWW.NSRCNANO.COM, 09640648777, 09652926926

DOT NET PROJECTS LIST--2013

DOT NET 2013 IEEE PAPERS

Converge-Cast network

Abstract

We define an ad hoc network where multiple sources transmit packets to one destination as Converge-Cast network. We will study the capacity delay tradeoffs assuming that n wireless nodes are deployed in a unit square. For each session1, k nodes are randomly selected as active sources and transmit one packet to a particular destination node, which is also randomly selected. We first consider the stationary case, where capacity is mainly discussed and delay is entirely dependent on the average number of hops. We find that the per-node capacity is Θ(1/ √ n log n)2, which is the same as that of unicast, presented in [3]. Then node mobility is introduced to increase network capacity, for which our study is performed in two steps. The first step is to establish the delay in single-session transmission. We find that the delay is Θ(n log k)under 1-hop strategy, and Θ(n log k/m) under 2-hop redundant strategy, where m denotes the number of replicas for each packet. The second step is to find delay and capacity in multisession transmission. We reveal that the per-node capacity and delay for 2-hop non-redundancy strategy are Θ(1) and Θ(n log k) respectively. The optimal delay is Θ( √ n log k + k) with redundancy, corresponding to a capacity of Θ( _ 1 n log k + k n log k ). Therefore we obtain that the capacity delay tradeoff satisfies delay/rate ≥ Θ(n log k) for both strategies

Existing System

We define an ad hoc network where multiple sources transmit packets to one destination as Converge-Cast network. We will study the capacity delay tradeoffs assuming that n wireless nodes are deployed in a unit square. For each session (the session is a dataflow from k different source nodes to 1 destination node), k nodes are randomly selected as active sources and each transmits one packet to a particular destination node, which is also randomly selected

Proposed System

We first consider the stationary case, where capacity is mainly discussed and delay is entirely dependent on the average number of hops. We find that the per-node capacity is Θ(1/ √ n log n)2, which is the same as that of unicast, presented in [3]. Then node mobility is introduced to increase network capacity, for which our study is performed in two steps. The first step is to establish the delay in single-session transmission. We find that the delay is Θ(n log k)under 1-hop strategy, and Θ(n log k/m) under 2-hop redundant strategy, where m denotes the number of replicas for each packet. The second step is to find delay and capacity in multisession transmission. We reveal that the per-node capacity and delay for 2-hop non-redundancy strategy are Θ(1) and Θ(n log k) respectively. The optimal delay is Θ( √ n log k + k) with redundancy, corresponding to a capacity of Θ( _ 1 n log k + k n log k ). Therefore we obtain that the capacity delay tradeoff satisfies delay/rate ≥ Θ(n log k) for both strategies

Software Requirements

Hardware Requirements:

• PIV 2.8 GHz Processor and Above
• RAM 512MB and Above
• HDD 20 GB Hard Disk Space and Above

Software Requirements:               

• WINDOWS OS (XP / 2000 / 200 Server / 2003 Server)
• Visual Studio .Net 2008 Enterprise Edition
• Sql server 2005
• Internet Information Server 5.0 (IIS)