Please use this identifier to cite or link to this item:
http://ptsldigitalv2.ukm.my:8080/jspui/handle/123456789/486984| Title: | An integrated partition avoidance protocol using probing scheduling and nearly shortest path routing for wireless sensor networks |
| Authors: | Mina Mahdavi (P39510) |
| Supervisor: | Mahamod Ismail, Prof. Dr. |
| Keywords: | Wirelesssensornetworks Computernetworks Detectors Sensornetwork Universiti Kebangsaan Malaysia -- Dissertations Dissertations, Academic -- Malaysia |
| Issue Date: | 23-Dec-2012 |
| Description: | Sensing coverage and network connectivity are the two main requirements to ensure proper operation of wireless sensor networks. Joint scheduling method satisfies the requirement of sensing coverage by using the randomized scheduling method, which divides sensor nodes to k subsets. Each sensor node randomly joins one predefined subset. Then, the algorithm turns on some extra sensor nodes for network connectivity. With such method, there are two reasons for the network to be partitioned. Firstly, to maintain network connectivity, some nodes should be active in more than one additional subset and some nodes may even stay on all the time. Secondly, extra active nodes are turned on to participate in other nodes routing. However, some of the extra-on nodes are subjected to many transmissions and receptions, in addition to the transmissions of their packets. Furthermore, both mentioned problems can cause rapid battery depletion in extra-on nodes and may lead to network partitioning. In this study, the probing mechanism scheduling and nearly shortest path algorithms in the joint scheduling method are proposed to minimize the number of extra-on sensor nodes. The proposed algorithm has been implemented, validated and evaluated using Matlab. In designing the algorithm, simulation parameters such as number of disjoint subsets, network coverage intensity, the size of the simulation area, sensing range, communication range, and the size of sensing area of each sensor have been used. The probing mechanism algorithm consists of three methods that allow for some nodes to change their working shift assigned by the randomized scheduling algorithm based on different scheduling rules. Using the probing mechanism algorithms, the number of extra active sensor nodes is reduced up to 35%. After utilizing the probing mechanism algorithms, the sensor nodes still transmit via the shortest path to the sink node. The probing mechanism scheduling algorithms are capable of removing redundancy from one subset and cover the blind points in other subsets. By using the nearly shortest path algorithm, the nodes find paths to the sink node via neighbouring nodes instead of turning on extra nodes. Nearly shortest path algorithm can reduce the number of extra-on sensor nodes by 96.85%. Integrating the probing mechanism and nearly shortest path algorithms can also reduce the number of extra-on sensor nodes up to 96.85%. The rescheduling process fulfilled by the probing mechanism in the integrated approach covers some blind points by the rescheduled sensor nodes. Hence, the integrated approach is preferable due to more than 96% reduction ratio of extra active sensor nodes and results in great reduction in the probability of partitioning.,Certification of Master's / Doctoral Thesis" is not available |
| Pages: | 123 |
| Call Number: | TK7872.D48.M338 2011 3 tesis |
| Publisher: | UKM, Bangi |
| Appears in Collections: | Faculty of Engineering and Built Environment / Fakulti Kejuruteraan dan Alam Bina |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| ukmvital_120318+SOURCE1+SOURCE1.0.PDF Restricted Access | 1.33 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.