cognitive radio is the solution for effectively utilizing the underutilized radio spectrum. There are many techniques to sense spectrum using cognitive radios like matched filter detection, energy detection, waveform based detection, cyclostationary feature detection and so on. In this paper comparative analysis of two popular techniques i.e. energy detection (ED) and cyclostationary feature detection (CFD) is discussed. Analysis is carried out by discussing the theoretical aspect of both the techniques supported by simulation graphs and plots. This analysis shows that among the two techniques discussed CFD shows better results.

No abstract

No abstract

Background: A Wireless Sensor Network (WSN) consists of a large number of sensor nodes deployed randomly over an area that can sense the surrounding environment to gather some data and interconnect over a wireless channel to share the information with neighboring nodes or with some user over the internet. WSN has a wide range of applications in the field of military, healthcare, industry, agriculture, livestock farming, and smart cities. The pertinence of WSN in healthcare, defense, agriculture, and industry is discussed in detail in the background section of this paper. Objective: The objective of this paper is to examine and simulate Dijkstra’s Algorithm, Bellman Ford’s Algorithm, and Floyd-Warshall’s Algorithm applied for routing in WSN Method: Simulation is completed on CupCarbon U-one 4.2 simulator for these algorithms to compute the shortest distance between a randomly deployed source node and a destination node in different sized networks. Simulation of the three algorithms is carried out considering the vital simulation parameters including sensor radius, radio range, and traffic. Also, Simulation is carried out to show the implementation of Floyd Warshall’s algorithm in the field of smart mobility. Result: The results obtained show that the simulation time for the calculation of the shortest route from source to destinations for the three algorithms is the same which is also suitable for various applications of smart mobility, smart accident management, and smart traffic management. Conclusion: The simulation results are also examined to measure the performance of each algorithm and its suitability in the context of WSN. The epilogue of this paper is provided in the conclusion section.

A Wireless Sensor Network (WSN) consists of a large no of sensor nodes deployed inside a physical environment that are capable of sensing and processing the data related to that environment and communicating it over the network. One of the vital applications of WSN is its suitability to smart cities that consist of many features such as smart buildings, smart education, smart governance, smart security, and smart mobility. This paper focuses on calculating the shortest path from the source node to the destination node in WSN by means of Dijkstra’s Algorithm. Various other algorithms are also compared and their suitability to different application scenarios is discussed. Simulations have been made for the smart city and Internet of Things (IoT) application by using the WSN simulator CupCarbon U-One 4.2.