Improving Base Station Anonymity using Data Funneling and PID Controlled Fake Packets The Base Station (BS) is responsible for managing the network, it serves as a sink to all data and it serves a gateway to the outside world. Therefore, compromising the BS is the holy grail of Wireless Sensor Networks (WSN) hacking. One of the key techniques used in disabling a network is finding the physical location of the BS and destroying it. This can be achieved through traffic volume analysis. Since the sensor nodes usually send a small amount of data, the data can be cascaded into one Superpacket. This will reduce traffic as well as noise in the network. This technique is the underlying concept behind data funneling. However, data funneling can only reduce the traffic but the relative traffic of the BS compared to the other sensor nodes is still ginormous. Therefore, fake packets from the sensor nodes are needed to cloak the BS. In this paper, data funneling and Proportional Integral and Derivative (PID) controlled fake packets are used to reduce the number of packets sent to the BS and control fake packets generated by the sensor nodes to hide the BS respectively. The proposed system reduces the traffic of the system by a factor of K, where K is the ratio of 1 to the maximum number of packets that can be fused into one packet.

On the Secure Dispersed Data TransferOriented Path Construction Method for Different ID Trees in WSNs In wireless sensor networks (hereinafter referred to as WSNs), sensor terminals (hereinafter referred to as nodes) have a possibility of being affected by attacks such as eavesdropping and node capture attacks because the nodes use the wireless multihop communication. To deal with this problem, secure dispersed data transfer using the secret sharing scheme has been proposed for WSNs having multiple gateways (hereinafter referred to as GWs). In this scheme, Source initiated Routing ID Routing (hereinafter referred to as SRIDR) is used to construct paths, and the number of control packets can be reduced. On the other hand, the routing ID, which is required for routing in SRIDR, may be exhausted in a large scale network, and multiple ID trees may be constructed. Therefore, it has drawbacks that some nodes belong to a different ID tree from the GWs and cannot construct paths to the GWs in a large scale network. In this paper, we propose a new method that enables nodes to construct paths to the GWs which belongs to a different ID tree. As a result of comparing our proposed method and the existing method through simulation experiments, we have confirmed that the path construction ratio was improved and the data packet delivery ratio was improved accordingly.