Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • Open Access

    ARTICLE

    Opportunistic Routing with Multi-Channel Cooperative Neighbour Discovery

    S. Sathish Kumar1,*, G. Ravi2

    Intelligent Automation & Soft Computing, Vol.35, No.2, pp. 2367-2382, 2023, DOI:10.32604/iasc.2023.030054

    Abstract Due to the scattered nature of the network, data transmission in a distributed Mobile Ad-hoc Network (MANET) consumes more energy resources (ER) than in a centralized network, resulting in a shorter network lifespan (NL). As a result, we build an Enhanced Opportunistic Routing (EORP) protocol architecture in order to address the issues raised before. This proposed routing protocol goal is to manage the routing cost by employing power, load, and delay to manage the routing energy consumption based on the flooding of control packets from the target node. According to the goal of the proposed protocol technique, it is possible… More >

  • Open Access

    ARTICLE

    A Hybrid Approach to Neighbour Discovery in Wireless Sensor Networks

    Sagar Mekala1,*, K. Shahu Chatrapati2

    Intelligent Automation & Soft Computing, Vol.35, No.1, pp. 581-593, 2023, DOI:10.32604/iasc.2023.023539

    Abstract In the contemporary era of unprecedented innovations such as Internet of Things (IoT), modern applications cannot be imagined without the presence of Wireless Sensor Network (WSN). Nodes in WSN use neighbour discovery (ND) protocols to have necessary communication among the nodes. Neighbour discovery process is crucial as it is to be done with energy efficiency and minimize discovery latency and maximize percentage of neighbours discovered. The current ND approaches that are indirect in nature are categorized into methods of removal of active slots from wake-up schedules and intelligent addition of new slots. The two methods are found to have certain… More >

Displaying 1-10 on page 1 of 2. Per Page