A resiliency analysis of information distribution policies over mobile ad hoc networks

Wei, Ningji; Walteros, Jose L.; Worden, McKenzie R.; Ortiz-Peña, Héctor J.

doi:10.1007/s11590-021-01717-0

Cited by 8 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The nodes in such networks are able to play the role of routers and participate in data transmission [1]. With the rapid development of communication technology, Ad hoc networks are widely used in the fields of surveillance, vehicle communication and agriculture [2,3]. Due to the dynamic nature of Ad hoc networks [4], previous researchers have developed various routing protocols suitable for different network requirements.…”

Section: Introductionmentioning

confidence: 99%

A multi-objective optimized OLSR routing protocol

Wei,

Wu,

et al. 2024

PLoS ONE

View full text Add to dashboard Cite

The rapid development of mobile communication devices has brought challenges to wireless networks, where data packets are able to organize and maintain local area networks more freely without the constraints of wired devices. Scholars have developed diverse network protocols on how to ensure data transmission while maintaining its self-organizational nature. However, it is difficult for traditional network protocols to meet the needs of increasingly complex networks. In order to solve the problem that the better node set may not be selected when selecting the node set responsible for forwarding in the traditional OLSR protocol, a multi-objective optimized OLSR algorithm is proposed in this paper, which incorporating a new MPR mechanism and an improved NSGA-II algorithm. In the process of route discovery, the intermediate nodes responsible for forwarding packets are determined by the new MPR mechanism, and then the main parameters in the OLSR protocol are provided by the multi-objective optimization algorithm. Matlab was used to build a self-organizing network in this study. In addition, the conventional OLSR protocol, NSGA-II algorithm and multi-objective simulated annealing algorithm are selected to compare with the proposed algorithm. Simulation results show that the proposed algorithm can effectively reduce packet loss and end-to-end delay while obtaining better results in HV and Spacing, two multi-objective optimization result evaluation metrics.

show abstract

Section: Introductionmentioning

confidence: 99%

A multi-objective optimized OLSR routing protocol

Wei,

Wu,

et al. 2024

PLoS ONE

View full text Add to dashboard Cite

show abstract

Adjustability in robust linear optimization

Wei,

Zhang

2024

Math. Program.

View full text Add to dashboard Cite

We investigate the concept of adjustability—the difference in objective values between two types of dynamic robust optimization formulations: one where (static) decisions are made before uncertainty realization, and one where uncertainty is resolved before (adjustable) decisions. This difference reflects the value of information and decision timing in optimization under uncertainty, and is related to several other concepts such as the optimality of decision rules in robust optimization. We develop a theoretical framework to quantify adjustability based on the input data of a robust optimization problem with a linear objective, linear constraints, and fixed recourse. We make very few additional assumptions. In particular, we do not assume constraint-wise separability or parameter nonnegativity that are commonly imposed in the literature for the study of adjustability. This allows us to study important but previously under-investigated problems, such as formulations with equality constraints and problems with both upper and lower bound constraints. Based on the discovery of an interesting connection between the reformulations of the static and fully adjustable problems, our analysis gives a necessary and sufficient condition—in the form of a theorem-of-the-alternatives—for adjustability to be zero when the uncertainty set is polyhedral. Based on this sharp characterization, we provide two efficient mixed-integer optimization formulations to verify zero adjustability. Then, we develop a constructive approach to quantify adjustability when the uncertainty set is general, which results in an efficient and tight poly-time algorithm to bound adjustability. We demonstrate the efficiency and tightness via both theoretical and numerical analyses.

show abstract

On supervalid inequalities for binary interdiction games

Wei,

Walteros

2024

Math. Program.

View full text Add to dashboard Cite

A resiliency analysis of information distribution policies over mobile ad hoc networks

Cited by 8 publications

References 28 publications

A multi-objective optimized OLSR routing protocol

A multi-objective optimized OLSR routing protocol

Adjustability in robust linear optimization

On supervalid inequalities for binary interdiction games

Contact Info

Product

Resources

About