Mobile ad hoc networks (MANETs) consisting of nodes with single omnidirectional antennas and limited transmit power can support wireless connectivity over long distances through coherent operation. Although designed for short-range networked communication, the individual radio nodes in a MANET can be coordinated to form a sparse aperiodic array with a high power directional gain. By targeting a distant receiver with the array beam synthesized by a synchronized transmission, the MANET can ensure greater signal quality at the receiver. The sparse nature of the array coupled with the mobility-driven randomization of node positions makes the array gain somewhat uncontrollable outside of the main beam. Our work investigates methods of shaping the pattern of a coherent distributed transmit array using open-loop beamforming. A null-forming algorithm based on a partitioning of the network nodes into two sub-arrays is presented. Simulation results demonstrate the attenuation of the array factor in the desired null direction. A stochastic optimization step is also introduced.
Cognitive radio networks (CRNs) are currently a rich area of development because of the promise of solving spectrum access challenges such as spectrum management and efficient spectrum use. Ad hoc networks in particular operate without fixed infrastructure and are decentralized in nature. Cognitive radio ad hoc networks (CRAHNs) offer robust connectivity and are highly adaptable, but the challenges in designing medium access control (MAC) protocols for them are the greatest. Rendezvous is a core element to initializing and maintaining a CRAHN; it is the process by which individual network nodes find one another and establish communication links. We propose a type of channel-hopping, adaptive blind rendezvous algorithm that integrates spectrum sensing and spectrum prediction using a non-parametric model of channel occupancy. One of the considerations lacking in many papers on blind rendezvous approaches is how the proposed algorithms contend with primary users (PU) that may be accessing the operating spectrum. Our rendezvous approach, which is called adaptive rendezvous with predictive collision avoidance (ARPCA), is an adaptive derivative of jump-stay developed using the assumption that PU activity is present and collisions between PUs and CRAHN users should be minimized. The channel occupancy prediction approach draws from an existing survival analysis-based DSA algorithm. We briefly explore how conventional jump-stay rendezvous contends with PU activity and use simulation results to illustrate the performance improvement in time-to-rendezvous (TTR) and collision avoidance demonstrated by ARPCA.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.