Optimasi Daya Baterai Menggunakan Bluetooth Low Energy Pada Routing di Wireless Sensor Network

Wireless Sensor Network (WSN) merupakan jaringan nirkabel untuk memantau kondisi fisik atau lingkungan, seperti suhu dan kelembapan, yang kemudian data tersebut diteruskan melalui sebuah jaringan kepada suatu lokasi (komputer) di mana data tersebut dapat diamati dan dianalisis. Tujuan utama WSN adalah menyediakan komunikasi nirkabel berdasarkan jaringan sensor berbiaya rendah dengan konsumsi daya yang sangat terbatas. Sehingga konsumsi energi merupakan permasalahan yang menantang pada WSN. Untuk mengurangi konsumsi energi pada WSN, protokol routing harus diterapkan. Salah satu tantangan pada routing yang terlibat dalam WSN, yaitu lalu lintas data yang dibuat memiliki redundansi (data yang tidak perlu/dibutuhkan) yang signifikan dalam sebagian besar kasus. Selain itu, perangkat WSN bergantung pada baterainya sebagai sumber listrik, sehingga masa pakai jaringan tergantung pada level baterai yang tersisa pada setiap node. Teknologi yang digunakan tiap node untuk saling berkomunikasi juga mempengaruhi konsumsi energi yang ada. Maka pada penelitian ini dirancang sebuah WSN yang berfokus pada pengiriman data dari tiap-tiap sensor node hingga mencapai sink node dengan mekanisme routing berdasarkan daya baterai pada node, sehingga data akan diteruskan melalui node yang memiliki daya terbesar. Protokol komunikasi yang digunakan adalah BLE yang sudah tertanam di ESP32. Metode komunikasi yang digunakan adalah connection-oriented atau master-slave, dengan shared-slave topology (SST) sebagai topologinya. DHT22 digunakan untuk mengukur suhu dan kelembapan relatif. Dari hasil percobaan, DHT22 memiliki error pada pembacaan suhu sebesar 1,935%, sementara pada pembacaan kelembapan udara memiliki error sebesar 1,90%. Hasil algrotima routing yaitu node menentukan dan mengirimkan data suhu dan kelembapan kepada node yang memiliki daya terbesar dengan rata-rata waktu 8,957 detik. Serta rata-rata waktu yang diperlukan oleh node untuk mengirimkan data suhu dan kelembapan kepada sink node yaitu 16,952 detik dengan 3 kali hop

Energy aware routing protocols in ad hoc wireless networks

In Mobile Ad hoc Network, communication at mobile nodes can be achieved by using multi-hop wireless links. The architecture of such a network is based, not on a centralized base station but on each node acting as a router to forward data packets to other nodes in the network. The aim of each protocol, in an ad hoc network, is to find valid routes between two communicating nodes. These protocols must be able to handle high mobility of the nodes which often cause changes in the network topology. Every ad hoc network protocol uses some form of a routing algorithm to transmit between nodes based on a mechanism that forwards packets from one node to another in the network. These algorithms have their own way of finding a new route or modifying an existing one when there are changes in the network. The novel area of this research is a proposed routing algorithm which improves routing and limits redundant packet forwarding, especially in dense networks. It reduces the routing messages and consequently power consumption, which increases the average remaining power and the lifetime of the network. The first aim of this research was to evaluate various routing algorithms in terms of power. The next step was to modify an existing ad hoc routing protocol in order to improve the power consumption. This resulted in the implementation of a dynamic probabilistic algorithm in the route request mechanism of an ad hoc On-Demand Distance Vector protocol which led to a 3.0% improvement in energy consumption. A further extension of the approach using Bayesian theory led to 3.3% improvement in terms of energy consumption as a consequence of a reduction in MAC Load for all network sizes, up to 100 nodes.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

A Cross-Layer Modification to the DSR Routing Protocol in Wireless Mesh Networks

A cross-layer modification to the DSR routing protocol that finds high throughput paths in WMNs has been introduced in this work. The Access Efficiency Factor (AEF) has been introduced in this modification as a local congestion avoidance metric for the DSR routing mechanism as an alternative to the hop count (Hc) metric. In this modification, the selected path is identified by finding a path with the highest minimum AEF (max_min_AEF) value. The basis of this study is to compare the performance of the Hc and max_min_AEF as routing metrics for the DSR protocol in WMNs using the OPNET modeler. Performance comparisons between max_min_AEF, Metric Path (MP), and the well known ETT metrics are also carried out in this work. The results of this modification suggest that employing the max_min_AEF as a routing metric outperforms the Hc, ETT, and MP within the DSR protocol in WMNs in terms of throughput. This is because the max_min_AEF is based upon avoiding directing traffic through congested nodes where significant packet loss is likely to occur. This throughput improvement is associated with an increment in the delay time due to the long paths taken to avoid congested regions. To overcome this drawback, a further modification to the routing discovery mechanism has been made by imposing a hop count limit (HCL) on the discovered paths. Tuning the HCL allows the network manager to tradeoff throughput against delay. The choice of congestion avoidance metric exhibits another shortcoming owing to its dependency on the packet size. It penalises the smaller packets over large ones in terms of path lengths. This has been corrected for by introducing a ModAEF metric that explicitly considers the size of the packet. The ModAEF metric includes a tuning factor that allows the operator determine the level of the weighting that should be applied to the packet size to correct for this dependence