The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

<p><span>Medium access control (MAC) protocol design plays a crucial role to increase the performance of wireless communications and networks. The channel access mechanism is provided by MAC layer to share the medium by multiple stations. Different types of wireless networks have different design requirements such as throughput, delay, power consumption, fairness, reliability, and network density, therefore, MAC protocol for these networks must satisfy their requirements. In this work, we proposed two multiplexing methods for modern wireless networks: Massive multiple-input-multiple-output (MIMO) and power domain non-orthogonal multiple access (PD-NOMA). The first research method namely Massive MIMO uses a massive numbe

In recent years, the number of applications utilizing mobile wireless sensor networks (WSNs) has increased, with the intent of localization for the purposes of monitoring and obtaining data from hazardous areas. Location of the event is very critical in WSN, as sensing data is almost meaningless without the location information. In this paper, two Monte Carlo based localization schemes termed MCL and MSL* are studied. MCL obtains its location through anchor nodes whereas MSL* uses both anchor nodes and normal nodes. The use of normal nodes would increase accuracy and reduce dependency on anchor nodes, but increases communication costs. For this reason, we introduce a new approach called low communication cost schemes to reduce communication

Due to the high mobility and dynamic topology of the FANET network, maintaining communication links between UAVs is a challenging task. The topology of these networks is more dynamic than traditional mobile networks, which raises challenges for the routing protocol. The existing routing protocols for these networks partly fail to detect network topology changes. Few methods have recently been proposed to overcome this problem due to the rapid changes of network topology. We try to solve this problem by designing a new dynamic routing method for a group of UAVs using Hybrid SDN technology (SDN and a distributed routing protocol) with a highly dynamic topology. Comparison of the proposed method performance and two other algorithms is simula

Tor (The Onion Routing) network was designed to enable users to browse the Internet anonymously. It is known for its anonymity and privacy security feature against many agents who desire to observe the area of users or chase users’ browsing conventions. This anonymity stems from the encryption and decryption of Tor traffic. That is, the client’s traffic should be subject to encryption and decryption before the sending and receiving process, which leads to delay and even interruption in data flow. The exchange of cryptographic keys between network devices plays a pivotal and critical role in facilitating secure communication and ensuring the integrity of cryptographic procedures. This essential process is time-consuming, which causes del

The transmitting and receiving of data consume the most resources in Wireless Sensor Networks (WSNs). The energy supplied by the battery is the most important resource impacting WSN's lifespan in the sensor node. Therefore, because sensor nodes run from their limited battery, energy-saving is necessary. Data aggregation can be defined as a procedure applied for the elimination of redundant transmissions, and it provides fused information to the base stations, which in turn improves the energy effectiveness and increases the lifespan of energy-constrained WSNs. In this paper, a Perceptually Important Points Based Data Aggregation (PIP-DA) method for Wireless Sensor Networks is suggested to reduce redundant data before sending them to the

In the last two decades, networks had been changed according to the rapid changing in its requirements. The current Data Center Networks have large number of hosts (tens or thousands) with special needs of bandwidth as the cloud network and the multimedia content computing is increased. The conventional Data Center Networks (DCNs) are highlighted by the increased number of users and bandwidth requirements which in turn have many implementation limitations. The current networking devices with its control and forwarding planes coupling result in network architectures are not suitable for dynamic computing and storage needs. Software Defined networking (SDN) is introduced to change this notion of traditional networks by decoupling control and

Cognitive radio technology is used to improve spectrum efficiency by having the cognitive radios act as secondary users to access primary frequency bands when they are not currently being used. In general conditions, cognitive secondary users are mobile nodes powered by battery and consuming power is one of the most important problem that facing cognitive networks; therefore, the power consumption is considered as a main constraint. In this paper, we study the performance of cognitive radio networks considering the sensing parameters as well as power constraint. The power constraint is integrated into the objective function named power efficiency which is a combination of the main system parameters of the cognitive network. We prove the exi

Voice over Internet Protocol (VoIP) is important technology that’s rapidly growing in the wireless networks. The Quality of Service (QoS) and Capacity are two of the most important issues that still need to be researched on wireless VoIP. The main aim of this paper is to analysis the performance of the VoIP application in wireless networks, with respect to different transport layer protocols and audio codec. Two scenarios used in the simulation stage. In the first scenario VoIP with codec G.711 transmitted over User Datagram Protocol (UDP), Stream Control Transmission Protocol (SCTP), and Real-Time Transport Protocol (RTP). While, in the second scenario VoIP with codec G.726 transmitted over UDP, SCTP, and RTP protocols. Network simulator

In this paper, we use concepts and results from percolation theory to investigate and characterize the effects of multi-channels on the connectivity of Dynamic Spectrum Access networks. 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-channels, 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 protocol, it becomes difficult for two nodes to agree on a common channel, thereby potentially remaining invisible to each other. We model this