Fuzzy based Secure Data Gathering Approach for Ad hoc Sensor Networks

391-394Data gathering is one of the difficult tasks in Ad hoc Sensor networks. Sensor Networks consist of limited power sensor nodes located with high density and deployed for various applications such as military, industry and environmental tracking etc. However energy constraint of sensor nodes is one of the biggest challenges in sensor networks. Balancing of data gathering and energy efficiency is the biggest task in sensor networks. In the proposed system, Fuzzy based Secure Data Gathering Approach (FSDGA) is introduced based on slot based scheduling and asymmetric key crypto scheme. Cluster region is formed and Cluster Head (CH) is chosen through voting system to determine the remaining energy, node flexibility, connectivity ratio and node stability. The routes are found with authentication metric based on key identifiers to reduce the vulnerability of attackers. Mamdani Fuzzy decision scheme is introduced with data gathering algorithm to improve the data availability ratio

Penentuan Rute Terpendek Tujuan Wisata di Kota Toboali Menggunakan Algoritme Djikstra Web

Kota Toboali merupakan ibukota Kabupaten Bangka Selatan yang telah menjadi daerah tujuan wisata baru karena keindahan yang dimiliki dan didukung oleh kebijakan pemerintah daerah. Oleh sebab itu fasilitas wisata terus dikembangkan hingga saat ini. Namun banyak wisatawan dari daerah lain yang mengalami kesulitan dalam perjalanannya menuju tujuan wisata di Kota Toboali. Hal ini dikarenakan mereka belum mengenal letak geografis Kota Toboali. Kesulitan yang dialami para wisatawan ini adalah dalam hal mengetahui dan menentukan jalan yang akan dilalui menuju ke tujuan wisatanya. Untuk itu dibuatlah sistem informasi geografis yang berbasis web dan dilengkapi dengan fungsi penentuan jarak terpendek menggunakan Algoritme Dijkstra agar dapat lebih cepat sampai pada tujuan wisata. Sistem dirancang berbasis web agar lebih banyak orang yang menggunakannya. Dalam penelitian ini juga dibahas mengenai cara perhitungan manual algoritme Dijkstra, selain itu untuk pembuktian hasil perhitungan, diberikan pula berupa contoh kasus penentuan jarak terpendek di salah satu sudut Kota Toboali. Hasil dari penelitian berupa sistem informasi pariwisata Kota Toboali yang dapat menentukan jarak terpendek menuju lokasi wisata. Dari hasil pengujian algoritme dapat dibuktikan bahwa sistem mampu menentukan jarak terpendek dari titik awal yang ditentukan pengguna menuju titik tujuan wisatanya. Dari pengujian blackbox didapat hasil bahwa fungional sistem memiliki kinerja yang baik.   AbstractToboali City is the capital of South Bangka Regency which has become a new tourist destination because of its beauty and supported by local government policies. Therefore tourism facilities continue to be developed to date. However, many tourists from other regions experience difficulties on their way to tourist destinations in Toboali City. This is because they do not know the geographical location of Toboali City. The difficulty experienced by these tourists is in terms of knowing and determining the path to be traveled to the destination. For this reason, a geographic information system based on the web was made and equipped with the shortest distance determination function using the Dijkstra algorithm to be able to reach tourist destinations faster. The system is designed web-based so that more people use it. In this study also discussed how the manual calculation of the Dijkstra algorithm, in addition to proof of calculations, is also given in the form of a case in determining the shortest distance in one corner of the city of Toboali. The results of the research in the form of the Toboali City tourism information system that can determine the shortest distance to the tourist location. From the algorithm test results it can be proven that the system is able to determine the shortest distance from the user-specified starting point to the destination point of the tour. From the blackbox testing, the results show that functional systems have good performance

A Review of Wireless Sensor Networks with Cognitive Radio Techniques and Applications

The advent of Wireless Sensor Networks (WSNs) has inspired various sciences and telecommunication with its applications, there is a growing demand for robust methodologies that can ensure extended lifetime. Sensor nodes are small equipment which may hold less electrical energy and preserve it until they reach the destination of the network. The main concern is supposed to carry out sensor routing process along with transferring information. Choosing the best route for transmission in a sensor node is necessary to reach the destination and conserve energy. Clustering in the network is considered to be an effective method for gathering of data and routing through the nodes in wireless sensor networks. The primary requirement is to extend network lifetime by minimizing the consumption of energy. Further integrating cognitive radio technique into sensor networks, that can make smart choices based on knowledge acquisition, reasoning, and information sharing may support the network's complete purposes amid the presence of several limitations and optimal targets. This examination focuses on routing and clustering using metaheuristic techniques and machine learning because these characteristics have a detrimental impact on cognitive radio wireless sensor node lifetime