Energy efficient routing protocol in ban using distributed cut detection (DCD) algorithm

Abstract

In Body Area Network the role of communication plays a vital role. All communication is done by means of nodes. There will be several nodes in a communication. Each node communicates with other nodes irrespective of the task achieved by it. During nodes communication some nodes will become a failure node and it is technically termed as “cut” in the field of wireless communication system. This failure nodes actually disturbs the entire communication which will result in the loss of data which in-turn lowers the efficiency of the entire system. So at any cost such type of failure node activity should be eradicated in order to improve the efficiency of the entire system. So to solve this problem we are going to follow the cut detection and eradication algorithm in order to improve the efficiency and life time of the communications. Here this algorithm will find out the failure nodes that are found during the communication. This failure node is found out by means of acknowledgement of each node which will be given back to the corresponding server. So in particular time we wont get the acknowledgement from certain nodes for a longer time that means that particular node will be a failure node and this failure node will be eradicated from the communication. A new route will be discovered by the other nodes in order to carry out the entire communication process without any delay.