A sink moving scheme based on local residual energy of nodes in wireless sensor networks

In the application of periodic data-gathering in sensor networks,sensor nodes located near the sink have to forward the data received from all other nodes to the sink,which depletes their energy very quickly.A moving scheme for the sink based on local residual energy was proposed.In the scheme,the sink periodically moves to a new location with the highest stay-value defined by the average residual energy and the number of neighbors.The scheme can balance energy consumption and prevent nodes around sink from draining their energy very quickly in the networks.The simulation results show that the scheme can prolong the network lifetime by 26%-65%compared with the earlier schemes where the sink is static or moves randomly.

Secure and efficient multi-message and multi-receiver ID-based signcryption for rekeying in ad hoc networks

In this paper, the security technology of ad hoc networks is studied.To improve the previous multi-receiver signcryption schemes, an ID-based multi-message and multi-receiver signcryption scheme for rekeying in ad hoc networks is proposed.In this scheme, a sender can simultaneously signcrypt n messeges for n receivers, and a receiver can unsigncrypt the ciphertext to get his message with his own private key.An analysis of this scheme indicates that it achieves authenticity and confidentiality in the random oracle model while being of lower computation and communication overhead.Finally, for the application of our scheme in ad hoc, a threshold key updating protocol for ad hoc networks is given.

Maximum Data Collection Rate in Rechargeable Wireless Sensor Networks with Multiple Sinks

In rechargeable wireless sensor networks, a sensor cannot be always benefi cial to conserve energy when a network can harvest excessive energy from the environment due to its energy replenished continually and limited energy storage capacity. Therefore, surplus energy of a node can be utilized for strengthening packet delivery efficiency and improving data collection rate. In this work, we propose an algorithm to compute an upper data generation rate that maximizes it as an optimization problem for a network with multiple sinks, which is formulated as a linear programming problem. Subsequently, a dual problem by introducing Lagrange multipliers is constructed, and subgradient algorithms are used to solve it in a distributed manner. The resulting algorithms are guaranteed to converge to an optimal data generation rate, which are illustrated by an example in which an optimum data generation rate is computed for a network of randomly distributed nodes. Through extensive simulation and experiments, we demonstrate our algorithm is efficient to maximize data collection rate in rechargeable wireless sensor networks.

Multiple Mobile Sinks Data Dissemination Mechanism for Large Scale Wireless Sensor Network

WSN has been developing from traditional environment monitoring applications to the ubiquitous information services such as the Congestion-oriented Intelligent Transportation System （ColTS）. However, the mobility of nodes makes data dissemination a hard nut to crack. In this paper, we propose MSDD, a multiple mobile sinks data dissemination mechanism for solving the dissemination problem. The main ideas of MSDD are constructing a two-tier grid structure by a designated sink, exploiting a hierarchical monitoring mechanism, and employing a global agent to track the sink locations in order to make the emergencies reported to the sinks immediately, In addition, MSDD supports the query-driven data dissemination. Being compared with TTDD, MSDD is theoretically proved to have less communication overhead. We also validate MSDD outperforms TTDD in reliability and the emergency delivery latency bv simulations.