<?xml version="1.0" encoding="utf-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<ArticleSet>
  <Article>
    <Journal>
      <PublisherName>IJIRCSTJournal</PublisherName>
      <JournalTitle>International Journal of Innovative Research in Computer Science and Technology</JournalTitle>
      <PISSN>I</PISSN>
      <EISSN>S</EISSN>
      <Volume-Issue>Volume 11 Issue 3</Volume-Issue>
      <PartNumber/>
      <IssueTopic>Computer Science &amp; Engineering</IssueTopic>
      <IssueLanguage>English</IssueLanguage>
      <Season>May - June 2023</Season>
      <SpecialIssue>N</SpecialIssue>
      <SupplementaryIssue>N</SupplementaryIssue>
      <IssueOA>Y</IssueOA>
      <PubDate>
        <Year>2023</Year>
        <Month>09</Month>
        <Day>07</Day>
      </PubDate>
      <ArticleType>Computer Sciences</ArticleType>
      <ArticleTitle>Secure Aggregation of Data in Connection-Less Networks</ArticleTitle>
      <SubTitle/>
      <ArticleLanguage>English</ArticleLanguage>
      <ArticleOA>Y</ArticleOA>
      <FirstPage>85</FirstPage>
      <LastPage>89</LastPage>
      <AuthorList>
        <Author>
          <FirstName>Mr. Giribabu Sadineni</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>Y</CorrespondingAuthor>
          <ORCID/>
                      <FirstName>Janardhan Reddy D</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>N</CorrespondingAuthor>
          <ORCID/>
                    <FirstName>B. Uma Pavani</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>N</CorrespondingAuthor>
          <ORCID/>
                    <FirstName>K. Vijaya Lakshmi</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>N</CorrespondingAuthor>
          <ORCID/>
                    <FirstName>Sk. Karishma</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>N</CorrespondingAuthor>
          <ORCID/>
                    <FirstName>P. Tulasi</FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>N</CorrespondingAuthor>
          <ORCID/>
           
        </Author>
      </AuthorList>
      <DOI>https://doi.org/10.55524/ijircst.2023.11.3.16</DOI>
      <Abstract>Reliable Minimal Energy Cost Routing (RMECR) and Reliable Minimum Energy Routing are two ingenious dynamism- conscious routing algorithms for wireless ad hoc networks (RMER). Ad hoc network conditions for dynamism effectiveness, responsibility, and dragging network continuance are all managed by RMECR. To develop dynamism-effective and reliable pathways that outstretch the network&amp;#39;s functional continuance, it takes into account the bumps&amp;#39; dynamism operation, their remaining battery dynamism, and the tractability of their links. RMER, on the other phase, is a dynamism-effective routing algorithm that identifies rows that exercise the least quantum of dynamism altogether for packet traversal from end to end. For networks where end- to- end retransmissions or lope- by- dance retransmissions guarantee responsibility, RMER and RMECR are alluded. Simulation simulations demonstrate that RMECR is able of locating reliable and dynamism-effective rows analogous to RMER, while contemporaneously dragging the network&amp;#39;s operating life. RMECR is thus a sophisticated system for dragging the dynamism- effectiveness, responsibility, and life of wireless ad hoc networks. We take into account nanosecond procurators while intending the RMECR, similar as the dynamism exercised by the transceiver&amp;#39;s processing factors, the ultimate number of packet retransmissions suffered, packet sizes, and the sequel of mention packets. This increases the oneness of our work in comparison to other examinations.</Abstract>
      <AbstractLanguage>English</AbstractLanguage>
      <Keywords>Reliable Minimum Energy Cost Routing(RMECR), Reliable Minimum Energy Routing(RMER), Hop- in- Hop(H2H), End to End(E2E).</Keywords>
      <URLs>
        <Abstract>https://ijircst.org/abstract.php?article_id=1169</Abstract>
      </URLs>      
    </Journal>
  </Article>
</ArticleSet>