An Enhanced Adaptive Duty Cycle Scheme for Optimum Data Transmission in Wireless Sensor Network

Shallahuddin, Ahmad Aiman; Kadir, Mohd Fadzil Abdul; Mohamed, Mohamad Afendee; Abidin@Bharun, Ahmad Faisal Amri; Usop, Nor Surayati Mohamad; Zakaria, Zalmiyah

doi:10.1007/978-981-15-1465-4_4

Cited by 9 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The duty cycle is one of the most extensively employed energy-saving mechanisms in WSN, particularly at the medium access control (MAC) layer. Because the active duration is longer and more energy is spent when the MAC works at a high duty cycle, the duty cycle must be adjusted to match the MAC's strength to ensure appropriate data transmission while avoiding battery depletion [9]. In the same way, using the sensor node's duty cycle mode is an efficient technique to increase energy efficiency.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Heuristic Model for Duty Cycle Framework Optimization

Ansah,

Appati,

Owusu

et al. 2024

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

This paper proposes a hybrid metaheuristic approach to optimize a duty cycle framework based on Seagull and Mayfly Optimization (HSMO-DC) Algorithm. This approach becomes crucial as current clustering protocols are unable to efficiently tune the clustering parameters in accordance to the diversification of varying WSNs. The proposed HSMO-DC primarily has two parts, where the first part takes care of the online cluster head selection and network communication using the seagull algorithm while the second part performs parameter optimization using the mayfly algorithm. The seagull is aimed at improving the energy distribution in the network through an effective bandwidth allocation procedure while reducing the total energy dissipation. Comparatively, with other clustering protocols, our proposed methods reveal an enhanced network lifetime with an improved network throughput and adaptability based on selected standard metric of performance measurement.

show abstract

Section: Introductionmentioning

confidence: 99%

A Hybrid Heuristic Model for Duty Cycle Framework Optimization

Ansah,

Appati,

Owusu

et al. 2024

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…In the taxonomy proposed, the approaches belonging to the subclass energy balancing/duty cycling/sleep scheduling are based on the idea that network nodes may be alternatively put in active and sleep mode for a certain time interval, so as to reduce their energy consumptions in sleep mode (mode in which sensing and communication activities are interrupted). To this subclass of approaches belongs those discussed in [1,6,10,12,17,19,22,24,26]. We focus on the optimization problem introduced by [1] under the name Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage (STSWSN-PC).…”

Section: Introductionmentioning

confidence: 99%

On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm

Bianchessi

2023

Networks

View full text Add to dashboard Cite

Given a wireless sensor network, we consider the problem to minimize its total energy consumption over consecutive time slots with respect to communication activities. Nonempty and disjoint subsets of nodes are required to be active and connected under a tree topology configuration in the different time slots, and each network node must be active in a unique time slot. Moreover, the power required by the same pair of network nodes to communicate on the associated direct channel may vary in the different time slots. The problem has been recently introduced in the literature under the name Sub‐Tree Scheduling for Wireless Sensor Networks with Partial Coverage. We focus on the exact solution of the problem. We present a branch‐and‐cut (BC) algorithm based on a novel integer linear programming formulation which allows avoiding the introduction of symmetries in the solution space. In particular, the algorithm relies on an efficient and nontypical separation algorithm for known valid inequalities, and on an easy‐to‐implement primal bound heuristic. The effectiveness of the BC algorithm is empirically shown through an extensive experimental analysis involving 300 newly generated benchmark instances with up to 200 network nodes and 8 time slots. Additionally, the experimental results show that the BC algorithm represents a valid computational tool to benchmark the performance of heuristics addressing the problem, and can be used in practice, as an heuristic solver, to tackle problem instances that are not too large.

show abstract

“…The problem that follows is that the traditional network architecture has been unable to meet today's technical requirements from many different aspects. As such, we come across a network such as a wireless sensor network (Shallahuddin et al, 2020;Muzakkari et al, 2018), a vehicular network (Elias et al, 2019;Karagiannis et al, 2011), and a wireless body area network (Latré et al, 2011). In another context, Software Defined Networking (SDN) was proposed and developed rapidly and has achieved excellent results (Rout et al, 2021;Akin and Korkmaz, 2019;Xia et al, 2014).…”

Section: Introductionmentioning

confidence: 99%

The performance effect due to varying network topologies on a software defined network employing the k-shortest path

al.¹

2022

Int. j. adv. appl. sci.

View full text Add to dashboard Cite

Packet routing has always been an issue that affects network performance. The traditional protocol is known to work with local information and thus not able to produce a global optimal decision. In the software-defined network (SDN), its centralized controller obtains unified access to the entire network topology information and has the ability to partially solve traditional network packet forwarding problems. SDN controller uses the Dijkstra algorithm to find the shortest path calculated from the source node to the destination node. However, constraints such as the need to bypass the node which has a high rate of failure exist to prevent the Dijkstra algorithm from meeting this demand. In practice, we need not only consider the shortest path but also consider the second short path, the third short path, and so on. K-shortest paths algorithm discovers a set of paths ordered in the most optimal, optimal, and suboptimal, has a very wide application is integrated into SDN controller to handle routing functionality. In this study, instead of only the number of hops, bandwidth and delay are adhered to within the k-shortest path to select the final route. Under this circumstance, different topologies are examined in response to network bandwidth and packet delay. The experiment shows that tree topology is best suited for improving bandwidth while simple topology for reducing delay.

show abstract

An Enhanced Adaptive Duty Cycle Scheme for Optimum Data Transmission in Wireless Sensor Network

Cited by 9 publications

References 12 publications

A Hybrid Heuristic Model for Duty Cycle Framework Optimization

A Hybrid Heuristic Model for Duty Cycle Framework Optimization

On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm

The performance effect due to varying network topologies on a software defined network employing the k-shortest path

Contact Info

Product

Resources

About