| Type of Material: | Thesis |
| Title: | An Efficient Packet Scheduling with TDMA Technique for Secure Data Merge in Wireless Sensor Networks |
| Researcher: | AKILA, V |
| Guide: | SHEELA, T |
| Department: | Department of Engineering and Technology(Computer Science and Engineering) |
| Publisher: | Bharath University, Chennai |
| Place: | Chennai |
| Year: | 2019 |
| Language: | English |
| Subject: | Computer Science | Computer Science Theory and Methods | Engineering and Technology | Computer Science and Information Technology | Engineering and Technology |
| Dissertation/Thesis Note: | PhD; Department of Engineering and Technology(Computer Science and Engineering), Bharath University, Chennai, Chennai; 2019; D11CS013 |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 454718 | |
| 003 | IN-AhILN | |
| 005 | 2024-09-18 15:35:43 | |
| 008 | __ | 240918t2019||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_454718 |
| 040 | __ | |aBHAU_600073|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aAKILA, V|eResearcher |
| 110 | __ | |aDepartment of Engineering and Technology(Computer Science and Engineering)|bBharath University, Chennai|dChennai|ein |
| 245 | __ | |aAn Efficient Packet Scheduling with TDMA Technique for Secure Data Merge in Wireless Sensor Networks |
| 260 | __ | |aChennai|bBharath University, Chennai|c2019 |
| 300 | __ | |dDVD |
| 502 | __ | |bPhD|cDepartment of Engineering and Technology(Computer Science and Engineering), Bharath University, Chennai, Chennai|d2019|oD11CS013 |
| 520 | __ | |aWireless Sensor Networks have limited power capabilities and it has to serve real time applications which usually to be delivered before a deadline without collision. Hence it is essential to avoid collisions, reduce energy consumption and to have real time behavior .To achieve this goal we proposed a hybrid technique priority queues in combination with TDMA technique. In this priority queue, each node except the node at the last level has three levels of priority queues. Real-time packets are placed in the highest priority queue1. It can be processed with minimum delay. It can preempt the packets in the other queues. Non Real-time remote packets and local packets are placed in the second priority queue2 and priority queue3.Leaf nodes have one real-time packets queue and other for non-real-time local packets. Data Merge is applied in the parent node before transmitting the data into the other nodes. To reduce the number of transmission, efficient data merge technique is used to merge the data packet in inte |
| 650 | __ | |aComputer Science and Information Technology|2UGC |
| 650 | __ | |aEngineering and Technology|2AIU |
| 653 | __ | |aComputer Science |
| 653 | __ | |aComputer Science Theory and Methods |
| 653 | __ | |aEngineering and Technology |
| 700 | __ | |aSHEELA, T|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/311629|yShodhganga |
| 905 | __ | |afromsg |
User Feedback Comes Under This section.