Tingyao Jiang

Learn More
Mobile ad hoc networks (MANETs) are a collection of wireless hosts that can be rapidly deployed as a multi-hop packet radio network without the aid of any established infrastructure or centralized administration. The routing security is a critical problem for MANETs. However, existing protocols are not sufficient for security requirements. In this paper, we(More)
—Aiming at improving the precision of nodes' localization, this paper analyses the source of the localization error when using the least square algorithm, and proposes the principle to choose the benchmark anchor nodes in reducing the power of equation. Based on this principle, the algorithm choosing the nearest node as the benchmark anchor node in LSM and(More)
Security is a critical challenge for robust and reliable wireless sensor networks. In this paper, A novel dynamic intrusion detection scheme for cluster-based wireless sensor networks is presented. The nodes in a wireless sensor network are grouped into clusters based on the special relationships with a cluster head in each cluster. The proposed scheme(More)
Secure multicast is an effective group communication technology for information sharing and message exchange in emerging grids. As the group scale in grids may be very large and group members can be very unstable (a member can join or quit the group dynamically), it is hard for conventional group key management schemes to satisfy the efficiency of group key(More)
Self-stabilization is an attractive approach to tolerate transient faults such as link failures or new link creations due to nodes mobility in mobile ad hoc networks. Multicasting is an important communication service that allows the source node to efficiently transmit copies of data packet to a set of destination nodes. In this paper, a self-stabilizing(More)
Scheduling for dependent tasks is NP-hard. In this paper, we propose a greedy algorithm that can generate a shorter schedule than other major algorithms. The time complexity of our algorithm is O(dv/sup 2/ logv), where v represents the number of tasks and d represents the maximum in degree of tasks. Simulation results show that the proposed algorithm(More)