Computational geometry : theory and applications.

We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible greedy routing scheme that can be adapted to any variant of geographical routing and works for any connectivity graph, not necessarily Unit Disk Graphs. The idea is to reactively detect voids, backtrack packets, and propagate information on blocked sectors to reduce packet loss. We also propose an extrapolating algorithm to reduce the latency of void discovery and to limit route stretch. Performance evaluation via simulation shows that our modified greedy routing avoids most of packet losses.

Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection

We propose Binary Waypoint Routing, a novel geographical routing protocol for wireless mesh networks. Its idea is to learn and maintain source routes to a small number of nodes called binary waypoints that are placed in subspaces constructed as a result of binary space partitioning. A source node sends a packet to a waypoint for a given destination and intermediate nodes try to adapt the packet route by aiming at waypoints that are closer to the destination. Our simulation results show that the proposed scheme achieves high packet delivery rate with a traffic pattern similar to the Optimal Shortest Path Routing.

/pdf/binary-waypoint-geographical-routing-in-wireless-mesh-35rt9632gd.pdf

Binary waypoint geographical routing in wireless mesh networks

https://hal.archives-ouvertes.fr/hal-02650657/document

Neighbor discovery is vital for initialing and maintaining self-organized ad hoc networks. In order to exchange advertise messages and learn about each other presence, nodes have to aim their antennas toward each other when they are only utilized by directional antennas. Since ad hoc networks nodes have no former information about each other, neighbor discovery in directional ad hoc networks becomes more challenging. An asynchronous pure directional quorum-based neighbor discovery technique is proposed for the first time in this paper. Using quorum system for realizing the pure directional asynchronous and deterministic neighbor discovery is the novelty of this approach. All nodes are able to find all their potential neighbors in a relatively small time interval using proposed and transmission scenario and neighbor discovery. The independency of quorum based neighbor discovery to omnidirectional antennas during discovery process divides this approach from former related solutions. The suggested approach, by means of quorum system guarantees at least a common active interval for any two reciprocal beams during neighbor discovery procedure. The correctness of quorum based neighbor discovery in directional ad hoc network is discussed besides evaluating by series of simulations. This approach can be classified as fully directional handshake-based deterministic neighbor discovery algorithm.

Quorum-based pure directional neighbor discovery in self-organized ad hoc networks

With the development of ad hoc networks, some researchers proposed several geometric routing protocols which depend on the planarization of the network connectivity graph to guarantee the delivery of the packet between any pair of nodes in the network. In this paper, we proposed a new online routing algorithm GLNFR (greedy and local neighbor face routing) for finding paths between the nodes of the ad hoc networks by storing a small amount of local face information at each node. The localized Delaunay triangulation was used to be the backbone of wireless network on which the GLNFR routing algorithm runs. It has the better scalability and adaptability for the change of ad hoc networks. Experiment on NS have been conducted. The results show that the delivery rate of packets and routing protocol message cost under such novel routing protocols performs better than others proposed before.

A novel geographic routing algorithm for ad hoc networks based on localized Delaunay triangulation

This invention discloses a small wave packet multi-carrier amplifying-frequency system based on neural net balancer and its controlling method. The system comprises a transmitting end composed of a quad-rature modulator, a copier, an inverse small wave packet conversion with an amplifying frequency code inserted before; a receiving end composed of multi-radial neural net balance, discrete small wave packet conversion, summer, a maximum likelihood tester and quad-rature modulator; after the conversion, inserting amplifying frequency code WH and sub-belt gain factor. The system owes a control switch to control its dislocation to realize using LMS method to renewing weight of multiradial neural net balancer and the communication of the sender and receiver, including channel balance, amplifying frequency, small wave packet multi-carrier adjusting, modulation and ML testing decision.

Wavelet packet multi-carrier spread-spectrum system and control method based on neural net equalizer

Topology control for ad hoc networks aims to increase effective network capacity and conserve energy. In this paper we proposed a distributed topology control algorithm for ad hoc networks with directional antennas. The topology is controlled not only by adjusting the transmission powers of nodes but also by changing the antenna's pattern (direction). A node grows its transmission power until it finds some neighbor nodes in every sector of its directional antenna. We also employ two planarized optimizations that further reduce some redundant edges and make the topology as a planar graph eventually. The resulting network topology increases network lifetime by reducing transmission power and decreases traffic interference by having low node degrees. Simulation results demonstrate the effectiveness of the proposed algorithm.

A Novel Distributed Topology Control Algorithm for Ad Hoc Networks

A novel wavelet packet division multiplexing (WPDM) system based on channel equalization is studied for multipath fading channels. The principle of WPDM is presented in this paper. New WPDM structures based on channel equalization and Htilde matrix based on ZF (zero forcing) algorithm are the two novel aspects of this system. The performance of the system under the multipath fading channels is analyzed

Novel WPDM System Based on Channel Equalization for Multipath Fading Channels

In this paper, novel wavelet packet spread spectrum (WPSS) communication system based on the complex radial basis function (CRBF) network equalizers is studied for multipath fading channels. The complex radial basis function network equalizers technique is adopted to suppress Inter-Symbol Interference (ISI) caused by multipath fading channels and reduce the symbol error rate (SER). The system performance is investigated in multipath fading channels. The theoretical analysis and simulation results show that the proposed CRBF channel equalizer structure which uses least mean square (LMS) algorithm to obtain the optimized equalizer weights offers both fast convergence and low value of the mean square error; the proposed CRBF-WPSS system has a superior SER performance to that of the conventional CRBF-OFDM-SS (spreading spectrum) system, and the proposed CRBF-WPSS system outperforms the WPSS system base on zero-forcing equalizers for multipath fading channels.

Peng He

Papers

A novel geographic routing algorithm for ad hoc networks based on localized Delaunay triangulation

Wavelet packet multi-carrier spread-spectrum system and control method based on neural net equalizer

A Novel Distributed Topology Control Algorithm for Ad Hoc Networks

Novel WPDM System Based on Channel Equalization for Multipath Fading Channels

WPSS communication system based on CRBF network equalizers