Taguchi Based Self-Configure Data Rate Optimization AODVUU Routing Parameters In MANET Over Optical Network Performances

Research and development advancements in the area of wireless technologies give rises of mobile ad hoc networks (MANET) domain but is constrained to the single networks and stand alone. Furthermore, the communication networking applications requirements mostly still depends on fixed infrastructure networks that lead to MANET need to communicate with internet. Consequently, the traditional mobile routing protocols proposed for MANET are inefficient but play an equivalent important role in the performances of mobile wireless network over optical backhaul with focusing of MANET of the wireless domain in access network. Routing protocols procedures are controlled with a set of parameters from being dragged to undesired situations such as un-optimized Quality of Service (QoS) resource consumption. These parameters have a direct impact on the efficiency of a routing protocol and the overall MANET network performances. This paper proposed an offline optimization through simulation design of experiment of the AODV-UU parameters of MANET is evaluated by performing Taguchi signal to noise ratio (SNR) method for fine-tuning the AODV-UU routing parameters using the OMNeT++ software. The work is further extended with self-configure multiple data rates (SCMDR) scheme-a cross-layer-specific technique. AODV-UU with Taguchi tuned under the proposed SCMDR scheme is compared with AODV-UU configuration of oRiG scheme also as respects to previous work is examined based on capacity consumption, end-to-end delay metric and energy consumption metric under the varying speed scenario. The obtained results showed that, AODV-UU with Taguchi configuration outperformed the AODV-UU for the mention performance metrics here. The existing of current access network of the telco operators can benefit from the proposed improvement here

Bandwidth and Energy-Efficient Route Discovery for Noisy Mobile Ad-Hoc Networks

Broadcasting is used in on-demand routing protocols to discover routes in Mobile Ad-hoc Networks (MANETs). On-demand routing protocols, such as Ad-hoc On-demand Distance Vector (AODV) commonly employ pure flooding based broadcasting to discover new routes. In pure flooding, a route request (RREQ) packet is broadcast by the source node and each receiving node rebroadcasts it. This continues until the RREQ packet arrives at the destination node. Pure flooding generates excessive redundant routing traffic that may lead to the broadcast storm problem (BSP) and deteriorate the performance of MANETs significantly. A number of probabilistic broadcasting schemes have been proposed in the literature to address BSP. However, these schemes do not consider thermal noise and interference which exist in real life MANETs, and therefore, do not perform well in real life MANETs. Real life MANETs are noisy and the communication is not error free. This research argues that a broadcast scheme that considers the effects of thermal noise, co-channel interference, and node density in the neighbourhood simultaneously can reduce the broadcast storm problem and enhance the MANET performance. To achieve this, three investigations have been carried out: First, the effect of carrier sensing ranges on on-demand routing protocol such as AODV and their impact on interference; second, effects of thermal noise on on-demand routing protocols and third, evaluation of pure flooding and probabilistic broadcasting schemes under noisy and noiseless conditions. The findings of these investigations are exploited to propose a Channel Adaptive Probabilistic Broadcast (CAPB) scheme to disseminate RREQ packets efficiently. The proposed CAPB scheme determines the probability of rebroadcasting RREQ packets on the fly according to the current Signal to Interference plus Noise Ratio (SINR) and node density in the neighbourhood. The proposed scheme and two related state of the art (SoA) schemes from the literature are implemented in the standard AODV to replace the pure flooding based broadcast scheme. Ns-2 simulation results show that the proposed CAPB scheme outperforms the other schemes in terms of routing overhead, average end-to-end delay, throughput and energy consumption

Performance evaluation of non-prefiltering vs. time reversal prefiltering in distributed and uncoordinated IR-UWB ad-hoc networks

Time Reversal (TR) is a prefiltering scheme mostly analyzed in the context of centralized and synchronous IR-UWB networks, in order to leverage the trade-off between communication performance and device complexity, in particular in presence of multiuser interference. Several strong assumptions have been typically adopted in the analysis of TR, such as the absence of Inter-Symbol / Inter-Frame Interference (ISI/IFI) and multipath dispersion due to complex signal propagation. This work has the main goal of comparing the performance of TR-based systems with traditional non-prefiltered schemes, in the novel context of a distributed and uncoordinated IR-UWB network, under more realistic assumptions including the presence of ISI/IFI and multipath dispersion. Results show that, lack of power control and imperfect channel knowledge affect the performance of both non-prefiltered and TR systems; in these conditions, TR prefiltering still guarantees a performance improvement in sparse/low-loaded and overloaded network scenarios, while the opposite is true for less extreme scenarios, calling for the developement of an adaptive scheme that enables/disables TR prefiltering depending on network conditions

Secure Communications in Millimeter Wave Ad Hoc Networks

Wireless networks with directional antennas, like millimeter wave (mmWave) networks, have enhanced security. For a large-scale mmWave ad hoc network in which eavesdroppers are randomly located, however, eavesdroppers can still intercept the confidential messages, since they may reside in the signal beam. This paper explores the potential of physical layer security in mmWave ad hoc networks. Specifically, we characterize the impact of mmWave channel characteristics, random blockages, and antenna gains on the secrecy performance. For the special case of uniform linear array (ULA), a tractable approach is proposed to evaluate the average achievable secrecy rate. We also characterize the impact of artificial noise in such networks. Our results reveal that in the low transmit powerregime, the use of low mmWave frequency achieves better secrecy performance, and when increasing transmit power, a transition from low mmWave frequency to high mmWave frequency is demanded for obtaining a higher secrecy rate. More antennas at the transmitting nodes are needed to decrease the antenna gain obtained by the eavesdroppers when using ULA. Eavesdroppers can intercept more information by using a wide beam pattern. Furthermore, the use of artificial noise may be ineffective for enhancing the secrecy rate.Comment: Accepted by IEEE Transactions on Wireless Communication

Geographic Centroid Routing for Vehicular Networks

A number of geolocation-based Delay Tolerant Networking (DTN) routing protocols have been shown to perform well in selected simulation and mobility scenarios. However, the suitability of these mechanisms for vehicular networks utilizing widely-available inexpensive Global Positioning System (GPS) hardware has not been evaluated. We propose a novel geolocation-based routing primitive (Centroid Routing) that is resilient to the measurement errors commonly present in low-cost GPS devices. Using this notion of Centroids, we construct two novel routing protocols and evaluate their performance with respect to positional errors as well as traditional DTN routing metrics. We show that they outperform existing approaches by a significant margin.Comment: 6 page

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-M&N schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust