Wireless Communication

V. Nancy Keerthika ¹, D. Elavarasi ²

Affiliations
1 Computer Science and Engineering, Mount Zion College of Engineering and Technology, Pudukkottai, Tamilnadu, IN
2 Department of Computer Science and Engineering, Mount Zion College of Engineering and Technology, Pudukkottai, Tamilnadu, IN

Abstract

In many surveillance applications of WSNs (Wireless Sensor Networks), tracking a mobile target is one of the main objectives. When nodes are tracking a target, the tracking performance can be improved only if moving path of the target can be predicted and nodes along the moving path can be awakened. Sleep scheduling protocol is proposed in this project for improving the energy efficiency of sensor nodes. Here a target prediction method is based on both kinematics and probability in which kinematics is used to predict the motion of the target and probability is used to predict the directional changes of the actual target motion. The protocol selects the node to be awakened in order to reduce the active time of individual node. Thus by power conservation can be achieved. It also sends the prediction details to base station. The protocol also makes the network scalable.

Keywords

Energy Efficiency, Kinematics, Sleep Scheduling, Target Prediction, Tracking Performance.

Full Text

     

G. Surya ¹, S. Anjuga ², D. Elavarasi ¹

Affiliations
1 Computer Science of Engineering in Mount Zion College of Engineering and Technology, Pudukkottai, Tamilnadu, IN
2 Computer Science of Engineering in Anna University, Tiruchirapalli, Tamilnadu, IN

Abstract

Explicit congestion control (XCC) is one of the answers for the problem occurs in current TCP algorithm. TCP has the some limitations of the limited fairness, higher queuing retard, static dynamic range, unstable throughput. This approach requires large buffer size at bottleneck routers to prevent transient packet losses and is slower in convergence to steady-state as compared to other methods. Routers furnish multibit feedback to origins which increases the throughput more accurate for the path bandwidth with larger convergence times. We map three possible algorithms for Explicit Congestion Control which holds efficiency from queue dynamics. This paper proposes two additional protocols for new flow control which are XCP and RCP and both have been designed as xcp-winf and rcp-winf. This approach evaluates the performance of XCP, xcp-winf and compares them with existing TCP congestion control.

Keywords

Congestion Control, Bottleneck, Bandwidth, Feedback, XCP_WINF.

Full Text