Optimization of Collection Tree Protocol

Abstract

Collection tree protocol is a tree based protocol which is mainly used for aggregation. It is minimum cost routing tree which selects the path having minimum cost routing gradient. It will generate one or more trees to root which is called base station. When any node has data it sends data up the tree which is forwarded to root. CTP will provide link quality estimation among nearby neighbors. It will indicate number of transmissions from a node to send a packet to destination and whose acknowledgment is successfully received. It sends data to root by choosing a next hop. CTP is having a problem of fast energy depletion which is caused by congestion in the network. This problem can be diminished by several load balancing schemes to route information by other well connected routes. Also energy level of the network is not highly scalable. Whenever a node in a network is failed it is not able to do the function and it should not e ect on overall network. CTP is not a fault tolerant network because if any node fails due to energy depletion, packets will drop. When more number of nodes are added in the network, congestion will take place and so it does not have an additional energy to choose an optimal path. In revised CTP broadcast fault tolerant algorithm using CTP has been implemented. To enhance the energy level of a network RSSI is used in broadcast fault tolerant algorithm. RSSI is used to determine amount of radio energy present in the radio channel. Once the network is cleared for sending the data by sender node, it will send its packet to destination and the packet is sent to destination hop by hop. Once the packet is reached to destination, it will measure its RSSI value and also the signal strength of wireless network at di fferent power levels which will enhance the lifetime of the network. CTP su ers a problem by disseminating data statically in network. So in revised CTP line mobility model is integrated which will send data dynamically to sink node.