| Summary: | 碩士 === 世新大學 === 資訊管理學研究所(含碩專班) === 99 === In recent years wireless sensor networks have been developing rapidly. Wireless sensor networks are composed by multiple sensor nodes and a sink node. A sensor node sense temperature, humidity, brightness, gravity and location, and it can also be customized according to different requirements.
Due to the variety and convenience, wireless sensor networks have been applied in different fields, such as military and medical. Therefore the security of wireless sensor networks becomes a very important issue. If can not be guaranteed, it might cause the loss in the wars or compromise patients’ privacy.
Our proposed Probabilistic Random Path mechanism can prevent attackers using tracing method to find the location of sink node. Fake messages are also used to prevent attackers from using traffic analysis to locate the sink node. By doing so, we can achieve the goal of protecting sink node. In the proposed PRP scheme, the further the distance between a node and the sink node, the higher the probability that the node will transmit data packets toward the sink node. This strategy can shorten the path length from sensor node to the sink node. Besides, fake messages are transmitted on-demand and thus the amount of fake message can be reduced. Therefore, our proposed scheme can enhance the performance of networks and minimize the energy consumption.
In this thesis, we compare the security strength and the performance of networks of Probabilistic Random Path(PRP) against some famous schemes, such as shortest path、random path and Location privacy routing protocol(LPR).
|
|---|
