Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Indonesian Journal of Electrical Engineering and Computer Science
D. Siva Kumar
Easwari Engineering College

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Cooperative and fresher encounter algorithm for reducing delay in MANET Noor Alleema; D. Siva Kumar
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 3: June 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v14.i3.pp1258-1265

Abstract

In Mobile Ad-hoc Networks (MANET), the route discovery is the chief problem for the nodes. In this paper Cooperative and Fresher Encounter Algorithm (CFEA) for Reducing Delay in MANET is proposed. The route discovery problem has been overcome by FResher Encounter algorithm. It is a simple algorithm for discovery the routes in efficient manner in the MANET. The node has the memory of past route details that communicate with remaining nodes. The node prefers to find the intermediate node instead of finding the destination node, that intermediate node keeps the knowledge of recently encounter the destination node. Then the intermediate node communicates with the node which is encountered the destination node recently, and the process is continued until the destination is attained. The main advantage of the scheme is reducing the process time.
An obstacle aware mobile sink path strategy in WSN T. H. Feiroz Khan; D. Siva Kumar
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 2: August 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i2.pp879-887

Abstract

In Wireless Sensor Networks, Mobile Sink accomplishes considerable achievement on network lifetime improvement. In sensing environment, more chances to present the obstacle. But, in the mobile sink, how to identify the obstacle and make the obstacle aware path strategy is a challenging task. To overcome this problem, we propose an Obstacle Aware Mobile sink Path Strategy (OAMPS) that detects any obstacles which enter within the network lifetime and design a shortest mobile sink movement path avoiding detected obstacles. In this scheme, the mobile sink collects the sensing data from the super node then it sends the data to the base station. Here, static or moving obstacles are present when the mobile sink moves the path scheduling by spanning graph. This algorithm is introduced to discovering the obstacle avoiding shortest path. The source selects the route by the updated cuckoo search algorithm. The simulation results show that the OAMPS improved the throughput and minimized the delay in the network.
Co-Authors Noor Alleema T. H. Feiroz Khan