Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by R.M. Bhavadharini
Total Records ( 2 ) for R.M. Bhavadharini
  R.M. Bhavadharini , S. Karthik and N. Karthikeyan
  Congestion in the network is a severe problem that affects the performance of MANET applications. When, a packet loss occurs in the wired medium, it clearly signs congestion in the network and suitable measures are taken to alleviate the effect of congestion. In a wireless environment, a packet can be lost for the factors such as wireless link error probability, link breakages, energy depletion, MAC contention fading and interference, etc. Due to various reasons contributing to the packet loss, Transmission Control Protocol (TCP) is unable to efficiently exploit the available network capacity in MANET. Across-layer congestion control algorithm with efficient Bandwidth Allocation and Dynamic Congestion Window Adaptation (CC-BADWA) is proposed in this study that uses TCP receiver’s prediction of bandwidth availability in the network and the receiver advertised window size back to the sender which then adjusts sender window. The timeout and the delayed acknowledgement can differently able the sender to predict the level of congestion in the network. When the acknowledgement is not received due to congestion in the network, the sender can estimate the transmission probability, adopt the dynamic congestion window size and transmit the packets. This improves the network throughput since, the sending rate is adjusted consistent to the currently prevailing network status. The bandwidth allocation uses the currently available bandwidth based on the present active connections and the route optimization proposed in this research selects the optimal path for data forwarding. The receiver’s timeliness helps to improve the network performance parameters throughput, end to end delay, packet delivery ratio of the existing method. The proposed algorithm is analyzed through ns 2 simulation tool.
  P. Ganesh Kumar , S. Karthik , R. Nidhya and R.M. Bhavadharini
  Real-road shortest-path finding algorithms involve large set of geographical data which include geo-tagged nodes and edges of the road network. Practical shortest path finding algorithms need minimized search-space for performing these computations by keeping these data in the computer’s conventional memory. The hierarchical pruning methods for minimizing the search-space to support real-road shortest algorithms are more suitable for connecting multiple cities and towns via highways. This study is to present a new suitable pruning method for intra-city shortest path finding, called elliptical pruning to bring the geo-tagged nodes and edges in to the memory for the subsequent shortest path finding process for the complex city road-transport networks.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility