<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-3062</article-id>
      <title-group>
        <article-title>Secure routing in wireless networks using dominating sets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Cholke</surname>
            <given-names>Satish Changdeo</given-names>
          </name>
          <aff>Department of Information Technology, Sir Visvesvarya Institute of Technology, Savitribai Phule Pune University (SPPU), Nashik, Maharashtra, 422103, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Garg</surname>
            <given-names>Anvesha</given-names>
          </name>
          <aff>Quantum University Research Center, Quantum University, Roorkee, Uttarakhand, 247667, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Swathi</surname>
            <given-names>Vundela</given-names>
          </name>
          <aff>Centre for Multidisciplinary Research, Anurag University, Hyderabad, Telangana, 500088, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sharma</surname>
            <given-names>Tripti</given-names>
          </name>
          <aff>Department of Computer Science &amp; Engineering, Rungta College of Engineering &amp; Technology, Rungta International Skills University, Bhilai, Chhattisgarh, 490024, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Parmar</surname>
            <given-names>Kiran D.</given-names>
          </name>
          <aff>Faculty of Engineering, Gokul Global University, Sidhpur, Gujarat, 384151, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sripada</surname>
            <given-names>Pushpa Nagini</given-names>
          </name>
          <aff>Department of English, Meenakshi College of Arts and Science, Meenakshi Academy of Higher Education &amp; Research (Deemed to be University), Chennai, Tamil Nadu, 600078, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>10-B</issue>
      <fpage>4417</fpage>
      <lpage>4428</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>Wireless networks, like wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs), are an essential part of the modern communication systems and serve purposes, such as IoT, smart cities, and critical infrastructure monitors. Nevertheless, they are highly susceptible to security risks like blackhole, wormhole and Sybil attacks due to their decentralized and dynamic nature, and have energy efficiency and scalability problems. The current routing protocols are mainly concerned with performance or security improvement on a case-by-case basis which results in efficiency versus robustness trade-off. The present paper discusses this issue by suggesting a safe routing model that is founded on a trust-sensitive Connected Dominating Set (CDS). The aim of the research is to come up with a routing backbone that will reduce the communication overhead and at the same time increase resilience against malicious nodes. It uses a methodology that models the wireless network as a graph and defines the construction of CDS as an optimization problem with node trust, link reliability, and cost of communication. Secure CDO is built by a multi stage algorithm that includes node selection, pruning and connectivity enforcement that is followed by secure route discovery and lightweight encryption and authentication. Simulation-based performance assessment of the proposed method is done under different attack conditions and performance of the proposed method is compared with the traditional protocols like AODV, DSR and the current secure routing protocols. The findings indicate that the proposed framework attains a superior Packet Delivery Ratio (up to 98% in normal circumstances and much higher in attacks), a lower routing overhead (by an approximation of 30-40%), and a lower energy consumption with respect to the different sizes of the network.</p>
      </abstract>
      <kwd-group>
        <kwd>Secure routing</kwd>
        <kwd>Wireless sensor networks (WSNs)</kwd>
        <kwd>Mobile ad hoc networks (MANETs)</kwd>
        <kwd>Connected dominating set (CDS)</kwd>
        <kwd>Dominating set optimization</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
