Scribd Logo
Загрузить

Добро пожаловать в Scribd!

  • 2nd Phase

    Загружено:

    Swadhin Goswami
    36 просмотров19 страниц
    Under the guidance of Mrs. Sangeetha V, four students - Sharath Bhat, Spurthi V, Sneha V Rao, and Sowmya H N - proposed a system to tackle congestion in wireless sensor networks. The system divides data into fragments, encrypts each fragment, and sends the encrypted fragments from the source to destination using dynamic source routing. This allows multiple paths to be used, helps control congestion efficiently, and provides more security. The best path can be selected based on parameters like time delay, buffer occupancy, and available power.

    Исходное описание:

    Оригинальное название

    2nd Phase Ppt

    Авторское право

    © Attribution Non-Commercial (BY-NC)

    Доступные форматы

    PPTX, PDF, TXT или читайте онлайн в Scribd

    Этот документ был вам полезен?

    Это неприемлемый материал?

    Пожаловаться на этот документ
    Under the guidance of Mrs. Sangeetha V, four students - Sharath Bhat, Spurthi V, Sneha V Rao, and Sowmya H N - proposed a system to tackle congestion in wireless sensor networks. The system divides data into fragments, encrypts each fragment, and sends the encrypted fragments from the source to destination using dynamic source routing. This allows multiple paths to be used, helps control congestion efficiently, and provides more security. The best path can be selected based on parameters like time delay, buffer occupancy, and available power.

    Авторское право:

    Attribution Non-Commercial (BY-NC)
    Скачайте в формате PPTX, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    36 просмотров19 страниц

    2nd Phase

    Загружено:

    Swadhin Goswami
    Under the guidance of Mrs. Sangeetha V, four students - Sharath Bhat, Spurthi V, Sneha V Rao, and Sowmya H N - proposed a system to tackle congestion in wireless sensor networks. The system divides data into fragments, encrypts each fragment, and sends the encrypted fragments from the source to destination using dynamic source routing. This allows multiple paths to be used, helps control congestion efficiently, and provides more security. The best path can be selected based on parameters like time delay, buffer occupancy, and available power.

    Авторское право:

    Attribution Non-Commercial (BY-NC)
    Скачайте в формате PPTX, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 19

    Sharath Bhat .A.S[1SG08CS068] Spurthi.V [1SG08CS077] Sneha.V.Rao [1SG08CS075] Sowmya.H.

    N [1SG08CS076]

    Under the guidance of Mrs.Sangeetha.V. Sr.Lecturer Dept of CSE

    Problem Statement System Architecture Methodology Implementation Plan Of Execution Results Conclusion

    As wireless sensor networks are evolving to applications where high load demands dominate and performance becomes a crucial factor, congestion remains a serious problem that has to be effectively and efficiently tackled.

    SOURCE

    DSR

    SOFT DECISION

    HARD DECISION

    TIME DELAY

    BUFFER OCCUPANCY

    POWER AVAILABLE

    COMBINATION OF ALL PARAMETERS

    DESTINATION

    The packets are sent from source to destination either by Soft decision phase Hard decision phase
    It does so by considering various parameters like time delay buffer occupancy power available Combination of all the above parameters

    i)Data Fragmentation The large data payload is divided into smaller fragments. Data payload of length L
    L
    DF1 DF2 DF3 DF4

    ii)Triple Des Encryption


    Data

    fragment is converted into bytes.

    The

    data is encrypted based on key and cipher. bytes are XORed thrice with key and cipher.

    Data

    Triple DES diagram


    DF1

    DES

    DF1` KEY CIPHER


    DES

    DF2` KEY CIPHER


    DES

    KEY CIPHER
    DF3`=E1

    Encrypted data enveloped into packet

    Format for each data packet is as follows

    SOURCE ID

    ENCRYPTED DATA

    DESTINATION ID

    SEQUENCE NO

    In DSR , information are propagated based on one-hop neighbourhood information. Specifically, a sensor node maintains a neighbour list, which contains the ids of all nodes within its transmission range. It is used to find multiple routings.

    Source node

    Fetch node in routing table

    Fetch node in coverage area

    Check whether the nodes contain destination

    Cache the route

    Obtain nodes in the fwd dirn

    Pick the node according to the rule

    Data

    Division

    Encryption

    Dynamic

    Source Routing

    DATA DIVISION

    getDataFragments() getAllPackets() getPacketData()

    ENCRYPTION

    getEncryptedDatapayload() encripthdata( ) setKey() setUpcipher() encrypt() getDecriptedDatapayload() decrypt()

    DYNAMIC SOURCE ROUTING

    getNodes() fetchCoverageNodes() packetBroadcastNode() checkDestinationCoverageNodes() getCoverageAreaForwardNodes()

    Sl No 1 2 3 4

    Tasks Design Analysis Implementation of Module 1 Implementation of Module 2

    Deadline 21-Feb-2012 1-March-2012 8-March-2012 14-March-2012

    Status Completed Completed Completed Completed Completed Completed Pending Pending

    5
    4 7 8 9 10 11

    Implementation of Module 3
    Implementation of Module 4 Implementation of Module 5 Implementation of Module 6 Testing Preparation of Final Report Submission of Report

    20-March-2012
    28-March-2012 1-April-2012 13-April-2012

    24-April-2012
    10-May-2012 15-May-2012

    Pending
    Pending Pending

    12

    Final Demo

    15-May-2012

    Pending

    Data payload is divided into fragments, that are further encrypted and formed as packets. Finally, it provides multiple paths by using DSR.

    Congestion is efficiently controlled since it provides multiple paths using DSR. It provides more security.

    Further, the best path can be obtained considering the various parameters.

    Вам также может понравиться