Browsing by Author "Sangeetha, M"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    ENHANCED ENERGY EFFICIENT ROUTING PROTOCOL FOR ON DEMAND DISTANCE VECTOR ROUTING TO IMPROVE COMMUNICATION IN BORDER AREA MILITARY COMMUNICATION
    (Prof.Dr. İskender AKKURT, 2024-10-02) Sangeetha, M; Parvathy, S; Deiwakumari, K; Veena, T; Badrinarayan, D
    Soldiers get rescue services through static wireless node heliports and medical ambulance to provide special service, in a battle field. The Mobile Ad hoc Network environment takes wireless communication across border communication to connects the source of multiple serves in military applications. The mobile node acts as mobile equipment to rescue the soldier. Due to increasing delay tolerance and latency overhead the performance eon network is degraded, to resolve this problem , this paper concentrates on Region and Mobility based Route Request Processing in AODV (RMRRP) is proposed in controlling Route Request Processing mechanism based on node mobility for reducing the routing overhead in AODV. The routing algorithm which guarantees services to the soldier in a shortest time also evaluate the energy efficiency of RMRRP with the existing AODV, DSDV, DSR routing algorithms. Efficiently reduce the overall overhead to a considerable level and significantly improve the overall performance by finding a rectangular region as a forwarding zone and only the nodes within the rectangular region are allowed to forward the RREQ message from source to the destination, hence the overhead in establishment of a stable shortest path gets reduced very much. Network region is minimized. Routing request packets generated is less and route request is reduced. Region width is limited to 150m and within that covered area only route discovery and route maintenance is carried out. Control packets are reduced within the limited rectangular region and data packets are able to send more. Avoiding link breaks to send and receive more data packets with a limited number of control packets hence consumes considerable energy. Simulation result reveals that with nodes 50 the Packet delivery Fraction is 90.60 , Routing overhead is 11376, Normalized Routing Load is 3.61 , Throughput is 261.94Kbps, MAC Load is 39.17 , Energy consumption is 4.64 Joules.
  • No Thumbnail Available
    Item
    AN OPTIMIZED WEIGHTED CONSENSUS CLUSTERING WITH REMOVAL OF LESS INFORMATIVE COMPOSITE CLUSTERS
    (IEEE, 2022-05-02) Sangeetha, M; Kousalya, R
    The most demanding processes in clinical diagnostics are the proper classification of cancer from a large amount of Gene Expression Data (GED). This article proposes a Weighted Consensus of Lion Optimized K-means Ensemble with Peak Density Clustering (WECLO K-means-PDC) algorithm, which disregards the less informative composite clusters to increase the accuracy of classifying the GED. This algorithm refines the clusters at all iterations by considering the Symmetric Neighbourhood (SN) correlation among data elements. For this clustering, the lion optimization algorithm is applied instead of random subspace and sampling which assumes the cluster validation metrics as fitness functions for effective clustering. Also, the SN Graph (SNG) is constructed over each data element using the adaptive PDC combined with K-means clustering. This SNG helps to choose the number of cluster centroids and refines the clusters at each iteration of K-means clustering without computing the cut off distance between two data elements. By using the SNG, the outliers are signified as the data elements having fewer than two neighbours. Moreover, all data elements are allocated to a suitable cluster by the breadth-first search on SNG and the less informative composite clusters are removed. Finally, the experimental outcomes show that the WECLO K-means-PDC on Leukemia, Lymphoma, Prostate cancer, SRBCT and breast cancer databases achieve 85%, 85.4%, 84.8%, 84.3% and 85% of accuracy, respectively compared to the classical algorithms.