Abstract
There are many routing protocols on sensor networks, but nearly all of them are not secure. Routing protocols without security mechanism would expose the whole network to danger environment. Adversaries can paralyze the routing topology and all the data would not be sent to the destination successfully. Though there is much research on secure protocols for sensor networks, it is still not sufficient for routing issues. In this study we review the SRPSN and suggest several possible flaws. We list the attacks available on SRPSN and analyze how the attacks happen. Then, we propose a secure routing protocol that is based on the breadth first tree structure. This is a clear and simple structure to maintain the shortest routing path. We build the routing path in the initial phase of the network setting. The pre-routing path establishment is authenticated to provide security against the adversary. To avoid large overhead of authentication of all nodes, a simple lightweight authentication is taken in this phase. Methods of authentication among sensor nodes after initial phase are also proposed. Different to the initial authentication on routing, we use a more secure method to implement it. This is because the adversary can begin to collect the routing information among the nodes. To save energy we minimize the conditions of authentication. Some rules of routing are also addressed to achieve the goal of energy efficiency. Besides, methods of detecting compromised nodes are proposed to prevent the network from intrusion attacks. Finally, security and performance analyses are also presented in this study. From these analyses we show that our routing protocol is energy efficient and by which rule we can take when meeting different applications.