An Efficient Broadcast Authentication Scheme In Wireless Sensor Networks
The aim of this paper is to authenticate the broadcast source in wireless sensor network. This can help the sender to securely broadcast the messages to many receivers. They have played to reduce the delay in the authentication and also avoiding complexity. They have used bloom filter which help in reducing communication overhead. They proved that the efficiency is more compared to the pervious proposed models with the help of simulation tool known as NS-2. 35 simulator. They tried to solve the problems of energy consumption while doing the broadcast from sender to many receiver, communication should be accurate and computation overhead. Their main target is to get rid of DOS attack. Which was achieved at last.
They used XOR-based Bloom filter data structure and hash digest to avoid the delay of the authentication and to reduce the computational overhead. Bloom filter is basically an array with m bits and a set which has n elements. Bloom filter need k different hash function. The hash function can range from 0 to m-1 and they are mapped for the set above. They also used staggered-TESLA a message d is generated by a sender which is used as a authentication code and then a set s is created. A send packet format is created in which a packet authentication code is used and a commitment key is also generated. They have added many commitment keys to this algorithm to reduce the DOS attack and secure the process properly. The protocol of tesla is also updated after introducing the new BF algorithm to it, by using an XOR operation in it. They have used bloom filter vector which can help in reducing communication overhead. This vector is basically based on XOR logical function which can help in reducing the collision rate and produce an accurate answer. They have taken 2 encoding values and then XORed them which continues till the end. And finally they are mapped to cells which are in bloom filter. Now collision detection and XOR operations are used. In collision detection the collisions are detected with the help of cell. If the cell value is shown as 0 then we can say that cell has no values, but if the cell value is 1 and replaces again to 1 that is 1 has occurred twice then the collision is occurred and it is detected. After the detection then cell counter is increased and so on it continues. This method helps in finding number of hash cells. Then the second starts that is the XOR operation.
In this scenario in case if 2 MACs are hashed in a cell then there is a possibility of collision. In this case they are using an XOR in between 2 encoding values of the set in BF. After the completion of the process they have used NS-2. 35 to test their model of staggered TESLA and XOR Bloom filter together. They satisfied all the 3 conditions which they proposed that is the energy consumption, which help in reducing the energy and then the memory overhead and authentication delay. Mainly they satisfied the broadcast of data packets in a very secure way. The delay of the packets way only for 4s which is a good thing. They measured the value of node energy which is very necessary for authentication. This can be used to calculate authentication delay also. The hash function used above uses modern MD5 algorithm and SHA1 which is bit old but strong algorithm and it also used CRC32. The main advantages of this algorithm which is proposed is that it uses a very simple XOR operations in between 2 values of hash function which helps in reducing the error rate in the algorithm.
The proposed algorithm also helps in detecting and preventing from the DOS attack by using the above 2 algorithms. This is the fisrt time this algorithm is proposed and none of them have proposed till now. The detecting of packets has become very easy with this XBF algorithm. The collision rate has decreased a lot, its very minuet now. The main disadvantage is that it can consume a lot of energy to complete the whole process.
