In this paper, we investigate and characterize the effects of multi-channel and rendezvous protocols on the connectivity of dynamic spectrum access networks using percolation theory. In particular, we focus on the scenario where the secondary nodes have plenty of vacant channels to choose from a phenomenon which we define as channel abundance. To cope with the existence of multi-channel, we use two types of rendezvous protocols: naive ones which do not guarantee a common channel and advanced ones which do. We show that, with more channel abundance, even with the use of either type of rendezvous protocols, it becomes difficult for two nodes to agree on a common channel, thereby, potentially remaining invisible to each other. We model this in

Technically, mobile P2P network system architecture can consider as a distributed architecture system (like a community), where the nodes or users can share all or some of their own software and hardware resources such as (applications store, processing time, storage, network bandwidth) with the other nodes (users) through Internet, and these resources can be accessible directly by the nodes in that system without the need of a central coordination node. The main structure of our proposed network architecture is that all the nodes are symmetric in their functions. In this work, the security issues of mobile P2P network system architecture such as (web threats, attacks and encryption) will be discussed deeply and then we prop

<p>Recently, reconfigurable intelligent surfaces have an increasing role to enhance the coverage and quality of mobile networks especially when the received signal level is very weak because of obstacles and random fluctuation. This motivates the researchers to add more contributions to the fields of reconfigurable intelligent surfaces (RIS) in wireless communications. A substantial issue in reconfigurable intelligent surfaces is the huge overhead for channel state information estimation which limits the system’s performance, oppressively. In this work, a newly proposed method is to estimate the angle of arrival and path loss at the RIS side and then send short information to the base station rather than huge overhe

Recently, there has been an increasing advancement in the communications technology, and due to the increment in using the cellphone applications in the diverse aspects of life, it became possible to automate home appliances, which is the desired goal from residences worldwide, since that provides lots of comfort by knowing that their appliances are working in their highest effi ciency whenever it is required without their knowledge, and it also allows them to control the devices when they are away from home, including turning them on or off whenever required. The design and implementation of this system is carried out by using the Global System of Mobile communications (GSM) technique to control the home appliances – In this work, an ele

Flying Ad hoc Networks (FANETs) has developed as an innovative technology for access places without permanent infrastructure. This emerging form of networking is construct of flying nodes known as unmanned aerial vehicles (UAVs) that fly at a fast rate of speed, causing frequent changes in the network topology and connection failures. As a result, there is no dedicated FANET routing protocol that enables effective communication between these devices. The purpose of this paper is to evaluate the performance of the category of topology-based routing protocols in the FANET. In a surveillance system involving video traffic, four routing protocols with varying routing mechanisms were examined. Additionally, simulation experiments conduct

Survival analysis is widely applied to data that described by the length of time until the occurrence of an event under interest such as death or other important events. The purpose of this paper is to use the dynamic methodology which provides a flexible method, especially in the analysis of discrete survival time, to estimate the effect of covariate variables through time in the survival analysis on dialysis patients with kidney failure until death occurs. Where the estimations process is completely based on the Bayes approach by using two estimation methods: the maximum A Posterior (MAP) involved with Iteratively Weighted Kalman Filter Smoothing (IWKFS) and in combination with the Expectation Maximization (EM) algorithm. While the other

The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages