Dynamic control of coding for progressive packet arrivals in dt ns(9611502400)

50 %
50 %
Information about Dynamic control of coding for progressive packet arrivals in dt...
Education

Published on March 4, 2014

Author: NaveenKumar358

Source: slideshare.net

Description

Dear IT Aspirants ,
Greetings from Embedpark , Bangalore!!!
Embedpark Innovations pvt ltd, Bangalore offers Total Developement solutions and Embedpark Innovations projects for freshers, working professionals and corporate in the below mentioned technologies:-
Final Year Projects Include:
1. Embedded Systems(Embedded / ARM / PIC/ MC/ MP)
2. Robotics
3. Linux Based Projects
4. Developement on FPGA / VLSI
5. Android
6. Mobile Applications
7. Website Developement
8. Database Design and Applicatios
9. MS ASP.Net, C# .Net, VB.Net, VC++ .net
10.JAVA / Advance - Java Projct
11.Big Data Hadoop
12.PHP
Embedpark Innovations pvt ltd, Bangalore has a dedicated total Developement & solutions in the Industry.
For further IEEE Projects details about Embedded System , VLSI, Android, Dot net, JAVA for IEEE 2013-14 Projects,
Source code+Documents+Review Document Slides+Softwares+Explanation+Execution
Feel free to contact the concerned person mentioned below:
Contact:Name: Naveen Kumar
Address: Embedpark Innovations Pvt.Ltd, #20/233, Manandi Towers, 9th Main Road, Above ING Vysya Bank, 2nd floor , Jayanagar 3rd block Bangalore, India-560011
Contact: 9886733705 / 9886289694

Dynamic Control of Coding for Progressive Packet Arrivals in DTNs ABSTRACT: In Delay Tolerant Networks (DTNs) the core challenge is to cope with lack of persistent connectivity and yet be able to deliver messages from source to destination. In particular, routing schemes that leverage relays’ memory and mobility are a customary solution in order to improve message delivery delay. When large files need to be transferred from source to destination, not all packets may be available at the source prior to the first transmission. This motivates us to study general packet arrivals at the source, derive performance analysis of replication based routing policies and study their optimization under two hop routing. In particular, we determine the conditions for optimality in terms of probability of successful delivery and mean delay and we devise optimal policies, so-called piecewise-threshold policies. We account for linear block-codes and rate less random linear coding to efficiently generate redundancy, as well as for an energy constraint in the optimization. We numerically assess the higher efficiency of piecewise-threshold policies compared with other policies by developing heuristic optimization of the thresholds for all flavors of coding considered. EXISTING SYSTEM: Delay Tolerant Networks (DTNs) leverage contacts between mobile nodes and sustain end-to-end communication even between nodes that do not have end-to-end connectivity at any given instant. In this context, contacts between DTN nodes may be rare, for instance due to low densities of active nodes, so that the design of

routing strategies is a core step to permit timely delivery of information to a certain destination with high probability. When mobility is random, i.e., cannot be known beforehand, this is obtained at the cost of many replicas of the original information, a process which consumes energy and memory resources. Since many relay nodes (and thus network resources) may be involved in ensuring successful delivery, it becomes crucial to design efficient resource allocation and data storage protocols. DISADVANTAGES OF EXISTING SYSTEM: The core challenge is to cope with lack of persistent connectivity and yet be able to deliver messages from source to destination. The routing schemes that leverage relays’ memory and mobility are a customary solution in order to improve message delivery delay. When large files need to be transferred from source to destination, not all packets may be available at the source prior to the first transmission. PROPOSED SYSTEM This paper focuses on general packet arrivals at the source and two-hop routing. We distinguish two cases: when the source can overwrite its own packets in the relay nodes, and when it cannot. The contributions are fourfold: For work-conserving policies (i.e., the source sends systematically before stopping completely), we derive the conditions for optimality in terms of probability of successful delivery and mean delay. In the case of non-overwriting, we prove that the best policies, in terms of delivery probability, are piecewisethreshold. For the overwriting case, work-

conserving policies are the best without energy constraint, but are outperformed by piecewise-threshold policies when there is an energy constraint. We extend the above analysis to the case where copies are coded packets, generated both with linear blockcodes and rateless coding. We also account for an energy constraint in the optimization. We illustrate numerically, in the non-overwriting case, the higher efficiency of piecewise-threshold policies compared with work-conserving policies by developing a heuristic optimization of the thresholds for all flavors of coding considered. As well, in the overwriting case, we show that work-conserving policies are the best without any energy constraint. ADVANTAGES OF PROPOSED SYSTEM: In DTNs the framework is different since the challenge is to overcome frequent disconnections. Papers propose a technique to erasure code a file and distribute the generated code-blocks over a large number of relays in DTNs, so as to increase the efficiency of DTNs under uncertain mobility patterns. The performance gain of the coding scheme is compared with simple replication. The benefit of coding is assessed by extensive simulations and for different routing protocols, including two hop routing. The paper addresses the design of stateless routing protocols based on network coding, under intermittent end-to end connectivity, and the advantage over plain probabilistic routing is proven.

ALGORITHMS USED: Algorithm-1 Constructing an optimal WC policy

Algorithm-2 Rateless coding after tK SYSTEM CONFIGURATION:HARDWARE CONFIGURATION:Processor - Pentium –IV Speed - 1.1 Ghz RAM - 256 MB(min) Hard Disk - 20 GB

Key Board - Standard Windows Keyboard Mouse - Two or Three Button Mouse Monitor - SVGA SOFTWARE CONFIGURATION:Operating System : Windows XP Programming Language : JAVA Java Version : JDK 1.6 & above. REFERENCE: Eitan Altman, Lucile Sassatelli, and Francesco De Pellegrini –“Dynamic Control of Coding for Progressive Packet Arrivals in DTNs”- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 12, NO. 2, FEBRUARY 2013.

Add a comment

Related presentations

Related pages

DENICdirect-Informationsseite: www.denic.de

Informationsseite. Die aufgerufene Domain ist derzeit nicht erreichbar. Falls Sie sich als administrativer Ansprechpartner bzw. als Domaininhaber nicht ...
Read more

IEEE Xplore Digital Library

IEEE Xplore. Delivering full text ... Robotics & Control Systems; Signal Processing & Analysis; Transportation; Browse. Books & eBooks; Conference ...
Read more

ASME - The American Society of Mechanical Engineers

ASME (American Society of Mechanical Engineers) ... Introduction to Dynamics and Control in Mechanical Engineering Systems. Expected March 2016, ...
Read more

Multi-layer active queue management and congestion control ...

"In view of the video coding technique, ... The TSAQM is comprised of Dynamic Weight Allocate Scheme ... Progressive placement, ...
Read more

TRANSIT-Informationsseite: www.denic.de

TRANSIT-Informationsseite. Die aufgerufene Domain ist derzeit nicht erreichbar. Der Domaininhaber bzw. der administrative Ansprechpartner ist bereits über ...
Read more

Google

Advertising Programmes Business Solutions +Google About Google Google.com © 2016 - Privacy - Terms. Search; Images; Maps; Play; YouTube; News; Gmail ...
Read more

Computing The Quality of Experience in Network Modeled by ...

... data packet arrivals in cellular ... Fig. 11.The cost for progressive streaming versus the ... ing and congestion control for adaptive video ...
Read more