No abstract

No abstract

No abstract

In order to obtain the availability of roads and bridges after earthquake, a real-time monitoring system is build by wireless sensor networks. And a new key management scheme is proposed to protect the safety of the system. The scheme is based on the polynomial and the Chinese Remainder Theorem, divided into three stages which are system initialization, key establishment, node join and revocation. Analysis shows that the new scheme greatly reduces the storage space and the energy consumption of calculation and communication of node. It is suitable for post-disaster road monitoring system.

In this paper, we study the node deployment in long narrow area of wireless sensor networks. Currently, studies on node deployment of wireless sensor networks mostly concentrated in two-dimensional flat area and three-dimensional space area which are complicated or inapplicable for long narrow area. The significant difference of node deployment between long narrow area and two-dimensional area is that the nodes in two-dimensional monitored area can be deployed anywhere, while the nodes in long narrow area can only be deployed by side with the environmental constraints. Considering the coverage, connectivity and reliability, we give out the densities and numbers of needed nodes in node deployment scheme for both 1-connected cover and k-connected cover in long narrow area covered completely by sensor networks.