Yazar "Sah, Dinesh Kumar" seçeneğine göre listele

Listeleniyor 1 - 3 / 3
  • Küçük Resim Yok
    Öğe
    3D Localization and Error Minimization in Underwater Sensor Networks
    (Assoc Computing Machinery, 2022) Sah, Dinesh Kumar; Nguyen, Tu N.; Kandulna, Manjusha; Cengiz, Korhan; Amgoth, Tarachand
    Wireless sensor networks (WSNs) consist of nodes distributed in the region of interest (ROI) that forward collected data to the sink. The node's location plays a vital role in data forwarding to enhance network efficiency by reducing the packet drop rate and energy consumption. WSN scenarios, such as tracking, smart cities, and agriculture applications, require location details to accomplish the objective. Assuming a 3D application space, a combination of received signal strength (RSS) and time of arrival (TOA) can be helpful for reliable range estimation of nodes. Notably, the anchor node can minimize localization error for non-line-of-sight (NLOS) signals. We proposed an error minimization protocol for localization of the sensor node, assuming that the anchor node's location is known prior and can limit the receiving signal in LOS, single, or twice reflection. We start to exploit the sensor node's geometrical relationship and the anchor node for LOS and NLOS signals and address misclassification. We started initially from the erroneous node position, bound its volume in 3D space, and reduced volume with each iteration following the constraint. Our simulation result outperforms the traditional methods on many occasions, such as boundary volume and computational complexity.
  • Küçük Resim Yok
    Öğe
    EDGF: Empirical dataset generation framework for wireless sensor networks
    (Elsevier, 2021) Sah, Dinesh Kumar; Cengiz, Korhan; Donta, Praveen Kumar; Inukollu, Venkata N.; Amgoth, Tarachand
    In wireless sensor networks (WSNs), simulation practices, system models, algorithms, and protocols have been published worldwide based on the assumption of randomness. The applied statistics used for randomness in WSNs are broad, e.g., random deployment, activity tracking, packet generation, etc. Even though authors' adequate formal and informal information and pledge validation of the proposal became challenging, the minuscule information alteration in implementation and validation can reflect the enormous effect on eventual results. In this proposal, we show how the results are affected by the generalized assumption made on randomness. In sensor node deployment, ambiguity arises due to node error-value (epsilon), and its upper bound in the relative position is estimated to understand the delicacy of diminutives changes. Besides, the effect of uniformity in the traffic and participation of scheduling position of nodes is also generalized. We propose an algorithm to generate the unified dataset for the general and some specific applications system models in WSNs. The results produced by our algorithm reflect the pseudo-randomness and can efficiently regenerate through seed value for validation.
  • Küçük Resim Yok
    Öğe
    Load-balance scheduling for intelligent sensors deployment in industrial internet of things
    (Springer, 2022) Sah, Dinesh Kumar; Nguyen, Tu N.; Cengiz, Korhan; Dumba, Braulio; Kumar, Vikas
    The Industrial Internet of Things uses intelligent sensors to collect the physical properties of objects placed on a large area. It provides innovative service and network functioning, such as time-bounded data delivery and efficient sensor sleep cycle management. Intelligent scheduling is crucial to assisting the situation. The periodic scheduling of radio transceivers of sensor nodes into sleep or active mode helps accomplish efficient energy consumption. Such an extensive scale network work on data collection on multihop fashion. Our proposal provides the algorithm to form the node's backbone, which task is to collect the data from sensors scatted in the area. Further, the heuristic algorithm is proposed to assist the backbone node in balancing the incoming traffic for scheduling. In Time Division Multiple Access (TDMA) driven Medium Access Control (MAC), the nodes are scheduled for data forwarding in the allotted time slot (owner node) in each time frame. Our proposed work is named aggressive scheduling medium access control (AS-MAC). If the owner node does not have data to forward, then the corresponding slot will be aggressively scheduled by other nodes. Therefore, that slot and all consecutive slots if the corresponding owner nodes do not use will go to the needy nodes. The proposed system model presents a unique instance of interference for successfully delivering control and data packets. Therefore, a probabilistic estimation has given for the packet delivery rate for the raised specific condition. Our proposal's distinctive feature is that the performance is better than Time Division Multiple Access for any given load. Finally, the packet delivery rate, packet drop, energy consumption, and time frame requirement for a different number of sensor node has been calculated and compared with the current state-of-the-art proposals.