Department of Computer Science and Information Systems

Permanent URI for this collectionhttp://localhost:4000/handle/123456789/1928

Browse

Filters

2014 - 2019102020 - 20255

Settings

Subject: search.filters.subject.Wireless sensor networks (WSNs)

Search Results

Now showing 1 - 10 of 15
  • No Thumbnail Available
    Item
    A review on WSN based resource constrained smart IoT systems
    (Springer, 2025) Haribabu, K.
    In Wireless Sensor Network (i.e. WSN) based resource constrained Internet of Things (i.e. IoT) environments, efficient data forwarding is achieved through cluster based mechanisms, where cluster heads facilitate communication among themselves and with the sink node. Data collected by each cluster head is temporarily buffered before being transmitted to the sink via multi-hop communication. The integration of advanced wireless technologies, such as 5th Generation (i.e. 5G) networks, offers significant benefits, including reduced latency, extensive coverage, improved spectral efficiency, and higher data transmission rates. Incorporating Device-to-Device (i.e. D2D) communication further enhances energy efficiency and offloads data traffic, addressing critical IoT requirements such as low latency, increased network capacity, and improved spectral and energy efficiency. Software Defined Networking (i.e. SDN) addresses diverse IoT network needs across domains like smart grids, healthcare, traffic signaling, agriculture, and smart homes by enabling efficient communication, network management, and innovative control procedures. However, SDN’s application for anomaly detection and primary defense against security threats in IoT systems remains underexplored. This research investigates the potential of the design of an intelligent mechanism for energy efficient, privacy preserving, and secure communication in WSN based resource constrained IoT systems. The proposed approach leverages advanced technologies such as SDN, Machine Learning (i.e. ML), Deep Learning (i.e. DL), D2D communication, Computer Vision, and Network Function Virtualization (i.e. NFV). Additionally, it emphasizes assessing and offloading specific IoT application functions onto the network’s edge to enhance performance. Moreover, the development of lightweight security mechanisms for secure communication in resource constrained IoT environments is also identified as a crucial research domain.
  • No Thumbnail Available
    Item
    Mmulcriapp: ML and MCDA based approach for energy efficient communication for wsn based resource constrained iot devices
    (IEEE, 2025-05) Haribabu, K.
    Wireless Sensor Networks (WSNs) play a crucial role in various domains like environmental monitoring, agriculture, home automation, and healthcare. However, they face challenges such as limited resources, dynamic environments, data routing issues, scalability, unreliable wireless communication, mobility, security concerns, limited bandwidth, and fault tolerance. Machine Learning (ML) techniques have been utilized to address these challenges. Additionally, Multi Criteria Decision Analysis (MCDA), a tool for making decisions involving multiple criteria, is helpful in scenarios like cluster head selection in WSNs. This paper proposes a hybrid approach that combines ML for initial rounds, followed by MCDA based mechanisms in later rounds. The approach is evaluated using metrics like energy consumption, node degree, remaining energy, sink node location, and distance metrics and shows better performance compared to the ML technique alone.
  • No Thumbnail Available
    Item
    Energy efficient data communication for WSN based resource constrained IoT devices
    (Elsevier, 2024-10) Haribabu, K.
    In the Internet of Things (IoTs) and wireless sensor networks (WSNs), improving security and energy efficiency are key concerns. Clustering, which involves managing cluster heads, plays a pivotal role in extending network lifetime. The selection of a cluster head, responsible for data transfer between nodes, is a key aspect of network management. This paper proposes two variants of a novel algorithm designed for energy efficient communication in a resource constrained IoT environments. One variant considers remaining energy, distance, and node degree for cluster head selection, while the other focuses on remaining energy and distance only. Including node degree ensures cluster heads do not waste energy by remaining idle or performing unnecessary tasks such as the cluster head selection process in every round. The authors tested these variants against several well known algorithms using MATLAB simulation environment, evaluating factors such as operating nodes, number of clusters, transmission energy, and remaining energy. The proposed algorithm extends network lifetime by maintaining more operating nodes for longer, not changing clusters or cluster heads frequently, minimizing energy consumption for transmission, and conserving more remaining energy. Consequently, the proposed algorithm outperforms existing approaches by addressing issues like zero cluster head selection, compulsory cluster head selection in every round, avoiding cluster heads that connect to no nodes, and preventing network destabilization due to unnecessary re-elections.
  • No Thumbnail Available
    Item
    Dyswitch: dynamic switching to enable secure and energy efficient data communication in resource constrained iot environmentattack detection in data plane
    (Springer, 2025-04) Haribabu, K.
    Numerous applications spanning smart health, smart cities, smart parking, smart agriculture, smart homes, and smart transportation rely extensively on internet of things (IoT) systems. These systems depend on the periodic sensing of the physical environment, employing wireless sensor networks (WSNs) to collect vast amounts of data. Given the importance of safeguarding this data against diverse attacks, traditional security mechanisms may prove impractical for resource constrained WSN devices. Lightweight cryptographic algorithms emerge as a fitting solution for such environments. This paper introduces a system proposed to dynamically transition between available lightweight cryptographic algorithms, guided by factors such as the desired security level, network status (e.g. bit error rate), and user requests. Through this dynamic adaptive approach, the proposed system ensures swift adaptability to evolving security requirements and network conditions. Moreover, this methodology highlights a nuanced integration of cryptographic algorithms, catering to the evolving needs of modern IoT environments.
  • No Thumbnail Available
    Item
    RD-TDMA: A Randomized Distributed TDMA Scheduling for Correlated Contention in WSNs
    (IEEE, 2014) Bhatia, Ashutosh
    In wireless sensor networks (WSNs), contention occurs when two or more nodes in a proximity simultaneously try to access the channel. The contention causes collisions, which are very likely to occur when traffic is correlated. The excessive collision not only affects the reliability and the QoS of the application, but also the lifetime of the network. It is well known that random access mechanisms do not efficiently handle correlated-contention, and therefore, suffer from high collision rate. Most of the existing TDMA scheduling techniques try to find an optimal or a sub-optimal schedule. Usually, the situation of correlated-contention persists only for a short duration, and therefore, it is not worthwhile to take a long time to generate an optimal or a sub-optimal schedule. We propose a randomized distributed TDMA scheduling (RD-TDMA) algorithm to quickly generate a feasible schedule (not necessarily optimal) to handle correlated-contention in WSNs. In RD-TDMA, a node in the network negotiates a slot with its neighbors using the message exchange mechanism. The proposed protocol has been simulated using the Castalia simulator to evaluate its runtime performance. Simulation results show that the RD-TDMA algorithm considerably reduces the time required to schedule.
  • No Thumbnail Available
    Item
    A Design for Performance Improvement of Clock Synchronization in WSNs Using a TDMA-Based MAC Protocol
    (IEEE, 2014) Bhatia, Ashutosh
    Clock synchronization in a wireless sensor network (WSN) is quite essential as it provides a consistent and a coherent time frame for all the nodes across the network. Typically, clock synchronization is achieved by message passing using a contention-based scheme for media access, like carrier sense multiple access (CSMA). The nodes try to synchronize with each other, by sending synchronization request messages. If many nodes try to send messages simultaneously, contention-based schemes cannot efficiently avoid collisions. In such a situation, there are chances of collisions, and hence, message losses, which, in turn, affects the convergence of the synchronization algorithms. However, the number of collisions can be reduced with a frame based approach like time division multiple access (TDMA) for message passing. In this paper, we propose a design to utilize TDMA-based media access and control (MAC) protocol for the performance improvement of clock synchronization protocols. The basic idea is to use TDMA-based transmissions when the degree of synchronization improves among the sensor nodes during the execution of the clock synchronization algorithm. The design significantly reduces the collisions among the synchronization protocol messages. We have simulated the proposed protocol in Castalia network simulator. The simulation results show that the proposed protocol significantly reduces the time required for synchronization and also improves the accuracy of the synchronization algorithm.
  • No Thumbnail Available
    Item
    A TDMA-Based Energy Aware MAC (TEA-MAC) Protocol for Reliable Multicast in WSNs
    (IEEE, 2014) Bhatia, Ashutosh
    Multicast in wireless sensor networks (WSNs) is an efficient way to spread the same data to multiple sensor nodes. It becomes more effective due to the broadcast nature of wireless link, where a message transmitted from one source is inherently received by all one-hop receivers, and therefore, there is no need to transmit the message one by one. Reliable multicast in WSNs is desirable for critical tasks like code updation and query based data collection. The erroneous nature of wireless medium coupled with limited resource of sensor nodes, makes the design of reliable multicast protocol a challenging task. In this work, we propose a time division multiple access (TDMA) based energy aware media access and control (TEA-MAC) protocol for reliable multicast in WSNs. The TDMA eliminates collisions, overhearing and idle listening, which are the main sources of reliability degradation and energy consumption. Furthermore, the proposed protocol is parametric in the sense that it can be used to trade-off reliability with energy and delay as per the requirement of the underlying applications. The performance of TEA-MAC has been evaluated by simulating it using Castalia network simulator. Simulation results show that TEA-MAC is able to considerably improve the performance of multicast communication in WSNs.
  • No Thumbnail Available
    Item
    A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs
    (IEEE, 2014) Bhatia, Ashutosh
    The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.
  • No Thumbnail Available
    Item
    UMAC: A Universal MAC protocol for Wireless Networks
    (ACM Digital Library, 2014-10) Bhatia, Ashutosh
    There are a number of wireless networks such as MANETs, WSNs, WLANs, BAN etc. which have come into prominence during the past several decades because of various kinds of requirements. From the very beginning, the design of various MAC protocols for these networks has been considered independently, targeting a few specific issues of the networks. Additionally, due to lack of compatibility with older protocols, various MAC protocols designed for wireless networks and available in the literature are not widely used in practice. We strongly believe that there is a requirement for a universal MAC (UMAC) protocol for mobile devices with multiple type of sensors, which can be used for a large spectrum of applications with different parametric requirements, deployment scenarios and device capabilities. In this paper, we first propose the design guidelines for such a UMAC, and then give an implementation of the same as an extension of IEEE 802.11 MAC, and the performance analysis of the proposed UMAC.
  • No Thumbnail Available
    Item
    A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs
    (Wiley, 2015-02) Bhatia, Ashutosh
    In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known as spatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.