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.
Mobile ad hoc networks (MANETs) pose challenges distinct from commercial wireless networking, including a need for decentralized routing. We consider the barrage relay network (BRN) routing algorithm for unicast communications, beginning with a simple connected graph model (CGM) and then more physically motivated models. We show geometrically and through simulation that lower bound on the domain of utilized nodes nodes converges to an elliptical region in the high-density limit. In this bound, the number of utilized nodes scales with the (1.5)-power of the distance between source and destination. We conclude with recommendations on how to reduce load while maintaining reliability.
Brent Kraczek andNicholas Woolsey
"Geometric analysis of barrage relay networks for optimizing reliable communications in mobile ad hoc networks (Conference Presentation)", Proc. SPIE 11419, Disruptive Technologies in Information Sciences IV, 114190R (27 April 2020); https://doi.org/10.1117/12.2558663
ACCESS THE FULL ARTICLE
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.
The alert did not successfully save. Please try again later.
Brent Kraczek, Nicholas Woolsey, "Geometric analysis of barrage relay networks for optimizing reliable communications in mobile ad hoc networks (Conference Presentation)," Proc. SPIE 11419, Disruptive Technologies in Information Sciences IV, 114190R (27 April 2020); https://doi.org/10.1117/12.2558663